Generalized fraction-free LU factorization for singular systems with kernel extraction
From MaRDI portal
Publication:648916
Recommendations
Cites work
- scientific article; zbMATH DE number 691245 (Why is no real title available?)
- scientific article; zbMATH DE number 2151192 (Why is no real title available?)
- scientific article; zbMATH DE number 1424302 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Method for Computing the Generalized Inverse of a Matrix
- A generalization of the fast LUP matrix decomposition algorithm and applications
- A generalized Sylvester identity and fraction-free random Gaussian elimination
- An algorithm to solve integer linear systems exactly using numerical methods
- An updated set of basic linear algebra subprograms (BLAS)
- Computational Geometry in C
- Computational Solutions of Matrix Problems Over an Integral Domain
- Discrete logarithms: The past and the future
- Error-free computer solution of certain system of linear equations
- Fraction free Gaussian elimination for sparse matrices
- Information transfer between incompatible finite element meshes: Application to coupled thermo-viscoelasticity
- Iterated snap rounding
- LAPACK Users' Guide
- LDU decompositions with \(L\) and \(U\) well conditioned
- MPFR
- Multiple LU factorizations of a singular matrix
- On the Computation of Null Spaces of Sparse Rectangular Matrices
- Rank revealing \(LU\) factorizations
- Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
- The shifted number system for fast linear algebra on integer matrices
- Which pivot to solve linear systems?
This page was built for publication: Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648916)