2001
DOI: 10.18514/mmn.2001.42
|View full text |Cite
|
Sign up to set email alerts
|

Rank reduction and bordered inversion

Abstract: We clarify the connection between the rank reduction algorithm and the bordered inversion method and their related sequences.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2009
2009
2015
2015

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 11 publications
(18 reference statements)
0
1
0
Order By: Relevance
“…The sufficient part of this result is included in Wedderburn's book and was later extended to block matrices by Guttman [14,15]. Galántai [2,[9][10][11] gave several results concerning the rank reduction algorithm developed by Egerváry. Wedderburn showed that subtracting rank one matrices of the form ω −1 Axy T A from a matrix A resulted in a matrix with rank one less than that of A, if ω = y T Ax = 0 [16,22]. The converse is also true [16].…”
Section: Introductionmentioning
confidence: 99%
“…The sufficient part of this result is included in Wedderburn's book and was later extended to block matrices by Guttman [14,15]. Galántai [2,[9][10][11] gave several results concerning the rank reduction algorithm developed by Egerváry. Wedderburn showed that subtracting rank one matrices of the form ω −1 Axy T A from a matrix A resulted in a matrix with rank one less than that of A, if ω = y T Ax = 0 [16,22]. The converse is also true [16].…”
Section: Introductionmentioning
confidence: 99%