𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient Computation and Representation of Large Reachability Sets for Composed Automata

✍ Scribed by Peter Buchholz; Peter Kemper

Book ID
110340143
Publisher
Springer
Year
2002
Tongue
English
Weight
401 KB
Volume
12
Category
Article
ISSN
0924-6703

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Efficient computation of the exponential
Efficient computation of the exponential operator for large, sparse, symmetric matrices
✍ Luca Bergamaschi; Marco Vianello πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 261 KB πŸ‘ 2 views

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