Results 251 to 260 of about 11,169,711 (292)
Two Preconditioners for Saddle Point Problems in Fluid Flows [PDF]
In this paper two preconditioners for the saddle point problem are analysed: one based on the augmented Lagrangian approach and another involving artificial compressibility.
F W Wubs
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A Class of Smoothers for Saddle Point Problems
Computing, 2000The finite element multigrid method for saddle point problems is considered. Approximation and smoothing properties are established. Numerical results for the Stokes problem are given.
openaire +2 more sources
Parallel Preconditioners for Saddle-Point Problems
Civil-Comp Proceedings, 2011Constraint preconditioners have proved very efficient for the solution of ill-conditioned saddle point problems in a sequential computing environment. Their implementation on parallel computers, however, is not straightforward because of their inherent sequentiality. The present paper describes a novel parallel inexact constraint preconditioner (ParICP)
FERRONATO, MASSIMILIANO +2 more
openaire +1 more source
2020
This chapter is devoted to the solution of saddle point problems that can be written in the abstract form $$\displaystyle \begin {cases} Au+B^{T}\lambda =F\\ Bu=G \end {cases} $$ for some linear operators A and B, λ having the role of a Lagrangian multiplier associated to the constraint Bu = G.
openaire +1 more source
This chapter is devoted to the solution of saddle point problems that can be written in the abstract form $$\displaystyle \begin {cases} Au+B^{T}\lambda =F\\ Bu=G \end {cases} $$ for some linear operators A and B, λ having the role of a Lagrangian multiplier associated to the constraint Bu = G.
openaire +1 more source
On the iterative algorithm for saddle point problems
Applied Mathematics and Computation, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
2016
Standard numerical methods fail to provide accurate approximations when partial differential equations involve constraints defined by a differential operator or when they contain terms weighted by a larger parameter. Generalizations of the Lax–Milgram and Cea lemmas provide a concise framework for the development and analysis of appropriate numerical ...
openaire +1 more source
Standard numerical methods fail to provide accurate approximations when partial differential equations involve constraints defined by a differential operator or when they contain terms weighted by a larger parameter. Generalizations of the Lax–Milgram and Cea lemmas provide a concise framework for the development and analysis of appropriate numerical ...
openaire +1 more source
On Schwarz-type Smoothers for Saddle Point Problems
Numerische Mathematik, 2003The authors analyze the smoothing property of symmetric inexact Uzawa methods as part of a multigrid method for solving symmetric saddle point problems. Additive Schwarz-type iterations are contained as a special case. As an example the theoretical results are applied to the Crouzeix-Raviart mixed finite element method for the Stokes equation ...
Joachim Schöberl, Walter Zulehner
openaire +2 more sources
Robust Preconditioners for Saddle Point Problems
2003We survey preconditioning methods for matrices on saddle point form, as typically arising in constrained optimization problems. Special consideration is given to indefinite matrix preconditioners and a preconditioner which results in a symmetric positive definite matrix, which latter may enable the use of the standard conjugate gradient (CG) method ...
Owe Axelsson, Maya G. Neytcheva
openaire +1 more source
An Interior-Point Method for a Class of Saddle-Point Problems
Journal of Optimization Theory and Applications, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Halldórsson, B. V., Tütüncü, R. H.
openaire +1 more source
Modifications in Optimization and Saddle Point Problems
SIAM Journal on Control and Optimization, 1979A general optimization problem of finding ${\operatorname{Inf}}\{ f(x)\mid x \in A\} $ is modified with a sequence of functions $(H_n )$, $n \in \mathbb{N}$ to yield the problems ${\operatorname{Inf}}\{ f(x) + H_n (x)\mid x \in A\} $. The properties of convergence are studied in two general classes of modifications, These results are applied to modify ...
openaire +2 more sources

