Matrix computations (3rd ed.)
Lagrange interpolation and quadrature formula in rational systems
Journal of Approximation Theory
Orthogonal basis functions in discrete least-squares rational approximation
Journal of Computational and Applied Mathematics - Special Issue: Proceedings of the 10th international congress on computational and applied mathematics (ICCAM-2002)
The computation of orthogonal rational functions on an interval
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the conference on orthogonal functions and related topics held in honor of Olav Njåstad
The computation of orthogonal rational functions on an interval
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the conference on orthogonal functions and related topics held in honor of Olav Njåstad
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the conference on orthogonal functions and related topics held in honor of Olav Njåstad
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
We study the recurrence relation for rational functions whose poles are in a prescribed sequence of numbers that are real or infinite and that are orthogonal with respect to an Hermitian positive linear functional. We especially discuss the interplay between finite and infinite poles. The recurrence relation will also be described in terms of a tridiagonal matrix which is a generalization of the Jacobi. matrix of the polynomial situation which corresponds to placing all the poles at infinity. This matrix not only describes the recurrence relation, but it can be used to give a determinant expression for the orthogonal rational functions and it also allows for the formulation of a generalized eigenvalue problem whose eigenvalues are the zeros of an orthogonal rational function. These nodes can be used in rational Gauss-type quadrature formulas and the corresponding weights can be obtained from the first components of the corresponding eigenvectors.