Results 261 to 270 of about 51,215 (304)
Some of the next articles are maybe not open access.
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 +1 more source
Block Preconditioners for Saddle Point Problems
Numerical Algorithms, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leigh Little, Yousef Saad
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
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
1988
For reasonable shapes {α} described by a set of dimensionless deformation parameters the liquid drop deformation energy BDef exhibits a barrier for each value of the fissility x, cf. Eq. (1.75), for instance the configuration of two tangent spheres for x = 0 and a single sphere for x = 1. The deformation energy at the saddle deformation {\( \hat \alpha
Rainer W. Hasse, William D. Myers
openaire +1 more source
For reasonable shapes {α} described by a set of dimensionless deformation parameters the liquid drop deformation energy BDef exhibits a barrier for each value of the fissility x, cf. Eq. (1.75), for instance the configuration of two tangent spheres for x = 0 and a single sphere for x = 1. The deformation energy at the saddle deformation {\( \hat \alpha
Rainer W. Hasse, William D. Myers
openaire +1 more source
1991
The theorems in [7] dealing with classes 1A, 2A and 2B do not depend on the strategy sets being disjoint, and include all Silverman games where at least one player has an optimal pure strategy, except the symmetric 1 by 1 case: THEOREM 2.1. In the symmetric Silverman game (S,T,ν), suppose that there is an element c in S such that c < Tci for all ...
Gerald A. Heuer +1 more
openaire +1 more source
The theorems in [7] dealing with classes 1A, 2A and 2B do not depend on the strategy sets being disjoint, and include all Silverman games where at least one player has an optimal pure strategy, except the symmetric 1 by 1 case: THEOREM 2.1. In the symmetric Silverman game (S,T,ν), suppose that there is an element c in S such that c < Tci for all ...
Gerald A. Heuer +1 more
openaire +1 more source
Note on ε-saddle point and saddle point theorems
Acta Mathematica Hungarica, 1994K. -K. Tan, J. Yu, X. -Z. Yuan
openaire +1 more source
International Journal of Game Theory, 1991
This paper considers three classes of matrices in terms of the existence ofsaddle points. The classes are described by conditions which are very closely related to the property ofquasi-concavity-convexity of functions of two variables. For the matrices in those classes, necessary and sufficient conditions for the existence of saddle points have been ...
openaire +1 more source
This paper considers three classes of matrices in terms of the existence ofsaddle points. The classes are described by conditions which are very closely related to the property ofquasi-concavity-convexity of functions of two variables. For the matrices in those classes, necessary and sufficient conditions for the existence of saddle points have been ...
openaire +1 more source
2009
We extend known saddlepoint tail probability approximations to multivariate cases, including multivariate conditional cases. Our first approximation applies to both continuous and lattice variables, and requires the existence of a cumulant generating function.
openaire +1 more source
We extend known saddlepoint tail probability approximations to multivariate cases, including multivariate conditional cases. Our first approximation applies to both continuous and lattice variables, and requires the existence of a cumulant generating function.
openaire +1 more source
On an application of the saddle-point theorem.
2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources