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

DOI10.1016/0045-7825(91)90129-TzbMATH Open0761.76056OpenAlexW2086784165MaRDI QIDQ1205083FDOQ1205083

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 equationsincompressible Navier-Stokes equationsEuler implicit time integrationexplicit four stage Runge-Kutta methodgeneral Krylov subspace methodsincomplete Newton iteration method

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

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

   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 👍 👎

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)