Paper
2 November 1999 Algorithms for solving rational interpolation problems related to fast and superfast solvers for Toeplitz systems
Peter Kravanja, Marc Van Barel
Author Affiliations +
Abstract
Linearized rational interpolation problems at roots of unity play a crucial role in the fast and superfast Toeplitz solvers that we have developed. Our interpolation algorithm is a sequential algorithm in which a matrix polynomial that satisfies already some of the interpolation conditions is updated to satisfy two additional interpolation conditions. In the algorithm that we have used so far, the updating matrix, which is a matrix polynomial of degree one, is constructed in a two-step process that resembles Gaussian elimination. We briefly recall this approach and then consider two other approaches. The first one is a completely new approach based on an updating matrix that is unitary with respect to a discrete inner product that is based on roots of unity. The second one is an application of an algorithm for solving discrete least squares problems on the unit circle, a problem that has linearized rational interpolation at roots of unity as its limiting case. We conduct a number of numerical experiments to compare the three strategies.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Peter Kravanja and Marc Van Barel "Algorithms for solving rational interpolation problems related to fast and superfast solvers for Toeplitz systems", Proc. SPIE 3807, Advanced Signal Processing Algorithms, Architectures, and Implementations IX, (2 November 1999); https://doi.org/10.1117/12.367652
Lens.org Logo
CITATIONS
Cited by 18 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Matrices

Algorithm development

Computing systems

Stereolithography

Vector spaces

Algorithms

Chlorine

RELATED CONTENT

Scheduling Linearly Indexed Assignment Codes
Proceedings of SPIE (May 17 1989)
Numerical Linear Algebra On The CEDAR Multiprocessor
Proceedings of SPIE (January 21 1988)
Alternative To The SVD: Rank Revealing QR-Factorizations
Proceedings of SPIE (April 04 1986)
Parallel QR Decomposition Of Toeplitz Matrices
Proceedings of SPIE (April 04 1986)
Fast eigenvalue algorithm for Hankel matrices
Proceedings of SPIE (October 02 1998)

Back to Top