Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries
From MaRDI portal
Publication:4098573
Cited in
(9)- Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations
- An optimal fraction free Routh array†
- An effective hybrid algorithm for computing symbolic determinants
- An effective algorithm of computing symbolic determinants with multivariate polynomial entries
- POLY: a new polynomial data structure for Maple 17
- 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
- Computing the determinant of a matrix with polynomial entries by approximation
- A New Black Box Factorization Algorithm - the Non-monic Case
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)