求解非线性方程组的L-M方法

本文研究了求解奇异非线性方程组的Levenberg-Marquardt方法的收敛性.利用选取新的迭代参数求解非线性方程组的L-M方法,获得点列的超线性收敛性和二阶收敛性,并把试验结果与文献[19,20]的结果进行了比较.     

基于简单二次函数模型的非单调信赖域算法

基于简单二次函数模型,结合非单调技术,建立了一个新的求解无约束最优化问题的非单调信赖域算法,并证明了算法的全局收敛性及超线性收敛性.数值例子表明算法是有效性的,适合求解大规模问题.     

一类不精确拟牛顿型算法的局部收敛性分析

为了求解Hilbert空间中算子方程或minimax问题,构造了一类无穷维空间中的不精确拟牛顿算法,并考虑了其线性收敛性和超线性收敛性,是对有限维空间中不精确拟牛顿法的推广.当迭代算子由Broyden修正给出时,在一定的假设条件下,得到了不精确Broyden方法的线性收敛性和超线性收敛性.这为使用不精确拟牛顿法结合投影法求解算子方程做好了准备.     

求解非线性互补问题的逐次逼近拟牛顿法的收敛性分析

提出了求解非线性互补问题的一个逐次逼近拟牛顿算法。在适当的假设下,证明了该算法的全局收敛性和局部超线性收敛性。     

求解二阶锥绝对值方程组的非单调光滑牛顿算法

本文提出了求解二阶锥绝对值方程组(SOCAVE)的非单调光滑牛顿算法.在适当的条件下分析了算法的全局收敛性和局部二次收敛性.数值结果表明用非单调光滑牛顿算法求解SOCAVE是可行且高效的.     

具有线性化技术的三块非凸不可分优化问题BregmanADMM收敛性分析

交替方向乘子法是求解两块可分离凸优化问题的有效方法,但是对于三块不可分的非凸优化问题的交替方向乘子法的收敛性可能无法保证.该文主要研究的是用线性化广义Bregman交替方向乘子法(L-G-BADMM)求解目标函数是三块不可分的非凸极小化问题的收敛性分析.在适当假设条件下,对算法中子问题进行求解并构建满足Kurdyka-Lojasiewicz性质的效益函数,经过理论证明可以得到该算法的收敛性.     

一类分裂变分不等式及其收敛算法

引入一种新的分裂变分不等式问题,构造了两种算法来求解,得到了相应迭代序列的弱收敛性和强收敛性.     

一类四阶微积分方程的Legendre-Galerkin谱逼近

针对研究吊桥模型而建立的四阶微积分方程, 提出Legendre谱逼近法进行求解.构造迭代算法来求解得到的线性系统, 证明了迭代格式的收敛性, 对问题进行了误差分析.数值算例验证了迭代的收敛性和方法的高精度.     

一类求解MPEC的全局收敛性算法

概述MPEC求解上存在的困难；提出将求解普通约束优化问题的信赖域方法用于求解MPEC；在适当条件下建立算法的全局收敛性定理。     

求解特定线性互补问题的牛顿KKT内点法

利用线性互补问题与二次规划之间的关系,推广了求解二次规划的KKT内点法,并用于线性互补问题,分析了推广算法的全局收敛性和局部收敛性.数值实验表明,算法对求解几类线性互补问题是有效的.     

Admissible equivalence transformations for linearization of nonlinear wave type equations

In the present paper, we consider a general family of two‐dimensional wave equations, which represents a great variety of linear and nonlinear equations within the framework of the transformations of equivalence groups. We have investigated the existence problem of point transformations that lead mappings between linear and nonlinear members of particular families and determined the structure of the nonlinear terms of linearizable equations. We have also given examples about some equivalence transformations between linear and nonlinear equations and obtained exact solutions of nonlinear equations via the linear ones.     

Exponential Stability for Discrete Time Linear Equations Defined by Positive Operators

In this paper the problem of exponential stability of the zero state equilibrium of a discrete-time time-varying linear equation described by a sequence of linear positive operators acting on an ordered finite dimensional Hilbert space is investigated. The class of linear equations considered in this paper contains as particular cases linear equations described by Lyapunov operators or symmetric Stein operators as well as nonsymmetric Stein operators. Such equations occur in connection with the problem of mean square exponential stability for a class of difference stochastic equations affected by independent random perturbations and Markovian jumping as well us in connection with some iterative procedures which allow us to compute global solutions of discrete time generalized symmetric or nonsymmetric Riccati equations. The exponential stability is characterized in terms of the existence of some globally defined and bounded solutions of some suitable backward affine equations (inequalities) or forward affine equations (inequalities).     

