Precise Matrix Eigenvalues Using Range Arithmetic
A recent paper by Aberth and Schaefer [Traps. Math. Software, to appear] described how the programming language C++ can serve as a vehicle for replacing floating-point arithmetic with the more advance...
A recent paper by Aberth and Schaefer [Traps. Math. Software, to appear] described how the programming language C++ can serve as a vehicle for replacing floating-point arithmetic with the more advance...
A Note on Nested Dissection for Rectangular Grids
A new ordering scheme is presented for sparse matrices associated with rectangular grid problems. The new scheme combines features of both the nested dissection and natural orderings to obtain orderi...
A new ordering scheme is presented for sparse matrices associated with rectangular grid problems. The new scheme combines features of both the nested dissection and natural orderings to obtain orderi...
You are not logged in to this journal. Log in
On Finding Supernodes for Sparse Matrix Computations
SIAM. J. Matrix Anal. & Appl. Volume 14, Issue 1, pp. 242-252 (January 1993)
Issue Date: January 1993
Connotea
CiteULike
del.icio.us
BibSonomy
A simple characterization of fundamental supernodes is given in terms of the row subtrees of sparse Cholesky factors in the elimination tree. Using this characterization, an efficient algorithm is presented that determines the set of such supernodes in time proportional to the number of nonzeros and equations in the original matrix. Experimental results verify the practical efficiency of this algorithm.
©1993 Society for Industrial and Applied Mathematics
| History: | Received 1990-08-25; accepted 1991-05-17 |
| Permalink: | http://dx.doi.org/10.1137/0614019 |
KEYWORDS and AMS
65F05, 65F50, 65W
PUBLICATION DATA
0895-4798 (print)
1095-7162 (online)
SIAM