Bibliographic Details
| Title: |
Robust Padé Approximation via SVD. |
| Authors: |
Gonnet, Pedro1, Güttel, Stefan2 stefan.guettel@manchester.ac.uk, Trefethen, Lloyd N.3 trefethen@maths.ox.ac.uk |
| Source: |
SIAM Review. 2013, Vol. 55 Issue 1, p101-117. 17p. |
| Subjects: |
Approximation theory, Linear algebra, Singular value decomposition, Algorithms, MatLab (Computer software), Padé approximant |
| Abstract: |
Padé approximation is considered from the point of view of robust methods of numerical linear algebra, in particular, the singular value decomposition. This leads to an algorithm for practical computation that bypasses most problems of solution of nearly-singular systems and spurious pole-zero pairs caused by rounding errors, for which a MATLAB code is provided. The success of this algorithm suggests that there might be variants of Pad#233; approximation that are pointwise convergent as the degrees of the numerator and denominator increase to ∞, unlike traditional Padé approximants, which converge only in measure or capacity. [ABSTRACT FROM AUTHOR] |
|
Copyright of SIAM Review is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
