Banach空间中关于(H,η)增生算子的变分包含问题

在Banach空间中引进了一类(H,η)增生算子,利用预解算子技巧,建立了一个Ishikawa迭代,并证明了此迭代算法产生的变分包含的解的存在与唯一性。其结果是近期相关结果的改进与推广。     

Pansystems studies in stability,bifurcation and chaos

This paper divides fixed subsets into three kinds, mainly discusses the existence of II-type fixed subset, connects the investigations infixed subsets with the studies in non-linear problems, such as stability, bifurcation, chaos, etc., and proposes a kind of discrete simulation to Liapunov stability and his second method.     

Unconstrained and constrained global optimization of polynomial functions in one variable

In Floudas and Visweswaran (1990), a new global optimization algorithm (GOP) was proposed for solving constrained nonconvex problems involving quadratic and polynomial functions in the objective function and/or constraints. In this paper, the application of this algorithm to the special case of polynomial functions of one variable is discussed. The special nature of polynomial functions enables considerable simplification of the GOP algorithm. The primal problem is shown to reduce to a simple function evaluation, while the relaxed dual problem is equivalent to the simultaneous solution of two linear equations in two variables. In addition, the one-to-one correspondence between the x and y variables in the problem enables the iterative improvement of the bounds used in the relaxed dual problem. The simplified approach is illustrated through a simple example that shows the significant improvement in the underestimating function obtained from the application of the modified algorithm. The application of the algorithm to several unconstrained and constrained polynomial function problems is demonstrated.     

Dynamic Global Constraints in Backtracking Based Environments

Global constraints provide strong filtering algorithms to reduce the search space when solving large combinatorial problems. In this paper we propose to make the global constraints dynamic, i.e., to allow extending the set of constrained variables during search. We describe a generic dynamisation technique for an arbitrary monotonic global constraint and we compare it with the semantic-based dynamisation for the alldifferent constraint. At the end we sketch a dynamisation technique for non-monotonic global constraints. A comparison with existing methods to model dynamic problems is given as well.     

Parallel globally adaptive quadrature on the KSR-1

New algorithms for parallel one-dimensional globally adaptive quadrature are developed. The algorithms are implemented on a Kendall Square Research KSR-1 parallel computer and numerical results are presented. The most successful algorithm gives significant speedups on a range of hard problems, including ones with singular integrands. Both authors acknowledge the support of the EEC Esprit Basic Research Action Programme, Project 6634 (APPARC). The second author acknowledges the support of the NATO Collaborative Research Grant 920037.     

FRANCIS QL ALGORITHM FOR FINDING THE EIGENVALUES OF ANTI-SYMMETRIC MATRICES

In this paper,we demonstrate that the double-shift QL algorithm for an irreducible anti-symmetric iridiagonal matrix with the shifts being two eigenvalues of the 2×2 matrix in the left upper corner of this matrix is convergent and the convergence rale of Ms kind of algorithm is generally cubic.     

Numerical analysis for factorial data analysis. Part II: Special purpose hardware—the programmable systolic array SARDA

The second part of this paper deals with the systolic implementation of the computational kernel for factorial data analysis, defined in Part I, on special-purpose hardware. The framework of the study is that a sequence of different algorithms has to be performed on a unique hardware array. This fact has led us to the design of the programmable systolic array SARDA: this is a triangular array which consists of programmable nodes with local memory and programmable orthogonal connections.     

A primal-dual algorithm for the fermat-weber problem involving mixed gauges

We give a new algorithm for solving the Fermat-Weber location problem involving mixed gauges. This algorithm, which is derived from the partial inverse method developed by J.E. Spingarn, simultaneously generates two sequences globally converging to a primal and a dual solution respectively. In addition, the updating formulae are very simple; a stopping rule can be defined though the method is not dual feasible and the entire set of optimal locations can be obtained from the dual solution by making use of optimality conditions. When polyhedral gauges are used, we show that the algorithm terminates in a finite number of steps, provided that the set of optimal locations has nonepty interior and a counterexample to finite termination is given in a case where this property is violated. Finally, numerical results are reported and we discuss possible extensions of these results.     

Critical and multicritical behavior in the Ising–Heisenberg universality class

Critical behavior of three-dimensional classical frustrated antiferromagnets with a collinear spin ordering and with an additional twofold degeneracy of the ground state is studied. We consider two lattice models, whose continuous limit describes a single phase transition with a symmetry class differing from the class of non-frustrated magnets as well as from the classes of magnets with non-collinear spin ordering. A symmetry breaking is described by a pair of independent order parameters, which are similar to order parameters of the Ising and O(N) models correspondingly. Using the renormalization group method, it is shown that a transition is of first order for non-Ising spins. For Ising spins, a second order phase transition from the universality class of the O(2) model may be observed. The lattice models are considered by Monte Carlo simulations based on the Wang–Landau algorithm. The models are a ferromagnet on a body-centered cubic lattice with the additional antiferromagnetic exchange interaction between next-nearest-neighbor spins and an antiferromagnet on a simple cubic lattice with the additional interaction in layers. We consider the cases N = 1, 2, 3 and in all of them find a first-order transition. For the N = 1 case we exclude possibilities of the second order or pseudo-first order of a transition. An almost second order transition for large N is also discussed.