See this document in CiteSeerX!

Fast and Efficient Parallel Solution of Dense Linear Systems (1989)  (Make Corrections)  (5 citations)
V. Pan, J. Reif
Journal of Computer and System Sciences



  Home/Search   Context   Related

 
View or download:
duke.edu/~reif/paper/pan/dense.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  duke.edu/~reif/vita/vita (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: The most efficient previously known parallel algorithms for the inversion of a nonsingular n x n matrix .4 or solving a linear system/Ix = b over the rational numbers require O(logn) time and M(n).x/ processors [provided that M(n) processors suffice in order to multiply two n x n rational matrices in time O(log n)]. Furthermore, the known polylog arithmetic time algorithms for those problems are numerically unstable. In this paper we apply Newton's iteration and initially choose an... (Update)

Context of citations to this paper:   More

.... 0) Numerical approximation is involved in this algorithm at the auxiliary stages of matrix inversions, where a parallel algorithm of [PR89] is applied. If A is filled with integers, then this stage can be performed exactly, by using the algorithms of [P85] P87] Then, the...

.... by Reif [29] and by Bini and Pan [1] page 357) Gaussian elimination with no pivoting [2] and Newton s iterative method [24, 25, 27] This selection covers a wide spectrum of features, and is (in some sense) a complete one . Csanky s algorithm, the easiest to describe...

Cited by:   More
Efficient Parallel Algorithms for Optical Computing - With The Discrete   (Correct)
The Role of Arithmetic in Fast Parallel Matrix Inversion - Codenotti, Leoncini.. (1998)   (Correct)
A Parallel Algorithm For Distributed Minimum Variance.. - Garcia (1999)   (Correct)

Active bibliography (related documents):   More   All
1.7:   Efficient Parallel Factorization and Solution of Structured and.. - Reif (2000)   (Correct)
0.5:   Division-Free Algorithms for the Determinant and the Pfaffian.. - Rote (2001)   (Correct)
0.4:   Parallel Matrix Multiplication on a Linear Array with a.. - Li, Pan (1997)   (Correct)

Similar documents based on text:   More   All
0.4:   The Bit-Complexity Of Discrete Solutions Of Partial Differential .. - Pan, Reif (1990)   (Correct)
0.3:   Fast And Efficient Parallel Solution Of Sparse Linear Systems - Pan, Reif (1993)   (Correct)
0.2:   3x+1 Search Programs - Leavens, Vermeulen (1992)   (Correct)

Related documents from co-citation:   More   All
6:   Processor-efficient parallel solution of linear systems over an abstract field (context) - Kaltofen, Pan - 1991
3:   The parallel computation of minimum cost paths in graphs by stream contraction (context) - Pan, Reif - 1991
3:   Fast and Efficient Parallel Algorithms for the Exact Inversion of Integer Matric.. (context) - Pan - 1985

BibTeX entry:   (Update)

V. Y. Pan, J. Reif, Fast and Efficient Parallel Solution of Dense Linear Systems, Compuaters & Mathematics (with Applications), 17, 11, 1481-1491, 1989. http://citeseer.ist.psu.edu/pan89fast.html   More

@article{ pan89fast,
    author = "Victor Y. Pan and John H. Reif",
    title = "Fast and Efficient Solution of Path Algebra Problems",
    journal = "Journal of Computer and System Sciences",
    volume = "38",
    number = "3",
    pages = "494-510",
    year = "1989",
    url = "citeseer.ist.psu.edu/pan89fast.html" }
Citations (may not include all citations):
624   The Algebraic Eigenvalue Problem (context) - Wilkinson - 1965
372   Matrix Iterative Analysis (context) - Varga - 1962
308   Matrix multiplication via arithmetic progressions (context) - Coppersmith, Winegrad - 1987
218   Iterative Solution of Large Linear Systems (context) - Young - 1971
124   Applied Iterative Methods (context) - Hageman, Young - 1981
120   An Introduction to Numerical Analysis (context) - Atkinson - 1978
106   Matching is as easy as matrix inversion (context) - Mulmuley, Vazirani et al. - 1987
82   Analysis of Numerical Methods (context) - Isaacson, Keller - 1966
65   The Computational Complexity of Algebraic and Numeric Proble.. (context) - Borodin, Munro - 1975
60   On computing the determinant in small parallel time using a .. (context) - Berkowitz - 1984
54   Fast parallel matrix and GCD computation (context) - Borodin, Oathn et al. - 1982
47   Fast parallel matrix inversion algorithm (context) - Csanky - 1976
46   Error analysis of direct methods of matrix inversion (context) - Wilkinson - 1961
42   Fast parallel computation of polynomials using few processor.. (context) - Valiant, Skyurn et al. - 1983
29   Efficient parallel solution of linear systems (context) - Pan, Reif - 1985
19   Complexity of parallel matrix computations (context) - Pan - 1987
17   How to Multiply Matrices Faster (context) - Pan - 1984
11   An improved Newton iteration for the generalized inverse of .. (context) - Pan, Schreiber - 1988
11   Parallel algorithms for algebraic problems (context) - zur - 1984
10   Johns Hopkins University Press (context) - olub, van Loan et al. - 1983
9   Parallel evaluation of the determinant and of the inverse of.. (context) - alii, Pan
9   An improved parallel processor bound in fast matrix inversio.. (context) - Prepsrata, Sarwate - 1978
9   Matrix Calculus (context) - Bodewig - 1959
7   Improved processor bounds for combinatorial problems in RNC (context) - Galil, Pan - 1988
6   Some new methods in matrix calculation (context) - Hotelling - 1943
4   Fast and efficient parallel algorithms for the exact inversi.. (context) - Pan - 1985
3   Maximal parallelism in matrix multiplication (context) - Chandra - 1976
2   A note on iterative method for generalized inversion of matr.. (context) - Ben-Israel - 1966
2   Further points on matrix calculations and simultaneous equat.. (context) - HotelLing - 1943
2   On iterative computation of generalized inverses and associa.. (context) - Ben-Israel, Cohen - 1966
2   Vermeidung yon Divisionen (context) - Strassen - 1973
1   Fast and efficient algorithms for linear programming and for.. (context) - Pan, Reif - 1986
1   Complexity of solving linear systems in different models ofc.. (context) - Bo - 1984
1   Matrix computation (context) - Newman - 1982
1   The Teory of Matrices in Numerical Analysis (context) - Householder - 1964
1   Fast and efficient parallel inversion of Toeplitz and block .. (context) - Pan - 1988
1   Computing generalized inverses and eigenvalues of symmetric .. (context) - Schreiber - 1984
1   Connectivity algorithms using rubber-bands (context) - Lov - 1986
1   On numerical properties of an iterative method for computing.. (context) - S', Stuart - 1974
1   A hyperpower iterative method for computing matrix products .. (context) - arnett, Ben-Israel et al. - 1971

Documents on the same site (http://www.cs.duke.edu/~reif/vita/vita.html):   More
Efficient Parallel Algorithms for Optical Computing with the.. - Reif, Tyagi (1990)   (Correct)
Continuous Alternation: The Complexity of Pursuit in Continuous .. - Reif, Tate (1993)   (Correct)
Energy Complexity of Optical Computations - Tyagi, Reif (1990)   (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