2013
DOI: 10.1137/110853236
|View full text |Cite
|
Sign up to set email alerts
|

Robust Padé Approximation via SVD

Abstract: 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é approximation that are pointwise convergent as the degrees of th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
126
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 108 publications
(127 citation statements)
references
References 30 publications
0
126
0
Order By: Relevance
“…Very recently, Gonnet et al suggested an efficient algorithm for the Padé approximations [30,31]. The algorithm detects and eliminates the spurious pole-zero pairs caused by the rounding errors by means of singular value decomposition for the Teoplitz matrix.…”
Section: Padé Approximationmentioning
confidence: 99%
See 1 more Smart Citation
“…Very recently, Gonnet et al suggested an efficient algorithm for the Padé approximations [30,31]. The algorithm detects and eliminates the spurious pole-zero pairs caused by the rounding errors by means of singular value decomposition for the Teoplitz matrix.…”
Section: Padé Approximationmentioning
confidence: 99%
“…In this subsection, we try to investigate the residues of the Padé approximation for some test functions. Up to now, the residue analysis has been mainly used for performance comparison between the different algorithms of the Padé approximation of the same order [30,31]. On the other hand, it seems that the study by using the information of the residue analysis is still rare in the Padé approximation [10,12].…”
Section: Numerical Accuracy and Spurious Polesmentioning
confidence: 99%
“…For example, the strength of the Borel-Padé-Laplace algorithm relies on is however also an obstacle in the speed of the method. Indeed, in some cases, it has to be combined to other techniques (such as singular value decomposition method [1,18]) to avoid the apparition of a singular matrix. As an alternative, factorial series may be used [15,27,28].…”
Section: Resultsmentioning
confidence: 99%
“…In a first test, a source term is added such that the solution is periodic in time. More precisely, u = cos(πt)ū (18) whereū has a Poiseuille profile. The approximate solution given by the series resummation approach is presented in Figure 7 where N = 8.…”
Section: Application To Fluid Mechanics Problemsmentioning
confidence: 99%
“…Conversely, we will see by the following linear algebra that if m + n = N , then (2.4) has a solution such that p − f q N = 0, called a linearised solution. Furthermore, (2.4) can be used to define more general solutions in the case that n + m < N , called linearised least-squares solutions for the rational interpolation problem [8]. The notion of a least-squares problem is a general one, in which the objective is to minimise a sum of squares.…”
Section: The Proposed Methodmentioning
confidence: 99%