Residual reduction algorithms for nonsymmetric saddle point problems
β Scribed by Constantin Bacuta; Brendan McCracken; Lu Shu
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 559 KB
- Volume
- 235
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper, we introduce and analyze Uzawa algorithms for non-symmetric saddle point systems. Convergence for the algorithms is established based on new spectral results about Schur complements. A new Uzawa type algorithm with optimal relaxation parameters at each new iteration is introduced and analyzed in a general framework. Numerical results supporting the efficiency of the algorithms are presented for finite element discretization of steady state Navier-Stokes equations.
π SIMILAR VOLUMES
## Abstract A class of constraint preconditioners for solving twoβbyβtwo block linear equations with the (1,2)βblock being the transpose of the (2,1)βblock and the (2,2)βblock being zero was investigated in a recent paper of Cao (__Numer. Math.__ 2006; **103**:47β61). In this short note, we extend
Nonsymmetric saddle point problems arise in a wide variety of applications in computational science and engineering. The aim of this paper is to discuss the numerical behavior of several nonsymmetric iterative methods applied for solving the saddle point systems via the Schur complement reduction or
The subject of this paper is to study the performance of multilevel preconditioning for nonsymmetric elliptic boundary value problems. In particular, a minimal residual method with respect to an appropriately scaled norm, measuring the size of the residual projections on all levels, is studied. This