An interpolation algorithm for orthogonal rational functions.

DOI10.1016/S0377-0427(03)00493-XzbMath1034.42026MaRDI QIDQ1426815

Adhemar Bultheel, Joris Van Deun

Publication date: 15 March 2004

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

interpolationorthogonal polynomialsorthogonal rational functionsthree-term recurrence

Mathematics Subject Classification ID

Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Numerical interpolation (65D05)

Related Items (8)

Computing orthogonal rational functions with poles near the boundary ⋮ Computation of rational Szegő-Lobatto quadrature formulas ⋮ A generalized eigenvalue problem for quasi-orthogonal rational functions ⋮ An extension of the associated rational functions on the unit circle ⋮ A fast adaptive model reduction method based on Takenaka-Malmquist systems ⋮ Generalizations of orthogonal polynomials ⋮ The computation of orthogonal rational functions on an interval ⋮ Computing rational Gauss-Chebyshev quadrature formulas with complex poles: The algorithm

Cites Work

• Ratio asymptotics for orthogonal rational functions on an interval
• Orthogonal rational functions and quadrature on an interval
• A Modified Schur Algorithm and an Extended Hamburger Moment Problem
• On Generating Orthogonal Polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An interpolation algorithm for orthogonal rational functions.