大型稀疏矩阵的不完全因子分解法及预处理

本文对大型稀疏阵线性方程组的不完全因子分解及预处理法进行了研究。对对称正定阵和Ｌ阵分别提出了非对角元乘子不完全因子分解法的分解公式。对分解Ａ＝Ｍ－Ｎ，得到了当Ａ为对称正定时，Ｍ亦为对称正定，当Ａ为Ｌ阵时，分解为正规分裂等结果。并研究了预处理ＣＧ加速，最后的数值例子表明本文给出了的算法效果是良好的。     

On the Average of Exponents

ＯｎｔｈｅＡｖｅｒａｇｅｏｆＥｘｐｏｎｅｎｔｓＣａｏＨｕｉｚｈｏｎｇ（曹惠中）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＳｈａｎｄｏｎｇＵｎｉｖｅｒｓｉｔｙ，Ｊｉｎａｎ２５０１００）Ａｂｓｔｒａｃｔ：Ｌｅｔｎ＞１ａｎｄｂｅｔｈｅｐｒｉｍｅｆａ...     

Properties of a representation of a basis for the null space

Given a rectangular matrixA(x) that depends on the independent variablesx, many constrained optimization methods involve computations withZ(x), a matrix whose columns form a basis for the null space ofA ^T(x). WhenA is evaluated at a given point, it is well known that a suitableZ (satisfyingA ^T Z = 0) can be obtained from standard matrix factorizations. However, Coleman and Sorensen have recently shown that standard orthogonal factorization methods may produce orthogonal bases that do not vary continuously withx; they also suggest several techniques for adapting these schemes so as to ensure continuity ofZ in the neighborhood of a given point.This paper is an extension of an earlier note that defines the procedure for computingZ. Here, we first describe howZ can be obtained byupdating an explicit QR factorization with Householder transformations. The properties of this representation ofZ with respect to perturbations inA are discussed, including explicit bounds on the change inZ. We then introduceregularized Householder transformations, and show that their use implies continuity of the full matrixQ. The convergence ofZ andQ under appropriate assumptions is then proved. Finally, we indicate why the chosen form ofZ is convenient in certain methods for nonlinearly constrained optimization.The research of the Stanford authors was supported by the U.S. Department of Energy Contract DE-AM03-76SF00326, PA No. DE-AT03-76ER72018; the National Science Foundation Grants MCS-7926009 and ECS-8312142; the Office of Naval Research Contract N00014-75-C-0267; and the U.S. Army Research Office Contract DAAG29-84-K-0156.The research of G.W. Stewart was supported by the Air Force Office of Scientific Research Contract AFOSR-82-0078.     

Factorization technique and new exact solutions for the modified Camassa-Holm and Degasperis-Procesi equations

In this paper, the recent factorization technique is applied to the modified Camassa-Holm and Degasperis-Procesi equations and two first-order ordinary differential equations are obtained, respectively. Subsequently, some new exact solitary wave solutions for the two equations are proposed. The figures for the bell-type and peakon-type solutions of the modified Camassa-Holm are plotted to describe the properties of the solutions.     

A fast algorithm for solving a Toeplitz system

In this paper, we present a fast algorithm for solving Symmetric penta-diagonal systems. We give the feasibility and Stability analysis of the algorithm. Moreover, parallel computations can be implemented in the algorithm. The numerical examples verify the efficiency of the algorithm.     

On Finite Factorization Rings

Let R be a commutative ring with identity. R is a finite factorization ring (FFR) if every nonzero nonunit of R has only a finite number of factorizations up to order and associates. In this article, we give a characterization of R for R[X] and R[[X]] to be an FFR.     

The semigroup generated by a unitary orbit of a singular matrix

We investigate the structure of the multiplicative semigroup generated by the set of matrices that are unitarily equivalent to a given singular matrix A. In particular, we give necessary and sufficient conditions, in terms of the singular values of A, for such a semigroup to consist of all matrices of rank not exceeding the rank of A.     

Spectrum-Generating Symmetries for the Superpotentials Acot θ and Btanh y

The hierarchy of supersymmetric partner Schrödinger equations for the superpotentials Acot?θ and Btanh?y with A and B as half-integer and negative integer numbers are solved. The number of bound states for given trigonometric and hyperbolic potentials are infinite and finite, respectively. In addition to the spectrum-generating corresponding to the standard supersymmetry which is based on shifting potential parameter, there exist three other different methods for generating the spectrum. The first method is based on supersymmetrizing two given models via infinite and finite number of their bound states. This is realized by the ladder operators which shift only quantum numbers. The second and third methods are based on supersymmetrizing any of the models via all bound states corresponding to hierarchy of their partner potentials. They are respectively realized via simultaneous increasing or decreasing of quantum number and the potential parameter, and also, increasing one of them while decreasing the other. Any of the second and third methods leads to introducing two different classes of the algebraic solutions for both models.