1989
DOI: 10.1007/bf01396344
|View full text |Cite
|
Sign up to set email alerts
|

Continued fractions associated with the Newton-Pad� table

Abstract: Summary. We discuss first the block structure of the Newton- Pad6 table (or, rational interpolation table)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
8
0

Year Published

1990
1990
2008
2008

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 21 publications
(8 citation statements)
references
References 18 publications
0
8
0
Order By: Relevance
“…Then the Newton coefficients Pk of the numerator are explicitly given by (3.3a). The principal result concerning the system (3.3) is [8], [3], [61 [5]: The following characterization follows easily from this result (but can be proved with little effort directly): We say that z' o ..... z'+, are well ordered for the interpolant r if the zeros of the polynomial s in (3.4) (i.e., the points where r does not interpolate) come last, i.e., s(z) = (z-z'+,)(z-z'~+,_l)...(z-z~,+n-0,). If r is not a true interpolant (i.e., 0s > 0), the Newton series off and r then coincide exactly up to the term tm+,-0s, and we write In general, if the two Newton series agree at least up to the term tt, we use the notation Proof.…”
Section: Continuity Of the Interpolation Operatormentioning
confidence: 99%
“…Then the Newton coefficients Pk of the numerator are explicitly given by (3.3a). The principal result concerning the system (3.3) is [8], [3], [61 [5]: The following characterization follows easily from this result (but can be proved with little effort directly): We say that z' o ..... z'+, are well ordered for the interpolant r if the zeros of the polynomial s in (3.4) (i.e., the points where r does not interpolate) come last, i.e., s(z) = (z-z'+,)(z-z'~+,_l)...(z-z~,+n-0,). If r is not a true interpolant (i.e., 0s > 0), the Newton series off and r then coincide exactly up to the term tm+,-0s, and we write In general, if the two Newton series agree at least up to the term tt, we use the notation Proof.…”
Section: Continuity Of the Interpolation Operatormentioning
confidence: 99%
“…Given finite real data {(xo, /o), • • •, (x", /")}, the classical problem of univariate rational interpolation [2,3,4] consists in finding an irreducible rational function p{x)/q{x) that satisfies the interpolation conditions ^=f, / = 0,...,«…”
Section: Rational Interpolationmentioning
confidence: 99%
“…3). In fact, our algorithm can be seen as a BerlekampMassey version of the Euclidean-like algorithm of Gutknecht [15]. In Sect.…”
Section: N(z) and D(z)mentioning
confidence: 99%
“…2). Compared to E27], we pose the rational interpolation problem in a much more general way, inspired by [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15]16], allowing confluent interpolation points, poles and ~ as interpolation point (Sect. 3).…”
Section: N(z) and D(z)mentioning
confidence: 99%
See 1 more Smart Citation