共查询到20条相似文献,搜索用时 625 毫秒
1.
2.
3.
4.
根据块三对角矩阵的特殊分解,给出了求解块三对角方程组的新算法.该算法含有可以选择的参数矩阵,适当选择这些参数矩阵,可以使得计算精度较著名的追赶法高,甚至当追赶法失效时,由该算法仍可得到一定精度的解. 相似文献
5.
三对角对称正定矩阵的一类反问题 总被引:2,自引:0,他引:2
§1.引言文[1]、[2]分别研究了对称正定阵和一类三对角 Stieltjes 阵的反问题,并分别给出了这两类反问题解存在的充要条件及解的通式,从[1][2]中知道,研究矩阵反问题,重要的一步是探求反问题求解矩阵类的一般分解形式。本文吸收了[2]中构造矩阵分解的思想,建立了一般三对角对称正定阵的矩阵分解,得到了这类矩阵反问题解存在的充分必要条件及通解表达式。此外,本文还研究了这类矩阵的一个子类——一般三对角对称 相似文献
6.
讨论了广义周期七对角矩阵的求逆问题,利用七对角矩阵的特殊结构,通过矩阵的广义LU分解,给出了一种求解广义周期七对角逆矩阵的新型算法,该算法不需要对矩阵的各阶顺序主子式做任何限制并且适用于多种计算机代数系统,如:Mathematics,Macsyma,Matlab和Maple等.最后通过算例来说明了算法的有效性。 相似文献
7.
提出了一种求三对角与五对角Toeplitz矩阵逆的快速算法,其思想为先将Toeplitz矩阵扩展为循环矩阵,再快速求循环矩阵的逆,进而运用恰当矩阵分块求原Toeplitz矩阵的逆的算法.算法稳定性较好且复杂度较低.数值例子显示了算法的有效性和稳定性,并指出了算法的适用范围. 相似文献
8.
三对角矩阵计算 总被引:5,自引:0,他引:5
唐达 《高等学校计算数学学报》1997,19(2):97-104
1 引言 在数值计算中,有许多问题最后归结为三对角矩阵的计算,因此研究它们的计算方法是有意义的。此外,有些三对角阵的计算方法可以做为带状阵计算的借鉴。 本文讨论三对角线性方程组的解耦算法,矩阵的LR~(-1)分解,求行列式,Jacobi矩阵的特征值与特征向量的关系以及三对角阵求逆等方面的问题,与现有的算法比较,本文的算法具有计算量或存贮量较少,或计算精度较高,或编程较简单等某些特点。 设A为n阶非奇实三对角阵: 相似文献
9.
1引言 三对角矩阵出现在很多应用中,例如,在求解常系数微分方程的比值问题,三次样条插值等应用中都会遇到三对角矩阵.因此这类矩阵非常重要,而且也有很多学者致力于这类矩阵的研究.在一些应用中,比如估计条件数和构造稀疏近似逆预条件子,需要计算三对角矩阵的逆,或者估计其逆元素的界.文献[1-7]给出了关于三对角矩阵逆的一些很好的结果,但是,这些结果大都建立在矩阵对角占优的条件之下,这限制了他们的应用.在本文中,我们给出一种一般三对角矩阵逆元素的估计办法. 相似文献
10.
11.
给定矩阵X和B,利用矩阵的广义奇异值分解,得到了矩阵方程X~HAX=B有Hermite-广义反Hamiton解的充分必要条件及有解时解的—般表达式.用S_E表示此矩阵方程的解集合,证明了S_E中存在唯一的矩阵(?),使得(?)与给定矩阵A的差的Frobenius范数最小,并且给出了矩阵(?)的表达式;同时也证明了S_E中存在唯一的矩阵A_o,使得A_o是此矩阵方程的极小Frobenius范数Hermite-广义反Hamilton解,并且给出了矩阵A_o的表达式. 相似文献
12.
利用四元数矩阵的广义Frobenius范数和弱圈积,建立一个关于四元数矩阵的实函数并简洁表征其极小值.再用四元数矩阵的奇异值分解和广义Frobenius范数的性质,讨论四元数矩阵方程组[AX,XB]=[C,D]的最小二乘解,得到了解的具体表达式.最后在该方程组的解集合中导出了与给定矩阵的最佳逼近解的表达式. 相似文献
13.
I. B. Yadykin 《Doklady Mathematics》2016,93(3):344-347
A new approach to solving discrete Lyapunov matrix algebraic equations is based on methods for spectral decomposition of their solutions. Assuming that all eigenvalues of the matrices on the left-hand side of the equation lie inside the unit disk, it is shown that the matrix of the solution to the equation can be calculated as a finite sum of matrix bilinear quadratic forms made up by products of Faddeev matrices obtained by decomposing the resolvents of the matrices of the Lyapunov equation. For a linear autonomous stochastic discrete dynamic system, analytical expressions are obtained for the decomposition of the asymptotic variance matrix of system’s states. 相似文献
14.
一个矩阵称为稳定的,如果这个矩阵的特征值全包含在单位开圆盘内.利用Parker关于复方阵的分解定理给出了稳定矩阵分解定理的一个简单证明,并对奇异值全部严格小于1的矩阵给出了类似的结论. 相似文献
15.
Qiu Yuyang Qiu Chunhan 《高校应用数学学报(英文版)》2007,22(4):441-448
The matrix equation AXB = E with the constraint PX=sXP is considered,where P is a given Hermitian matrix satisfying p~2=I and s=±1.By an eigenvalue decomposition of P,the constrained problem can be equivalently transformed to a well-known unconstrained problem of matrix equation whose coefficient matrices contain the corresponding eigenvector, and hence the constrained problem can be solved in terms of the eigenvectors of P.A simple and eigenvector-free formula of the general solutions to the constrained problem by generalized inverses of the coefficient matrices A and B is presented.Moreover,a similar problem of the matrix equation with generalized constraint is discussed. 相似文献
16.
Yury J. Ionin 《Discrete Mathematics》2006,306(14):1557-1568
The first infinite families of symmetric designs were obtained from finite projective geometries, Hadamard matrices, and difference sets. In this paper we describe two general methods of constructing symmetric designs that give rise to the parameters of all other known infinite families of symmetric designs. The method of global decomposition produces an incidence matrix of a symmetric design as a block matrix with each block being a zero matrix or an incidence matrix of a smaller symmetric design. The method of local decomposition represents incidence matrices of a residual and a derived design of a symmetric design as block matrices with each block being a zero matrix or an incidence matrix of a smaller residual or derived design, respectively. 相似文献
17.
The Metapositive Definite Self-Conjugate Solution of the Matrix Equation AXB=C over a Skew Field 总被引:2,自引:0,他引:2
TheMetapositiveDefiniteSelf-ConjugateSolutionoftheMatrixEquationAXB=Cover a Skew FieldWangQingwen(王卿文)(DepartmentofMath.,Chan... 相似文献
18.
Takagi’s decomposition is an analog (for complex symmetric matrices and for unitary similarities replaced by unitary congruences)
of the eigenvalue decomposition of Hermitian matrices. It is shown that, if a complex matrix is not only symmetric but is
also unitary, then its Takagi decomposition can be found by quadratic radicals, that is, by means of a finite algorithm that
involves arithmetic operations and quadratic radicals. A similar fact is valid for the eigenvalue decomposition of reflections,
which are Hermitian unitary matrices. 相似文献
19.
导出了对角因子分块循环矩阵的概念,把循环矩阵的对角化和谱分解推广到具有对角因子循环结构的分块矩阵中去. 相似文献
20.
A new class of so called S-matrices is introduced which allows investigating links between various known classes of matrices such as Vandermonde matrices, Hankel matrices, companion matrices, etc. For complex S-matrices, the problem of decomposition into a quasidirect sum (a sum for which the sum of the ranks of the summands equals the rank of the given matrix) of indecomposable complex S-matrices is completely solved, and the uniqueness of such a decomposition is proved. 相似文献