C-代数上的Fourier变换和C-代数上的Vinogradov不等式

本文给出了C-代数上的Fourier变换，从而推广了经典数论上Fourier变换和任意有限Abel群的Fourier变换．进一步应用这个Fourier变换，给出了C-代数上的Vinogradov不等式．     

符号空间的拟移位和Moebius带上的奇怪吸引子

给出了双边符号空间上的一种新的拟移位映射，得到了它与传统的移位映射拓扑共轭．类似Smale马蹄，对这种拟移位映射给出了一个模型，即在Moebius带上给出一类映射．同时刻划了这类映射的吸引子的结构及动力学行为．     

关于体上分块矩阵的群逆

本文利用分块矩阵方法．研究了体上两个矩阵乘积的群逆的存在性及表示形式，给出了体上两个矩阵乘积群逆存在的充分必要条件和表示形式．并且在一定条件下．给出了体上分块矩阵的群逆存在性及表示形式．     

在某些正则区域上的多元B形式曲面

本文首先通过在多面体区域上抬高维数的技巧给出了多元Ｂ形式中曲面的一般性定义．由此我们构造了平行四边形域上、正六边形域上和正八边形成上Ｂ形式的同次曲面格式，并给出了其基函数的递推公式和求导公式．同时我们也给出了正六边形域上插值角点的Ｂ形式同次曲面的表示式．     

复Banach空间上的Rouché定理

本文利用（广义）拓扑度的有关性质给出了一般复Ｂａｎａｃｈ空间上全纯映射的（广义）Ｒｏｕｃｈé定理．特别，在复平面上它以经典的Ｒｏｕｃｈé定理为特例．同时，它也给出了多复变全纯映射的相应定理及一些应用．     

不等式的又一巧证

《中学生数学》2010年第1期（上）发表的《巧证不等式》给出了以下题目的一个巧证．笔者经过思考，给出另一种巧证，供大家参考．     

随机变量的一种顺序及其应用

本文对分布于有限区间上的随机变量给出了一种顺序，并给出了其在实际中的一种应用．     

一种平面保凸插值构造光滑曲线的方法

Ａ．Ｍｅｈａｕｔｅ和Ｆ．Ｕｔｒｅｒａｓ（１９９４）给出了一种平面函数型保凸插值构造光滑曲线的方法（以下简称为Ｍ－Ｕ方法）．本文在利用其方法本质的基础上，给出了一种平面上参数型保凸插值构造光滑曲线的方法，同Ｍｅｈａｕｔｅ和Ｕｔｒｅｒａｓ的方法一样，这里的方法也有局部性．另外这种方法还可以构造平面上的封闭曲线．     

某些广义插值在L_p ~(2π)和L_p(R)空间的逼近(英文)

给出了两种插值算子，并研究了它们在和L~(2π)_p和Lp（R）L空间上的逼近阶．用实数α阶的积分模给出逼近度．     

Minkowski空间中定向曲面上的第二类松弛弹性线

在Minkowski空间中，定义了定向曲面上的第二类松弛弹性线，推导了在定向曲面上的第二类松弛弹性线的Euler-Lagrange方程．进一步阐明了，这些曲线是否落在曲率线上，最后给出相关的实例．     

关于线性矩阵方程通解的求法

给出了求线性矩阵方程 Am× n Xn× s=Bm× s通解的两种方法     

用初等行变换求线性矩阵方程的通解

本文通过建立通解矩阵的概念 ,给出了用初等行变换求线性矩阵方程 Am× n Xn× s=Bm× s的通解的方法 .     

矩阵方程Am×nXn×p=Bm×p的一种分块矩阵解法

利用分块矩阵的运算和矩阵的初等变换给出了矩阵方程Am×nXn×p=Bm×p解的存在性、解的结构,以及求解的一种方法.同时指出该方法对求解线性方程组Am×nx=b也完全适用.     

The inverse problem of bisymmetric matrices with a submatrix constraint

