On decoupling of linear recursions

DOI10.1017/S0004972700025867MaRDI QIDQ4743685zbMATH OpenOpenAlexFDO

Authors R. M. M. Mattheij

Publication date 1983

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0004972700025867

zbMATH Keywords

decouplinginvariant imbeddingorder reductionsecond order recursionstabilitytriangularization

Mathematics Subject Classification ID

Additive difference equations (39A10)

Cites work

• A Note on Olver's Algorithm for the Solution of Second-Order Linear Difference Equations
• Characterizations of dominant and dominated solutions of linear recursions
• scientific article; zbMATH DE number 3786072 (Why is no real title available?)
• scientific article; zbMATH DE number 3244037 (Why is no real title available?)
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)
• Initial value methods for boundary value problems. Theory and application of invariant imbedding
• Note on Backward Recurrence Algorithms
• Numerical solution of second-order linear difference equations
• Stable computation of solutions of unstable linear initial value recursions
• The numerical solution of linear recurrence relations

Cited in

(1)

• A generalized Jacobi-Perron algorithm for the reduction of systems of linear difference equations

This page was built for publication: On decoupling of linear recursions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4743685)