Splitting dense columns in sparse linear systems (Q803727)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4201484
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Splitting dense columns in sparse linear systems |
scientific article; zbMATH DE number 4201484 |
Statements
Splitting dense columns in sparse linear systems (English)
0 references
1991
0 references
Let \(A=[S,D]\) where S and D denote respectively the sparse and dense columns of a matrix A. The author gives an efficient and robust method for solving \(AA^ Tx=b.\) The proposed method avoids the rank-deficiency problem that is common to the present algorithms and also makes an effective use of sparse matrix techniques. Applications to interior-point methods for linear programming and non-symmetric matrices are pointed out.
0 references
splitting dense columns
0 references
sparse matrix
0 references
interior-point methods
0 references
linear programming
0 references
non-symmetric matrices
0 references
0 references
0 references
0 references
0 references
0.854755163192749
0 references
0.8535739779472351
0 references
0.7869694232940674
0 references
0.7757529616355896
0 references
0.7729217410087585
0 references
