A globally convergent matrix-free algorithm for implicit time-marching schemes arising in finite element analysis in fluids

100Citations
Citations of this article
34Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A solution procedure for solving nonlinear time-marching problems is presented. The nonsymmetric systems of equations arising from a Newton-type linearization of these time-marching problems are solved using an iterative strategy based on the generalized minimal residual (GMRES) algorithm. Matrix-free techniques leading to reduction in storage are presented. Incorporation of a linesearch algorithm in the Newton-GMRES scheme is discussed. An automatic time-increment control strategy is developed to increase the stability of the time-marching process. High-speed flow computations demonstrate the effectiveness of these algorithms. © 1991.

Cite

CITATION STYLE

APA

Johan, Z., & Hughes, T. J. R. (1991). A globally convergent matrix-free algorithm for implicit time-marching schemes arising in finite element analysis in fluids. Computer Methods in Applied Mechanics and Engineering, 87(2–3), 281–304. https://doi.org/10.1016/0045-7825(91)90009-U

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free