Minor Self-conjugate and Skewpositive Semidefinite Solutions to a System of Matrix Equations over Skew Fields

Minor self conjugate (msc) and skewpositive semidefinite (ssd) solutions to the system of matrix equations over skew fields [A mn X nn =A mn ,B sn X nn =O sn ] are considered. Necessary and sufficient conditions for the existence of and the expressions for the msc solutions and the ssd solutions are obtained for the system.

Degree of Approximation of Conjugate of Signals (Functions) by Lower Triangular Matrix Operator

In the present paper, an attempt is made to obtain the degree of approximation of conjugate of functions (signals) belonging to the generalized weighted W(LP, ξ(t)), (p ≥ 1)-class, by using lower triangular matrix operator of conjugate series of its Fourier series.

ORTHOGONAL MATRIX POLYNOMIALS WITH RESPECT TO A CONJUGATE BILINEAR MATRIX MOMENT FUNCTIONAL: BASIC THEORY

In this paper basic results for a theory of orthogonal matrix polynomials with respect to a conjugate bilinear matrix moment functional are proposed. Properties of orthogonal matrix polynomial sequences including a three term matrix relationship are given. Positive definite conjugate bilinear matrix moment functionals are introduced and a characterization of positive definiteness in terms of a block Haenkel moment matrix is established. For each positive definite conjugate bilinear matrix moment functional an associated matrix inner product is defined.

A SEMI-CONJUGATE MATRIX BOUNDARY VALUE PROBLEM FOR GENERAL ORTHOGONAL POLYNOMIALS ON AN ARBITRARY SMOOTH JORDAN CURVE

In this article, the author characterizes orthogonal polynomials on an arbitrary smooth Jordan curve by a semi-conjugate matrix boundary value problem, which is different from the Riemann-Hilbert problems that appear in the theory of Riemann -Hilbert approach to asymptotic analysis for orthogonal polynomials on a real interval introduced by Fokas, Its, and Kitaev and on the unit circle introduced by Baik, Deift, and Johansson. The author hopes that their characterization may be applied to asymptotic analysis for general orthogonal polynomials by combining with a new extension of steepest descent method which we are looking for.

Gradient-Based Iterative Algorithm for a Coupled Complex Conjugate and Transpose Matrix Equations

Gradient-based iterative algorithm is suggested for solving a coupled complex conjugate and transpose matrix equations. Using the hierarchical identification principle and the real representation of a complex matrix, a convergence proof is offered. The necessary and sufficient conditions for the optimal convergence factor are determined. A numerical example is offered to validate the efficacy of the suggested algorithm.

Conjugate gradient and cross-correlation based least-square reverse time migration and its application

Although conventional reverse time migration can be perfectly applied to structural imaging it lacks the capability of enabling detailed delineation of a lithological reservoir due to irregular illumination. To obtain reliable reflectivity of the subsurface it is necessary to solve the imaging problem using inversion. The least-square reverse time migration （LSRTM） （also known as linearized refleetivity inversion） aims to obtain relatively high-resolution amplitude preserving imaging by including the inverse of the Hessian matrix. In practice, the conjugate gradient algorithm is proven to be an efficient iterative method for enabling use of LSRTM. The velocity gradient can be derived from a cross-correlation between observed data and simulated data, making LSRTM independent of wavelet signature and thus more robust in practice. Tests on synthetic and marine data show that LSRTM has good potential for use in reservoir description and four-dimensional （4D） seismic images compared to traditional RTM and Fourier finite difference （FFD） migration. This paper investigates the first order approximation of LSRTM, which is also known as the linear Born approximation. However, for more complex geological structures a higher order approximation should be considered to improve imaging quality.

THE BI-SELF-CONJUGATE AND NONNEGATIVE DEFINITE SOLUTIONS TO THE INVERSE EIGENVALUE PROBLEM OF QUATERNION MATRICES

The main aim of this paper is to discuss the following two problems: Problem I: Given X ∈ Hn×m (the set of all n×m quaternion matrices), A = diag(λ1,…, λm) EEEEE Hm×m, find A ∈ BSHn×n≥such that AX = X(?), where BSHn×n≥ denotes the set of all n×n quaternion matrices which are bi-self-conjugate and nonnegative definite. Problem Ⅱ2= Given B ∈ Hn×m, find B ∈ SE such that ||B-B||Q = minAE∈=sE ||B-A||Q, where SE is the solution set of problem I , || ·||Q is the quaternion matrix norm. The necessary and sufficient conditions for SE being nonempty are obtained. The general form of elements in SE and the expression of the unique solution B of problem Ⅱ are given.

