双变量矩阵方程组对称最小二乘解的迭代算法

本文研究了求双变量线性矩阵方程组的对称最小二乘解的问题.利用求解线性代数方程组的共轭梯度法的基本思想,通过对有关矩阵和系数的变形与近似处理,建立了一种迭代算法.拓宽了共轭梯度法的适用范围.算例表明,迭代算法是有效的.     

求矩阵方程组的反对称最小二乘解的递推算法

讨论了矩阵方程组A_1XB_1=D_1,A_2XB_2=D_2反对称最小二乘解的递推算法,该算法不仅能够用于计算反对称最小二乘解,而且在选取特殊的初始矩阵时,算法能够求出矩阵方程组的极小范数反对称最小二乘解,以及对给定的矩阵进行最佳逼近的反对称解.     

矩阵方程AXB=D解的研究

给出了矩阵方程AXB=D相容的又一充要条件,同时讨论它的极小范数解、最小二乘解和极小范数最小二乘解,推广了文献[1]和[3]的结论.     

矩阵方程组AX=C,XB=D的公共最小二乘解

通过使用矩阵秩方法,我们给出了矩阵方程组AX =C,XB =D的公共最小二乘解的通解表达式,以及公共最小二乘解的极大秩和极小秩.     

最小二乘问题及其研究

本文从理论上讨论了线性方程中最小二乘解的存在性及最小范数最小二乘解的唯一性，并给出求最小二乘解及最小范数最小二乘解的公式方法。     

Hermitian自反矩阵反问题的最小二乘解

本文研究了Hermitian自反矩阵反问题的最小二乘解及其最佳逼近.利用矩阵的奇异值分解理论,获得了最小二乘解的表达式.同时对于最小二乘解的解集合,得到了最佳逼近解.     

双变量LMEs一种异类约束最小二乘解的MCG算法

借鉴求线性矩阵方程组(LMEs)同类约束最小二乘解的修正共轭梯度法,建立了求双变量LMEs的一种异类约束最小二乘解的修正共轭梯度法,并证明了该算法的收敛性.在不考虑舍入误差的情况下,利用该算法不仅可在有限步计算后得到LMEs的一组异类约束最小二乘解,而且选取特殊初始矩阵时,可求得LMEs的极小范数异类约束最小二乘解.另外,还可求得指定矩阵在该LMEs的异类约束最小二乘解集合中的最佳逼近.算例表明,该算法是有效的.     

加权总体最小二乘问题的分析

总体最小二乘问题由Golub和Van Loan首先进行数学的分析,随后人们对于总体最小二乘问题的算法、解的各种形式、总体最小二乘解和最小二乘解的关系、总体最小二乘解的扰动理论以及数值试验作了大量的研究工作。近来,[10]中给出了总体最小二乘问题(TLS)较一般地讨论。另一方面,Golub和Van Loan研究了总体最小二乘问题的特殊均加权形式。本文试图在[10,11]的基础上讨论最一般的总体最小二     

加权总体最小二乘问题的解集和性质

本文讨论了加权总体最小二乘问题的等价解集，分析了加权总体最小二乘解与加权最小二乘问题的解之间的关系。推广了Ｇｏｌｕｂ和Ｖａｎ Ｌｏａｎ，Ｖａｎ Ｈｕｆｆｅｌ和Ｖａｎｄｅｗａｌｌｅ，及Ｗｅｉ的相应结果。     

矩阵方程AX＋XB=C的双对称解及其最佳逼近

提出一种求解线性矩阵方程AX＋XB=C双对称解的迭代法.该算法能够自动地判断解的情况,并在方程相容时得到方程的双对称解,在方程不相容时得到方程的最小二乘双对称解.对任意的初始矩阵,在没有舍入误差的情况下,经过有限步迭代得到问题的一个双对称解.若取特殊的初始矩阵,则可以得到问题的极小范数双对称解,从而巧妙地解决了对给定矩...     

线性微分方程的降阶法

提出线性微分方程的降阶法.在工科院校高数教材中若采用降阶法可以减少教材的篇幅.缩短教学时间,减轻学习难度.同时,还可利用数学软件求解线性微分方程,使高数教材贴近于现代计算技术.     

Using MathCAD to teach one-dimensional graphs

Topics such as linear and nonlinear equations and inequalities, compound inequalities, linear and nonlinear absolute value equations and inequalities, rational equations and inequality are commonly found in college algebra and precalculus textbooks. What is common about these topics is the fact that their solutions and graphs lie in the real line one-dimensional. However, sketching these graphs using computer software and graphing utilities is not straightforward. In this note we show how to use MathCAD to address this problem. The approach is simple and can be used by teachers in teaching almost all topics whose graphs and solutions lie in the real line. The method encourages students to explore mathematical models in these topics.     

