Pages that link to "Item:Q1904132"
From MaRDI portal
The following pages link to Fraction free Gaussian elimination for sparse matrices (Q1904132):
Displaying 14 items.
- Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction (Q648916) (← links)
- Complete integration-by-parts reductions of the non-planar hexagon-box via module intersections (Q1797273) (← links)
- Common factors in fraction-free matrix decompositions (Q2071522) (← links)
- Heuristics to sift extraneous factors in Dixon resultants (Q2117431) (← links)
- A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\) (Q2492665) (← links)
- Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations (Q2802247) (← links)
- Sparse Gaussian Elimination Modulo p: An Update (Q2829994) (← links)
- Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations (Q5071429) (← links)
- (Q5075778) (← links)
- Modified gauss algorithm for matrices with symbolic entries (Q5176447) (← links)
- Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work (Q5232110) (← links)
- Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates (Q5358295) (← links)
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization (Q5883713) (← links)
- A generalized Sylvester identity and fraction-free random Gaussian elimination (Q5933502) (← links)
