Computational Solutions of Matrix Problems Over an Integral Domain
From MaRDI portal
Publication:5652123
Cited in
(20)- Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations
- A generalized Sylvester identity and fraction-free random Gaussian elimination
- Which pivot to solve linear systems?
- Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction
- Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates
- The inverses of Toeplitz band matrices
- A parallel algorithm for exact solution of linear equations via congruence technique
- Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
- Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
- Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation
- Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
- An adaptable and extensible geometry kernel
- Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
- Common factors in fraction-free matrix decompositions
- Exactly solving sparse rational linear systems via roundoff-error-free Cholesky factorizations
- Essentially optimal computation of the inverse of generic polynomial matrices
- How Tight is Hadamard's Bound?
- A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
- Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
This page was built for publication: Computational Solutions of Matrix Problems Over an Integral Domain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5652123)
