1987
DOI: 10.1016/0168-9274(87)90049-3
|View full text |Cite
|
Sign up to set email alerts
|

Generalized Schur-complements and a test for total positivity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

1992
1992
2021
2021

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 20 publications
(13 citation statements)
references
References 6 publications
0
13
0
Order By: Relevance
“…Replacing a k by its expression in (24) (25) and (26) are similar to the rules of the E-algorithm [5]. Due to the non-commutativity of the matrix products, it does not seem that the preceding rules could be simplified.…”
Section: Second Approachmentioning
confidence: 90%
See 1 more Smart Citation
“…Replacing a k by its expression in (24) (25) and (26) are similar to the rules of the E-algorithm [5]. Due to the non-commutativity of the matrix products, it does not seem that the preceding rules could be simplified.…”
Section: Second Approachmentioning
confidence: 90%
“…19-23] or [42,Section 6.4] for basic definitions and results). Schur complements have many applications in extrapolation methods and related topics [7,8,13] and in other domains of mathematics, in particular in linear algebra [23,24,26,28,34].…”
Section: Pseudo-schur Complementsmentioning
confidence: 99%
“…This concept, introduced in [34,35] has found many applications in Linear Algebra and Statistics [13,53]. It may be generalized in di erent ways, see, for example, [21,22,44] where we used the concept of general elimination strategy which is explained in the next section.…”
Section: If I • ; Imentioning
confidence: 99%
“…However, it is clear that the basic role in all these papers was played by elimination techniques. In [21] we studied general elimination strategies, where one strategy which we called Neville elimination proved to be well suited to work with some special classes of matrices, in particular totally positive matrices (that are matrices with all subdeterminants nonnegative).…”
Section: Introductionmentioning
confidence: 99%
“…In some papers by M. Gasca and G. Mühlbach ( [13] for example) on the connection between interpolation formulas and elimination techniques it became clear that what they called Neville elimination had special interest for TP matrices. It is a procedure to make zeros in a column of a matrix by adding to each row an appropriate multiple of the precedent one and had been already used in some of the first papers on TP matrices [33].…”
Section: §1 Introductionmentioning
confidence: 99%