Name
Abstract | ||
|---|---|---|
Abstract We have considered the systolic implementation of several methods for updating the Cholesky factorization. For positive rank-k changes there are simple one-pass arrays that implement algorithms based on elimination and plane rotations. In the case of negative rank-one changes, we do not feel that the standard algorithm [2] has a practical implementation. We have introduced a new algorithm for the case of a negative rank-k change and provided an attractive two-pass systolic implementation. |
Year | DOI | Venue |
|---|---|---|
1986 | 10.1007/BF01935052 | Bit Numerical Mathematics |
Keywords | Field | DocType |
systolic array,cholesky factorization,C.1.2,F.1.1,F.2.1,G.1.3 | Standard algorithms,Algebra,Incomplete Cholesky factorization,Minimum degree algorithm,Arithmetic,Factorization,Mathematics,Cholesky decomposition | Journal |
Volume | Issue | ISSN |
26 | 4 | 0006-3835 |
Citations | PageRank | References |
4 | 18.16 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert Schreiber | 1 | 4 | 18.16 |
| Wei-Pai Tang | 2 | 96 | 34.36 |