Name
Abstract | ||
|---|---|---|
AbstractPadé approximation is considered from the point of view of robust methods of numerical linearalgebra, in particular, the singular value decomposition. This leads to an algorithm for practicalcomputation that bypasses most problems of solution of nearly-singular systems and spuriouspole-zero pairs caused by rounding errors, for which a MATLAB code is provided. The success of this algorithmsuggests that there might be variants of Padé approximation that are pointwise convergent asthe degrees of the numerator and denominator increase to $\infty$, unlike traditional Padéapproximants, which converge only in measure or capacity. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1137/110853236 | Periodicals |
Keywords | Field | DocType |
Pade approximation,SVD,regularization,Froissart doublet,Nuttall-Pommerenke theorem | Singular value decomposition,Mathematical optimization,Padé approximant,Mathematical analysis,Rounding,Regularization (mathematics),Numerical analysis,Numerical linear algebra,Mathematics,Pointwise,Computation | Journal |
Volume | Issue | ISSN |
55 | 1 | 0036-1445 |
Citations | PageRank | References |
17 | 1.77 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pedro Gonnet | 1 | 89 | 13.43 |
| Stefan Güttel | 2 | 109 | 9.68 |
| Lloyd N. Trefethen | 3 | 1024 | 203.66 |