STABLE DOUBLE LR ALGORITHM AND ITS ERROR ANALYSIS

In this paper, the normative matrices and their double LR transformation with origin shifts are defined, and the essential relationship between the double LR transformation of a normative matrix and the QR transformation of the related symmetric tridiagonal matrix is proved. We obtain a stable double LR algorithm for double LR transformation of normative matrices and give the error analysis of our algorithm. The operation number of the stable double LR algorithm for normative matrices is only four sevenths of the rational QR algorithm for reed symmetric tridiagonal matrices.     

QR factorization for row or column symmetric matrix

The problem of fast computing the QR factorization of row or column symmetric matrix is considered. We address two new algorithms based on a correspondence of Q and R matrices between the row or column symmetric matrix and its mother matrix. Theoretical analysis and numerical evidence show that, for a class of row or column symmetric matrices, the QR factorization using the mother matrix rather than the row or column symmetric matrix per se can save dramatically the CPU time and memory without loss of any numerical precision.     

Least-Squares Solution of Inverse Problem for Hermitian Anti-reflexive Matrices and Its Appoximation

In this paper, we first consider the least-squares solution of the matrix inverse problem as follows： Find a hermitian anti-reflexive matrix corresponding to a given generalized reflection matrix J such that for given matrices X, B we have minA ｜｜AX - B｜｜. The existence theorems are obtained, and a general representation of such a matrix is presented. We denote the set of such matrices by SE. Then the matrix nearness problem for the matrix inverse problem is discussed. That is： Given an arbitrary A^＊, find a matrix A E SE which is nearest to A^＊ in Frobenius norm. We show that the nearest matrix is unique and provide an expression for this nearest matrix.     

THE SINE TRANSFORM OPERATOR IN THE BANACH SPACE OF SYMMETRIC MATRICES AND ITS APPLICATION IN IMAGE RESTORATION

In this paper, we study an operator s which maps every n-by-n symmetric matrix A, to a matrix s(A_n) that minimizes || B_n-A_n || F over the set of all matrices B_n, that can be diagonalized by the sine transform. The matrix s(A_n), called the optimal sine transform preconditioner, is defined for any n-by-n symmetric matrices A_n. The cost of constructing s(A_n) is the same as that of optimal circulant preconditioner c(A_n) which is defined in [8], The s(A_n) has been proved in [6] to be a good preconditioner in solving symmetric Toeplitz systems with the preconditioned conjugate gradient (PCG) method. In this paper, we discuss the algebraic and geometric properties of the operator s, and compute its operator norms in Banach spaces of symmetric matrices. Some numerical tests and an application in image restoration are also given.     

SOME PROPERTIES OF CENTROSYMMETRIC MATRICES AND ITS APPLICATIONS

In this paper, some properties of centrosymmetric matrices, which often appear in the construction of orthonormal wavelet basis in wavelet analysis, are investigated. As an application, an algorithm which is tightly related to a so-called Lawton matrix is presented. In this algorithm, about only half of memory units are required and quarter of computational cost is needed by exploiting the property of the Lawton matrix and using a compression technique, it is compared to one for the original Lawton matrix.     

ESTIMATES OF THE DOUBLE DETERMINANTS OF QUATERNION MATRICES

An estimate of the upper bound is given for the double determinant of the sum of two arbitrary quaternion matrices, and meanwhile the lower bound on the double determinant is established especially for the sum of two quaternion matrices which form an assortive pair. As applications, some known results are obtained as corollaries and a question in the matrix determinant theory is answered completely.     

A Class of Constrained Inverse Eigenproblem and Associated Approximation Problem for Symmetric Reflexive Matrices

Let S∈Rn×n be a symmetric and nontrival involution matrix. We say that A∈E R n×n is a symmetric reflexive matrix if AT = A and SAS = A. Let S R r n×n(S)={A|A= AT,A = SAS, A∈Rn×n}. This paper discusses the following two problems. The first one is as follows. Given Z∈Rn×m (m < n),∧= diag(λ1,...,λm)∈Rm×m, andα,β∈R withα<β. Find a subset (?)(Z,∧,α,β) of SRrn×n(S) such that AZ = Z∧holds for any A∈(?)(Z,∧,α,β) and the remaining eigenvaluesλm 1 ,...,λn of A are located in the interval [α,β], Moreover, for a given B∈Rn×n, the second problem is to find AB∈(?)(Z,∧,α,β) such that where ||.|| is the Frobenius norm. Using the properties of symmetric reflexive matrices, the two problems are essentially decomposed into the same kind of subproblems for two real symmetric matrices with smaller dimensions, and then the expressions of the general solution for the two problems are derived.     

