Newton-Type Method for Solving Systems of Linear Equations and Inequalities

Computational Mathematics and Mathematical Physics - A Newton-type method is proposed for numerical minimization of convex piecewise quadratic functions, and its convergence is analyzed....     

求解线性不等式组的方法

本提出了一个新的求解线性不等式组可行解的方法－－无约束极值方法。通过在线性不等式组的非空可行域的相对内域上建立一个非线性极值问题，根据对偶关系，得到了一个对偶空间的无约束极值及原始，对偶变量之间的简单线性映射关系，这样将原来线性不等式组问题的求解转化为一个无约束极值问题。中主要讨论了求解无约束极值问题的共轭梯度算法。同时，在寻找不等式组可行解的过程中，定义了穿越方向，这样大大减少计算量。中最后数值实验结果表明此算法是有效的。     

基于动力系统的线性不等式组的解法

本文提出了一种新的求解线性不等式组可行解的方法-基于动力系统的方法．假设线性不等式组的可行域为非空,在可行域的相对内域上建立一个非线性关系表达式,进而得到一个结构简单的动力系统模型．同时,定义了穿越方向。文章最后的数值实验结果表明此算法是有效的．     

Polynomial Acceleration Methods for Solving Singular Systems of Linear Equations

In this paper we study the polynomial acceleration methods for solving singular linear systems. We establish iterative schemes, show their convergence and find iteration error bounds.     

Dynamical Systems Gradient Method for Solving Ill-Conditioned Linear Algebraic Systems

A version of the Dynamical Systems Method (DSM) for solving ill-conditioned linear algebraic systems is studied in this paper. An a priori and a posteriori stopping rules are justified. An algorithm for computing the solution using a spectral decomposition of the left-hand side matrix is proposed. Numerical results show that when a spectral decomposition of the left-hand side matrix is available or not computationally expensive to obtain the new method can be considered as an alternative to the Variational Regularization.     

增广Lagrangian对偶分解方法求解变分不等式系统

本文考虑带约束的变分不等式系统.提出一个基于增广Lagrangian对偶的分解算法,本文给出了算法的收敛性分析.     

动力系统方法解决无界线性算子方程

针对反问题中出现的第一类算子方程Au=f,其中A是实Hilbert空间H上的一个无界线性算子利用动力系统方法和正则化方法,求解上述问题的正则化问题的解:u'(t)=-A~*(Au(t)-f)利用线性算子半群理论可以得到上述正则化问题的解的半群表示,并证明了当t→∞时,所得的正则化解收敛于原问题的解.     

On Solving Parametric Polynomial Systems

Border polynomial and discriminant variety are two important notions related to parametric polynomial system solving, in particular, for partitioning the parameter space into regions where the solutions of the system depend continuously on the parameter values. In this paper, we study the relations between those notions in the case of parametric triangular systems. We also investigate the properties and computation of the non-properness locus of the canonical projection restricted at a parametric regular chain or at its saturated ideal.     

Homotopy Method for Solving Variational Inequalities

In this paper, a globally convergent method of finding solutions for an ordinary finite-dimensional variational inequality is presented by using a homotopy method. A numerical example is given to support this method.     

求解增广线性系统的局部多分裂迭代法

为了在高性能计算机上求解增广线性系统,基于并行多分裂的两种技巧,本文提出一种局部多分裂迭代格式,给出当增广线性系统的矩阵为M-矩阵和H-矩阵时新方法的收敛性理论.并讨论预条件矩阵的特征值情形.     

Projective-Dual Method for Solving Systems of Linear Equations with Nonnegative Variables

In order to solve an underdetermined system of linear equations with nonnegative variables, the projection of a given point onto its solutions set is sought. The dual of this problem—the problem of unconstrained maximization of a piecewise-quadratic function—is solved by Newton’s method. The problem of unconstrained optimization dual of the regularized problem of finding the projection onto the solution set of the system is considered. A connection of duality theory and Newton’s method with some known algorithms of projecting onto a standard simplex is shown. On the example of taking into account the specifics of the constraints of the transport linear programming problem, the possibility to increase the efficiency of calculating the generalized Hessian matrix is demonstrated. Some examples of numerical calculations using MATLAB are presented.     

Necessary and Sufficient Conditions for Solving Infinite-Dimensional Linear Inequalities

The existence of a feasible solution to a system of infinite-dimensional linear inequalities is characterized by a topological generalization of the Farkas Condition. If this result is specialized to a finite-dimensional vector space with finite positive cone, then a geometric proof of the classic Minkowski-Farkas Lemma is obtained. A dual version leads to an infinite-dimensional extension of the Theorem of the Alternative.     

多项式组特征列的矩阵求法

基于矩阵多元多项式的带余除法,给出了代数情形多项式组特征列的一种新求法,并举例验证了这种方法的有效性.     

On Global Convergence and Approximate Iteration of the Linear Approximation Method for Solving Variational Inequalities

This paper is concerned with the linear approximation method (i.e. the iterative method in which a sequence of vectors is generated by solving certain linearized subproblems) for solving the variational inequality. The global convergent iterative process is proposed by applying the continuation method, and the related problems are discussed. A convergent result is obtained for the approximation iteration (i.e. the iterative method in which a sequence of vectors is generated by solving certain linearized subproblems approximately).     

求解混合三角多项式方程组的直接GBQ方法

许多科学与工程领域,我们经常需要求混合三角多项式方程组的全部解.一般来说,混合三角多项式方程组可以通过变量替换及增加二次多项式转化为多项式方程组,进而利用数值方法进行求解,但这种转化会增大问题的规模从而增加计算量.在本文中,我们不将问题转化,考虑利用直接同伦方法求解,并给出基于GBQ方法构造的初始方程组及同伦定理的证明.数值实验结果表明我们构造的直接同伦方法较已有的直接同伦方法更加有效.     

用遗传算法求解病态线性方程组

众所周知 ,病态方程组的条件数较大 ,当输入数据有微小扰动或计算过程中的舍入误差都可能引起输出数据的很大扰动 ,使得解严重失真 ,因此求解此类方程组是相当困难的 .本文尝试使用遗传算法来求解病态线性方程组 ,得到了较好的结果 ,并与传统的求解方法作了简单的比较     

线性不等式组的简单对偶非线性方法

将线性不等式组问题转化为一个形式简单的对偶空间非线性极值问题,本提出了一类新的求解线性不等式组的方法-简单对偶非线性方法,它在理论上是多项式算法,并可以从任意点启动,可以应用共轭梯度方法有效地求解大规模线性不等式组问题。本给出了不同的算法实现,数值实验结果表明,简单对偶非线性方法是有效的。     

A Generalized Newton-Like Method for Solving Variational Inequalities

In this paper,we present a generalized Newton-like method for solving variational inequalities,and prove Q-superlinear and Q-quadratic convergence without the strict complementarity slackness condition