An n×n real matrix A is called a bisymmetric matrix if A=A^T and A=S_nAS_n, where S_n is an n×n reverse unit matrix. This paper is mainly concerned with solving the following two problems: Problem I Given n×m real matrices X and B, and an r×r real symmetric matrix A₀, find an n×n bisymmetric matrix A such that where A([1: r]) is a r×r leading principal submatrix of the matrix A. Problem II Given an n×n real matrix A^*, find an n×n matrix  in S_E such that where ∥·∥ is Frobenius norm, and S_E is the solution set of Problem I. The necessary and sufficient conditions for the existence of and the expressions for the general solutions of Problem I are given. The explicit solution, a numerical algorithm and a numerical example to Problem II are provided. Copyright © 2003 John Wiley & Sons, Ltd.     

一类矩阵方程的非奇异解

利用分块矩阵的等价标准形讨论了矩阵方程Am×nXn×nBn×l=Cm×l有解的充分必要条件,给出了一般解的表达式.在此基础上,进一步讨论了这类矩阵方程有非奇异解的条件,并且给出非奇异解的一般表达形式.     

The Constrained Solutions of Two Matrix Equations

We study the symmetric positive semidefinite solution of the matrix equation AX ₁ A ^T + BX ₂ B ^T = C, where A is a given real m×n matrix, B is a given real m×p matrix, and C is a given real m×m matric, with m, n, p positive integers; and the bisymmetric positive semidefinite solution of the matrix equation D ^T XD = C, where D is a given real n×m matrix, C is a given real m×m matrix, with m, n positive integers. By making use of the generalized singular value decomposition, we derive general analytic formulae, and present necessary and sufficient conditions for guaranteeing the existence of these solutions. Received December 17, 1999, Revised January 10, 2001, Accepted March 5, 2001     

Effective condition numbers and small sample statistical condition estimation for the generalized Sylvester equation

In this paper,we investigate the effective condition numbers for the generalized Sylvester equation(AX-YB,DX-YE)=(C,F),where A,D∈R m×m,B,E∈R n×n and C,F ∈ R m×n.We apply the small sample statistical method for the fast condition estimation of the generalized Sylvester equation,which requires O(m2n+mn2) flops,comparing with O(m3+n3) flops for the generalized Schur and generalized HessenbergSchur methods for solving the generalized Sylvester equation.Numerical examples illustrate the sharpness of our perturbation bounds.     

关于谢邦杰的一个定理的推广

本文采用[1]的术语.1978年,谢邦杰将著名的Hadamard不等式推广到四元数体上,即:设A=(a_ij)_n×n为四元数体上可中心化的非奇异矩阵,则等号成立当且仅当A的各行广义正交.本文给出关于四元数体上长方阵的不等式(2).当m=n,且A是可中心化的非奇异矩阵时,(2)式即为(1)式.     

The generalized centro‐symmetric and least squares generalized centro‐symmetric solutions of the matrix equation AYB + CYTD = E

An n×n real matrix P is said to be a symmetric orthogonal matrix if P = P^?1 = P^T. An n × n real matrix Y is called a generalized centro‐symmetric with respect to P, if Y = PYP. It is obvious that every matrix is also a generalized centro‐symmetric matrix with respect to I. In this work by extending the conjugate gradient approach, two iterative methods are proposed for solving the linear matrix equation and the minimum Frobenius norm residual problem over the generalized centro‐symmetric Y, respectively. By the first (second) algorithm for any initial generalized centro‐symmetric matrix, a generalized centro‐symmetric solution (least squares generalized centro‐symmetric solution) can be obtained within a finite number of iterations in the absence of round‐off errors, and the least Frobenius norm generalized centro‐symmetric solution (the minimal Frobenius norm least squares generalized centro‐symmetric solution) can be derived by choosing a special kind of initial generalized centro‐symmetric matrices. We also obtain the optimal approximation generalized centro‐symmetric solution to a given generalized centro‐symmetric matrix Y₀ in the solution set of the matrix equation (minimum Frobenius norm residual problem). Finally, some numerical examples are presented to support the theoretical results of this paper. Copyright © 2011 John Wiley & Sons, Ltd.     

Indecomposable matrices over a distributive lattice

In this paper, the concepts of indecomposable matrices and fully indecomposable matrices over a distributive lattice L are introduced, and some algebraic properties of them are obtained. Also, some characterizations of the set F _n (L) of all n × n fully indecomposable matrices as a subsemigroup of the semigroup H _n (L) of all n × n Hall matrices over the lattice L are given.