Level density of odd-A nuclei at saddle point

Based on the covariant density functional theory,by employing the core–quasiparticle coupling(CQC)model,the nuclear level density of odd-A nuclei at the saddle point is achieved.The total level density is calculated via the convolution of the intrinsic level density and the collective level density.The intrinsic level densities are obtained in the finite-temperature covariant density functional theory,which takes into account the nuclear deformation and pairing self-consistently.For saddle points on the free energy surface in the(β_(2),γ)plane,the entropy and the associated intrinsic level density are compared with those of the global minima.By introducing a quasiparticle to the two neighboring even–even core nuclei,whose properties are determined by the five-dimensional collective Hamiltonian model,the collective levels of the odd-A nuclei are obtained via the CQC model.The total level densities of the^(234-240)U agree well with the available experimental data and Hilaire’s result.Furthermore,the ratio of the total level densities at the saddle points to those at the global minima and the ratio of the total level densities to the intrinsic level densities are discussed separately.

Convergence analysis of the corrected Uzawa algorithm for symmetric saddle point problems

For the large sparse saddle point problems, Pan and Li recently proposed in [H. K. Pan, W. Li, Math. Numer. Sinica, 2009, 31（3）： 231-242] a corrected Uzawa algorithm based on a nonlinear Uzawa algorithm with two nonlinear approximate inverses, and gave the detailed convergence analysis. In this paper, we focus on the convergence analysis of this corrected Uzawa algorithm, some inaccuracies in [H. K. Pan, W. Li, Math. Numer. Sinica, 2009, 31（3）： 231-242] are pointed out, and a corrected convergence theorem is presented. A special case of this modified Uzawa algorithm is also discussed.

Distributed Resource Allocation via Accelerated Saddle Point Dynamics

In this paper,accelerated saddle point dynamics is proposed for distributed resource allocation over a multi-agent network,which enables a hyper-exponential convergence rate.Specifically,an inertial fast-slow dynamical system with vanishing damping is introduced,based on which the distributed saddle point algorithm is designed.The dual variables are updated in two time scales,i.e.,the fast manifold and the slow manifold.In the fast manifold,the consensus of the Lagrangian multipliers and the tracking of the constraints are pursued by the consensus protocol.In the slow manifold,the updating of the Lagrangian multipliers is accelerated by inertial terms.Hyper-exponential stability is defined to characterize a faster convergence of our proposed algorithm in comparison with conventional primal-dual algorithms for distributed resource allocation.The simulation of the application in the energy dispatch problem verifies the result,which demonstrates the fast convergence of the proposed saddle point dynamics.

Coincidence Point Theorems,Intersection Theorems and Saddle Point Theorems on FC-spaces

In this paper, we first give the definitions of finitely continuous topological space and FC-subspace generated by some set, and obtain coincidence point theorem, whole intersection theorems and Ky Fan type matching theorems, and finally discuss the existence of saddle point as an application of coincidence point theorem.

Mixed Saddle Point and Its Equivalence with an Efficient Solution under Generalized (V, <i>p</i>)-Invexity

The purpose of this paper is to define the concept of mixed saddle point for a vector-valued Lagrangian of the non-smooth multiobjective vector-valued constrained optimization problem and establish the equivalence of the mixed saddle point and an efficient solution under generalized (V, p)-invexity assumptions.

HESSIAN MATRIX BASED SADDLE POINT DETECTION FOR GRANULES SEGMENTATION IN 2D IMAGE

Segmenting the touching objects in an image has been remaining as a hot subject due to the problematic complexities, and a vast number of algorithms designed to tackle this issue have come into being since a decade ago. In this paper, a new granule segmentation algorithm is developed using saddle point as the cutting point. The image is binarized and then sequentially eroded to form a gray-scale topographic counterpart, followed by using Hessian matrix computation to search for the saddle point. The segmentation is performed by cutting through the saddle point and along the maximal gradient path on the topographic surface. The results of the algorithm test on the given real images indicate certain superiorities in both the segmenting robustness and execution time to the referenced methods.

Thermal Fission Rate Calculated Numerically by Particles Multi-passing over SaddlePoint

Langevin simulation of the particles multi-passing over the saddle point is proposed to calculate thermal fission rate.Due to finite friction and the corresponding thermal flutuation,a backstreaming exists in the process of the particle descent from the saddle to the scissio.This leads to that the diffusion behind the saddle point has influence upon the stationary flow across the saddle point.A dynamical correction factor,as a ratio of the flows of multi-and firstoverpassing the saddle point,is evaluated analytically.The results show that the fission rate calculated by the particles multi-passing over the saddle point is lower than the one calculated by the particle firstly passing over the saddle point,and the fomer approaches the results at the scission point.

THE CHARACTERIZATION OF EFFICIENCY AND SADDLE POINT CRITERIA FOR MULTIOBJECTIVE OPTIMIZATION PROBLEM WITH VANISHING CONSTRAINTS

