Abstract
The employment of finite element or finite difference discretization schemes, for the numerical solution of Boundary Value Problems (BVPs) with periodic type Boundary Conditions (BCs), leads to a large and sparse linear system whose coefficient matrix is in normal p-cyclic form. The use of block iterative methods, for the solution of such linear systems, and the demand for fast convergence rates, require the optimal repartitioning of the coefficient matrix. In this work, we make use of the finite element Hermite collocation method to discretize the BVP and the SOR iterative method to solve the corresponding sparse linear system. The optimal repartitioning of the collocation coefficient matrix leads to SOR methods with optimal rates of convergence.
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.
