Fast iterative algorithms based on optimized explicit time stepping (Q1086986)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Fast iterative algorithms based on optimized explicit time stepping
scientific article

    Statements

    Fast iterative algorithms based on optimized explicit time stepping (English)
    0 references
    0 references
    0 references
    1987
    0 references
    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.
    0 references
    convergence acceleration
    0 references
    stabilization of iterative algorithms
    0 references
    generalized nonlinear minimal residual method
    0 references
    optimized explicit multistepping
    0 references
    computational efficiency
    0 references
    convergence rate
    0 references
    computation costs
    0 references
    relaxation
    0 references

    Identifiers