๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Efficient computation of erfc(x) for large arguments

โœ Scribed by Tellambura, C.; Annamalai, A.

Book ID
114557935
Publisher
IEEE
Year
2000
Tongue
English
Weight
120 KB
Volume
48
Category
Article
ISSN
0090-6778

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Efficient computation of large change mu
Efficient computation of large change multiparameter sensitivity
โœ K. Singhal; J. Vlach; P. R. Bryant ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 580 KB

## Abstract In many applications, a network has to be solved repeatedly while certain element values are changed. The computation is reduced significantly if the network functions are generated in terms of these variable parameters explicitly. This paper presents a method of doing this which requir

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