Fast and efficient parallel solution of dense linear systems
نویسندگان
چکیده
منابع مشابه
Fast and Efficient Parallel Solution of Dense Linear Systems
The most efficient previously known parallel algorithms for the inversion ofa nonsingular n x n matrix A or solving a linear system Ax = b over the rational numbers require O(log2n) time and M(n).~ processors [provided that M(n) processors suffice in order to multiply two n × n rational matrices in time O (log n)]. Furthermore, the known polylog arithmetic time algorithms for those problems are...
متن کاملFast and Efficient Parallel Solution of Sparse Linear Systems
This paper presents a parallel algorithm for the solution of a linear system Ax = b with a sparse n n symmetric positive deenite matrix A, associated with the graph G(A) that has n vertices and has an edge for each nonzero entry of A. If G(A) has an s(n)-separator family and a known s(n)-separator tree, then the algorithm requires only O(log 3 n) time and (jEj+M(s(n)))= log n processors for the...
متن کاملProcessor Efficient Parallel Solution of Linear Systems of Equations
We present a deterministic parallel algorithm that solves a n-dimensional system Ax b of linear equations over an ordered field or over a subfield of the complex Ž 2 . Ž Ž . 2 numbers. This algorithm uses O log n parallel time and O max M n , n Ž . 4. Ž . log log n log n arithmetic processors if M n is the processor complexity of fast parallel matrix multiplication. 2000 Academic Press
متن کاملThe Efficient Parallel Iterative Solution of Large Sparse Linear Systems
The development of eecient, general-purpose software for the iterative solution of sparse linear systems on a parallel MIMD computer requires an interesting combination of expertise. Parallel graph heuristics, convergence analysis, and basic linear algebra implementation issues must all be considered. In this paper, we discuss how we have incorporated recent results in these areas into a genera...
متن کاملIterative Solution of Dense Linear Systems
Integral equation methods have been used with great success in electromagnetic scattering calculations and in other problems involving unbounded computational domains. Their application is in many cases limited by the storage requirements of dense matrices and also by the rapidly increasing computational time. However, the use of iterative solvers and special methods for computing the matrix-ve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1989
ISSN: 0898-1221
DOI: 10.1016/0898-1221(89)90081-3