Using qr-decompositions in the numerical solution of linear recurrence relations

DOI10.1080/00036819008839948zbMath0678.65091OpenAlexW2013104794MaRDI QIDQ3834996

Paul Levrie, Robert Piessens

Publication date: 1990

Published in: Applicable Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00036819008839948

zbMATH Keywords

minimal solutionlinear recurrence relationQR-decomposition

Mathematics Subject Classification ID

Related Items (1)

Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series

Cites Work

• Unnamed Item
• Über lineare Differenzengleichungen und eine Anwendung auf lineare Differentialgleichungen mit Polynomkoeffizienten
• Modified Clenshaw-Curtis method for the computation of Bessel function integrals
• Stable computation of solutions of unstable linear initial value recursions
• The numerical solution of linear recurrence relations
• Asymptotic solutions of certain linear difference equations, with applications to some eigenvalue problems
• Computational Aspects of Three-Term Recurrence Relations

This page was built for publication: Using qr-decompositions in the numerical solution of linear recurrence relations