块C-特征向量块线性无关的等价表征

引进了块复合矩阵的块C-特征值、块C-特征向量的概念,给出了块C-特征向量块线性无关的等价表征,并由此讨论了块复合幂零矩阵的性质,给出了这类矩阵的块C-特征向量块线性相关的等价表征.     

On modified block SSOR iteration methods for linear systems from steady incompressible viscous flow problems

In order to solve the large sparse systems of linear equations arising from numerical solutions of two-dimensional steady incompressible viscous flow problems in primitive variable formulation, we present block SSOR and modified block SSOR iteration methods based on the special structures of the coefficient matrices. In each step of the block SSOR iteration, we employ the block LU factorization to solve the sub-systems of linear equations. We show that the block LU factorization is existent and stable when the coefficient matrices are block diagonally dominant of type-II by columns. Under suitable conditions, we establish convergence theorems for both block SSOR and modified block SSOR iteration methods. In addition, the block SSOR iteration and AF-ADI method are considered as preconditioners for the nonsymmetric systems of linear equations. Numerical experiments show that both block SSOR and modified block SSOR iterations are feasible iterative solvers and they are also effective for preconditioning Krylov subspace methods such as GMRES and BiCGSTAB when used to solve this class of systems of linear equations.     

块AOR迭代法的收敛性

本文推广了解线性方程组的AOR迭代法,给出了块AOR迭代法(BAOR迭代法).文中引进了块M-矩阵,块H-矩阵,块严格对角优势矩阵,块Hermite正定矩阵,块相容次序矩阵和广义块相容次序矩阵等概念.在线性方程组的系数矩阵分别具有上述性质的假设下,讨论了BAOR迭代法的敛散性.     

Dealing with linear dependence during the iterations of the restarted block Lanczos methods

The Lanczos method can be generalized to block form to compute multiple eigenvalues without the need of any deflation techniques. The block Lanczos method reduces a general sparse symmetric matrix to a block tridiagonal matrix via a Gram–Schmidt process. During the iterations of the block Lanczos method an off-diagonal block of the block tridiagonal matrix may become singular, implying that the new set of Lanczos vectors are linearly dependent on the previously generated vectors. Unlike the single vector Lanczos method, this occurrence of linearly dependent vectors may not imply an invariant subspace has been computed. This difficulty of a singular off-diagonal block is easily overcome in non-restarted block Lanczos methods, see [12,30]. The same schemes applied in non-restarted block Lanczos methods can also be applied in restarted block Lanczos methods. This allows the largest possible subspace to be built before restarting. However, in some cases a modification of the restart vectors is required or a singular block will continue to reoccur. In this paper we examine the different schemes mentioned in [12,30] for overcoming a singular block for the restarted block Lanczos methods, namely the restarted method reported in [12] and the Implicitly Restarted Block Lanczos (IRBL) method developed by Baglama et al. [3]. Numerical examples are presented to illustrate the different strategies discussed.     

A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit

We consider the block orthogonal multi-matching pursuit(BOMMP) algorithm for the recovery of block sparse signals.A sharp condition is obtained for the exact reconstruction of block K-sparse signals via the BOMMP algorithm in the noiseless case,based on the block restricted isometry constant(block-RIC).Moreover,we show that the sharp condition combining with an extra condition on the minimum l_2 norm of nonzero blocks of block K-sparse signals is sufficient to ensure the BOMMP algorithm selects at least one true block index at each iteration until all true block indices are selected in the noisy case.The significance of the results we obtain in this paper lies in the fact that making explicit use of block sparsity of block sparse signals can achieve better recovery performance than ignoring the additional structure in the problem as being in the conventional sense.     

对角因子分块循环矩阵的对角化和谱分解

导出了对角因子分块循环矩阵的概念，把循环矩阵的对角化和谱分解推广到具有对角因子循环结构的分块矩阵中去．     

A variant of block incomplete factorization preconditioners for a symmetricH-matrix

We propose a variant of parallel block incomplete factorization preconditioners for a symmetric block-tridiagonalH-matrix. Theoretical properties of these block preconditioners are compared with those of block incomplete factorization preconditioners for the corresponding comparison matrix. Numerical results of the preconditioned CG(PCG) method using these block preconditioners are compared with those of PCG using other types of block incomplete factorization preconditioners. Lastly, parallel computations of the block incomplete factorization preconditioners are carried out on the Cray C90.     

块H－矩阵的进一步推广

对Ｎａｂｂｅｎ［２］提出的块Ｈ－矩阵做进一步推广，使得非对角块矩阵不必是Ｈｅｒｍｉｔｅ矩阵．但仍保留其基本特征不变．对块Ｈ－矩阵提出块Ｈ－分裂及块相容Ｈ－分裂．证明了矩阵的任意块相容Ｈ－分裂都是收敛分裂．对ＪＯＲ迭代法给出松驰参数的上界．     

块H-矩阵与块矩阵的谱

利用G-函数概念研究块H-矩阵,引入若干块矩阵概念。获得了块H-矩阵的等价刻划,得到了一般块矩阵特征值的由G-函数描述的分布域,由于用G-函数刻划,所获结果具有一般性。     

An Automatic Procedure for Updating the Block Size in the Block Conjugate Gradient Method for Solving Linear Systems

The paper considers the problem of constructing an efficient automatic procedure for reducing the block size in the block conjugate gradient method insuring that the resulting rate of convergence is comparable with that of the block conjugate gradient method with constant block size. The numerical results provided show that, independently of the type of distribution of the smallest eigenvalues of the preconditioned matrix, the procedure suggested always leads to a decrease of the arithmetic costs with respect to those of the block method with constant block size. Bibliography: 8 titles.     

TWO ALGORITHMS FOR SYMMETRIC LINEAR SYSTEMS WITH MULTIPLE RIGHT-HAND SIDES

1　ＩｎｔｒｏｄｕｃｔｉｏｎＩｎｍａｎｙａｐｐｌｉｃａｔｉｏｎｓｗｅｎｅｅｄｔｏｓｏｌｖｅｍｕｌｔｉｐｌｅｓｙｓｔｅｍｓｏｆｌｉｎｅａｒｅｑｕａｔｉｏｎｓＡｘ(ｉ) =ｂ(ｉ) ,ｉ=1,… ,ｓ (1)ｗｉｔｈｔｈｅｓａｍｅｎ×ｎｒｅａｌｓｙｍｍｅｔｒｉｃｃｏｅｆｆｉｃｉｅｎｔｍａｔｒｉｘＡ ,ｂｕｔｓｄｉｆｆｅｒｅｎｔｒｉｇｈｔ ｈａｎｄｓｉｄｅｓｂ(ｉ) (ｉ=1,… ,ｓ) .Ｉｆａｌｌｏｆｔｈｅｒｉｇｈｔ ｈａｎｄｓｉｄｅｓａｒｅａｖａｉｌａｂｌｅｓｉｍｕｌｔａｎｅｏｕｓｌｙ ,ｔｈｅｎｔｈｅｓｅｓｌｉｎｅａｒｓｙｓｔｅ…     

分块矩阵g-逆的块独立性

本文研究分块矩阵g-逆的块独立性,得到两个和三个复矩阵块独立的充分 必要条件,并揭示了不同定义下的块独立性定义之间的联系.     

块对角占优性的推广与特征值分布

本文引入了若干矩阵块对角占优性概念，并利用Ｎｏｗｏｓａｄ和Ｈｏｆｆｍａｎ提出的Ｇ－ｂｉｂ ｏｖｔ ｓｖ。     

混合区组试验的设计与分析

本文设计了一种混合区组试验，这种试验是在试验环境的一个方向上采用随机区组设计，在另一个方向上采用平衡不完全区组设计，从而可以控制两个方向上的环境差异，适用于不能安排拉丁方设计和３义向随机区组设计的试验，其精确度相当于拉丁方试验的精确度。本文通过实例分析说明了混合区组试验设计具有较高的实用价值。     

Block Squares

A block square is a certain 1–block design. We show that there are exactly two block squares in which each block consists of 5 elements and each element is contained in 6 blocks.     

Block Eigenvalues of block compound matrices

We obtain some results about the block eigenvalues of block compound matrices and additive block compound matrices. Assuming that a certain block Vandermonde matrix is nonsingular, we generalize known results for (scalar) compound and additive compound matrices.     

块Toeplitz方程组的快速块Gauss-Seidel迭代算法

本文研究块Toeplitz方程组的块Gauss-Seidel迭代算法。我们首先讨论了块三角Toeplitz矩阵的一些性质,然后给出了求解块三角Toeplitz矩阵逆的快速算法,由此而得到了求解块Toeplitz方程组的快速块Gauss-Seidel迭代算法,最后证明了当系数矩阵为对称正定和H-矩阵时该方法都收敛,数值例子验证了方法的收敛性。     

Generalized qd algorithm for block band matrices

The generalized qd algorithm for block band matrices is an extension of the block qd algorithm applied to a block tridiagonal matrix. This algorithm is applied to a positive definite symmetric block band matrix. The result concerning the behavior of the eigenvalues of the first and the last diagonal block of the matrix containing the entries q ^(k) which was obtained in the tridiagonal case is still valid for positive definite symmetric block band matrices. The eigenvalues of the first block constitute strictly increasing sequences and those of the last block constitute strictly decreasing sequences. The theorem of convergence, given in Draux and Sadik (Appl Numer Math 60:1300?C1308, 2010), also remains valid in this more general case.     

A class of asynchronous multisplitting two-stage iterations for large sparse block systems of weakly nonlinear equations

For the block system of weakly nonlinear equations Ax=G(x), where is a large sparse block matrix and is a block nonlinear mapping having certain smoothness properties, we present a class of asynchronous parallel multisplitting block two-stage iteration methods in this paper. These methods are actually the block variants and generalizations of the asynchronous multisplitting two-stage iteration methods studied by Bai and Huang (Journal of Computational and Applied Mathematics 93(1) (1998) 13–33), and they can achieve high parallel efficiency of the multiprocessor system, especially, when there is load imbalance. Under quite general conditions that is a block H-matrix of different types and is a block P-bounded mapping, we establish convergence theories of these asynchronous multisplitting block two-stage iteration methods. Numerical computations show that these new methods are very efficient for solving the block system of weakly nonlinear equations in the asynchronous parallel computing environment.     

Simple block patterns for the two-dimensional cutting problem

This paper presents an algorithm for the unconstrained two-dimensional cutting problem of rectangular pieces. It proposes the simple block (SB) pattern consisting of simple blocks. The SB pattern is defined recursively. Each cut on the stock plate produces just one simple block. A horizontal cut produces a horizontal block with width equal to that of the leftmost piece in the block. A vertical cut produces a vertical block with length equal to that of the bottommost piece in the block. The algorithm generates the optimal SB pattern recursively, and selects optimally the first piece in each block. It uses upper bound to prune some unpromising branches during the searching process. The computational results indicate that the algorithm is highly efficient in improving material utilization, and the computation time is reasonable.