The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Analysis of the Inexact Uzawa Algorithm for Saddle Point Problems
Abstract
In this paper, we consider the so-called "inexact Uzawa" algorithm for iteratively solving linear block saddle point problems. Such saddle point problems arise, for example, in finite element and finite difference discretizations of Stokes equations, the equations of elasticity, and mixed finite element discretization of second-order problems. We consider both the linear and nonlinear variants of the inexact Uzawa iteration. We show that the linear method always converges as long as the preconditioners defining the algorithm are properly scaled. Bounds for the rate of convergence are provided in terms of the rate of convergence for the preconditioned Uzawa algorithm and the reduction factor corresponding to the preconditioner for the upper left-hand block. In the case of nonlinear iteration, the inexact Uzawa algorithm is shown to converge provided that the nonlinear process approximating the inverse of the upper left-hand block is of sufficient accuracy. Bounds for the nonlinear iteration are given in terms of this accuracy parameter and the rate of convergence of the preconditioned linear Uzawa algorithm. Applications to the Stokes equations and mixed finite element discretization of second-order elliptic problems are discussed and, finally, the results of numerical experiments involving the algorithms are presented.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Methods of conjugate gradients for solving linear systems
Hestenes, M. R., & Stiefel, E. (1952) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.049.044 · Cited by 8,132
Mixed and Hybrid Finite Element Methods
(1991) · Springer Series in Computational Mathematics · doi:10.1007/978-1-4612-3172-1 · Cited by 6,390
The finite element method with Lagrangian multipliers
Babuska, I. M. (1973) · Numerische Mathematik · doi:10.1007/bf01436561 · Cited by 1,684
Cited by
Numerical solution of saddle point problems
Benzi, M., Golub, G. H., & Liesen, J. (2005) · Acta Numerica · doi:10.1017/s0962492904000212 · Cited by 2,300
Split Bregman Methods and Frame Based Image Restoration
Cai, J.-F., Osher, S., & Shen, Z. (2010) · Multiscale Modeling & Simulation · doi:10.1137/090753504 · Cited by 670
A Unified Primal-Dual Algorithm Framework Based on Bregman Iteration
Zhang, X., Burger, M., & Osher, S. (2011) · Journal of Scientific Computing · doi:10.1007/s10915-010-9408-8 · Cited by 419
Linear Convergence Rate of a Class of Distributed Augmented Lagrangian Algorithms
Jakovetic, D., Moura, J. M. F., & Xavier, J. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2363299 · Cited by 123
Metadata
- Authors
- Bramble, J. H., Pasciak, J. E., & Vassilev, A. T.
- Venue
- SIAM Journal on Numerical Analysis
- Published
- 1997-06
- Volume
- 34
- Issue
- 3
- Pages
- 1072-1092
- ISSN
- 0036-1429 (ISSN-L)
- 1095-7170
- OpenAlex
- W2004291775
- Cited by
- 406
- References
- 3
- FWCI
- 15.19
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Analysis of the Inexact Uzawa Algorithm for Saddle Point Problems. https://app.cochat.ai/papers/10.1137/s0036142994273343
- The paper
- Bramble, J. H., Pasciak, J. E., & Vassilev, A. T. (1997). Analysis of the Inexact Uzawa Algorithm for Saddle Point Problems. SIAM Journal on Numerical Analysis. https://doi.org/10.1137/s0036142994273343
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.