Abstract
A fast algorithm is developed for the parallel numerical solution of the first biharmonic boundary value problem on a rectangular region with N 2 interior grid points. The parallel computer considered is of SIMD type. The iterative procedure where one iteration consists in solving two transformed Poisson equations with relaxation is used. This approach allows one to apply the direct block-elimination method with parallel algorithm for linear recurrence relations efficiently to the evaluation of one iteration. For our algorithm the time per iteration does not exceed 9 log N time units, on N 2 processors. Thus, the technique presented brings a reduction in the arithmetic steps required for the solution of the problem considered.
Sign-in/Register to access full text options 
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.
