共查询到20条相似文献，搜索用时 15 毫秒
1.
将对角占优矩阵的性质与矩阵的直积结合起来,给出了两矩阵的直积是对角占优矩阵的一些充分和必要条件,推广了近期的一些结果.最后用相应的数值例子说明了所得结果的有效性. 相似文献
2.
3.
利用矩阵的Kronecker积定义了一种矩阵乘积"*积",并且对这种乘积的性质进行了研究,发现它对于任意两个矩阵都有意义而且具有通常矩阵乘积的所有性质,并且在一些特殊情况下它比通常的矩阵乘积更和谐对称,而且当在"合适维数"下它就是通常的矩阵乘积,所以可以把这种"*积"看作是对通常矩阵乘积的推广. 相似文献
4.
为了构造适应于复杂的矩阵计算的程序,在分块矩阵与Kronecker积的基础上提出一类新的矩阵运算方式,称之为矩阵的分块Kronecker积.首先研究了这种运算的性质及计算机实现的过程,进一步讨论了的这类运算在实际中的应用,最后提出进一步可研究的问题. 相似文献
5.
6.
Daniel Kressner Kathryn Lund Stefano Massei Davide Palitta 《Numerical Linear Algebra with Applications》2021,28(1)
Block Krylov subspace methods (KSMs) comprise building blocks in many state‐of‐the‐art solvers for large‐scale matrix equations as they arise, for example, from the discretization of partial differential equations. While extended and rational block Krylov subspace methods provide a major reduction in iteration counts over polynomial block KSMs, they also require reliable solvers for the coefficient matrices, and these solvers are often iterative methods themselves. It is not hard to devise scenarios in which the available memory, and consequently the dimension of the Krylov subspace, is limited. In such scenarios for linear systems and eigenvalue problems, restarting is a well‐explored technique for mitigating memory constraints. In this work, such restarting techniques are applied to polynomial KSMs for matrix equations with a compression step to control the growing rank of the residual. An error analysis is also performed, leading to heuristics for dynamically adjusting the basis size in each restart cycle. A panel of numerical experiments demonstrates the effectiveness of the new method with respect to extended block KSMs. 相似文献
7.
Lei Hu 《应用数学学报(英文版)》2006,22(1):1-8
Kronecker sequences constructed from short sequences are good sequences for spread spectrum communication systems. In this paper we study a similar problem for two-dimensional arrays, and we determine the linear complexity of the Kronecker product of two arrays, Our result shows that similar good property on linear complexity holds for Kronecker product of arrays. 相似文献
8.
讨论矩阵方程sum from k=0 to r( )A~kXB~k=F存在惟一解的充要条件,并给出了两种迭代求解法. 相似文献
9.
研究亚正定矩阵kronecker积的亚正定性,得到了一个充要条件,同时得到Hadamard积亚正定性的一个充要条件. 相似文献
10.
矩阵Kronecker积的推广 总被引：2，自引：0，他引：2
由x,y的p次多项式f(x,y)=∑pi,j=0aijxiyj给出f(x,y)的广义Kronecker积f(A,B)=∑pi,j=0aijAi Bj,得到f(A,B)的特征值的分布,推广了已知的一些结果. 相似文献
11.
12.
Shany Shmueli;Petros Drineas;Haim Avron; 《Numerical Linear Algebra with Applications》2024,31(1):e2528
Models in which the covariance matrix has the structure of a sparse matrix plus a low rank perturbation are ubiquitous in data science applications. It is often desirable for algorithms to take advantage of such structures, avoiding costly matrix computations that often require cubic time and quadratic storage. This is often accomplished by performing operations that maintain such structures, for example, matrix inversion via the Sherman–Morrison–Woodbury formula. In this article, we consider the matrix square root and inverse square root operations. Given a low rank perturbation to a matrix, we argue that a low-rank approximate correction to the (inverse) square root exists. We do so by establishing a geometric decay bound on the true correction's eigenvalues. We then proceed to frame the correction as the solution of an algebraic Riccati equation, and discuss how a low-rank solution to that equation can be computed. We analyze the approximation error incurred when approximately solving the algebraic Riccati equation, providing spectral and Frobenius norm forward and backward error bounds. Finally, we describe several applications of our algorithms, and demonstrate their utility in numerical experiments. 相似文献
13.
关于图的关联矩阵的一个重要的定理是r个结点的连通图G的关联矩阵的秩是r-1.利用一般域上的线性空间理论,给出了无向图的关联矩阵秩的定理证明,该方法结构严谨且利于学生理解和接受. 相似文献
14.
Ming-Huat Lim 《Linear and Multilinear Algebra》2013,61(7):1442-1447
In this note, we give a simple proof as well as an extension of a very recent result of B. Zheng, J. Xu and A. Fosner concerning linear maps between vector spaces of complex square matrices that preserve the rank of tensor products of matrices by using a structure theorem of R. Westwick on linear maps between tensor product spaces that preserve non-zero decomposable elements. 相似文献
15.
A new expression is established for the common solution to six classical linear quaternion matrix equations A 1 X = C 1 , X B 1 = C 3 , A 2 X = C 2 , X B 2 = C 4 , A 3 X B 3 = C 5 , A 4 X B 4 = C 6 which was investigated recently by Wang, Chang and Ning (Q. Wang, H. Chang, Q. Ning, The common solution to six quaternion matrix equations with applications, Appl. Math. Comput. 195: 721-732 (2008)). Formulas are derived for the maximal and minimal ranks of the common solution to this system. Moreover, corresponding results on some special cases are presented. As an application, a necessary and sufficient condition is presented for the invariance of the rank of the general solution to this system. Some known results can be regarded as the special cases of the results in this paper. 相似文献
16.
This work is concerned with the numerical solution of large‐scale linear matrix equations . The most straightforward approach computes from the solution of an mn × mn linear system, typically limiting the feasible values of m,n to a few hundreds at most. Our new approach exploits the fact that X can often be well approximated by a low‐rank matrix. It combines greedy low‐rank techniques with Galerkin projection and preconditioned gradients. In turn, only linear systems of size m × m and n × n need to be solved. Moreover, these linear systems inherit the sparsity of the coefficient matrices, which allows to address linear matrix equations as large as m = n = O(105). Numerical experiments demonstrate that the proposed methods perform well for generalized Lyapunov equations. Even for the case of standard Lyapunov equations, our methods can be advantageous, as we do not need to assume that C has low rank. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
17.
18.
关于随机矩阵Kronecker积的谱半径的不等式 总被引：2，自引：0，他引：2
研究了随机矩阵的Kronecker积的数学期望的性质,得到了随机矩阵的Kronecker积的谱半径的几个不等式. 相似文献
19.
复亚正定矩阵的一些性质 总被引：18，自引：0，他引：18
复亚正定矩阵是正定Ｈｅｒｍｉｔｅ矩阵的推广,本文讨论了这一类矩阵张量积的性质,并将实对称矩阵的Ｓｃｈｕｒ定理、华罗庚定理和Ｍｉｎｋｏｗｓｋｉ不等式推广到较为广泛的复矩阵类． 相似文献
20.
Tatjana von Rosen 《Linear and Multilinear Algebra》2013,61(5):595-606
In this article, we derive explicit expressions for the entries of the inverse of a patterned matrix that is a sum of Kronecker products. This matrix keeps the Kronecker structure under matrix inversion, and it is used, for example, in statistics, in particular in the linear mixed model analysis. The obtained results present new and extended existing algorithms for the inversion of the considered patterned matrices. We also obtain a closed-form inverse in terms of block matrices. 相似文献