Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries
From MaRDI portal
Publication:4098573
DOI10.1145/355694.355696zbMath0332.65017MaRDI 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
68W30: Symbolic computation and algebraic computation
65H10: Numerical computation of solutions to systems of equations
65H05: Numerical computation of solutions to single equations
65F05: Direct numerical methods for linear systems and matrix inversion
68W99: Algorithms in computer science
Related Items
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 effective hybrid algorithm for computing symbolic determinants, Computing the determinant of a matrix with polynomial entries by approximation, POLY: A New Polynomial Data Structure for Maple 17, Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations, An optimal fraction free Routh array†