Algebraic and numerical techniques for the computation of matrix determinants
From MaRDI portal
Publication:1368466
DOI10.1016/S0898-1221(97)00097-7zbMath0885.65052OpenAlexW2042254001MaRDI QIDQ1368466
Publication date: 28 September 1997
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0898-1221(97)00097-7
Related Items (5)
A HYBRID APPROACH FOR DETERMINANT SIGNS OF MODERATE-SIZED MATRICES ⋮ The lifetime of micron scale topological chiral magnetic states with atomic resolution ⋮ Single precision computation of the sign of algebraic predicates ⋮ Sign determination in residue number systems ⋮ On the rate of convergence of the alternating projection method in finite dimensional spaces
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Evaluating signs of determinants using single-precision arithmetic
- Towards exact geometric computation
- How to multiply matrices faster
- Complexity of parallel matrix computations
- Computing the determinant and the characteristic polynomial of a matrix via solving linear systems of equations
- The complexity of partial derivatives
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Parametrization of Newton's iteration for computations with structured matrices and applications
- Combinatorial face enumeration in convex polytopes
- Efficient perturbations for handling geometric degeneracies
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- Voronoi polygons and polyhedra
- Application of cut polyhedra. I
- Applications of cut polyhedra. II
- Parallel Algorithms for Dense Linear Algebra Computations
- Solving sparse linear equations over finite fields
- Complexity of Computations with Matrices and Polynomials
- Taylor expansion of the accumulated rounding error
- Perturbation Bounds for the $QR$ Factorization of a Matrix
- Methods for Modifying Matrix Factorizations
- Systems of distinct representatives and linear algebra
- Solving linear least squares problems by Gram-Schmidt orthogonalization
- Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
This page was built for publication: Algebraic and numerical techniques for the computation of matrix determinants
