A new algorithm for computing the Geronimus transformation with large shifts
DOI10.1007/S11075-009-9325-9zbMATH Open1191.65039OpenAlexW2131272303MaRDI QIDQ970591FDOQ970591
Authors: Maria Isabel Bueno Cachadina, Alfredo Deaño, Edward Tavernetti 
Publication date: 19 May 2010
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-009-9325-9
Recommendations
- 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
algorithmnumerical experimentsorthogonal polynomialsaccuracyJacobi matrixill-conditionedGeronimus transformationthree-term recurrence relationsroundoff error analysis
Ill-posedness and regularization problems in numerical linear algebra (65F22) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Numerical aspects of recurrence relations (65Q30)
Cites Work
- Title not available (Why is that?)
- Accuracy and Stability of Numerical Algorithms
- Title not available (Why is that?)
- Computational Aspects of Three-Term Recurrence Relations
- Calculation of Gauss quadratures with multiple free and fixed knots
- On quasi-orthogonal polynomials
- Differential-difference evolution equations. II: Darboux transformation for the Toda lattice
- On orthogonal polynomials transformed by the QR algorithm
- Some functions that generalize the Krall-Laguerre polynomials
- Jacobi matrices for measures modified by a rational factor
- The interplay between classical analysis and (numerical) linear algebra -- a tribute to Gene H. Golub
- Darboux transformation and perturbation of linear functionals
- Discrete Darboux transformations, the discrete-time Toda lattice, and the Askey-Wilson polynomials
- Algebraic Methods for Modified Orthogonal Polynomials
- Spectral transformations, self-similar reductions and orthogonal polynomials
- Title not available (Why is that?)
- Title not available (Why is that?)
- DARBOUX TRANSFORMS AND ORTHOGONAL POLYNOMIALS
- An Implemention of Christoffel's Theorem in the Theory of Orthogonal Polynomials
- Minimal Solutions of Three-Term Recurrence Relations and Orthogonal Polynomials
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lectures on Finite Precision Computations
Cited In (7)
- Algorithms for the Geronimus transformation for orthogonal polynomials on the unit circle
- Title not available (Why is that?)
- A generalization of the \(G\)-transformation and the related algorithms
- A more accurate algorithm for computing the Christoffel transformation
- Algorithm 830
- \(L\)-orthogonal polynomials associated with related measures
- Asymptotics of orthogonal polynomials generated by a Geronimus perturbation of the Laguerre measure
Uses Software
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)
