In this paper we compare Krylov subspace methods with Chebyshev series expansion for approximating the matrix exponential operator on large, sparse, symmetric matrices. Experimental results upon negative-definite matrices with very large size, arising from (2D and 3D) FE and FD spatial discretizatio
A computational technique-for the efficient handling of large matrices
β Scribed by C. J. Bates
- Publisher
- John Wiley and Sons
- Year
- 1973
- Tongue
- English
- Weight
- 362 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0029-5981
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In self-consistent field (SCF) calculations the construction of the Fock matrix is most time-consuming step. The Fock matrix construction may formally be seen as a matrix-vector multiplication, where the matrix is the supermatrix, Tikl, and the vector is the first-order density matrix, yi. This form
A new algorithm is presented for the computation of canonical forms of matrices over fields. These are the Primary Rational, Rational, and Jordan canonical forms. The algorithm works by obtaining a decomposition of the vector space acted on by the given matrix into primary cyclic spaces (spaces whos
Dimensionless ratios of various moments of conformation-dependent physical properties play an important role in the evaluation of the behavior of chain molecules. For example, the correlation coefficient, pxr, between two conformation-dependent physical properties, denoted here as x and y, is determ