The choleski Q.I.F. algorithm for solving symmetric linear systems (Q4934815)
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 1394595
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The choleski Q.I.F. algorithm for solving symmetric linear systems |
scientific article; zbMATH DE number 1394595 |
Statements
The choleski Q.I.F. algorithm for solving symmetric linear systems (English)
0 references
21 November 2000
0 references
QIF factorization
0 references
Cholesky algorithm
0 references
bow-tie algorithm
0 references
parallel algorithm
0 references
quadratic interlocking factors
0 references
0.8202297687530518
0 references
0.7947496175765991
0 references
0.7873424887657166
0 references
Earlier the author introduced the quadratic interlocking factors (Q.I.F) algorithm [Parallel numerical algorithms for linear systems, in \textit{D. J. Evans}, Parallel Processing Systems, 357-384, Cambridge University Press (1982; Zbl 0484.68016)]. This algorithm gives rise to matrices with a characteristic butterfly pattern of non-zeros and can be efficiently implemented on parallel computers. The purpose of this note is to present a restatement of the algorithm in the symmetric case with evident analogy with the square-root form of the Cholesky algorithm. Operation counts for the factorization and an illustrative example are presented.
0 references