矩阵方程ATXA=B的对称正交对称解及其最佳逼近

By applying the generalized singular value decomposition of matrices, this paper provides the necessary and sufficient conditions for the existence and the expression of the symmetric ortho-symmetric solutions of the linear matrix equation A^TXA = B. In addition, the expression of the optimal approximation solution to the given matrix is derived.     

Least-Squares Solutions of the Matrix Equation A^T XA = B Over Bisymmetric Matrices and its Optimal Approximation

A real n×n symmetric matrix X=(x_(ij))_(n×n)is called a bisymmetric matrix if x_(ij)=x_(n 1-j,n 1-i).Based on the projection theorem,the canonical correlation de- composition and the generalized singular value decomposition,a method useful for finding the least-squares solutions of the matrix equation A~TXA=B over bisymmetric matrices is proposed.The expression of the least-squares solutions is given.Moreover, in the corresponding solution set,the optimal approximate solution to a given matrix is also derived.A numerical algorithm for finding the optimal approximate solution is also described.     

Some Conditions for Matrices over an Incline To Be Invertible and General Linear Group on an Incline

Inclines are the additively idempotent semirings in which products are less than or equal to either factor. In this paper, some necessary and sufficient conditions for a matrix over L to be invertible are given, where L is an incline with 0 and 1. Also it is proved that L is an integral incline if and only if GLn（L） = PLn （L） for any n （n 〉 2）, in which GLn（L） is the group of all n × n invertible matrices over L and PLn（L） is the group of all n × n permutation matrices over L. These results should be regarded as the generalizations and developments of the previous results on the invertible matrices over a distributive lattice.     

ON THE IRREDUCIBILITY OF THE DETERMINANT OF THE MATRIX OF MOVING PLANES

ABSTRACT

We show that, for generic bihomogeneous polynomials, the determinant of the matrix of moving planes is irreducible.     

样本判决系数的样本特性研究

本文用 bootstrap方法估计 R2和 R2的标准误差并构建置信区间 ,用蒙特卡罗方法说明 bootstrap标准误差的精确程度 ,并说明 R2的 95置信水平的置信区间不包含真实值的某些特殊情况在用 R2时不会发生。     

具有强迫项的Liénard方程解的有界性

讨论了具有强迫项的Liénard方程     

一阶H(o)lder条件下带参数的修正型Euler-Halley迭代族的局部收敛性

1引言 设X和y为实或复Banach空间,Ω X是开凸子集,F:Ω X→y是一阶连续可微的非线性算子.     

关于幂等元之差的可逆性

本文研究在一个有单位元的环中两个幂等元之差的可逆性问题,利用幂等元的性质,得到了两个幂等元之差可逆的几个充分必要条件,并给出了在矩阵环中的几个应用.     

关于“停走”生成器概率模型中的符合率问题

本文首先建立了“停走”生成器辅出序列的概率模型,给出了“停走”生成器输出序列与其线性移位寄存器序列之间的符合率的计算公式。     

幂级数系数重排使型不变的必要条件

根据幂级数系数重排级不变的充要条件，对比研究了幂级数系数的重排与此级数的和函数的型之间的关系，得到了幂级数系数重排型不变的一些必要条件。     

THE ACTION OF THE LINEAR CHARACTER GROUP ON THE SET OF NON-LINEAR IRREDUCIBLE CHARACTERS THE ACTION OF THE LINEAR CHARACTER GROUP ON THE SET OF NON-LINEAR IRREDUCIBLE CHARACTERS

1. Notations and Basic ResultsLet G be a finite nonabelian group. Then frs(G/G') is an abelian group under themultiplication of characters and acts on the set of non-linear irreducible characters of G viathe multiplication of characters. The purpose of this paper is to investigate this action. Asan application of our theoryl in the end of Section 3 we give the classification of groupshaving exactly three non-linear irreducible caracters.All groups in the paper are finite. For a factor grou…