Improving the accuracy of solutions of the linear second kind volterra integral equations system by using the taylor expansion method

This paper presents a new and an efficient method for determining solutions of the linear second kind Volterra integral equations system. In this method, the linear Volterra integral equations system using the Taylor series expansion of the unknown functions transformed to a linear system of ordinary differential equations. For determining boundary conditions we use a new method. This method is effective to approximate solutions of integral equations system with a smooth kernel, and a convolution kernel. An error analysis for the proposed method is provided. And illustrative examples are given to represent the efficiency and the accuracy of the proposed method.     

Shift-invariant spaces and linear operator equations

In this paper we investigate the structure of finitely generated shift-invariant spaces and solvability of linear operator equations. Fourier trans-forms and semi-convolutions are used to characterize shift-invariant spaces. Criteria are provided for solvability of linear operator equations, including linear partial difference equations and discrete convolution equations. The results are then applied to the study of local shift-invariant spaces. Moreover, the approximation order of a local shift-invariant space is characterized under some mild conditions on the generators. Supported in part by NSERC Canada under Grant OGP 121336.     

Characterizations of linear Volterra integral equations with nonnegative kernels

We first introduce the notion of positive linear Volterra integral equations. Then, we offer a criterion for positive equations in terms of the resolvent. In particular, equations with nonnegative kernels are positive. Next, we obtain a variant of the Paley-Wiener theorem for equations of this class and its extension to perturbed equations. Furthermore, we get a Perron-Frobenius type theorem for linear Volterra integral equations with nonnegative kernels. Finally, we give a criterion for positivity of the initial function semigroup of linear Volterra integral equations and provide a necessary and sufficient condition for exponential stability of the semigroups.     

Application of group analysis to classification of systems of three second‐order ordinary differential equations

Here, we give a complete group classification of the general case of linear systems of three second‐order ordinary differential equations excluding the case of systems which are studied in the literature. This is given as the initial step in the study of nonlinear systems of three second‐order ordinary differential equations. In addition, the complete group classification of a system of three linear second‐order ordinary differential equations is carried out. Four cases of linear systems of equations are obtained. Copyright © 2015 John Wiley & Sons, Ltd.     

Floquet theory for second order linear homogeneous difference equations

In this paper we provide a version of the Floquet’s theorem to be applied to any second order difference equations with quasi-periodic coefficients. To do this we extend to second order linear difference equations with quasi-periodic coefficients, the known equivalence between the Chebyshev equations and the second order linear difference equations with constant coefficients. So, any second order linear difference equations with quasi-periodic coefficients is essentially equivalent to a Chebyshev equation, whose parameter only depends on the values of the quasi-periodic coefficients and can be determined by a non-linear recurrence. Moreover, we solve this recurrence and obtaining a closed expression for this parameter. As a by-product we also obtain a Floquet’s type result; that is, the necessary and sufficient condition for the equation has quasi-periodic solutions.     

A fresh look at linear ordinary differential equations with constant coefficients. Revisiting the impulsive response method using factorization

We present an approach to the impulsive response method for solving linear constant-coefficient ordinary differential equations of any order based on the factorization of the differential operator. The approach is elementary, we only assume a basic knowledge of calculus and linear algebra. In particular, we avoid the use of distribution theory, as well as of the other more advanced approaches: Laplace transform, linear systems, the general theory of linear equations with variable coefficients and variation of parameters. The approach presented here can be used in a first course on differential equations for science and engineering majors.     

含参数线性方程组解的判别方法注记

当线性方程组中含有未知参数时,线性方程组解的情况往往需要进行讨论.本文给出了在非齐次线性方程组系数矩阵中含有未知参数且系数行列式等于零的情况下,判定对应参数值下方程组的解是无解还是有无穷多解的两个判定定理.和以前的方法比较,本文提出的讨论方法更直接.     

解聯立方程的差分方程法

<正> 一. 引 聯立一次方程的求解早就不是一個理論問題,而是一個改進計算技術的問題.問題在如何組織計算使計算機械化從而節省工作量. 給定充分多始值後,線性差分方程是很容易解的.在本文內,我們把特種的及一般的聯立一次方程組的解看作線性差分方程滿足某種邊值的解,從而推求出求聯立一次方程組的準確解的一種簡單的機械的列表計算方法。