A mathematical analysis of Miller's algorithm

DOI10.1007/BF01399606zbMath0336.65056MaRDI QIDQ1230368

R. V. M. Zahar

Publication date: 1977

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132466

Mathematics Subject Classification ID

Additive difference equations (39A10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (7)

Computation of solutions to linear difference and differential equations with a prescribed asymptotic behavior ⋮ Minimal Solutions of Three-Term Recurrence Relations and Orthogonal Polynomials ⋮ Rigorous uniform approximation of D-finite functions using Chebyshev expansions ⋮ A new algorithm for unstable three term recurrence relations ⋮ Linear difference equations and generalized continued fractions ⋮ On the relationship between generalised continued fractions and G- continued fractions ⋮ A generalized Jacobi-Perron algorithm for the reduction of systems of linear difference equations

Cites Work

• Unnamed Item
• An extension of Olver's error estimation technique for linear recurrence relations
• Zur Numerik rekurrenter Relationen
• On Linear Difference Equations
• Computational Aspects of Three-Term Recurrence Relations
• Numerical solution of second-order linear difference equations
• Theory of Incomplete Cylindrical Functions and their Applications
• Note on Backward Recurrence Algorithms
• Error Analysis of Miller's Recurrence Algorithm

This page was built for publication: A mathematical analysis of Miller's algorithm