AN EFFICIENT MOVING MESH METHOD FOR A MODEL OF TURBULENT FLOW IN CIRCULAR TUBES

This paper presents an efficient moving problem with an optimal control constrained mesh method to solve a nonlinear singular condition. The physical problem is governed by a new model of turbulent flow in circular tubes proposed by Luo et al. using Prandtl＇s mixing-length theory. Our algorithm is formed by an outer iterative algorithm for handling the optimal control condition and an inner adaptive mesh redistribution algorithm for solving the singular governing equations. We discretize the nonlinear problem by using a upwinding approach, and the resulting nonlinear equations are solved by using the Newton- Raphson method. The mesh is generated and the grid points are moved by using the arc-length equidistribution principle. The numerical results demonstrate that proposed algorithm is effective in capturing the boundary layers associated with the turbulent model.     

A CONTINUATION HOMOTOPY METHOD FOR THE INVERSE PROBLEM OF OPERATOR IDENTIFICATION AND ITS APPLICATION

A new widly convergent method for solving the problem of operator kientification is illustrated.Numerical simulations are carried out to test the feasibllity and to study the general characteristics of the technique without the real measurement data.This technique is a direct application of the continuation homotopy method for solving nonlinear systems of equations.It is found that this method does give excellent results in solving the inverse problem of the elliptic differential equations.     

求解广义线性互补问题的光滑牛顿法(英文)

The extended linear complementarity problem(denoted by ELCP) can be reformulated as the solution of a nonsmooth system of equations. By the symmetrically perturbed CHKS smoothing function, the ELCP is approximated by a family of parameterized smooth equations. A one-step smoothing Newton method is designed for solving the ELCP. The proposed algorithm is proved to be globally convergent under suitable assumptions.     

Regular Splitting and Potential Reduction Method for Solving Quadratic Programming Problem with Box Constraints

A regular splitting and potential reduction method is presented for solving a quadratic programming problem with box constraints (QPB) in this paper. A general algorithm is designed to solve the QPB problem and generate a sequence of iterative points. We show that the number of iterations to generate an e-minimum solution or an e-KKT solution by the algorithm is bounded by O( nlog(1 )), and the total running time is bounded by O(n2(n logn log1/ε)(n/εlog1/ε logn)) arithmetic operations.     

A NEW REDUCED-ORDER FVE ALGORITHM BASED ON POD METHOD FOR VISCOELASTIC EQUATIONS

A proper orthogonal decomposition （POD） technique is used to reduce the finite volume element （FVE） method for two-dimensional （2D） viscoelastic equations. A reduced-order fully discrete FVE algorithm with fewer degrees of freedom and sufficiently high accuracy based on POD method is established. The error estimates of the reduced- order fully discrete FVE solutions and the implementation for solving the reduced-order fully discrete FVE algorithm are provided. Some numerical examples are used to illus- trate that the results of numerical computation are consistent with theoretical conclusions. Moreover, it is shown that the reduced-order fully discrete FVE algorithm is one of the most effective numerical methods by comparing with corresponding numerical results of finite element formulation and finite difference scheme and that the reduced-order fully discrete FVE algorithm based on POD method is feasible and efficient for solving 2D viscoelastic equations.     

A SUPERLINEARLY CONVERGENT TRUST REGION ALGORITHM FOR LC^1 CONSTRAINED OPTIMIZATION PROBLEMS

In this paper, a new trust region algorithm for nonlinear equality constrained LC^1 optimization problems is given. It obtains a search direction at each iteration not by solving a quadratic programming subproblem with a trust region bound, but by solving a system of linear equations. Since the computational complexity of a QP-Problem is in general much larger than that of a system of linear equations, this method proposed in this paper may reduce the computational complexity and hence improve computational efficiency. Furthermore, it is proved under appropriate assumptions that this algorithm is globally and super-linearly convergent to a solution of the original problem. Some numerical examples are reported, showing the proposed algorithm can be beneficial from a computational point of view.     

A SPARSE SUBSPACE TRUNCATED NEWTON METHOD FOR LARGE-SCALE BOUND CONSTRAINED NONLINEAR OPTIMIZATION

