Jürgen Schulze  Home/Search
Context Related
| unipaderborn.de/f...upling_paper.ps.gz 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 remaining elements in an unfinished bottom-up ordering. As a consequence, we are using bottomup techniques such as quotient... (Update)
Similar documents based on text: More All
0.3: Towards a Tighter Coupling of Bottom-Up and Top-Down Sparse.. - Schulze (2001) (Correct)
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)
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/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/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 - 1999
244 A multilevel algorithm for partitioning graphs - Hendrickson, Leland - 1995
222 A fast multilevel implementation of recursive spectral bisec.. - Barnard, Simon - 1993
126 The role of elimination trees in sparse factorization (context) - Liu - 1990
126 The multifrontal solution of indefinite sparse symmetric lin.. (context) - Duff, Reid - 1983
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
[Article contains additional citations not shown here]
Documents on the same site (http://www.uni-paderborn.de/fachbereich/AG/monien/PERSONAL/SCHLUNZ/publications.html): More
Towards a Tighter Coupling of Bottom-Up and Top-Down Sparse.. - Schulze (2001) (Correct)
A Parallel Algorithm for the Vehicle Routing Problem with.. - Schulze, Fahle (1997) (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