اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAlgebraic representation of dual scalar products and stabilization of saddle point problems
53
0
0.0
(
0
)
تأليف
Silvia Bertoluzza
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We provide a systematic way to design computable bilinear forms which, on the class of subspaces $W^* subseteq V$ that can be obtained by duality from a given finite dimensional subspace $W$ of an Hilbert space $V$, are spectrally equivalent to the scalar product of $V$. Such a bilinear form can be used to build a stabilized discretization algorithm for the solution of an abstract saddle point problem allowing to decouple, in the choice of the discretization spaces, the requirements related to the approximation from the inf-sup compatibility condition, which, as we show, can not be completely avoided.
قيم البحث
اقرأ أيضاً
In this paper we prove a new abstract stability result for perturbed saddle-point problems based on a norm fitting technique. We derive the stability condition according to Babuv{s}kas theory from a small inf-sup condition, similar to the famous Lady
zhenskaya-Babuv{s}ka-Brezzi (LBB) condition, and the other standard assumptions in Brezzis theory, in a combined abstract norm. The construction suggests to form the latter from individual {it fitted} norms that are composed from proper seminorms. This abstract framework not only allows for simpler (shorter) proofs of many stability results but also guides the design of parameter-robust norm-equivalent preconditioners. These benefits are demonstrated on mixed variational formulations of generalized Poisson, Stokes, vector Laplace and Biots equations.
In this paper, two types of Schur complement based preconditioners are studied for twofold and block tridiagonal saddle point problems. One is based on the nested (or recursive) Schur complement, the other is based on an additive type Schur complemen
t after permuting the original saddle point systems. We discuss different preconditioners incorporating the exact Schur complements. It is shown that some of them will lead to positive stable preconditioned systems. Our theoretical analysis is instructive for devising various exact and inexact preconditioners, as well as iterative solvers for many twofold and block tridiagonal saddle point problems.
For the nonsymmetric saddle point problems with nonsymmetric positive definite (1,1) parts, the modified generalized shift-splitting (MGSSP) preconditioner as well as the MGSSP iteration method are derived in this paper, which generalize the MSSP pre
conditioner and the MSSP iteration method newly developed by Huang and Su (J. Comput. Appl. Math. 2017), respectively. The convergent and semi-convergent analysis of the MGSSP iteration method are presented, and we prove that this method is unconditionally convergent and semi-convergent. In addition, some spectral properties of the preconditioned matrix are carefully analyzed. Numerical results demonstrate the robustness and effectiveness of the MGSSP preconditioner and the MGSSP iteration method, and also illustrate that the MGSSP iteration method outperforms the GSS and GMSS iteration methods, and the MGSSP preconditioner is superior to the shift-splitting (SS), generalized SS (GSS), modified SS (MSS) and generalized MSS (GMSS) preconditioners for the GMRES method for solving the nonsymmetric saddle point problems.
We show that the scalar products of on-shell and off-shell Bethe vectors in the algebra1ic Bethe ansatz solvable models satisfy a system of linear equations. We find solutions to this system for a wide class of integrable models. We also apply our me
thod to the XXX spin chain with broken $U(1)$ symmetry.
This paper studies the generalization bounds for the empirical saddle point (ESP) solution to stochastic saddle point (SSP) problems. For SSP with Lipschitz continuous and strongly convex-strongly concave objective functions, we establish an $mathcal
{O}(1/n)$ generalization bound by using a uniform stability argument. We also provide generalization bounds under a variety of assumptions, including the cases without strong convexity and without bounded domains. We illustrate our results in two examples: batch policy learning in Markov decision process, and mixed strategy Nash equilibrium estimation for stochastic games. In each of these examples, we show that a regularized ESP solution enjoys a near-optimal sample complexity. To the best of our knowledge, this is the first set of results on the generalization theory of ESP.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
