On generalized Schur complement of matrices and its applications to real and integer matrix factorizations
From MaRDI portal
Publication:5080098
Recommendations
- The generalized Schur algorithm and some applications
- A note on the factorization of some structured matrix functions
- What are Schur complements, anyway?
- Schur factorization and orthogonal diagonal factorization of quasi-row (column) symmetric matrices
- Real and integer Wedderburn rank reduction formulas for matrix decompositions
Cites work
- scientific article; zbMATH DE number 4063277 (Why is no real title available?)
- A Generalization of the Schur Complement by Means of the Moore–Penrose Inverse
- A class of ABS algorithms for Diophantine linear systems
- A class of direct methods for linear systems
- A parallel linear system solver
- 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
- Generalized Schur complements
- 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 extended rank reduction formulas and matrix decompositions: A review
- Some inequalities on generalized Schur complements
- Some interlacing properties of the Schur complement of a Hermitian matrix
- 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: On generalized Schur complement of matrices and its applications to real and integer matrix factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080098)
