Esmond G. Ng, Padma Raghavan  Home/Search
Context Related
Links: ACM | utk.edu/~padma/mdef.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: utk.edu/~padma/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Greedy algorithms for ordering sparse matrices for Cholesky factorization can be based on different metrics. Minimum degree, a popular and effective greedy ordering scheme, minimizes the number of nonzero entries in the rank-1 update (degree) at each step of the factorization. Alternatively, minimum deficiency minimizes the number of nonzero entries introduced (deficiency) at each step of the factorization. In this paper we develop two new heuristics: "modified minimum deficiency" (MMDF) and... (Update)
Context of citations to this paper: More
.... [9] AMIND Approximate Minimum Increase in Rothberg and Eisenstat [9] Neighbor Degree MMDF Modified Minimum Deficiency Ng and Raghavan [6] MMMD Modified Multiple Minimum Degree Ng and Raghavan [6] connecting vertices i and j in G exists if and only if a ij is nonzero. By...
...Gaussian elimination process. The algorithms using such an approach are typically distinguished by their greedy minimization criteria [20]. In graph terms, the basic ordering process used by most greedy algorithms is as follows: 1. Start: Construct undirected graph G 0...
Cited by: More
Generic Graph Algorithms for Sparse Matrix Ordering - Lee, Siek, Lumsdaine (1999) (Correct)
Rapid Parallelisation of the Industrial Modelling Code PZFlex - Rob Baxter Paul (Correct)
A Column Approximate Minimum Degree Ordering Algorithm - Davis, Gilbert, Larimore, Ng (2000) (Correct)
Active bibliography (related documents): More All
0.5: Adaptive and Efficient Algorithms for Lattice Agreement and.. - Attiya, Fouren (1998) (Correct)
0.3: Towards a Tighter Coupling of Bottom-Up and Top-Down Sparse.. - Schulze (2001) (Correct)
0.3: Sparse Numerical Linear Algebra: Direct Methods and Preconditioning - Duff (1996) (Correct)
Similar documents based on text: More All
0.5: The Computational Complexity of the minimum degree.. - Heggernes, Eisenstat.. (2001) (Correct)
0.3: The Minimum Degree Heuristic and the Minimal - Berry, Heggernes, Simonet (Correct)
0.2: A New Data-Mapping Scheme For Latency-Tolerant.. - Teranishi, Raghavan, Ng (2002) (Correct)
Related documents from co-citation: More All
7: Modification of the minimum degree algorithm by multiple
7: An approximate minimum degree ordering algorithm - Davis, Amestoy et al. - 1994
5: Node selection strategies for bottom-up sparse matrix ordering (context) - Rothberg, Eisenstat - 1998
BibTeX entry: (Update)
E. G.-Y. Ng and P. Raghavan, Performance of greedy ordering heuristics for sparse cholesky factorization, Tech. Rep. CS-97-XX, University of Tennessee, Knoxville, TN, 1997. http://citeseer.ist.psu.edu/ng97performance.html More
@article{ ng99performance,
author = "Esmond G. Ng and Padma Raghavan",
title = "Performance of Greedy Ordering Heuristics for Sparse {Cholesky} Factorization",
journal = "SIAM Journal on Matrix Analysis and Applications",
volume = "20",
number = "4",
pages = "902--914",
year = "1999",
url = "citeseer.ist.psu.edu/ng97performance.html" }
Citations (may not include all citations):322 Direct Methods for Sparse Matrices (context) - Duff, Erisman et al. - 1987
98 An approximate minimum degree ordering algorithm - Amestoy, Davis et al. - 1996 ACM
93 Computing the minimum fill-in is NP-complete (context) - Yannakakis - 1981
93 Reducing the bandwidth of sparse symmetric matrices (context) - Cuthill, McKee - 1969 ACM
74 Modification of the minimum degree algorithm by multiple eli.. (context) - Liu - 1985
57 A graph-theoretic study of the numerical solution of sparse .. (context) - Rose - 1972
42 Improving the runtime and quality of nested dissection order.. - Hendrickson, Rothberg - 1996
39 Direct solution of sparse network equations by optimally ord.. (context) - Tinney, Walker - 1967
30 Compressed graphs and the minimum degree algorithm (context) - Ashcraft - 1995 ACM
30 Robust orderings of sparse matrices using multisection - Ashcraft, Liu - 1996
30 An automatic nested dissection algorithm for irregular finit.. (context) - George, Liu - 1978
20 Computer Implementation of the Finite Element Method (context) - George - 1971
19 Node selection strategies for bottom-up sparse matrix orderi.. (context) - Rothberg, Eisenstat - 1997
16 the performance of the minimum degree ordering for Gaussian .. (context) - Berman, Schnitger - 1990
12 Ordering sparse matrices using approximate minimum local fil.. (context) - Rothberg - 1996
11 Performance of greedy ordering heuristics for sparse cholesk.. - Ng, Raghavan - 1997
10 Prentice-Hall Inc (context) - of, Positive et al. - 1981
8 Several strategies for reducing bandwidth of matrices (context) - Cuthill - 1972
2 ACM Trans (context) - implementation, minimum et al. - 1980
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.utk.edu/~padma/): More
Parallel Ordering Using Edge Contraction - Padma Raghavan (Correct)
Distributed Sparse Gaussian Elimination And Orthogonal.. - Raghavan (1995) (Correct)
A Blocked Incomplete Cholesky Preconditioner For.. - Ng, Peyton, Raghavan (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC