Abstract
This article is concerned with the efficient numerical solution of Fredholm integral equations on a parallel computer with shared or distributed memory. Parallel algorithms for both, the approximation of the discrete operator by hierarchical matrices using adaptive cross approximation (ACA) and the parallel matrix-vector multiplication of such matrices by a vector, are presented. The first algorithm has a complexity of order p -1 N log2d-1 N, while the latter is of order p -1 N log d N, where N, d and p are the number of unknowns, the spatial dimension and the number of processors, respectively. The approximant needs Ω(p -1 N log d N) units of storage on each processor.
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.
