Zobrazeno 1 - 10
of 55
pro vyhledávání: '"Andreas Stathopoulos"'
Publikováno v:
SIAM Journal on Scientific Computing. 44:B1096-B1121
In this work, we study probing for the more general problem of computing the trace of a permutation of $A^{-1}$, say $PA^{-1}$. The motivation comes from Lattice QCD where we need to construct "disconnected diagrams" to extract flavor-separated Gener
Publikováno v:
Proceedings of The 39th International Symposium on Lattice Field Theory — PoS(LATTICE2022).
Autor:
Jesse Laeuchli, Andreas Stathopoulos
Publikováno v:
SIAM Journal on Scientific Computing. 42:A1459-A1485
We present extensions to hierarchical probing, a method developed in [A. Stathopoulos, J. Laeuchli, and K. Orginos, SIAM J. Sci. Comput., 35 (2013), pp. S299--S322] to reduce the variance of the Mo...
Publikováno v:
SIAM Journal on Scientific Computing. 41:A2172-A2192
Obtaining high accuracy singular triplets for large sparse matrices is a significant challenge, especially when searching for the smallest triplets. Due to the difficulty and size of these problems...
Publikováno v:
SSRN Electronic Journal.
We document that the currency denomination of the debt of developed country firms is strongly related to the geographical distribution of their sales. On average, a unit increase in the percentage of sales in a country is associated with an equivalen
Autor:
Andreas Stathopoulos
Publikováno v:
Review of Financial Studies. 30:363-415
This paper proposes a two-country model that features time-varying heterogeneity in conditional risk aversion across countries, endogenously arising from the interaction between external habit formation and preference home bias. The model generates h
Publikováno v:
Journal of Computational Physics. 409:109356
Computing the trace of the inverse of large matrices is typically addressed through statistical methods. Deflating out the lowest eigenvectors or singular vectors of the matrix reduces the variance of the trace estimator. This work summarizes our eff
Autor:
Andreas Stathopoulos, Lingfei Wu
Publikováno v:
SIAM Journal on Scientific Computing. 37:S365-S388
The computation of a few singular triplets of large, sparse matrices is a challenging task, especially when the smallest magnitude singular values are needed in high accuracy. Most recent efforts try to address this problem through variations of the
The Lanczos method is one of the standard approaches for computing a few eigenpairs of a large, sparse, symmetric matrix. It is typically used with restarting to avoid unbounded growth of memory and computational requirements. Thick-restart Lanczos i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d91ca476b9557eb380165437716d9195
http://arxiv.org/abs/1711.10128
http://arxiv.org/abs/1711.10128