In this paper we report a sparse truncated Newton algorithm for handling large-scale simple bound nonlinear constrained minimixation problem. The truncated Newton method is used to update the variables with indices outside of the active set, while the projected gradient method is used to update the active variables. At each iterative level, the search direction consists of three parts, one of which is a subspace truncated Newton direction, the other two are subspace gradient and modified gradient directions. The subspace truncated Newton direction is obtained by solving a sparse system of linear equations. The global convergence and quadratic convergence rate of the algorithm are proved and some numerical tests are given.     

Superlinear Convergence of a Smooth Approximation Method for Mathematical Programs with Nonlinear Complementarity Constraints

<正>Mathematical programs with complementarity constraints(MPCC) is an important subclass of MPEC.It is a natural way to solve MPCC by constructing a suitable approximation of the primal problem.In this paper,we propose a new smoothing method for MPCC by using the aggregation technique.A new SQP algorithm for solving the MPCC problem is presented.At each iteration,the master direction is computed by solving a quadratic program,and the revised direction for avoiding the Maratos effect is generated by an explicit formula.As the non-degeneracy condition holds and the smoothing parameter tends to zero,the proposed SQP algorithm converges globally to an S-stationary point of the MPEC problem,its convergence rate is superlinear.Some preliminary numerical results are reported.     

SOURCE TERM IDENTIFICATION WITH DISCONTINUOUS DUAL RECIPROCITY APPROXIMATION AND QUASI-NEWTON METHOD FROM BOUNDARY OBSERVATIONS

This paper deals with discontinuous dual reciprocity boundary element method for solving an inverse source problem.The aim of this work is to determine the source term in elliptic equations for nonhomogenous anisotropic media,where some additional boundary measurements are required.An equivalent formulation to the primary inverse problem is established based on the minimization of a functional cost,where a regularization term is employed to eliminate the oscillations of the noisy data.Moreover,an efficient algorithm is presented and tested for some numerical examples.     

A QR DECOMPOSITION BASED SOLVER FOR THE LEAST SQUARES PROBLEMS FROM THE MINIMAL RESIDUAL METHOD FOR THE SYLVESTER EQUATION

Based on the generalized minimal residual （GMRES） principle, Hu and Reichel proposed a minimal residual algorithm for the Sylvester equation. The algorithm requires the solution of a structured least squares problem. They form the normal equations of the least squares problem and then solve it by a direct solver, so it is susceptible to instability. In this paper, by exploiting the special structure of the least squares problem and working on the problem directly, a numerically stable QR decomposition based algorithm is presented for the problem. The new algorithm is more stable than the normal equations algorithm of Hu and Reichel. Numerical experiments are reported to confirm the superior stability of the new algorithm.     

连续代数扩域上多项式因式分解的Trager算法

多项式的因式分解是符号计算中最基本的算法,二十世纪六十年代开始出现的关于多项式因式分解的工作被认为是符号计算领域的起源．目前多项式的因式分解已经成熟,并已在Maple等符号计算软件中实现,但代数扩域上的因式分解算法还有待进一步改进．代数扩域上的基本算法是Trager算法．Weinberger等提出了基于Hensel提升的算法．这些算法是在单个扩域上做因式分解．而在吴零点分解定理中,多个代数扩域上的因式分解是非常基本的一步,主要用于不可约升列的计算．为了解决这一问题,吴文俊,胡森、王东明分别提出了基于方程求解的多个扩域上的因式分解算法．王东明、林东岱提出了另外一个算法Trager算法相似,将问题化为有理数域上的分解．他们应用了吴的三角化算法,因此算法的终止性依赖于吴方法的计算．支丽红则将提升技巧用于多个扩域上的因式分解算法．本文将Trager的算法直接推广为连续扩域上的因式分解,只涉及结式计算与有理数域上的因式分解,给出了多个代数扩域上的因式分解一个直接的算法．     

An Algorithm for Finding All Isolated Zeros of Polynomial Systems

Finding all zeros of polynomial systems is very interesting and it is also useul for many applied science problems.In this paper,based on Wu‘s method,we give an algorithm to find all isolated zeros of polynomial systems (or polynomial equations).By solving Lorenz equations,it is shown that our algo-rithm is efficient and powerful.     

