An efficient numerical scheme for precise time integration of a diffusion-dissolution/precipitation chemical system

A numerical scheme based on an operator splitting method and a dense output event location algorithm is proposed to integrate a diffusion-dissolution/precipitation chemical initial-boundary value problem with jumping nonlinearities. The numerical analysis of the scheme is carried out and it is proved to be of order 2 in time. This global order estimate is illustrated numerically on a test case.

     

Local Feasible QP-Free Algorithms for the Constrained Minimization of SC1 Functions

We consider the problem of minimizing an SC¹ function subject to inequality constraints. We propose a local algorithm whose distinguishing features are that: (a) a fast convergence rate is achieved under reasonable assumptions that do not include strict complementarity at the solution; (b) the solution of only linear systems is required at each iteration; (c) all the points generated are feasible. After analyzing a basic Newton algorithm, we propose some variants aimed at reducing the computational costs and, in particular, we consider a quasi-Newton version of the algorithm.     

一类椭圆型方程的多重解

利用极小极大方法获得了一类Dirichlet问题多重解的存在性结果.     

General Information

In this paper, we propose and analyze an SQP-type method for solving linearly constrained convex minimization problems where the objective functions are too complex to be evaluated exactly. Some basic results for global convergence and local superlinear convergence are obtained according to the properties of the approximation sequence. We illustrate the applicability of our approach by proposing a new method for solving two-stage stochastic programs with fixed recourse.     

含有陡峭势阱和凹凸非线性项的Kirchhoff型问题的多重正解*

在这篇文章中, 作者研究涉及凹凸非线性项的Kirchhoff型问题-(a + b ∫R3|▽u|²dx) Δu + λV (x)u = μf(x)|u|^q?2u + |u|^p?2u, x ∈ R³,u ∈ H¹(R³),其中a,b > 0 是常数, λ, μ > 0 是参数, 1 < q < 2, 4 < p < 6 且 V 是一个非负连续位势. 在f(x) 和 V 的合适条件下,此问题正解的存在性和集中性能够通过Nehari 流形和Ekeland 变分原理得到.     

Primal-dual interior point approach for computingl 1-solutions andl ∞-solutions of overdetermined linear systems

This paper concerns solving an overdetermined linear systemA ^T x=b in the leastl ₁-norm orl -norm sense, whereA ^m×n ,m<n. We show that the primal-dual interior point approach for linear programming can be applied, in an effective manner, to linear programming versions of thel ₁ andl -problems. The resulting algorithms are simple to implement and can attain quadratic or superlinear convergence rate. At each iteration, the algorithms must solve a linear system with anm×m positive-definite coefficient matrix of the formADA ^T , whereD is a positive diagonal matrix. The preliminary numerical results indicate that the proposed algorithms offer considerable promise.This research was supported in part by Grants NSF DMS-91-02761 and DOE DE-FG05-91-ER25100.     

A quadratically convergent O(\sqrt n L)-iteration algorithm for linear programming

Recently, Ye, Tapia and Zhang (1991) demonstrated that Mizuno—Todd—Ye's predictor—corrector interior-point algorithm for linear programming maintains the O( L)-iteration complexity while exhibiting superlinear convergence of the duality gap to zero under the assumption that the iteration sequence converges, and quadratic convergence of the duality gap to zero under the assumption of nondegeneracy. In this paper we establish the quadratic convergence result without any assumption concerning the convergence of the iteration sequence or nondegeneracy. This surprising result, to our knowledge, is the first instance of a demonstration of polynomiality and superlinear (or quadratic) convergence for an interior-point algorithm which does not assume the convergence of the iteration sequence or nondegeneracy.Supported in part by NSF Grant DDM-8922636 and NSF Coop. Agr. No. CCR-8809615, the Iowa Business School Summer Grant, and the Interdisciplinary Research Grant of the University of Iowa Center for Advanced Studies.Supported in part by NSF Coop. Agr. No. CCR-8809615, AFOSR 89-0363, DOE DEFG05-86ER25017 and ARO 9DAAL03-90-G-0093.Supported in part by NSF Grant DMS-9102761 and DOE Grant DE-FG05-91ER25100.     

Chaotic flows with a single nonquadratic term

This paper addresses a previously unexplored regime of three-dimensional dissipative chaotic flows in which all but one of the nonlinearities are quadratic. The simplest such systems are determined, and their equilibria and stability are described. These systems often have one or more infinite lines of equilibrium points and sometimes have stable equilibria that coexist with the strange attractors, which are sometimes hidden. Furthermore, the coefficient of the single nonquadratic term provides a simple means for scaling the amplitude and frequency of the system.     

非线性互补约束规划问题的一个新的QP-free算法

本文研究了非线性互补约束均衡问题.利用互补函数以及光滑近似法,把非线性互补约束均衡问题转化为一个光滑非线性规划问题,得到了超线性收敛速度,数值实验结果表明本文提出的算法是可行的.