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

From MaRDI portal





scientific article; zbMATH DE number 146826
Language Label Description Also known as
default for all languages
No label defined
    English
    Distributed minimal residual (DMR) method for acceleration of iterative algorithms
    scientific article; zbMATH DE number 146826

      Statements

      Distributed minimal residual (DMR) method for acceleration of iterative algorithms (English)
      0 references
      0 references
      0 references
      1 April 1993
      0 references
      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.
      0 references
      explicit four stage Runge-Kutta method
      0 references
      convergence rate
      0 references
      general Krylov subspace methods
      0 references
      incomplete Newton iteration method
      0 references
      Euler equations
      0 references
      incompressible Navier-Stokes equations
      0 references
      Euler implicit time integration
      0 references

      Identifiers