共查询到19条相似文献,搜索用时 93 毫秒
1.
2.
研究了Sylvester矩阵方程最小二乘解以及极小范数最小二乘解的迭代解法,首先利用递阶辨识原理,得到了求解矩阵方程AX+YB=C的极小范数最小二乘解的一种迭代算法,进而,将这种算法推广到一般线性矩阵方程A_iX_iB_i=C的情形,最后,数值例子验证了算法的有效性. 相似文献
3.
Toeplitz矩阵乘Vandermonde矩阵的快速算法 总被引:1,自引:0,他引:1
李磊 《数学的实践与认识》1988,(2)
本文给出计算中应用较多的T阵乘V阵的快速方法,该算法需要O(N~2)次算术运算,较已有的算法的复杂性上界都要低。 相似文献
4.
5.
6.
设 M( G)是简单无向图 G的关联矩阵 ,A是 M( G)的可逆子矩阵 ,γ( A)是逆矩阵 A- 1中非零元素的个数 .获得了求逆矩阵 A- 1的一种图论方法 ,并且得到了γ( A)的精确上下界以及达到上下界时子矩阵 A的图论刻划 相似文献
7.
复合载荷作用下带边缘大波纹膜片的非线性弯曲 总被引:6,自引:1,他引:5
采用轴对称旋转壳体的简化Reissuer方程,研究了在复合载荷作用下具有硬中心的带边缘大波纹膜片的非线性弯曲问题。应用格林函数方法,将波纹膜片的非线性边值问题化为非线性积分方程进行求解。为了求解积分方程并防止发散,引人一个插值参数到选代格式中。计算表明,当载荷很小时,任何插值参数值均能保证迭代的收敛性,取插值参数值接近或等于1获得较快的收敛速度;而当载荷较大时,插值参数值不能取得过大。绘出了不同载荷组合下波纹膜片的特征曲线,得到的特征曲线可供设计参考。由于均布压力和中心集中载荷的共同作用,将产生比均布压力单独作用更大的挠度。提出的解决方法适应于任意轴向截面的波纹壳体。 相似文献
8.
给出了求最短路线问题的直接解法,利用矩阵的循环移位变换,构造集合的笛卡儿积,把所有可能的路线看成是始点集合与终点集合的笛卡儿积的子集.把距离定义为笛卡儿积上的函数,结合Matlab软件,列出由始点到终点的所有路线,并计算出对应的距离,进而求出最短路线和最短距离.所给程序可以作为模型推广应用到同类问题的求解中. 相似文献
9.
通过矩阵方法可求一类由常系数线性递推公式所确定的数列的极限.实例演示其递推公式形如xn 1=pxn qxn-1(p,q为非零常数)和xn 1=caxxnn db(c≠0,且ad≠bc)的两类数列{xn}的极限的求法. 相似文献
10.
一类矩阵方程的简便解法胡安民(连云港职业大学)对于系数矩阵可逆的矩阵方程AX=B,XA=B及AXB=C,一般线性代数教材中讲述求解方法时通常分两步进行:首先求系数矩阵A的逆阵A-1,再用A-1与B相采得解(对于解AXB=C则需先求出A-1,B-1,再... 相似文献
11.
Despite the fact that symmetric Toeplitz matrices can have arbitrary eigenvalues, the numerical construction of such a matrix having prescribed eigenvalues remains to be a challenge. A two-step method using the continuation idea is proposed in this paper. The first step constructs a centro-symmetric Jacobi matrix with the prescribed eigenvalues in finitely many steps. The second step uses the Cayley transform to integrate flows in the linear subspace of skew-symmetric and centro-symmetric matrices. No special geometric integrators are needed. The convergence analysis is illustrated for the case of n = 3. Numerical examples are presented. 相似文献
12.
13.
14.
Djalil Chafaï 《Journal of Theoretical Probability》2010,23(4):945-950
Let (X jk )j,k≥1 be an infinite array of i.i.d. complex random variables with mean 0 and variance 1. Let λ n,1,…,λ n,n be the eigenvalues of \((\frac{1}{\sqrt{n}}X_{jk})_{1\leqslant j,k\leqslant n}\). The strong circular law theorem states that, with probability one, the empirical spectral distribution \(\frac{1}{n}(\delta _{\lambda _{n,1}}+\cdots+\delta _{\lambda _{n,n}})\) converges weakly as n→∞ to the uniform law over the unit disc {z∈?,|z|≤1}. In this short paper, we provide an elementary argument that allows us to add a deterministic matrix M to (X jk )1≤ j,k ≤ n provided that Tr(MM *)=O(n 2) and rank(M)=O(n α ) with α<1. Conveniently, the argument is similar to the one used for the noncentral version of the Wigner and Marchenko–Pastur theorems. 相似文献
15.
We prove that if a circular arc has angle short enough, then it can be continuously moved to any prescribed position within a set of arbitrarily small area. 相似文献
16.
修正迭代法在波纹圆板非线性振动问题中的应用 总被引:1,自引:0,他引:1
在本文中,我们将修正迭代法成功地推广运用于全波纹圆板的非线性振动问题的研究,获得了全波纹圆板的非线性振频和振幅的解析关系式.本文还讨论了波纹圆板的几何参量对其振动特性的影响,本文结果对精密仪器弹性元件的设计具有一定的实际意义. 相似文献
17.
18.
19.
This paper focuses on the generalized arc routing problem. This problem is stated on an undirected graph in which some clusters are defined as pairwise-disjoint connected subgraphs, and a route is sought that traverses at least one edge of each cluster. Broadly speaking, the generalized arc routing problem is the arc routing counterpart of the generalized traveling salesman problem, where the set of vertices of a given graph is partitioned into clusters and a route is sought that visits at least one vertex of each cluster. A mathematical programming formulation that exploits the structure of the problem and uses only binary variables is proposed. Facets and families of valid inequalities are presented for the polyhedron associated with the formulation and the corresponding separation problem studied. The numerical results of a series of computational experiments with an exact branch and cut algorithm are presented and analyzed. 相似文献