Computational Solutions of Matrix Problems Over an Integral Domain

From MaRDI portal
Publication:5652123

DOI10.1093/imamat/10.1.68zbMath0241.65032OpenAlexW2157251766MaRDI QIDQ5652123

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



Related Items

An adaptable and extensible geometry kernel, 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, Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination, Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates, Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation, Unnamed Item, Computing the sign or the value of the determinant of an integer matrix, a complexity survey., Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction, 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, A parallel algorithm for exact solution of linear equations via congruence technique, A generalized Sylvester identity and fraction-free random Gaussian elimination, Essentially optimal computation of the inverse of generic polynomial matrices, How Tight is Hadamard's Bound?, Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations, Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work, Common factors in fraction-free matrix decompositions, The inverses of Toeplitz band matrices, Which pivot to solve linear systems?