Saddle Point
Bifurcations and Chaos in the Duffing Equation with One Degenerate Saddle Point and Single External Forcing
... degenerate saddle point and one external forcing and obtain the criteria of chaos of Duffing equation under periodic perturbation through Melnikov ...
9
A Note on Parameterized Preconditioned Method for Singular Saddle Point Problems
... Recently, some authors (Li, Yang and Wu, 2014) studied the parameterized preconditioned HSS (PPHSS) method for solving saddle point problems. In this short note, we further discuss the PPHSS method for ...
6
Comparison between cross sections, saddle point and scission point barriers for the 32S+24Mg reaction
... Sierk saddle-point barriers [11] and Moretto’s transition density ...The saddle- point approximation to the fragment yields of Sanders et ...
6
An analysis of low-rank modifications of preconditioners for saddle point systems
... We assume that E and A have dimensions n × n and m × n respectively, with m < n, that E is symmetric positive definite, and that A has rank m. The use of the inverse in the (1,1) block is purely notational, to ...
14
On a non-stagnation condition for GMRES and application to saddle point matrices
... Abstract. In Simoncini and Szyld [Numer. Math., 109 (2008), pp. 477–487] a new non-stagnation condition for the convergence of GMRES on indefinite problems was proposed. In this paper we derive an enhanced strategy ...
12
Preconditioners for the geometry optimisation and saddle point search of molecular systems
... components to ensure their positivity. An advantage of this procedure is that it avoids the computation of second derivatives of the collective variables (or internal coordinates). The preconditioner yields significant ...
11
On the Shift HSS Splitting Method for Nonsingular Saddle Point Problem
... The novelty of this present paper is the research of the shift-HSS iteration method for nonsingular saddle point systems with nonsymmetric positive definite (1,1)-block. We study the convergence property of ...
5
A primal dual algorithm framework for convex saddle point optimization
... with adaptive stepsize. Though the algorithm is quite fast, the convergence is not proved. He, You, and Yuan [] showed that PDHG with constant step sizes is indeed convergent if one of the functions of the ...
16
The alternate direction iterative methods for generalized saddle point systems
... generalized saddle- point systems based on two splitting forms of generalized saddle-point matrix, and then establish some convergence theorems for these two iterative ...
11
Saddle Point Approximation to Cumulative Distribution Function for Damage Process
... Furthermore, Reid (1988) reported for applications to inference. As well as, Borowiak (1999) study, for discussion of a tail area approximation that has uniform relative error and Terrell (2003) for a stabilized ...
8
Performance Analysis of a Special GPIU Method for Singular Saddle Point Problems
... The purpose of this paper is to provide performance analysis of a special case of the GPIU method with singular preconditioners for solving the singular saddle point prob- lem (1). This paper is organized ...
7
A Full Characterization on Fixed Point Theorem, Minimax Inequality, Saddle Point, and KKM Theorem
... The saddle point theorem is an important tool in variational problems and game ...on saddle point without imposing any form of convexity ...
18
Eigenvalue bounds of the shift splitting preconditioned singular nonsymmetric saddle point matrices
... of saddle-point problems, see [, ] and references ...the saddle-point ma- trix A [, ], we know that the linear system ...nonsymmetric saddle-point problem ...
13
Preconditioners for reduced saddle point systems arising in elliptic PDE constrained optimization problems
... linear saddle point system ...linear saddle point sys- tem (), such as the block diagonal preconditioner and the constraint preconditioner [], block triangular diagonal preconditioner [], ...
14
Some generalizations of the new SOR like method for solving symmetric saddle point problems
... From Table 2 we can see that the GNSOR-like method requires much less iteration num- ber than NSOR-like [14], SOR-like, MSOR-like [15], so that it costs less CPU time than the others. So, the GNSOR-like method is ...
12
A New Tactic to Solve the Two Person Zero Sum Game Without Saddle Point
... There are some games for which no saddle point exists. In such cases both the players must determine an optimal combination of strategies to find a saddle (equilibrium) point. The optimal ...
22
Integrability and linearizability for Lotka Volterra systems with the 3:−q resonant saddle point
... resonant saddle point of quadratic systems, by computing the saddle numbers to get the necessary conditions, the authors completely solved the integrability problem in [, ], and further- more in ...
15
A multigrid method for saddle point problems arising from mortar finite element discretizations
... Abstract. A multigrid algorithm for saddle point problems arising from mortar finite element discretizations is analyzed. Here, we do not require that the constraints at the interface are satisfied in each ...
12
Combination preconditioning of saddle point systems for positive definiteness
... for saddle point systems, standard iterative methods in nonstandard inner products have been usefully ...preconditioned saddle point matrix nonsymmetric but self-adjoint with respect to a ...
23
Null-space preconditioners for saddle point systems
... Abstract. The null-space method is a technique that has been used for many years to reduce a saddle point system to a smaller, easier to solve, symmetric positive-definite system. This method can be ...
26