Software for the tabular-algorithmic acceleration of calculations of functions (Q1183779)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Software for the tabular-algorithmic acceleration of calculations of functions |
scientific article; zbMATH DE number 33739
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Software for the tabular-algorithmic acceleration of calculations of functions |
scientific article; zbMATH DE number 33739 |
Statements
Software for the tabular-algorithmic acceleration of calculations of functions (English)
0 references
28 June 1992
0 references
The authors describe an adaptive FORTRAN software to compute the values of mathematical functions for constructing reference tables. They notice that modern computers do not need the use of sophisticated approximation metods and show that the simple three term Taylor expansion is more efficient (with respect to complexity and to time optimization). The prescribed precision defines the choice of the nodes and of the subintervals. Examples show that the cost (in time) of the proposed algorithms diminishes from 2,5 up to 268 times with respect to the cost of the ``classical'' algorithms (not precised). The term ``algorithmic acceleration'' is deceitful; it means: ``optimization of the computing time due to the choice of the formula of small complexity''.
0 references
construction of tables
0 references
adaptive FORTRAN software
0 references
mathematical functions
0 references
three term Taylor expansion
0 references
complexity
0 references
prescribed precision
0 references
algorithms
0 references
algorithmic acceleration
0 references
0.7670531868934631
0 references