Distributed minimal residual (DMR) method for acceleration of iterative algorithms

DOI10.1016/0045-7825(91)90129-TMaRDI QIDQ1205083zbMATH OpenOpenAlexFDO

Authors Seungsoo Lee, George S. Dulikravich

Publication date 1 April 1993

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(91)90129-t

zbMATH Keywords

convergence rateEuler equationsEuler implicit time integrationexplicit four stage Runge-Kutta methodgeneral Krylov subspace methodsincomplete Newton iteration methodincompressible Navier-Stokes equations

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Finite difference methods applied to problems in fluid mechanics (76M20)

Review text

A new method for enhancing the convergence rate of iterative schemes for the numerical integration of systems of partial differential equations has been developed. It is termed the distributed minimal residual (DMR) method, and is based on general Krylov subspace methods. The DMR method differs from the Krylov subspace methods by the fact that the iterative acceleration factors are different from equation to equation in the system. At the same time, the DMR method can be viewed as an incomplete Newton iteration method. The DMR method has been applied to Euler equations of gasdynamics and incompressible Navier-Stokes equations. All numerical test cases were obtained using either explicit four stage Runge-Kutta or Euler implicit time integration.

Recommendations

• Minimal residual based iterative methods and its parallel implementation for sparse linear systems
• Multigrid with inexact minimal residual smoothing acceleration
• Distributed iteratively reweighted least squares and applications
• Iterative residual-based vector methods to accelerate fixed point iterations
• Generalized nonlinear minimal residual (GNLMR) method for iterative algorithms
• Accelerating the EMML algorithm and related iterative algorithms by rescaled block-iterative methods
• Accelerated residual methods for the iterative solution of systems of equations
• Analysis of acceleration strategies for restarted minimal residual methods
• Fast Distributed Gradient Methods
• Accelerated alternating descent methods for Dykstra-like problems

Cites work

• A numerical method for solving incompressible viscous flow problems
• A three-dimensional incompressible Navier-Stokes flow solver using primitive variables
• Application of time-iterative schemes to incompressible flow
• Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
• Distributed minimal residual (DMR) method for acceleration of iterative algorithms
• Euler equations - Implicit schemes and boundary conditions
• Fast iterative algorithms based on optimized explicit time stepping
• Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
• Generalized nonlinear minimal residual (GNLMR) method for iterative algorithms
• scientific article; zbMATH DE number 4012120 (Why is no real title available?)
• scientific article; zbMATH DE number 3181418 (Why is no real title available?)
• Implicit Finite-Difference Procedures for the Computation of Vortex Wakes
• Optimum acceleration factors for iterative solution of linear and nonlinear differential systems
• Preconditioned methods for solving the incompressible and low speed compressible equations
• Stability analysis of numerical boundary conditions and implicit difference approximations for hyperbolic equations

Cited in

(3)

• Distributed minimal residual (DMR) method for acceleration of iterative algorithms
• Quantitative performance analysis of the improved quasi-minimal residual method on massively distributed memory computers.
• Sensitivity-based methods for convergence acceleration of iterative algorithms.

This page was built for publication: Distributed minimal residual (DMR) method for acceleration of iterative algorithms

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