Processor Efficient Parallel Solution of Linear Systems of Equations
Copyright policy )Processor Efficient Parallel Solution of Linear Systems of Equations
Summary: We present a deterministic parallel algorithm that solves an \(n\)-dimensional system \(Ax= b\) of linear equations over an ordered field or over a subfield of the complex numbers. This algorithm uses \(O(\log^2 n)\) parallel time and \(O(\max\{M(n), n^2(\log\log n)/\log n\})\) arithmetic processors if \(M(n)\) is the processor complexity of fast parallel matrix multiplication.
Complexity classes (hierarchies, relations among complexity classes, etc.), General topics in the theory of software, linear system solution, processor-efficient algorithm, Toeplitz matrix, fast parallel algorithm, Krylov subspace
Complexity classes (hierarchies, relations among complexity classes, etc.), General topics in the theory of software, linear system solution, processor-efficient algorithm, Toeplitz matrix, fast parallel algorithm, Krylov subspace
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!