Rank reduction and conjugation

MaRDI QIDQ2714182zbMATH OpenFDO

Authors Aurél Galántai

Publication date 12 June 2001

Published in Mathematical Notes (Miskolc) (Search for Journal in Brave)

zbMATH Keywords

ABS methodalgorithmsconjugationmatrix factorizationsrank reductionTSGS method

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Review text

The author investigates Egerváry's rank reduction method and related conjugation algorithms. Necessary and sufficient conditions for performing the rank reduction procedure without breakdown are investigated. The author gives an exact characterization for the components of the full rank factorization produced by the rank reduction algorithm and derives various factorization results. It is also shown that the components of the full rank factorization are biconjugate. The \(ABS\) conjugate procedure and the \(TSGS\) biconjugate process of Heged\hataccent us are investigated. It is shown that \(ABS\) conjugation is essentially a full rank factorization by Egerváry's rank reduction algorithm.

Recommendations

• Rank reduction, factorization and conjugation
• scientific article; zbMATH DE number 2163555
• A Rank–One Reduction Formula and Its Applications to Matrix Factorizations
• Extended integer rank reduction formulas and Smith normal form
• scientific article; zbMATH DE number 2212599

Cited in

(6)

• Reduced rank and normalizing elements
• Rank reduction, factorization and conjugation
• scientific article; zbMATH DE number 2163555 (Why is no real title available?)
• A Rank–One Reduction Formula and Its Applications to Matrix Factorizations
• scientific article; zbMATH DE number 2212599 (Why is no real title available?)
• The rank reduction procedure of Egerváry

This page was built for publication: Rank reduction and conjugation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2714182)