Robust Padé Approximation via SVD.
Saved in:
| 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 |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 87368158 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Robust Padé Approximation via SVD. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Gonnet%2C+Pedro%22">Gonnet, Pedro</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Güttel%2C+Stefan%22">Güttel, Stefan</searchLink><relatesTo>2</relatesTo><i> stefan.guettel@manchester.ac.uk</i><br /><searchLink fieldCode="AR" term="%22Trefethen%2C+Lloyd+N%2E%22">Trefethen, Lloyd N.</searchLink><relatesTo>3</relatesTo><i> trefethen@maths.ox.ac.uk</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22SIAM+Review%22">SIAM Review</searchLink>. 2013, Vol. 55 Issue 1, p101-117. 17p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Approximation+theory%22">Approximation theory</searchLink><br /><searchLink fieldCode="DE" term="%22Linear+algebra%22">Linear algebra</searchLink><br /><searchLink fieldCode="DE" term="%22Singular+value+decomposition%22">Singular value decomposition</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22MatLab+%28Computer+software%29%22">MatLab (Computer software)</searchLink><br /><searchLink fieldCode="DE" term="%22Padé+approximant%22">Padé approximant</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=87368158 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1137/110853236 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 17 StartPage: 101 Subjects: – SubjectFull: Approximation theory Type: general – SubjectFull: Linear algebra Type: general – SubjectFull: Singular value decomposition Type: general – SubjectFull: Algorithms Type: general – SubjectFull: MatLab (Computer software) Type: general – SubjectFull: Padé approximant Type: general Titles: – TitleFull: Robust Padé Approximation via SVD. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Gonnet, Pedro – PersonEntity: Name: NameFull: Güttel, Stefan – PersonEntity: Name: NameFull: Trefethen, Lloyd N. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Text: 2013 Type: published Y: 2013 Identifiers: – Type: issn-print Value: 00361445 Numbering: – Type: volume Value: 55 – Type: issue Value: 1 Titles: – TitleFull: SIAM Review Type: main |
| ResultId | 1 |
