| |
|
Item: REP-1999-374
|
| |
Item:REP-1999-374
|
Title:Multiple-Rank Modifications of a Sparse Cholesky Factorization
Timothy A. Davis
CISE Dept., Univ. of Florida
William W. Davis
Dept. of Mathematics, Univ. of Florida
Abstract:
Given a sparse symmetric positive definite matrix AA' and an associated sparse Cholesky factorization LDL' or LL', we develop sparse techniques for updating the factorization after either adding a collection of columns to A or deleting a collection of columns from A. Our techniques are based on an analysis and manipulation of the underlying graph structure, using the framework developed in an earlier paper on rank one modifications [SIAM J. Matrix Anal. Appl., 20 (1999), pp. 606-627]. Computationally, the multiple rank update has better memory traffic and executes much faster than an equivalent series of rank one updates since the multiple rank update makes one pass through L computing the new entries, while a series of rank one updates requires multiple passes through L. Revised September 2000.
Supporting File:here
|
|
| |
|
Select Departmental Reports
|
| |
|
|
| |
|
Departmental Report Categories
|
| |
|
|
To submit items for this page, please log in on the
CISE submit page.
|
|