Abstract
The results of a computational evaluation of several Newton's and quasi-Newton's method solvers are discussed and analyzed. Computer time and memory requirements for iterating a solution to the steady state are recorded for each method. Roe's flux-difference splitting together with the Spekreijse/Van Albada continuous limiter is used for the spatial discretization. Sparse matrix inversions are performed using a modified version of the Boeing real sparse library routines and the conjugate gradient squared algorithm. The methods are applied to exact and approximate Newton's method Jacobian systems for flat plate and Mat-plate/wedge-type geometries. Results indicate that the quasi-Newton's method solvers do not exhibit quadratic convergence, but can be more efficient than the exact Newton's method in select cases
Published Version
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.
