Characterizations of dominant and dominated solutions of linear recursions

DOI10.1007/BF01399009zbMath0426.65071MaRDI QIDQ1136214

Robert M. M. Mattheij

Publication date: 1980

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

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

zbMATH Keywords

stabilityfundamental solutionlinear recursionstable computationdominated solutions

Mathematics Subject Classification ID

Additive difference equations (39A10)

Related Items (7)

Numerical methods in seismology ⋮ Computing hitting probabilities of Markov chains: structural results with regard to the solution space of the corresponding system of equations ⋮ Stable computation of solutions of unstable linear initial value recursions ⋮ Accurate estimates for the fundamental solutions of discrete boundary value problems ⋮ A generalized Jacobi-Perron algorithm for the reduction of systems of linear difference equations ⋮ On decoupling of linear recursions ⋮ The stability of LU-decompositions of block tridiagonal matrices

Cites Work

• Unnamed Item
• Some inequalities involving the euclidean condition of a matrix
• Accurate estimates of solutions of second order recursions
• Error estimates for Miller's algorithm
• A summation technique for minimal solutions of linear homogeneous difference equations
• The numerical solution of linear recurrence relations
• Zur Numerik rekurrenter Relationen
• Estimating the Solutions of Slowly Varying Recursions
• Computational Aspects of Three-Term Recurrence Relations
• Numerical solution of second-order linear difference equations
• The Rotation of Eigenvectors by a Perturbation. III
• Note on Backward Recurrence Algorithms

This page was built for publication: Characterizations of dominant and dominated solutions of linear recursions