Fast iterative algorithms based on optimized explicit time stepping

DOI10.1016/0045-7825(87)90122-8zbMath0609.65037OpenAlexW2025678870MaRDI QIDQ1086986

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

convergence accelerationrelaxationconvergence ratecomputational efficiencycomputation costsgeneralized nonlinear minimal residual methodoptimized explicit multisteppingstabilization 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)

Related Items (4)

Torsional springs for two-dimensional dynamic unstructured fluid meshes ⋮ The ortho-semi-torsional (OST) spring analogy method for 3D mesh moving boundary problems ⋮ Distributed minimal residual (DMR) method for acceleration of iterative algorithms ⋮ Sensitivity-based methods for convergence acceleration of iterative algorithms.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized nonlinear minimal residual (GNLMR) method for iterative algorithms
• 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
• High-Re solutions for incompressible flow using the Navier-Stokes equations and a multigrid method
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems

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