| Alternate document: Details Parallel Sparse LU Factorization with Partial Pivoting on Distributed Memory Architectures (97) Cong Fu, Xiangmin Jiao, Tao Yang |
Xiangmin Jiao  Home/Search
Context Related
| ucsb.edu/research/S+...jiao_thesis.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: ucsb.edu/research/S+/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Parallel Sparse Gaussian Elimination with Partial Pivoting and 2-D Data Mapping by Xiangmin Jiao Master of Science in Computer Science University of California at Santa Barbara Professor Tao Yang, Chair Sparse Gaussian elimination with partial pivoting is a fundamental algorithm for many scientific and engineering applications, but it is still an open problem to develop a time and space efficient algorithm on distributed memory machines. In this thesis, we present an asynchronous... (Update)
Context of citations to this paper: More
.... only differ by a small number of entries and it can be performed in a very efficient manner which only has a time complexity of O(n) [27]. We can control the maximum allowed differences by an amalgamation factor r. Our experiments show that when r is in the range of 4 Gamma 6,...
...and the space is allocated for all the possible nonzero entries. Using an efficient implementation of the symbolic factorization algorithm [13], this preprocessing step can be very fast. For example, it costs less than one second for most of our tested matrices, at worst it...
Cited by: More
S+: Efficient 2D Sparse LU Factorization on Parallel Machines - Shen, Yang, Jiao (Correct)
Efficient Sparse Gaussian Elimination with Lazy Space Allocation - Jiang (1999) (Correct)
Elimination Forest Guided 2D Sparse LU Factorization - Shen, Jiao, Yang (1998) (Correct)
Similar documents (at the sentence level):
19.0%: Parallel Sparse LU Factorization with Partial Pivoting on.. - Fu, Jiao, Yang (1997) (Correct)
18.8%: Efficient Sparse LU Factorization with Partial Pivoting on.. - Fu, Jiao, Yang (1998) (Correct)
Active bibliography (related documents): More All
1.0: Sparse LU Factorization with Partial Pivoting on Distributed.. - Fu, Yang (1996) (Correct)
0.6: Sparse Gaussian Elimination on High Performance Computers - Li (1996) (Correct)
0.5: A Comparison of 1-D and 2-D Data Mapping for Sparse LU.. - Fu, Jiao, Yang (Correct)
Similar documents based on text: More All
0.4: A New Scheduling Algorithm for Parallel Sparse LU Factorization .. - Grigori, Li (2002) (Correct)
0.3: Mesh Association: Formulation and Algorithms - Jiao, Edelsbrunner, Heath (1999) (Correct)
0.3: Stability of the Diagonal Pivoting Method with Partial Pivoting - Higham (1995) (Correct)
Related documents from co-citation: More All
5: An Extended Set of Basic Linear Algebra Subroutines (context) - Dongarra, Croz et al. - 1988
5: A supernodal approach to sparse partial pivoting - Demmel, Eisenstat et al. - 1995
5: On Algorithms for Obtaining a Maximum Transversal (context) - Duff - 1981
BibTeX entry: (Update)
X. Jiao. Parallel sparse gaussian elimination with partial pivoting and 2-d data mapping. Master's thesis, Dept. of Computer Science, University of California at Santa Barbara, August 1997. http://citeseer.ist.psu.edu/jiao97parallel.html More
@misc{ jiao97parallel,
author = "X. Jiao",
title = "Parallel sparse gaussian elimination with partial pivoting and 2-d data
mapping",
text = "X. Jiao. Parallel sparse gaussian elimination with partial pivoting and
2-d data mapping. Master's thesis, Dept. of Computer Science, University
of California at Santa Barbara, August 1997.",
year = "1997",
url = "citeseer.ist.psu.edu/jiao97parallel.html" }
Citations (may not include all citations):346 Computer Solution of Large Sparse Positive Definite Systems (context) - George, Liu - 1981
322 Direct Methods for Sparse Matrices (context) - Duff, Erisman et al. - 1986
94 Parallel Algorithms for Sparse Linear Systems (context) - Heath, Ng et al. - 1991
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
79 PYRROS: Static Task Scheduling and Code Generation for Messa.. - Yang, Gerasoulis - 1992
75 A Supernodal Approach to Sparse Partial Pivoting - Demmel, Eisenstat et al. - 1995
72 Sparse Matrices in Matlab: Design and Implementation - Gilbert, Moler et al. - 1992
68 the Granularity and Clustering of Directed Acyclic Task Grap.. - Gerasoulis, Yang - 1993
63 An Unsymmetric-Pattern Multifrontal Method for Sparse LU Fac.. - Davis, Duff - 1997
58 Synchronization and Communication TE Multiproces - Synchronization, the et al. - 1996
57 Highly Scalable Parallel Algorithms for Sparse Matrix Factor.. - Gupta, Kumar - 1994
52 Scientific Computing: An Introduction with Parallel Computin.. (context) - Golub, Ortega - 1993
40 Improved Load Distribution in Parallel Sparse Cholesky Facto.. - Rothberg, Schreiber - 1994
34 Cray TE Network Adaptive Routing High Performance D Toru (context) - Thorson, Network et al. - 1996
30 Symbolic Factorization for Sparse Gaussian Elimination with .. (context) - George, Ng - 1987
30 The Influence of Relaxed Supernode Partitions on the Multifr.. (context) - Ashcraft, Grimes - 1989
29 On Algorithms for Obtaining a Maximum Transversal (context) - Duff - 1981
29 Exploiting the Memory Hierarchy in Sequential and Parallel S.. (context) - Rothberg - 1992
25 Decoupling Synchronization and Data Transfer in Message Pass.. - Stricker, Stichnoth et al. - 1995
22 Computational Models and Task Scheduling for Parallel Sparse.. (context) - Liu - 1986
19 Run-time Compilation for Parallel Sparse Matrix Computations - Fu, Yang - 1996
16 Parallel Sparse Gaussian Elimination with Partial Pivoting (context) - George, Ng - 1990
14 An Extended Set of Basic Linear Algebra Subroutines (context) - Dongarra, Croz et al. - 1988
14 Sparse LU Factorization with Partial Pivoting on Distributed.. - Fu, Yang - 1996
12 PWS Publishing Company (context) - Burden, Faires et al. - 1993
12 Progress in Sparse Matrix Methods for Large Sparse Linear Sy.. (context) - Ashcraft, Grimes et al. - 1987
10 Numerical Linear Algebra on Parallel Processors (context) - Demmel - 1995
9 The Parallel Solution of Nonsymmetric Sparse Linear Systems .. - Gallivan, Marsolf et al. - 1994
9 A Parallel Unsymmetric-pattern Multifrontal Method - Hadfield, Davis - 1994
8 Efficient Run-time Support for Irregular Task Computations w.. - Fu, Yang - 1996
8 Parallel Sparse Orthogonal Factorization on Distributed-Memo.. (context) - Sun - 1996
7 Approximate Minimum Degree Ordering for Unsymmetric Matrices (context) - Davis, Gilbert et al. - 1996
7 the Efficient Solution of Sparse Systems of Linear and Nonli.. (context) - Sherman - 1975
4 Data Mapping for Sparse LU Factorization with Partial Pivoti.. (context) - Fu, Jiao et al. - 1997
2 Parallel Sparse LU Factorization with Partial Pivoting on Di.. - Fu, Jiao et al. - 1997
Documents on the same site (http://www.cs.ucsb.edu/research/S+/):
Elimination Forest Guided 2D Sparse LU Factorization - Shen, Jiao, Yang (1998) (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