Fast iterative algorithms based on optimized explicit time stepping

DOI10.1016/0045-7825(87)90122-8MaRDI QIDQ1086986zbMATH OpenOpenAlexFDO

Authors Chung-Yuan Huang, George S. Dulikravich

Publication date 1987

Published in Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0045-7825(87)90122-8

zbMATH Keywords

computation costscomputational efficiencyconvergence accelerationconvergence rategeneralized nonlinear minimal residual methodoptimized explicit multisteppingrelaxationstabilization of iterative algorithms

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Review text

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 negligibly weighed down by the computation costs due to the requirements for additional computer storage.

Recommendations

• scientific article; zbMATH DE number 3919660
• Generalized nonlinear minimal residual (GNLMR) method for iterative algorithms
• scientific article; zbMATH DE number 3854341
• Convergence acceleration of iterative algorithms. Applications to thin shell analysis and Navier-Stokes equations
• Publication:4863026

Cites work

• Generalized nonlinear minimal residual (GNLMR) method for iterative algorithms
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• High-Re solutions for incompressible flow using the Navier-Stokes equations and a multigrid method
• scientific article; zbMATH DE number 3649937 (Why is no real title available?)
• scientific article; zbMATH DE number 3854341 (Why is no real title available?)
• scientific article; zbMATH DE number 3936378 (Why is no real title available?)
• Optimum acceleration factors for iterative solution of linear and nonlinear differential systems
• Stream function and stream-function-coordinate (SFC) formulation for inviscid flow field calculations

Cited in

(9)

• Distributed minimal residual (DMR) method for acceleration of iterative algorithms
• Sensitivity-based methods for convergence acceleration of iterative algorithms.
• New efficient substepping methods for exponential timestepping
• Going forth and back in time: a fast and parsimonious algorithm for mixed initial/final-value problems
• Torsional springs for two-dimensional dynamic unstructured fluid meshes
• The ortho-semi-torsional (OST) spring analogy method for 3D mesh moving boundary problems
• Algorithm stabilization and acceleration in computational fluid dynamics: exploiting recursive properties of fixed point algorithms
• Super-time-stepping acceleration of explicit schemes for parabolic problems
• Generalized nonlinear minimal residual (GNLMR) method for iterative algorithms

This page was built for publication: Fast iterative algorithms based on optimized explicit time stepping

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086986)