A more accurate algorithm for computing the Christoffel transformation
From MaRDI portal
Publication:2372952
Recommendations
- A new algorithm for computing the Geronimus transformation with large shifts
- On a Christoffel transformation for matrix measures supported on the unit circle
- Darboux transformations of Jacobi matrices and Padé approximation
- Stability and sensivity of Darboux transformation without parameter
- Shifted Darboux transformations of the generalized Jacobi matrices. I
Cites work
- scientific article; zbMATH DE number 3820981 (Why is no real title available?)
- scientific article; zbMATH DE number 46780 (Why is no real title available?)
- scientific article; zbMATH DE number 3605240 (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 780780 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 3199190 (Why is no real title available?)
- Accuracy and Stability of Numerical Algorithms
- Accurate singular values and differential qd 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
- Darboux transformation and perturbation of linear functionals
- Der Quotienten-Differenzen-Algorithmus
- Differential-difference evolution equations. II: Darboux transformation for the Toda lattice
- Lectures on Finite Precision Computations
- On orthogonal polynomials transformed by the QR algorithm
- On the calculation of Jacobi matrices
- Some functions that generalize the Krall-Laguerre polynomials
- Spectral transformations, self-similar reductions and orthogonal polynomials
- Stability and sensivity of Darboux transformation without parameter
- The interplay between classical analysis and (numerical) linear algebra -- a tribute to Gene H. Golub
Cited in
(9)- Discrete semiclassical orthogonal polynomials of class 2
- Algorithms for the Geronimus transformation for orthogonal polynomials on the unit circle
- Computation of connection coefficients and measure modifications for orthogonal polynomials
- Recurrence relations for the moments of discrete semiclassical orthogonal polynomials
- Orthogonality of the Dickson polynomials of the \((k+1)\)-th kind
- On Gauss-type quadrature rules
- Rational algorithm for quadratic Christoffel modification and applications to the constrained \(L^2\)-approximation
- Error analysis of the mdLVs algorithm for computing bidiagonal singular values
- A new algorithm for computing the Geronimus transformation with large shifts
This page was built for publication: A more accurate algorithm for computing the Christoffel transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372952)