Computational Solutions of Matrix Problems Over an Integral Domain
From MaRDI portal
Publication:5652123
DOI10.1093/IMAMAT/10.1.68zbMATH Open0241.65032OpenAlexW2157251766MaRDI QIDQ5652123FDOQ5652123
Authors: E. H. Bareiss 
Publication date: 1972
Published in: IMA Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imamat/10.1.68
Direct numerical methods for linear systems and matrix inversion (65F05) Theory of matrix inversion and generalized inverses (15A09) Matrices over special rings (quaternions, finite fields, etc.) (15B33)
Cited In (20)
- Which pivot to solve linear systems?
- An adaptable and extensible geometry kernel
- 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
- A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix
- Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
- Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations
- Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations
- Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation
- Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates
- Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction
- Common factors in fraction-free matrix decompositions
- Title not available (Why is that?)
- Essentially optimal computation of the inverse of generic polynomial matrices
- A generalized Sylvester identity and fraction-free random Gaussian elimination
- A parallel algorithm for exact solution of linear equations via congruence technique
- How Tight is Hadamard's Bound?
- Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work
- The inverses of Toeplitz band matrices
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)