Interval Newton Iteration in Multiple Precision for the Univariate Case

In this paper, interval arithmetic using an underlying multiple precision arithmetic is briefly presented. Then interval Newton iteration for solving nonlinear equations is introduced. A new Newton's algorithm based on multiple precision interval arithmetic is given, along with its properties: termination, arbitrary accuracy on the computed zeros, automatic and dynamic adaptation of the precision. Finally, some experiments illustrate the behaviour of this method.     

On conformal measures for infinitely renormalizable quadratic polynomials

We study a conformal measure for an infinitely renormalizable quadratic poly- nomial.We prove that the conformal measure is ergodic if the polynomial is unbranched and has complex bounds.The main technique we use in the proof is the three-dimensional puzzle for an infinitely renormalizable quadratic polynomial.     

多项式剩余类环上循环码新的表示

在编码理论中，多项式剩余类环是非常有意义的，它已经用来构造最优频率希望序列。本文，定义了多项式剩余类环上循环码的离散傅立叶变换及Mattson-Solomon（MS）多项式，证明了多项式剩余类环上的循环码同构于多项式剩余类环的Galois扩张的理想。     

矩阵多元多项式的带余除法及其应用

给出矩阵多元多项式的带余除法,从而用微分代数的观点,得到把一类微分方程(组)化为无穷维Hamilton系统的充要条件及其具体无穷维Hamilton系统形式。再把此方法和吴方法相结合获得构造一类微分方程(组)的通解的新方法。几个例子表明这些方法都很有效的。     

γ-循环线性方程组的快速算法

1．引言在数学以及应用科学中的许多问题都与周期性有关，从而导致一类特殊形式的TOeelitZ系统，即r一循环线性系统的求解，其计算复杂性为O（N”）［’j或渐近复杂性O（NlogZN）p］．由于循环矩阵与离散富里时变换之间的关系，我们也可通过快速富里叶变换（＊＊n来求解r一循环线性方程组，计算复杂性降为O（NlogZN）［‘，’］．事实上，到目前为止所有与厂循环矩阵有关问题的快速算法全部建立在富里叶变换某础之卜IZ，9，10，17，19，20］但另一方面富里叶交换定义在复数域上，而实际问题中的数据大多为实数，因此用FFT快速求解r…     

Adaptive Interpolation Algorithm Based on a kd-Tree for Numerical Integration of Systems of Ordinary Differential Equations with Interval Initial Conditions

We consider issues related to the numerical solution of interval systems of ordinary differential equations. We suggest an algorithm that permits finding interval estimates of solutions with prescribed accuracy in reasonable time. The algorithm constructs an adaptive partition (a dynamic structured grid) based on a kd-tree over the space formed by interval initial conditions for the ordinary differential equations. In the operation of the algorithm, a piecewise polynomial function interpolating the dependence of the solution on the specific values of interval parameters is constructed at each step of solution of the original problem. We prove that the global error estimate linearly depends on the height of the kd-tree. The algorithm is tested on several examples; the test results show its efficiency when solving problems of the class under study.     

On the new fourth-order methods for the simultaneous approximation of polynomial zeros

A new iterative method of the fourth-order for the simultaneous determination of polynomial zeros is proposed. This method is based on a suitable zero-relation derived from the fourth-order method for a single zero belonging to the Schröder basic sequence. One of the most important problems in solving polynomial equations, the construction of initial conditions that enable both guaranteed and fast convergence, is studied in detail for the proposed method. These conditions are computationally verifiable since they depend only on initial approximations, the polynomial coefficients and the polynomial degree, which is of practical importance. The construction of improved methods in ordinary complex arithmetic and complex circular arithmetic is discussed. Finally, numerical examples and the comparison with existing fourth-order methods are given.     

模糊运算和模糊有限元静力控制方程的求解

根据模糊数的区间形式表达和区间运算的性质,给出了模糊数和模糊变量的运算规则.据此并依据区间有限元理论,提出了结构模糊有限元静力控制方程的几种求解方法.方法可根据输入模糊数的隶属函数,给出结构响应量的可能性分布.且计算量小,易于实施.算例分析说明了方法是实用和可行的.