Abstract
The paper presents a parallel scalable VLSI algorithms for solving the Dirichlet boundary value problem and the first biharmonic boundary value problem on a rectangle. The complexity parameters occurring in the VLSI model (area-A and time-T) are evaluated in dependence on the problem size n (the number of grid points in one direction) and the VLSI array size p (the number of processing cells in one direction). The algorithms presented have scalable properties, i.e. their designs are not limited to a fixed size of the problem but can be used to solve problems on n × n grid where (n − 1) = k(p − 1) for a chosen integerk≥1
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.
