A new algorithm for computing the Geronimus transformation with large shifts
The authors consider the numerical computation of the Geronimus transformation with shift and parameter \(C\) of a Jacobi matrix. The numerical behavior of the available algorithms are investigated. The problem of computing the Geronimus transformation is proved to be very ill-conditioned when \(C\) is zero. The authors propose a new algorithm which is more accurate when the shift moves away from the support of the measure and \(C\) is nonzero. The forward errors of the algorithm is estimated and a backward error analysis of the algorithm is presented. Some numerical experiments are shown to illustrate that the method is componentwise forward stable.
- Algorithms for the Geronimus transformation for orthogonal polynomials on the unit circle
- A more accurate algorithm for computing the Christoffel transformation
- A note on the Geronimus transformation and Sobolev orthogonal polynomials
- A generalization of the \(G\)-transformation and the related algorithms
- Multiple Geronimus transformations
- Accuracy and Stability of Numerical Algorithms
- Algebraic Methods for Modified Orthogonal Polynomials
- An Implemention of Christoffel's Theorem in the Theory of Orthogonal Polynomials
- Calculation of Gauss quadratures with multiple free and fixed knots
- Computational Aspects of Three-Term Recurrence Relations
- Darboux transformation and perturbation of linear functionals
- DARBOUX TRANSFORMS AND ORTHOGONAL POLYNOMIALS
- Differential-difference evolution equations. II: Darboux transformation for the Toda lattice
- Discrete Darboux transformations, the discrete-time Toda lattice, and the Askey-Wilson polynomials
- scientific article; zbMATH DE number 3125991 (Why is no real title available?)
- scientific article; zbMATH DE number 3181418 (Why is no real title available?)
- scientific article; zbMATH DE number 1018555 (Why is no real title available?)
- scientific article; zbMATH DE number 953151 (Why is no real title available?)
- scientific article; zbMATH DE number 2107939 (Why is no real title available?)
- scientific article; zbMATH DE number 3304223 (Why is no real title available?)
- Jacobi matrices for measures modified by a rational factor
- Lectures on Finite Precision Computations
- Minimal Solutions of Three-Term Recurrence Relations and Orthogonal Polynomials
- On orthogonal polynomials transformed by the QR algorithm
- On quasi-orthogonal polynomials
- Some functions that generalize the Krall-Laguerre polynomials
- Spectral transformations, self-similar reductions and orthogonal polynomials
- The interplay between classical analysis and (numerical) linear algebra -- a tribute to Gene H. Golub
- \(L\)-orthogonal polynomials associated with related measures
- A more accurate algorithm for computing the Christoffel transformation
- Algorithms for the Geronimus transformation for orthogonal polynomials on the unit circle
- scientific article; zbMATH DE number 1094070 (Why is no real title available?)
- Asymptotics of orthogonal polynomials generated by a Geronimus perturbation of the Laguerre measure
- Algorithm 830
- A generalization of the \(G\)-transformation and the related algorithms
- Determinantal formulas for rational perturbations of multiple orthogonality measures
This page was built for publication: A new algorithm for computing the Geronimus transformation with large shifts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q970591)
