Approximating functions by means of symbolic computation and a general extrapolation method
✍ Scribed by J. Grotendorst
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 557 KB
- Volume
- 59
- Category
- Article
- ISSN
- 0010-4655
No coin nor oath required. For personal study only.
✦ Synopsis
Using a general extrapolation algorithm we present MAPLE procedures for the generation of polynomial and rational approximations to functions having formal series expansions. This algorithm, which has been called E algorithm or Brezinski-Hâvie (BH) protocol, includes most of the series (sequence) transformations actually known. MAPLE's ability to perform all calculations in rational arithmetic eliminates the numerical instability of the E algorithm. For numerical purposes the approximating functions can be transformed into optimized FORTRAN programs.
📜 SIMILAR VOLUMES
## Abstract The analysis of structures with complex geometries leads to the use of three‐dimensional numerical methods. Such devices can be unmanageable unless a segmentation technique is applied. In this work, a hybrid 3D finite‐element‐mode matching method, based on the generalized admittance mat
## Abstract The main drawback of the coupled‐mode method is the poor convergence and accuracy of the discontinuous field components. The greater the discontinuity, the worse these problems become. This Letter presents an improvement of the method, allowing this drawback to be minimized. © 2002 Wile
## Abstract We present a model to calculate the free energies of solvation of small organic compounds as well as large biomolecules. This model is based on a generalized Born (GB) model and a self‐consistent charge‐density functional theory‐based tight‐binding (SCC‐DFTB) method with the nonelectros