In this article, we focus to study about modified objective function approach for multiobjective optimization problem with vanishing constraints. An equivalent η-approximated multiobjective optimization problem is constructed by a modification of the objective function in the original considered optimization problem. Furthermore, we discuss saddle point criteria for the aforesaid problem. Moreover, we present some examples to verify the established results.

MINIMAX THEOREMS FOR SUBCONVEXLIKEFUNCTIONS WITH APPLICATIONS TO SADDLEPOINT PROBLEMS

In this paper some minimax theorems are presented for subconvexlike functions. These are then applied to obtain saddle point theorems.

MINIMAX THEOREM AND SADDLE POINT THEOREM WITHOUT LINEAR STRUCTURE

In this paper, a new kind of concavity of a function defined on a set without linear structure is introduced and a generalization of Fam Ky inequality is given. Minimax theorem in a general topological space is obtained. Moreover, a saddle point theorem on a topological space without any linear structure is established.

Saddle Point Solution for System with Parameter Uncertainties

In this paper, we consider dynamical system, in the presence of parameter uncertainties. We apply max-min principles to determine the saddle point solution for the class of differential game arising from the associated dynamical system. We also provide sufficient condition for the existence of this saddle point.

Open Loop Saddle Point on Linear Quadratic Stochastic Differential Games

In this paper, we deal with one kind of two-player zero-sum linear quadratic stochastic differential game problem. We give the existence of an open loop saddle point if and only if the lower and upper values exist.

Wide-range characteristics of beam perveance and saddle point potential of LIPS-200 ion thruster

Both the long-life and multi-mode versions of LIPS-200 ion thruster are under investigation in LIP(Lanzhou Institute of Physics).To confirm the feasible ranges of the beam current and accel(abbreviation for accelaration)grid potential to apply to the thruster,the wide-range beam perveance(the state of beam focus)and saddle point potential(the lowest potential along beamlet centerline)characteristics of LIPS-200 are studied with a test-verified PIC-MCC(Particle in Cell-Monte Carlo Collisions)model.These characteristics are investigated with both the initial and the eroded states of the accel grid aperture diameter.The results show that the feasible ranges of these parameters with respect to perveance/crossover(overfocused)limit extend as the operating time accumulates,while the feasible range of accel grid potential narrows due to a reduced EBSF(electron backstreaming failure)margin.The feasible ranges determined by the initial condition are:(i)the beam current up to 0.981 A,and(ii)the accel grid potential up to−85 V.A 23%enlargement of the aperture diameter would bring up to 48 V of EBSF margin loss.

A New Preconditioner with Two Variable Relaxation Parameters for Saddle Point Linear Systems with Highly Singular(1,1) Blocks

In this paper, we provide new preconditioner for saddle point linear systems with (1,1) blocks that have a high nullity. The preconditioner is block triangular diagonal with two variable relaxation paremeters and it is extension of results in [1] and [2]. Theoretical analysis shows that all eigenvalues of preconditioned matrix is strongly clustered. Finally, numerical tests confirm our analysis.

Saddle Point Optimality Criteria of Interval Valued Non-Linear Programming Problem

The present paper aims to develop the Kuhn-Tucker and Fritz John criteria for saddle point optimality of interval-valued nonlinear programming problem.To achieve the study objective,we have proposed the definition of minimizer and maximizer of an interval-valued non-linear programming problem.Also,we have introduced the interval-valued Fritz-John and Kuhn Tucker saddle point problems.After that,we have established both the necessary and sufficient optimality conditions of an interval-valued non-linear minimization problem.Next,we have shown that both the saddle point conditions(Fritz-John and Kuhn-Tucker)are sufficient without any convexity requirements.Then with the convexity requirements,we have established that these saddle point optimality criteria are the necessary conditions for optimality of an interval-valued non-linear programming with real-valued constraints.Here,all the results are derived with the help of interval order relations.Finally,we illustrate all the results with the help of a numerical example.

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 solving singular saddle point problems. We prove the semi-convergence of the PPHSS method under some conditions. Numerical experiments are given to illustrate the efficiency of the method with appropriate parameters.

Exact propagator for an electron in a quadratic saddle-point potential and a magnetic field

We study the propagator for an electron moving in a two-dimensional （2D） quadratic saddle-point potential, in the presence of a perpendicular uniform magnetic field. A closed-form expression for the propagator is derived using the Feynmann path integrals.

A New GMλ-KKM Theorem and Its Application to Saddle Points

在这份报纸，一条新 GM-KKM 定理为 noncompact -hyperconvex 度量标准 spaces.As 应用被建立，变化不平等的答案集合的性质被显示出，为僵绳点的一条存在定理被获得。

Accelerated RHSS Iteration Method for Stabilized Saddle-Point Problems

For stabilized saddle-point problems, we apply the two iteration parameters idea for regularized Hermitian and skew-Hermitian splitting (RHSS) method and establish accelerated RHSS (ARHSS) iteration method. Theoretical analysis shows that the ARHSS method converges unconditionally to the unique solution of the saddle point problem. Finally, we use a numerical example to confirm the effectiveness of the method.