A probing method for computing the diagonal of a matrix inverse
By Jok Man Tang, Y. Saad. 2012
134 citations recorded by the source corpus.
Subfields: Atomic and Molecular Physics, and Optics, Computational Theory and Mathematics, Numerical Analysis
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Atomic and Molecular Physics, and Optics
In Computational Theory and Mathematics
In Numerical Analysis
Citations in the corpus
- Determinantal Point Processes for Machine Learning (2012, background): “It is conceivable that a faster algorithm exists for computing the diagonal of K(X;θ) directly, along the lines of ideas recently proposed by [144] (which focus on sparse matrices); however, we are not currently aware of a useful improvement over Algorithm 4.”
- Approximating Spectral Densities of Large Matrices (2013, unknown): “ynomials, to alternative ways in which the traces can be estimated. A common solution to the problem of estimating Trace(Tk(A)) is to use a stochastic argument as suggested in [50] and, e.g., also in [29, 53]. This entails generating a large number of random vectors v(1) 0 ,v (2) 0 ,··· ,v (n vec) 0”