Abstract
AbstractThe approximation of trace(f(Ω)), where f is a function of a symmetric matrix Ω, can be challenging when Ω is exceedingly large. In such a case even the partial Lanczos decomposition of Ω is computationally demanding and the stochastic method investigated by Bai et al. (J. Comput. Appl. Math. 74:71–89, 1996) is preferred. Moreover, in the last years, a partial global Lanczos method has been shown to reduce CPU time with respect to partial Lanczos decomposition. In this paper we review these techniques, treating them under the unifying theory of measure theory and Gaussian integration. This allows generalizing the stochastic approach, proposing a block version that collects a set of random vectors in a rectangular matrix, in a similar fashion to the partial global Lanczos method. We show that the results of this technique converge quickly to the same approximation provided by Bai et al. (J. Comput. Appl. Math. 74:71–89, 1996), while the block approach can leverage the same computational advantages as the partial global Lanczos. Numerical results for the computation of the Von Neumann entropy of complex networks prove the robustness and efficiency of the proposed block stochastic method.
Funder
Regione Autonoma della Sardegna
Gruppo Nazionale per il Calcolo Scientifico
Ministero dell’Istruzione, dell’Università e della Ricerca
Publisher
Springer Science and Business Media LLC
Reference41 articles.
1. Bai, Z., Fahey, M., Golub, G.: Some large-scale matrix computation problems. J. Comput. Appl. Math. 74, 71–89 (1996)
2. Katok, A., Hasselblatt, B.: Introduction to the Modern Theory of Dynamical Systems, vol. 54. Cambridge University Press, Cambridge (1997)
3. Braustein, S.L., Gosh, S., Severini, S.: The Laplacian of a graph as a density matrix: A basic combinatorial approach to separability of mixed states. Ann. Comb. 10, 291–317 (2006)
4. Anand, K., Bianconi, G.: Entropy measures for networks: Toward an information theory of complex topologies. Phys. Rev. E 80–045102 (2009)
5. Anand, K., Bianconi, G., Severini, S.: Shannon and von Neumann entropy of random networks with heterogeneous expected degree. Phys. Rev. E 83–036109 (2020)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献