Determining rank in the presence of error
Determining rank in the presence of error
Symbolic Computation of Padé Approximants
ACM Transactions on Mathematical Software (TOMS)
Froissart doublets in Padé approximation in the case of polynomial noise
Journal of Computational and Applied Mathematics - Proceedings of the sixth international symposium on orthogonal polynomials, special functions and their applications
Rank degeneracy and least squares problems
Rank degeneracy and least squares problems
From numerical quadrature to Padé approximation
Applied Numerical Mathematics
A type of matrix Padé approximant inspired by scalar component models
Journal of Computational and Applied Mathematics
| Hi-index | 7.29 |
In this paper, a new definition of a reduced Pade approximant and an algorithm for its computation are proposed. Our approach is based on the investigation of the kernel structure of the Toeplitz matrix. It is shown that the reduced Pade approximant always has nice properties which the classical Pade approximant possesses only in the normal case. The new algorithm allows us to avoid the appearance of Froissart doublets induced by computer roundoff in the non-normal Pade table.