Jürgen Schulze  Home/Search
Context Related
| unipaderborn.de/c...oupling_paper.ps.Z 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: unipaderborn.de/f...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Most state-of-the-art ordering schemes for sparse matrices are a hybrid of a bottom-up method such as minimum degree and a top down scheme such as George's nested dissection. In this paper we present an ordering algorithm that achieves a tighter coupling of bottom-up and topdown methods. In our methodology vertex separators are interpreted as the boundaries of the last elements in a bottom-up ordering. As a consequence, we are using bottom-up techniques like quotient graphs and special node... (Update)
Context of citations to this paper: More
.... ordering with automatic quasi dense row detection, an approximate minimum fill in ordering, and PORD from Jurgen Schulze at Paderborn [20]. There is also an interface to the METIS package from Minnesota [19] so that their METIS NODEND hybrid ordering routine can be used. A...
.... of the Approximate Minimum Fill, available in MUMPS; PORD: a tight coupling of bottom up and top down sparse reordering methods [20]; METIS: the METIS package [11] provides an hybrid approach based on multilevel nested dissection and multiple minimum degree;...
Cited by: More
Unknown - Isrn Inria Rr-- (Correct)
Analysis and Improvments of the Memory Usage of a.. - Guermouche.. (2003) (Correct)
On the Memory Usage of a Parallel Multifrontal Solver - Guermouche, L'Excellent, Utard (2002) (Correct)
Similar documents (at the sentence level):
24.2%: Towards a Tighter Coupling of Bottom-Up and Top-Down Sparse.. - Schulze (2001) (Correct)
Active bibliography (related documents): More All
0.8: Sparse Numerical Linear Algebra: Direct Methods and Preconditioning - Duff (1996) (Correct)
0.7: Effective Sparse Matrix Ordering: Just Around the BEND - Hendrickson, Rothberg (1997) (Correct)
0.6: Robust Ordering of Sparse Matrices using Multisection - Ashcraft, Liu (1996) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.3: Integrating Top-Down and Bottom-Up Sensory Processing By.. - Siegel, Körding, König (2000) (Correct)
0.2: Controlling the Search in Bottom-Up Evaluation - Ramakrishnan, Srivastava.. (1992) (Correct)
0.2: Listing All Minimal Separators of a Graph - Kloks, Kratsch (1998) (Correct)
Related documents from co-citation: More All
5: Multifrontal parallel distributed symmetric and unsymmetric solvers - Amestoy, Duff et al. - 1998
5: The multifrontal solution of unsymmetric sets of linear equations (context) - Duff, Reid - 1984
5: A fully asynchronous multifrontal solver using distributed dynamic scheduling - Amestoy, Duff et al. - 1999
BibTeX entry: (Update)
J. Schulze. Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods. BIT, 41(4):800--841, 2001. 27 http://citeseer.ist.psu.edu/article/schulze01towards.html More
@article{ schulze01towards,
author = "J. Schulze",
title = "Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods",
journal = "BIT Numerical Mathematics",
volume = "41",
number = "4",
month = "????",
pages = "800--??",
year = "2001",
url = "citeseer.ist.psu.edu/article/schulze01towards.html" }
Citations (may not include all citations):421 A linear-time heuristic for improving network partitions (context) - Fiduccia, Mattheyses - 1982
346 Computer Solution of Large Sparse Positive Definite Systems (context) - George, Liu - 1981
322 Direct Methods for Sparse Matrices (context) - Duff, Erisman et al. - 1987
288 A fast and high quality multilevel scheme for partitioning i.. - Karypis, Kumar - 1995
244 A multilevel algorithm for partitioning graphs - Hendrickson, Leland - 1995
111 Users' guide for the Harwell-Boeing sparse matrix collection - Duff, Grimes et al. - 1992
110 Nested dissection of a regular finite element mesh (context) - George - 1973
98 An approximate minimum degree ordering algorithm - Amestoy, Davis et al. - 1996
93 Computing the minimum fill-in is NP-complete (context) - Yannakakis - 1981
80 The evolution of the minimum degree ordering algorithm (context) - George, Liu - 1989
78 A heuristic for reducing fill-in in sparse matrix factorizat.. (context) - Bui, Jones - 1993
74 Modification of the minimum-degree algorithm by multiple eli.. (context) - Liu - 1985
72 Sparse matrices in MATLAB: design and implementation - Gilbert, Moler et al. - 1992
57 A graph-theoretic study of the numerical solution of sparse .. (context) - Rose - 1972
54 The elimination form of the inverse and its application to l.. (context) - Markowitz - 1957
47 METIS: a software package for partitioning unstructured grap.. (context) - Karypis, Kumar - 1998
42 Improving the runtime and quality of nested dissection order.. - Hendrickson, Rothberg - 1998
39 Direct solutions of sparse network equations by optimally or.. (context) - Tinney, Walker - 1967
35 An effective heuristic procedure for partitioning graphs (context) - Kernighan, Lin - 1970
30 Compressed graphs and the minimum degree algorithm (context) - Ashcraft - 1995
30 Robust ordering of sparse matrices using multisection - Ashcraft, Liu - 1998
30 An automatic nested dissection algorithm for irregular finit.. (context) - George, Liu - 1978
29 SPOOLES: an object-oriented sparse matrix library - Ashcraft, Grimes - 1999
26 A graph partitioning algorithm by node separators (context) - Liu - 1989
26 The CHACO user's guide (context) - Hendrickson, Leland - 1994
19 Node selection strategies for bottom-up sparse matrix orderi.. (context) - Rothberg, Eisenstat - 1998
19 The use of linear graphs in Gauss elimination (context) - Parter - 1961
16 the performance of the minimum degree ordering for Gaussian .. (context) - Berman, Schnitger - 1990
15 Using domain decomposition to find graph bisectors - Ashcraft, Liu - 1997
13 The minimum degree ordering with constraints (context) - Liu - 1989
13 A partition improvement algorithm for generalized nested dis.. (context) - Ashcraft, Liu - 1994
13 Complexity bounds for regular finite difference and finite e.. (context) - Hoffman, Martin et al. - 1973
11 Uber Graphen und ihre Anwendung auf Determinantentheorie und.. (context) - Konig - 1916
11 Applications of the Dulmage-Mendelsohn decomposition and net.. - Ashcraft, Liu - 1998
10 Generalized nested dissection: Some recent progress (context) - Ashcraft, Liu - 1994
9 The PARTY partitioning library user guide -- version - Preis, Diekmann - 1996
9 A fast implementation of the minimum degree algorithm using .. (context) - George, Liu - 1980
8 Exploring the tradeoff between imbalance and separator size .. (context) - Rothberg - 1996
7 Sparse solution of finite element equations (context) - Damhaug - 1992
6 Incomplete nested dissection for solving n by n grid problem.. (context) - George, Poole et al. - 1978
5 Robust ordering of sparse matrices: a minimum degree (context) - Rothberg - 1995
4 Effective sparse matrix ordering: just around the BEND - Hendrickson, Rothberg - 1997
2 The generalized element model (context) - Speelpenning - 1978
2 The inexact minimum local fill-in ordering algorithm (context) - Meszaros - 1995
2 Practical extensions of the multisection ordering for sparse.. (context) - Ashcraft, Liu et al. - 1997
Documents on the same site (http://www.uni-paderborn.de/fachbereich/AG/monien/PERSONAL/SCHLUNZ/publications.html): More
A Parallel Algorithm for the Vehicle Routing Problem with.. - Schulze, Fahle (1997) (Correct)
Towards a Tighter Coupling of Bottom-Up and Top-Down Sparse.. - Schulze (2001) (Correct)
Parallel Sparse Cholesky Factorization - Monien, Schulze (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