Exportar Publicação

A publicação pode ser exportada nos seguintes formatos: referência da APA (American Psychological Association), referência do IEEE (Institute of Electrical and Electronics Engineers), BibTeX e RIS.

Exportar Referência (APA)
Acebron, J. A., Herrero, J. R. & Monteiro, J. (2020). A highly parallel algorithm for computing the action of a matrix exponential on a vector based on a multilevel Monte Carlo method. Computers and Mathematics with Applications. 79 (12), 3495-3515
Exportar Referência (IEEE)
J. A. Torres et al.,  "A highly parallel algorithm for computing the action of a matrix exponential on a vector based on a multilevel Monte Carlo method", in Computers and Mathematics with Applications, vol. 79, no. 12, pp. 3495-3515, 2020
Exportar BibTeX
@article{torres2020_1714726173052,
	author = "Acebron, J. A. and Herrero, J. R. and Monteiro, J.",
	title = "A highly parallel algorithm for computing the action of a matrix exponential on a vector based on a multilevel Monte Carlo method",
	journal = "Computers and Mathematics with Applications",
	year = "2020",
	volume = "79",
	number = "12",
	doi = "10.1016/j.camwa.2020.02.013",
	pages = "3495-3515",
	url = "https://www.sciencedirect.com/science/article/pii/S0898122120300808"
}
Exportar RIS
TY  - JOUR
TI  - A highly parallel algorithm for computing the action of a matrix exponential on a vector based on a multilevel Monte Carlo method
T2  - Computers and Mathematics with Applications
VL  - 79
IS  - 12
AU  - Acebron, J. A.
AU  - Herrero, J. R.
AU  - Monteiro, J.
PY  - 2020
SP  - 3495-3515
SN  - 0898-1221
DO  - 10.1016/j.camwa.2020.02.013
UR  - https://www.sciencedirect.com/science/article/pii/S0898122120300808
AB  - A novel algorithm for computing the action of a matrix exponential over a vector is proposed. The algorithm is based on a multilevel Monte Carlo method, and the vector solution is computed probabilistically generating suitable random paths which evolve through the indices of the matrix according to a suitable probability law. The computational complexity is proved in this paper to be significantly better than the classical Monte Carlo method, which allows the computation of much more accurate solutions. Furthermore, the positive features of the algorithm in terms of parallelism were exploited in practice to develop a highly scalable implementation capable of solving some test problems very efficiently using high performance supercomputers equipped with a large number of cores. For the specific case of shared memory architectures the performance of the algorithm was compared with the results obtained using an available Krylov-based algorithm, outperforming the latter in all benchmarks analyzed so far. 
ER  -