M. Leoncini  Home/Search
Context Related
| imc.pi.cnr.it/tr/ps/9418.ps.gz Cached: 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.
PS.gz PS Image Update HelpFrom: imc.pi.cnr.it/tr (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Consider the Gaussian Elimination algorithm with the well-known Partial Pivoting strategy for improving numerical stability (GEPP). Vavasis proved that the problem of determining the pivot sequence used by GEPP is log space-complete for P, and thus inherently sequential. Assuming P 6= NC, we prove here that either the latter problem cannot be solved in parallel time O(N 1=2\Gammaffl ) or all the problems in P admit polynomial speedup. Here N is the order of the input matrix and ffl is any... (Update)
Similar documents based on text: More All
0.4: On the Parallel Complexity of Gaussian Elimination with Pivoting - Leoncini (1994) (Correct)
0.3: Stability of Block LDL^T Factorization of a Symmetric Tridiagonal .. - Higham (1998) (Correct)
0.3: How Accurate is Gaussian Elimination? - Higham (1990) (Correct)
Related documents from co-citation: More All
2: Processor-efficient parallel solution of linear systems over an abstract field (context) - Kaltofen, Pan - 1991
BibTeX entry: (Update)
Leoncini, M., On the Parallel Complexity of Gaussian Elimination with Pivoting, Journal of Computer and System Sciences 53 (1996), 380--394. http://citeseer.ist.psu.edu/article/leoncini96parallel.html More
@article{ leoncini96parallel,
author = "Mauro Leoncini",
title = "On the Parallel Complexity of Gaussian Elimination with Pivoting",
journal = "Journal of Computer and System Sciences",
volume = "53",
number = "3",
pages = "380-394",
year = "1996",
url = "citeseer.ist.psu.edu/article/leoncini96parallel.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
744 Matrix Computations (context) - Golub, Van Loan - 1989
287 Mathematica. A System for Doing Mathematics by Computer (context) - Wolfram - 1988
268 Parallel Algorithms for Shared-Memory Machines (context) - Karp, Ramachandran - 1990
211 Lapack User's Guide (context) - Anderson - 1992
168 A taxonomy of problems with fast parallel algorithms (context) - Cook - 1985
70 A complexity theory of efficient parallel algorithms (context) - Kruskal, Rudolph et al. - 1990
47 Fast parallel matrix inversion algorithms (context) - Csanky - 1976
42 Time Bounded Random Access Machines (context) - Cook, Reckhow - 1973
21 New classes for parallel complexity: a study of unification .. (context) - Vitter, Simons - 1986
18 Parallel Linear Algebra (context) - Gathen - 1993
10 Gaussian Elimination with Pivoting is P-complete (context) - Vavasis - 1989
7 A Theory of Strict P-completeness - Condon - 1992
7 Machine Models and Simulations (context) - Boas - 1990
5 Indirect Addressing and the Time Relationships of Some Model.. (context) - Dymond - 1979
5 Fast parallel matrix and GCD computations (context) - Borodin, Gathen et al. - 1982
5 Parallel Complexity of Linear System Solution (context) - Codenotti, Leoncini - 1991
5 Trading off parallelism and numerical accuracy (context) - Demmel - 1992
4 Lower bounds for solving linear Diophantine equations on Ran.. (context) - auf - 1985
2 personal communication (context) - Condon
2 Normalizing and Accelerating RAM Computations and the Proble.. (context) - Wiedermann - 1990
2 Matlab Primer (context) - Sigmon - 1994
2 personal communication through E-mail (context) - Dymond
Documents on the same site (http://www.imc.pi.cnr.it/tr.html): More
Chaos in Mathematics, Physics, and Computer Science.. - Codenotti, Margara (1995) (Correct)
Unknown - (Correct)
On Speed versus Accuracy: Some Case Studies - Leoncini (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