Abstract
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 numbers. This algorithm uses O(log2n) parallel time and O(max{M(n),n2(loglogn)/logn}) arithmetic processors if M(n) is the processor complexity of fast parallel matrix multiplication.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
