In a series of articles about the numerical computation of orthogonal polynomials on a subset of the real line, Gautschi shows that computing orthogonal polynomials starting from the moments µ_k = ∫ x^k dµ(x) of the measure is generally an ill-conditioned problem. However, in one of these papers an alternative approach is presented, based on so-called modified moments, which works better in certain situations. In this paper we generalize these results to the computation of orthogonal rational functions and provide a new modified moment algorithm, based on the connection between modified moments and interpolatory quadrature.status: publishe
The main objective is to generalize previous results obtained for orthogonal Laurent polynomials and...
AbstractThe Chebyshev and Stieltjes procedures are algorithms for computing recursion coefficients f...
Using the language of exponential Riordan arrays, we study three distinct families of orthogonal pol...
In a series of articles [9, 10, 11] about the numerical computation of orthogonal polynomials on a s...
AbstractWe consider polynomials orthogonal with respect to some measure on the real line. A basic pr...
The main accomplishment of this article is an algorithm that computes the reflection coefficients of...
We consider a modication of moment functionals for some classical polynomials of a discrete variable...
AbstractAn account is given of the role played by moments and modified moments in the construction o...
AbstractWe consider a modification of moment functionals for some classical polynomials of a discret...
The aim of this work is to find simple formulas for the moments µn for all families of classical ort...
A class of continued fractions is discussed that generalize the real J-fractions, and which have the...
SIGLEAvailable from TIB Hannover: RR 8460(2002,14) / FIZ - Fachinformationszzentrum Karlsruhe / TIB ...
AbstractWe consider the problem of generating orthogonal polynomials. Starting with a measure dω and...
This paper introduces a new set of moment functions based on Chebyshev polynomials which are orthogo...
AbstractPolynomial moments are often used for the computation of Gauss quadrature to stabilize the n...
The main objective is to generalize previous results obtained for orthogonal Laurent polynomials and...
AbstractThe Chebyshev and Stieltjes procedures are algorithms for computing recursion coefficients f...
Using the language of exponential Riordan arrays, we study three distinct families of orthogonal pol...
In a series of articles [9, 10, 11] about the numerical computation of orthogonal polynomials on a s...
AbstractWe consider polynomials orthogonal with respect to some measure on the real line. A basic pr...
The main accomplishment of this article is an algorithm that computes the reflection coefficients of...
We consider a modication of moment functionals for some classical polynomials of a discrete variable...
AbstractAn account is given of the role played by moments and modified moments in the construction o...
AbstractWe consider a modification of moment functionals for some classical polynomials of a discret...
The aim of this work is to find simple formulas for the moments µn for all families of classical ort...
A class of continued fractions is discussed that generalize the real J-fractions, and which have the...
SIGLEAvailable from TIB Hannover: RR 8460(2002,14) / FIZ - Fachinformationszzentrum Karlsruhe / TIB ...
AbstractWe consider the problem of generating orthogonal polynomials. Starting with a measure dω and...
This paper introduces a new set of moment functions based on Chebyshev polynomials which are orthogo...
AbstractPolynomial moments are often used for the computation of Gauss quadrature to stabilize the n...
The main objective is to generalize previous results obtained for orthogonal Laurent polynomials and...
AbstractThe Chebyshev and Stieltjes procedures are algorithms for computing recursion coefficients f...
Using the language of exponential Riordan arrays, we study three distinct families of orthogonal pol...