Add to ORKGWe provide a fast algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebyshev quadrature formulas integrating exactly in spaces of rational functions with arbitrary complex poles outside [-1,1]. This algorithm is based on the derivation of explicit expressions for the Chebyshev (para-)orthogonal rational functions.nrpages: 19status: publishe
Rational functions with real poles and poles in the complex lower half plane, orthogonal on the real...
Szego quadrature formulas are analogs of Gauss quadrature rules when dealing with the approximate in...
Computing orthogonal rational functions is a far from trivial problem, especially for poles close to...
We provide a fast algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebysh...
We provide a fast algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebysh...
We provide an algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebyshev q...
In this paper we provide an extension of the Chebyshev orthogonal rational functions with arbitrary ...
In this paper we provide an extension of the Chebyshev orthogonal rational functions with arbitrary ...
In this paper we characterize rational Szego ̋ quadrature formulas associated with Chebyshev weight ...
We present a numerical procedure to compute the nodes and weights in rational Gauss-Chebyshev quadra...
Several generalisations to the classical Gauss quadrature formulas have been made over the last few ...
In this paper we characterize rational Szego quadrature formulas associated with Chebyshev weight fu...
We consider the computation of quadrature rules that are exact for a Chebyshev set of linearly indep...
AbstractMaking use of the connection between quadrature formulas on the unit circle and the interval...
AbstractMaking use of the connection between quadrature formulas on the unit circle and the interval...
Rational functions with real poles and poles in the complex lower half plane, orthogonal on the real...
Szego quadrature formulas are analogs of Gauss quadrature rules when dealing with the approximate in...
Computing orthogonal rational functions is a far from trivial problem, especially for poles close to...
We provide a fast algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebysh...
We provide a fast algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebysh...
We provide an algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebyshev q...
In this paper we provide an extension of the Chebyshev orthogonal rational functions with arbitrary ...
In this paper we provide an extension of the Chebyshev orthogonal rational functions with arbitrary ...
In this paper we characterize rational Szego ̋ quadrature formulas associated with Chebyshev weight ...
We present a numerical procedure to compute the nodes and weights in rational Gauss-Chebyshev quadra...
Several generalisations to the classical Gauss quadrature formulas have been made over the last few ...
In this paper we characterize rational Szego quadrature formulas associated with Chebyshev weight fu...
We consider the computation of quadrature rules that are exact for a Chebyshev set of linearly indep...
AbstractMaking use of the connection between quadrature formulas on the unit circle and the interval...
AbstractMaking use of the connection between quadrature formulas on the unit circle and the interval...
Rational functions with real poles and poles in the complex lower half plane, orthogonal on the real...
Szego quadrature formulas are analogs of Gauss quadrature rules when dealing with the approximate in...
Computing orthogonal rational functions is a far from trivial problem, especially for poles close to...