|
|
|
|
LEADER |
03563nmm a2200313 u 4500 |
001 |
EB000637345 |
003 |
EBX01000000000000000490427 |
005 |
00000000000000.0 |
007 |
cr||||||||||||||||||||| |
008 |
140122 ||| eng |
020 |
|
|
|a 9783034893060
|
100 |
1 |
|
|a Bultheel, A.
|
245 |
0 |
0 |
|a Laurent Series and their Padé Approximations
|h Elektronische Ressource
|c by A. Bultheel
|
250 |
|
|
|a 1st ed. 1987
|
260 |
|
|
|a Basel
|b Birkhäuser
|c 1987, 1987
|
300 |
|
|
|a XI, 276 p
|b online resource
|
505 |
0 |
|
|a 8.4 ?? paramaters (diagonal path) -- 8.5 Some dual results -- 8.6 Relation with classical algorithms -- 9. Biorthogonal polynomials, quadrature and reproducing kernels -- 9.1 Biorthogonal polynomials -- 9.2 Interpolatory quadrature methods -- 9.3 Reproducing kernels -- 9.4 Other orthogonality relations -- 10. Determinant expressions and matrix interpretations -- 10.1 Determinant expressions -- 10.2 Matrix interpretations -- 11. Symmetry Properties -- 11.1 Symmetry for F(z) and
|
505 |
0 |
|
|a 2. Introduction -- 2.1 Classical Padé approximation -- 2.2 Toeplitz and Hankel systems -- 2.3 Continued fractions -- 2.4 Orthogonal polynomials -- 2.5 Rhombus algorithms and convergence -- 2.6 Block structure -- 2.7 Laurent-Padé approximants -- 2.8 The projection method -- 2.9 Applications -- 2.10 Outline -- 3. Moebius transforms, continued fractions and Padé approximants -- 3.1 Moebius transforms -- 3.2 Flow graphs -- 3.3 Continued fractions (CF) -- 3.4 Formal series -- 3.5 Padé approximants -- 4. Two algorithms -- 4.1 Algorithm 1 -- 4.2 Algorithm 2 -- 5. All kinds of Padé Approximants -- 5.1 Padé approximants -- 5.2 Laurent-Padé approximants -- 5.3 Two-point Padé approximants -- 6. Continued fractions -- 6.1 General observations -- 6.2 Some special cases -- 7. Moebius transforms -- 7.1 General observations -- 7.2 Some special cases -- 8. Rhombus algorithms -- 8.1 The ab parameters (sawtooth path) -- 8.2. The FG parameters (row path) -- 8.3. A staircase path --
|
653 |
|
|
|a Humanities and Social Sciences
|
653 |
|
|
|a Humanities
|
653 |
|
|
|a Social sciences
|
041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
490 |
0 |
|
|a Operator Theory: Advances and Applications
|
028 |
5 |
0 |
|a 10.1007/978-3-0348-9306-0
|
856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-0348-9306-0?nosfx=y
|x Verlag
|3 Volltext
|
082 |
0 |
|
|a 001.3
|
082 |
0 |
|
|a 300
|
520 |
|
|
|a The Pade approximation problem is, roughly speaking, the local approximation of analytic or meromorphic functions by rational ones. It is known to be important to solve a large scale of problems in numerical analysis, linear system theory, stochastics and other fields. There exists a vast literature on the classical Pade problem. However, these papers mostly treat the problem for functions analytic at 0 or, in a purely algebraic sense, they treat the approximation of formal power series. For certain problems however, the Pade approximation problem for formal Laurent series, rather than for formal power series seems to be a more natural basis. In this monograph, the problem of Laurent-Pade approximation is central. In this problem a ratio of two Laurent polynomials in sought which approximates the two directions of the Laurent series simultaneously. As a side result the two-point Pade approximation problem can be solved. In that case, two series are approximated, one is a power series in z and the other is a power series in z-l. So we can approximate two, not necessarily different functions one at zero and the other at infinity
|