Comparison of performance of iterative methods for singular and nonsingular saddle point linear systems arising from Navier--Stokes equations
DOI10.1016/j.amc.2005.04.109zbMath1089.65024OpenAlexW2028183310MaRDI QIDQ2490235
Publication date: 28 April 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2005.04.109
convergenceNavier-Stokes equationsnumerical examplesGMRESKrylov subspace methodIterative methodsOseen equation
Finite difference methods applied to problems in fluid mechanics (76M20) Stokes and related (Oseen, etc.) flows (76D07) Iterative numerical methods for linear systems (65F10)
Related Items (13)
Cites Work
- Performance and analysis of saddle point preconditioners for the discrete steady-state Navier-Stokes equations
- The Idea behind Krylov Methods
- GMRES On (Nearly) Singular Systems
- Numerical Calculation of Time-Dependent Viscous Incompressible Flow of Fluid with Free Surface
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- How Fast are Nonsymmetric Matrix Iterations?
- Preconditioning for the Steady-State Navier--Stokes Equations with Low Viscosity
- Iterative Krylov Methods for Large Linear Systems
- Fast Nonsymmetric Iterations and Preconditioning for Navier–Stokes Equations
- Efficient preconditioning of the linearized Navier-Stokes equations for incompressible flow
- Unnamed Item
This page was built for publication: Comparison of performance of iterative methods for singular and nonsingular saddle point linear systems arising from Navier--Stokes equations