Abstract
Three algorithms are presented and compared for the solution of the steady Euler equations on unstructured triangular grids. All are variations on Newton's method-one quasi- and two full-Newton schemes-and employ the BILU (n)-preconditioned generalized minimum residual method (GMRES) algorithm to solve the Jacobian matrix problem that arises at each iteration. The quasi-Newton scheme uses a first-order approximation to the Jacobian matrix with the standard GMRES implementation, in which matrix-vector products are formed in the usual explicit manner. The full-Newton schemes are distinguished by the implementation of GMRES: One employs the standard GMRES algorithm, and the other is matrix free using Frechet derivatives. The matrix-free, full-Newton algorithm is shown to be the fastest of the three algorithms. Optimal preconditioning, reordering, and storage strategies for the matrix-free, full-Newton algorithm are presented. Register and cache performance issues are briefly discussed
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.
