Details
| Originalsprache | Englisch |
|---|---|
| Seiten (von - bis) | 329-344 |
| Seitenumfang | 16 |
| Fachzeitschrift | Journal of Computational and Applied Mathematics |
| Jahrgang | 17 |
| Ausgabenummer | 3 |
| Publikationsstatus | Veröffentlicht - März 1987 |
Abstract
In this paper linear extrapolation by rational functions with given poles is considered from an arithmetical point of view. It is shown that the classical interpolation algorithms of Lagrange, Neville-Aitken and Newton which are well known for polynomial interpolation can be extended in a natural way to this problem yielding recursive methods of nearly the same complexity. The proofs are based upon explicit representations of generalized Vandermonde-determinants which are calculated by the elimination method combined with analytical considerations. As an application a regularity criterion for certain linear sequence-transformations is given. Also, by the same method simplified recurrence relations for linear extrapolation by exponentials and logarithmic functions at special knots are derived.
ASJC Scopus Sachgebiete
- Mathematik (insg.)
- Computational Mathematics
- Mathematik (insg.)
- Angewandte Mathematik
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
in: Journal of Computational and Applied Mathematics, Jahrgang 17, Nr. 3, 03.1987, S. 329-344.
Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review
}
TY - JOUR
T1 - Linear extrapolation by rational functions, exponentials and logarithmic functions
AU - Mühlbach, G.
AU - Reimers, L.
PY - 1987/3
Y1 - 1987/3
N2 - In this paper linear extrapolation by rational functions with given poles is considered from an arithmetical point of view. It is shown that the classical interpolation algorithms of Lagrange, Neville-Aitken and Newton which are well known for polynomial interpolation can be extended in a natural way to this problem yielding recursive methods of nearly the same complexity. The proofs are based upon explicit representations of generalized Vandermonde-determinants which are calculated by the elimination method combined with analytical considerations. As an application a regularity criterion for certain linear sequence-transformations is given. Also, by the same method simplified recurrence relations for linear extrapolation by exponentials and logarithmic functions at special knots are derived.
AB - In this paper linear extrapolation by rational functions with given poles is considered from an arithmetical point of view. It is shown that the classical interpolation algorithms of Lagrange, Neville-Aitken and Newton which are well known for polynomial interpolation can be extended in a natural way to this problem yielding recursive methods of nearly the same complexity. The proofs are based upon explicit representations of generalized Vandermonde-determinants which are calculated by the elimination method combined with analytical considerations. As an application a regularity criterion for certain linear sequence-transformations is given. Also, by the same method simplified recurrence relations for linear extrapolation by exponentials and logarithmic functions at special knots are derived.
UR - http://www.scopus.com/inward/record.url?scp=0023311309&partnerID=8YFLogxK
U2 - 10.1016/0377-0427(87)90109-9
DO - 10.1016/0377-0427(87)90109-9
M3 - Article
AN - SCOPUS:0023311309
VL - 17
SP - 329
EP - 344
JO - Journal of Computational and Applied Mathematics
JF - Journal of Computational and Applied Mathematics
SN - 0377-0427
IS - 3
ER -