Abstract
A strongly implicit solver is proposed in the present investigation for solving a large set of algebraic equations that arise from a discretization of an elliptic differential equation. Based on the guessed θNW and θSE values (solutions at the northwest and the southeast corners of a computational cell), the nine-diagonal coefficient matrix is factored in terms of a lower and an upper triangular matrix with only seven nonzero diagonals. The solution procedure then is iterated with a successive overrelaxation (SOR) factor until the solution converges within a prescribed tolerance. In the present solver, there is no need to evaluate the residual for the guessed solution. The CPU time thus is reduced a great amount for a single iteration. In addition, the storage is only one-half as large as that required by the SIP solver because the original matrix is no longer needed after it is factored. The convergence rate of the SIP solver is very sensitive to the cancellation parameter a. The present solver needs no ...
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.
