Fast iterative algorithms based on optimized explicit time stepping Article

Huang, CY, Dulikravich, GS. (1987). Fast iterative algorithms based on optimized explicit time stepping . COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 63(1), 15-36. 10.1016/0045-7825(87)90122-8

cited authors

  • Huang, CY; Dulikravich, GS

authors

abstract

  • The Generalized Nonlinear Minimal Residual (GNLMR) method is shown to consistently accelerate and stabilize iterative algorithms for solving nonlinear problems by using the optimized explicit multistepping. The examples presented in this paper illustrate the beneficial effects of the optimized multistep algorithm on the computational efficiency and the convergence rate as applied to several nonlinear problems in fluid dynamics. The significant reduction in computing time when using the multiple optimized acceleration factors is only negligibly weighed down by the computation costs due to the requirements for additional computer storage. © 1987.

publication date

  • January 1, 1987

published in

Digital Object Identifier (DOI)

start page

  • 15

end page

  • 36

volume

  • 63

issue

  • 1