科技报告详细信息
Object-Oriented Algorithmic Laboratory for Ordering Sparse Matrices. | |
Kumfert, G. K. | |
Technical Information Center Oak Ridge Tennessee | |
关键词: Sparse matrices; Algorithms; Computations; Object-oriented programming; Graph diameters; | |
RP-ID : DE200515013116 | |
学科分类:工程和技术(综合) | |
美国|英语 | |
来源: National Technical Reports Library | |
【 摘 要 】
We focus on two known NP-hard problems that have applications in sparse matrix computations: the envelope/wavefront reduction problem and the fill reduction problem. Envelope/wavefront reducing orderings have a wide range of applications including profile and frontal solvers, incomplete factorization preconditioning, graph reordering for cache performance, gene sequencing, and spatial databases. Fill reducing orderings are generally limited to -- but an inextricable part of -- sparse matrix factorization.
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
DE200515013116.pdf | 5895KB | download |