Matrices That Commute with Their Conjugate and Transpose

It is known that if A∈Mn is normal (AA*=A*A) , then AA￣=A￣A if and only if AAT=ATA. This leads to the question: do both AA￣=A￣A and AAT=ATA?imply that A?is normal? We give an example to show that this is false when n=4, but we show that it is true when n=2?and n=3.

直纹面面齿轮共轭小齿轮的滚齿加工研究

针对直纹面面齿轮与圆柱齿轮不满足共轭关系而限制其在小传动比应用场合的情况,提出与直纹面面齿轮共轭的小齿轮及其滚齿加工方法。首先建立了直纹面面齿轮及其共轭小齿轮的齿面方程,获得共轭小齿轮相比圆柱齿轮的齿面偏差形貌;随后推导了阿基米德齿轮滚刀的齿面方程,并根据滚齿加工运动坐标系和啮合原理建立了圆柱齿轮的数学模型;在滚齿加工圆柱齿轮的运动基础上,通过增加滚刀的径向移动和工件的附加转动使滚刀切削刃逼近共轭齿面,附加运动由泰勒多项式表示,通过建立敏感矩阵方程并采用奇异值分解法迭代求解方程获得附加数控运动多项式系数,最后获得数控加工齿面;为评价直纹面面齿轮副的传动性能,进行了齿面承载接触分析,并与传统面齿轮-圆柱齿轮副进行了对比。研究结果表明:相同参数下,直纹面面齿轮副与传统面齿轮副的承载性能基本相同,完全能够代替传统面齿轮副传动;数值算例和仿真加工对该方法的验证表明,其数值算例误差不超过1μm,仿真结果误差不超过6μm,证明了该方法的可行性和准确性。

基于云模型的核心竞争力影响因素分析及评估

为寻找合适的影响因素,提升企业核心竞争力水平,提出基于可拓共轭对分析和云模型的核心竞争力影响因素分析方法。通过对典型农机制造企业分析,运用可拓共轭对分析理论,建立企业内部业务流程和供应链两个角度的虚实、软硬共轭对模型,寻找所有影响因素集合。在此基础上构建基于相对偏好关系的云模型,处理评价信息的不确定性和模糊性,计算核心竞争力初始重要度。引入自相关矩阵进行修正并判断各相关因素的重要度,确定关键核心影响因素。最后通过实例分析验证所提模型的科学性和可行性,帮助企业寻找核心竞争力提升方向。

特征提取中一类矩阵迹函数极值问题的黎曼优化算法

研究来源于特征提取中的一类鲁棒判别回归模型,该模型问题可以重构为Stiefel流形和线性流形组成的乘积流形约束下的一类矩阵迹函数极小化问题.整合紧流形和线性流形,结合乘积流形几何性质,本文设计适用于求解重构问题简化版本的一类基于Zhang-Hager技术拓展的乘积流形黎曼非线性共轭梯度法,并给出算法全局收敛性分析.数据实验表明所提算法对于问题求解是高效可行的,且与已有算法、其它黎曼梯度类算法及黎曼优化工具箱中已有的黎曼一阶和二阶算法相比在迭代解精度或迭代效率上有一定优势.

Toeplitz算子在Hardy空间上的复对称性

复对称算子是由复对称矩阵的概念抽象出来的,本文借助矩阵研究如何刻画经典Hardy空间上的一类复对称Toeplitz算子。首先在Hardy空间上定义两类新的共轭算子,它们分别为n倒置的共轭算子和n二次倒置的共轭算子。其次分奇偶情况去完整刻画在这类共轭算子下Toeplitz算子是复对称的结构,利用在Hardy空间上经典正规正交基下Toeplitz算子的矩阵表示,给出了Toeplitz算子分别相对于一类共轭算子是复对称的充分必要条件。最后对本文进行总结及展望,提出能否继续刻画Toeplitz算子相对于这类共轭算子是m-复对称的问题。

基于共轭梯度法的空时抗干扰算法研究

