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
β¦ LIBER β¦
Minimization of the number of arithmetic operations in problems with sparse symmetric matrices
β Scribed by N.D. Sergeev
- Publisher
- Elsevier Science
- Year
- 1976
- Weight
- 870 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0041-5553
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Efficient computation of the exponential
β
Luca Bergamaschi; Marco Vianello
π
Article
π
2000
π
John Wiley and Sons
π
English
β 261 KB
π 2 views
The entropy change of fuzzy numbers with
β
Wen-June Wang; Chih-Hui Chiu
π
Article
π
2000
π
Elsevier Science
π
English
β 117 KB
Manzur and Hamed (M-H) algorithm for res
β
M.Ali Ajiz; M.Mustafa Hamed
π
Article
π
1996
π
Elsevier Science
π
English
β 907 KB
Minimizing the number of tardy jobs in m
β
GΓΌrsel A. SΓΌer
π
Article
π
1997
π
Elsevier Science
π
English
β 321 KB
Mayag~Β’z, PR 00681-5000 ## #bstract Cellular Manufacturing is gaining more acceptance in the indnst~. The Im'fommnce of a cellular manufacturing system can be further improved by addressing planning issues as well. The objective of this paper is to minimize the number of tsrdy jobs in a multi-par
A heuristic algorithm to minimize the nu
β
Jae D. Hong; M.Jeya Chandra
π
Article
π
1990
π
Elsevier Science
π
English
β 613 KB
Minimizing the weighted number of tardy
β
B.M.T. Lin; T.C.E. Cheng
π
Article
π
1999
π
Elsevier Science
π
English
β 216 KB