Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries

DOI10.1145/355694.355696MaRDI QIDQ4098573zbMATH OpenOpenAlexFDO

Authors

Publication date 1976

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/355694.355696

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Numerical computation of solutions to single equations (65H05) Algorithms in computer science (68W99)

Cited in

(9)

• An effective algorithm of computing symbolic determinants with multivariate polynomial entries
• An effective hybrid algorithm for computing symbolic determinants
• A New Black Box Factorization Algorithm - the Non-monic Case
• Computing the determinant of a matrix with polynomial entries by approximation
• Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations
• The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects
• Factoring multivariate polynomials represented by black boxes: a Maple + C implementation
• An optimal fraction free Routh array†
• POLY: a new polynomial data structure for Maple 17

This page was built for publication: Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries

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