A fast algorithm for the division of two polynomial matrices

DOI10.1109/9.28020MaRDI QIDQ3816909zbMATH OpenOpenAlexFDO

Authors Bruno Codenotti, Grazia Lotti

Publication date 1989

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

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

zbMATH Keywords

algorithmblock triangular Toeplitz matricesconvolutionsdivisionfast Fourier transformparallel implementationpolynomial matrices

Mathematics Subject Classification ID

Matrices over function rings in one or more variables (15A54) Parallel numerical computation (65Y05)

Recommendations

• An efficient division algorithm for polynomial matrices
• Fast parallel polynomial division via reduction to triangular Toeplitz matrix inversion and to polynomial inversion modulo a power
• Parallel algorithms for matrix polynomial division
• Polynomial division and its computational complexity
• A division algorithm for polynomial matrices

Cited in

(8)

• Fast parallel polynomial division via reduction to triangular Toeplitz matrix inversion and to polynomial inversion modulo a power
• Approximate real polynomial division via approximate inversion of real triangular Toeplitz matrices
• Algorithms for fast polynomial division
• scientific article; zbMATH DE number 3856407 (Why is no real title available?)
• A division algorithm for polynomial matrices
• An efficient division algorithm for polynomial matrices
• Parallel algorithms for matrix polynomial division
• A polynomial matrix method for computing stable rational doubly coprime factorizations

This page was built for publication: A fast algorithm for the division of two polynomial matrices

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