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

DOI10.1145/355694.355696zbMath0332.65017OpenAlexW2073080309MaRDI QIDQ4098573

No author found.

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

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

Related Items (9)

Computing the determinant of a matrix with polynomial entries by approximation ⋮ A New Black Box Factorization Algorithm - the Non-monic Case ⋮ Factoring multivariate polynomials represented by black boxes: a Maple + C implementation ⋮ The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects ⋮ An effective algorithm of computing symbolic determinants with multivariate polynomial entries ⋮ An optimal fraction free Routh array† ⋮ POLY: A New Polynomial Data Structure for Maple 17 ⋮ Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations ⋮ An effective hybrid algorithm for computing symbolic determinants

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