A note on the evaluation of matrix polynomials

DOI10.1109/TAC.1979.1102005zbMath0401.65027OpenAlexW2157280319MaRDI QIDQ4185739

Charles F. Van Loan

Publication date: 1979

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.1979.1102005

zbMATH Keywords

Algorithm of Paterson and StockmeyerEvaluation of Matrix PolynomialsStorage Requirement

Mathematics Subject Classification ID

Algebraic systems of matrices (15A30) Algorithms in computer science (68W99)

Related Items

On-the-fly backward error estimate for matrix exponential approximation by Taylor algorithm ⋮ The Padé method for computing the matrix exponential ⋮ Optimality of the Paterson-Stockmeyer method for evaluating matrix polynomials and rational matrix functions ⋮ Fast methods for resumming matrix polynomials and Chebyshev matrix polynomials. ⋮ Computing the matrix sine and cosine simultaneously with a reduced number of products ⋮ Error analysis of two algorithms for the computation of the matrix exponential ⋮ Computation of a function of a matrix with close eigenvalues by means of the Newton interpolating polynomial ⋮ The scaling and modified squaring method for matrix functions related to the exponential