A fast algorithm for evaluating the matrix polynomial I+A+. . .+A/sup N-1/

DOI10.1109/81.129458MaRDI QIDQ4017651zbMATH OpenOpenAlexFDO

Authors Lei Li, Tadao Nakamura

Publication date 16 January 1993

Published in IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

cyclic reductionfast algorithmmatrix multiplicationsmatrix polynomial

Mathematics Subject Classification ID

Matrices over function rings in one or more variables (15A54) Computation of special functions and constants, construction of tables (65D20)

Recommendations

• Evaluating the matrix polynomial I+A+. . .+A/sup N-1/
• Hybrid algorithm for the computation of the matrix polynomial I+A+···+A/sup N-1/
• scientific article; zbMATH DE number 4145232
• Fast methods for resumming matrix polynomials and Chebyshev matrix polynomials.
• scientific article; zbMATH DE number 1256647

Cited in

(8)

• Fast methods for resumming matrix polynomials and Chebyshev matrix polynomials.
• A parallel algorithm for functions of triangular matrices
• Computing the matrix sine and cosine simultaneously with a reduced number of products
• scientific article; zbMATH DE number 4145232 (Why is no real title available?)
• Evaluating the matrix polynomial I+A+. . .+A/sup N-1/
• Fast algorithms for discrete polynomial transforms
• Hybrid algorithm for the computation of the matrix polynomial I+A+···+A/sup N-1/
• Updating matrix polynomials

This page was built for publication: A fast algorithm for evaluating the matrix polynomial I+A+. . .+A/sup N-1/

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