由于卫星导航信号功率很小,所以卫星导航信号具有易受干扰的特点,目前卫星导航抗干扰算法主要用到的是协方差矩阵求逆的方法,比如空域和空时抗干扰算法,然而随着天线阵元数的增加和空时抽头数的增加,矩阵维数也随之增加,导致运算量的上升,而共轭梯度法可以避免高维矩阵求逆,且具有收敛快,计算量小的特点,因此基于共轭梯度法的求解空时抗干扰算法,并通过仿真分析证明所提方法的有效性。

An iterative algorithm for solving a class of matrix equations

In this paper, an iterative algorithm is presented to solve the Sylvester and Lyapunov matrix equations. By this iterative algorithm, for any initial matrix X1, a solution X＊ can be obtained within finite iteration steps in the absence of roundoff errors. Some examples illustrate that this algorithm is very efficient and better than that of [ 1 ] and [2].

Efficient solution of large-scale matrix of acoustic wave equations in 3D frequency domain

In 3D frequency domain seismic forward and inversion calculation,the huge amount of calculation and storage is one of the main factors that restrict the processing speed and calculation efficiency.The frequency domain finite-difference forward simulation algorithm based on the acoustic wave equation establishes a large bandwidth complex matrix according to the discretized acoustic wave equation,and then the frequency domain wave field value is obtained by solving the matrix equation.In this study,the predecessor's optimized five-point method is extended to a 3D seven-point finite-difference scheme,and then a perfectly matched layer absorbing boundary condition(PML)is added to establish the corresponding matrix equation.In order to solve the complex matrix,we transform it to the equivalent real number domain to expand the solvable range of the matrix,and establish two objective functions to transform the matrix solving problem into an optimization problem that can be solved using gradient methods,and then use conjugate gradient algorithm to solve the problem.Previous studies have shown that in the conjugate gradient algorithm,the product of the matrix and the vector is the main factor that affects the calculation efficiency.Therefore,this study proposes a method that transform bandwidth matrix and vector product problem into some equivalent vector and vector product algorithm,thereby reducing the amount of calculation and storage.

关于复矩阵(A^(T)A)^(m)的秩及其推广

设A为复矩阵,A为A的共轭矩阵,A^(T)为A的转置,m为任意正整数,R(A)为A的秩.证明了R((A^(T)A)^(m))=R((A^(T)A)^(m)A^(T))=R(A(A^(T)A)^(m))=R(A).

一类新的可对角化矩阵及其张量积与张量和

应用正规矩阵、共轭转置矩阵的概念和理论,研究了适于条件A=A 2-I的矩阵A的特征值分布。利用矩阵张量积与张量和理论,获得了适于上述条件的两个矩阵A,B的张量积与张量和的表达式及其行列式的值,给出了适于这一条件的矩阵的张量积、张量和仍属于此类型的矩阵的充要条件。

BANDED M-MATRIX SPLITTING PRECONDITIONER FOR RIESZ SPACE FRACTIONAL REACTION-DISPERSION EQUATION

Based on the Crank-Nicolson and the weighted and shifted Grunwald operators,we present an implicit difference scheme for the Riesz space fractional reaction-dispersion equations and also analyze the stability and the convergence of this implicit difference scheme.However,after estimating the condition number of the coefficient matrix of the discretized scheme,we find that this coefficient matrix is ill-conditioned when the spatial mesh-size is sufficiently small.To overcome this deficiency,we further develop an effective banded M-matrix splitting preconditioner for the coefficient matrix.Some properties of this preconditioner together with its preconditioning effect are discussed.Finally,Numerical examples are employed to test the robustness and the effectiveness of the proposed preconditioner.

关于分裂四元数及其矩阵的共轭相似性探讨

定义了分裂四元数及其矩阵的共轭特征值和共轭特征向量概念,从而将复矩阵的相似性理论推广到了分裂四元数上,并讨论了它们的若干代数性质.

A Gohberg-Semencul Type Formula for the Inverse of Conjugate-Toeplitz Matrix and Applications

Constructing a kind of cyclic displacement, we obtain the inverse of conjugate-Toeplitz matrix by the aid of Gohberg-Semencul type formula. The stability of the inverse formula is discussed. Numerical examples are given to verify the feasibility of the inverse formula. We show how the analogue of our Gohberg-Semencul type formula leads to an efficient way to solve the conjugate-Toeplitz linear system of equations. It will be shown the number of real arithmetic operations is not more than known results. The corresponding conjugate-Hankel matrix is also considered.