Is the recurrence relation for orthogonal polynomials always stable? (Q688633)

The basic three-term recurrence relation for orthogonal polynomials is generally an excellent way for computing the polynomials. It is to become unstable if one attempts to use it for computing other solutions, e.g. solutions of minimization problems. To be more precise, the formulas are not instable for \(n\to \infty\), but the stability constants may become extremely large. The author calls this phenomenon ``pseudostability'' and illustrates it with several examples.