【摘 要】
：
In this paper we expound the principle why the Lanczos procedure of a matrix canbe accurately performed by symbolic computation and give the uses of the accuratelanczos procedure in obtaining the inva
论文部分内容阅读
In this paper we expound the principle why the Lanczos procedure of a matrix canbe accurately performed by symbolic computation and give the uses of the accuratelanczos procedure in obtaining the invariant factors of a matrix and solving the matrixequa
其他文献
Hadamard matrix is widely applied in digital image processing, encoding theory,digital communication, multiple bits diffusion code, block design and etc. Production ofHadamard matrix with 2k has been
The Samelson inverse mains Pade approximation (SMPA) is introduced in [3]. Bymeans of Samelson invrese for matrices, s-algorithm and n-algorithm, which are used asthe computation for SMPA, are establi
Based on discussing the method of accelerating the convergence of infinite sequences,the study on the method for numerical inversion of Laplace transforms has been made.A new method of numerical inver
In this paper, a branch and bound algorithm for solving mixed 0-1 linear programming problem is presented and the effectiveness of the algorithm is illustrated bycomputation examples.
In this paper, we present a nine-point difference scheme for two-dimensional equa- tions of heat conduction with three-temperature. Finally, the calculated result arecompared with the five-point schem
This paper is concerned with testing 0, 1 digital sequence for its randomness. Itsprobability model is set up and probability distribution law is deduced. Based on them,the multiple XOR method for tes
Based on the algorithms which was presented by Li Shou-fo and Gan Si-qing[1],a class of parallel algorithms for initial value problems in DDEs is constructed. Thenumerical results show the effectivene
In this paper the analyses of various numerical results are given, which involve theacceleration efficiency and convergence behavior of both ILU (k) preconditioners andKrylov subspace methods for solv
In this paper, an algorithm for computing near-centers of a nearly round body inany dimension is shown. The algorithm generalizes a recent result [2]. It is quite simpleand needs only d "parallel" pro
As the parallel version of LAPACK, ScaLAPACK will provide convenient and powerful parallel programming platform for parallel computing society. In this paper, wepropose a PVM based ScaLAPACK applicati