Recursive Evaluation of Padé Approximants for Matrix Sequences

DOI10.1147/RD.164.0401MaRDI QIDQ3214081zbMATH OpenOpenAlexFDO

Authors

Publication date 1972

Published in IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1147/rd.164.0401

Mathematics Subject Classification ID

Numerical approximation and computational geometry (primarily algorithms) (65D99) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Cited in

(9)

• On the partial realization problem
• A new application of the extended Euclidean algorithm for matrix Padé approximants
• Généralisations de la transformation de Shanks, de la table de Padé et de l'\(\varepsilon\)-algorithme
• Markovian representation of stochastic processes and its application to the analysis of autoregressive moving average processes
• A method of constructing minimal approximate realizations of linear input-output behavior
• A recursive algorithm for matrix Padé approximants --- the divide-and- conquer approach
• Partial realization of random systems
• Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm
• Recursive formulation of the matrix Padé approximation in packed storage

This page was built for publication: Recursive Evaluation of Padé Approximants for Matrix Sequences

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