Actions for Effective sparse matrix ordering [electronic resource] : Just around the BEND

Email RIS file
Bookmark
Report an Issue

Effective sparse matrix ordering [electronic resource] : Just around the BEND

Published
Washington, D.C. : United States. Dept. of Energy. Office of Energy Research, 1997.
Oak Ridge, Tenn. : Distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy.
Physical Description
9 pages : digital, PDF file
Additional Creators
Sandia National Laboratories, United States. Department of Energy. Office of Energy Research, and United States. Department of Energy. Office of Scientific and Technical Information
Access Online

Availability

I Want It
I Want It

Finding items...

Restrictions on Access
Free-to-read Unrestricted online access
Summary
When performing sparse matrix factorization, the ordering of matrix rows and columns has a dramatic impact on the factorization time. This paper describes an approach to the reordering problem that produces significantly better orderings than previous methods. The algorithm is a hybrid of nested dissection and minimum degree ordering, and combines an assortment of algorithmic techniques.
Report Numbers
E 1.99:sand--97-0176c
E 1.99: conf-970342--3
conf-970342--3
sand--97-0176c
Subject(s)
Other Subject(s)
Note
Published through SciTech Connect.
02/01/1997.
"sand--97-0176c"
" conf-970342--3"
"DE97002644"
8. SIAM conference on parallel processing for scientific computing, Minneapolis, MN (United States), 14-17 Mar 1997.
Hendrickson, B.; Rothberg, E.
Funding Information
AC04-94AL85000
View MARC record | catkey: 14349230