Global Existence of Positive Solutions for Volterra Integral Equations

ＧｌｏｂａｌＥｘｉｓｔｅｎｃｅｏｆＰｏｓｉｔｉｖｅＳｏｌｕｔｉｏｎｓｆｏｒＶｏｌｔｅｒｒａＩｎｔｅｇｒａｌＥｑｕａｔｉｏｎｓＷａｎｇＳｈｕ（王术）；ＷａｎＣｈｕｎｌｉｎ（万春林）；ＺｈａｎｇＫｕｎ（张锟）（ＨｅｍａｎＵｎｉｖｅｒｓｉｔｙ，Ｋａｉｆｅｎ...     

线性代数教材改革指导思想探析

论述线性代数教材改革的必要性及其指导思想,主张线性代数教材建设应以矩阵为主线,以教育部颁发的硕士研究生人学考试线性代数部分的大纲为纲,结合教学现代化的现状,强调几何与代数相结合,重视代数学思想方法的渗透,化抽象为具体,同时在教学中还要引入数学建模的思想．     

一种迭代格式的有限元并行算法*

本文提出了一种求解有限元方程的迭代格式的并行算法.该方法在线性代数方程迭代解法的基础上,引进并行运算步骤;并且运用加权残数方法,通过选择适当的权函数,推导了该并行算法的有限元基本格式.该方法在西安交通大学BLXSI-6400并行计算机上程序实现.计算结果表明它能有效地提高运算速度,减少计算时间,是一种有效的求解大型结构有限元方程的并行算法.     

关于数学分析在线性代数中某些应用的数学札记

线性代数中有不少难度较高的问题,若从代数学内部系统出发处理起来,相当繁冗.但是若从另一角度出发,运用数学分析的方法去处理这些代数问题,可能有着事半功倍之效.为此,本文运用数学分析的有关知识和方法论证线性代数中的某些问题.供大家在教学时参考,不妥之处,敬请斧正.     

A combinatorial problem related to sparse systems of equations

Nowadays sparse systems of equations occur frequently in science and engineering. In this contribution we deal with sparse systems common in cryptanalysis. Given a cipher system, one converts it into a system of sparse equations, and then the system is solved to retrieve either a key or a plaintext. Raddum and Semaev proposed new methods for solving such sparse systems common in modern ciphers which are combinations of linear layers and small S-boxes. It turns out that the solution of a combinatorial MaxMinMax problem provides an upper bound on the average computational complexity of those methods. In this paper we initiate the study of a linear algebra variation of the MaxMinMax problem. The complexity bound proved in this paper significantly overcomes conjectured complexity bounds for Gröbner basis type algorithms.     

线性方程组解的有关问题

首先讨论了两个齐次线性方程组有非零公共解的充分必要条件并给出了非零公共解的一般形式,然后讨论了两个线性方程组同解的一个充分必要条件和非齐次线性方程组的线性无关解向量的个数以及非齐次线性方程组通解的表达式,最后证明了非齐次线性方程组有解的一个充分必要条件.     

Solving systems of linear equations over lie nilpotent rings

We show how the so called right and left determinants can be used in the solution of certain systems of linear equations over Lie niipotent rings, A close analogue of Cramer's rule is formulated for right linear equations over the Grassmann algebra.     

A unified analysis of linear quaternion dynamic equations on time scales

Over the last years, considerable attention has been paid to the role of the quaternion differential equations (QDEs) which extend the ordinary differential equations. The theory of QDEs was recently well established and has wide applications in physics and life science. This paper establishes a systematic frame work for the theory of linear quaternion dynamic equations on time scales (QDETS), which can be applied to wave phenomena modeling, fluid dynamics and filter design. The algebraic structure of the solutions to the QDETS is actually a left- or right- module, not a linear vector space. On the non-commutativity of the quaternion algebra, many concepts and properties of the classical dynamic equations on time scales (DETS) can not be applied. They should be redefined accordingly. Using $q$-determinant, a novel definition of Wronskian is introduced under the framework of quaternions which is different from the standard one in DETS. Liouville formula for QDETS is also analyzed. Upon these, the solutions to the linear QDETS are established. The Putzer''s algorithms to evaluate the fundamental solution matrix for homogeneous QDETS are presented. Furthermore, the variation of constants formula to solve the nonhomogeneous QDETs is given. Some concrete examples are provided to illustrate the feasibility of the proposed algorithms.