Asymptotics of orthogonal polynomials and the numerical solution of ill-posed problems
DOI10.1007/BF02142497zbMath0851.65035MaRDI QIDQ1911450
Publication date: 26 November 1996
Published in: Numerical Algorithms (Search for Journal in Brave)
convergenceconjugate gradient methoditerative methodslinear ill-posed problemsChristoffel functionszeros of orthogonal polynomialscompact operator equationsmodified Lommel polynomialsTricomi-Carlitz polynomialsBrakhage's \(\nu\)-method
Numerical solutions to equations with linear operators (65J10) Equations and inequalities involving linear operators, with vector unknowns (47A50) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The zeros of basic Bessel functions, the functions J(nu+ax)(x), and associated orthogonal polynomials
- Accelerated Landweber iterations for the solution of ill-posed equations
- An optimal stopping rule for the \(v\)-method for solving ill-posed problems, using Christoffel functions
- Fast decreasing polynomials
- Orthogonal polynomials suggested by a queueing model
- An $\epsilon $-Free a Posteriori Stopping Rule for Certain Iterative Regularization Methods
- Christoffel functions and orthogonal polynomials for exponential weights on [-1,1]
This page was built for publication: Asymptotics of orthogonal polynomials and the numerical solution of ill-posed problems