Computer Solution of Large Sparse Positive Definite
Computer Solution of Large Sparse Positive Definite
Computer implementation of the finite element method
Computer implementation of the finite element method
On the efficient solution of sparse systems of linear and nonlinear equations.
On the efficient solution of sparse systems of linear and nonlinear equations.
A generalized envelope method for sparse factorization by rows
ACM Transactions on Mathematical Software (TOMS)
Multicolor reordering of sparse matrices resulting from irregular grids
ACM Transactions on Mathematical Software (TOMS)
| Hi-index | 0.00 |
A symbolic node-addition model for matrix factorization of symmetric positive definite matrices is described. In this model, the nodes are added onto the filled graph one at a time. The advantage of the node-addition model is its simplicity and flexibility. The model can be immediately incorporated into finite element analysis programs. The model can also be extended to determine modification patterns in the matrix factors due to changes in the original matrix. For a given matrix K(=LDLt), the time complexity of the algorithm for constructing the structure of the lower triangular matrix factor L is O(&eegr;(L)) where &eegr;(L) is the number of nonzero entries in L.