Alternatively, working from values rather than coefficients =-=[24]-=-, one can solve an (n + 1) × (n + 1) generalized eigenvalue problem with arrowhead structure [1, 11]. (This approach produces two spurious eigenvalues at ∞ as well as the n − 1 eigenvalues correspondi......
The error analysis suggests that the randomized algorithm is most accurate when the generalized singular values of B^{-1}A B^{-1}A decay rapidly. Finally, we demonstrate the performance of our algorithm on two computationally intensive GHEP problems with rapidly decaying eigenvalues - computing ...
Current truncation schemes require dramatically increasing computational resources at small values of the bare couplings, where magnetic field effects become important. Such limitation precludes one from `taking the continuous limit' while working with finite resources. To overcome this limitation, we ...