A generalization of the ABS algorithms and its application to some special real and integer matrix factorizations
From MaRDI portal
Publication:5054007
DOI10.22067/IJNAO.2021.70974.1043OpenAlexW4391766303MaRDI QIDQ5054007FDOQ5054007
Authors: Effat Golpar-Raboky, Nezam Mahdavi-Amiri
Publication date: 29 November 2022
Full work available at URL: https://doaj.org/article/761a864fe37b495b8af4cdf3e8cba14e
Recommendations
Direct numerical methods for linear systems and matrix inversion (65F05) Factorization of matrices (15A23)
Cites Work
- ABS algorithms for linear equations and ABSPACK
- ABS methods and ABSPACK for linear systems and optimization: A review
- Title not available (Why is that?)
- ABS methods for continuous and integer linear equations and optimization
- WZ factorization via Abaffy-Broyden-Spedicato algorithms
- Existence and uniqueness of WZ factorization
- A parallel linear system solver
- A class of ABS algorithms for Diophantine linear systems
- A class of direct methods for linear systems
- Integer extended ABS algorithms and possible control of intermediate results for linear Diophantine systems
- Title not available (Why is that?)
- Generating the integer null space and conditions for determination of an integer basis using the ABS algorithms
- Diophantine quadratic equation and Smith normal form using scaled extended integer Abaffy-Broyden-Spedicato algorithms
- Real and integer Wedderburn rank reduction formulas for matrix decompositions
- Title not available (Why is that?)
- The parallel solution of banded linear equations by the new quadrant interlocking factorisation (q.i.f.) method
Cited In (1)
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)