Results 201 to 210 of about 10,389,003 (244)
New Preconditioners for Saddle Point Problems
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael Ng, Zhong-Zhi Bai
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Subgradient Methods for Saddle-Point Problems
Journal of Optimization Theory and Applications, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Angelia Nedic, Asuman E. Ozdaglar
openaire +3 more sources
Block Preconditioners for Saddle Point Problems
Numerical Algorithms, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leigh Little, Yousef Saad
openaire +3 more sources
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
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

