A generalization of the ABS algorithms and its application to some special real and integer matrix factorizations
From MaRDI portal
Publication:5054007
Recommendations
Cites work
- scientific article; zbMATH DE number 4043149 (Why is no real title available?)
- scientific article; zbMATH DE number 45283 (Why is no real title available?)
- scientific article; zbMATH DE number 1446826 (Why is no real title available?)
- A class of ABS algorithms for Diophantine linear systems
- A class of direct methods for linear systems
- A parallel linear system solver
- ABS algorithms for linear equations and ABSPACK
- ABS methods and ABSPACK for linear systems and optimization: A review
- ABS methods for continuous and integer linear equations and optimization
- Diophantine quadratic equation and Smith normal form using scaled extended integer Abaffy-Broyden-Spedicato algorithms
- Existence and uniqueness of WZ factorization
- Generating the integer null space and conditions for determination of an integer basis using the ABS algorithms
- Integer extended ABS algorithms and possible control of intermediate results for linear Diophantine systems
- Real and integer Wedderburn rank reduction formulas for matrix decompositions
- The parallel solution of banded linear equations by the new quadrant interlocking factorisation (q.i.f.) method
- WZ factorization via Abaffy-Broyden-Spedicato algorithms
This page was built for publication: A generalization of the ABS algorithms and its application to some special real and integer matrix factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5054007)
