Pages that link to "Item:Q2457353"
From MaRDI portal
The following pages link to An algorithm to solve integer linear systems exactly using numerical methods (Q2457353):
Displaying 14 items.
- The SIAM 100-Digit Challenge: a decade later. Inspirations, ramifications, and other eddies left in its wake (Q295658) (← links)
- Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction (Q648916) (← links)
- An interval algorithm for solving systems of linear equations to prespecified accuracy (Q760758) (← links)
- Error-free algorithms to solve special and general discrete systems of linear equations (Q941471) (← links)
- An algorithm to solve Hilbert systems of linear equations precisely (Q1908247) (← links)
- T-count optimized quantum circuit for floating point addition and multiplication (Q2099611) (← links)
- A complete and terminating approach to linear integer solving (Q2307624) (← links)
- Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations (Q2802247) (← links)
- Iterative refinement for linear programming (Q2830949) (← links)
- (Q4013374) (← links)
- Certified Hermite Matrices from Approximate Roots - Univariate Case (Q5014656) (← links)
- Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work (Q5232110) (← links)
- Numeric-symbolic exact rational linear system solver (Q5254187) (← links)
- Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates (Q5358295) (← links)
