A New Method for Computing the Diagonal of a Matrix Inverse

References

• C. Bekas, A. Curioni, I. Fedulova, Low cost high performance uncertainty quantification. WHPCF’09: Proceeding of the 2nd Workshop on High Performance Computational Finance. ACM, pp1–8. New York, USA (2009).
   Google Scholar
• C. Bekas, E. Kokiopoulou, Y. Saad, An estimator for the diagonal of a matrix. Appl Numer Math. Volume 57, pp1214–1229. (2007).
   Google Scholar
• M. Benzi, G. H. Golub, Bounds for the entries of matrix functions with applications to preconditioning. BIT Numer Math. Volume 39, pp417–438. (1999).
   Google Scholar
• M. Ceriotti, T. D. Kühne, M. Parrinello, An efficient and accurate decomposition of the Fermi operator. J Chem Phys. Volume 129, p024707. (2008).
   Google Scholar
• T. F. Chan, T. P. Mathew, The interface probing technique in domain decomposition. SIAM J Matrix Anal Appl. Volume 13, pp212–238. (1992).
   Google Scholar
• E. Chow, A priori sparsity patterns for parallel sparse approximate inverse preconditioners. SIAM J Sci Comput. Volume 21, pp1804–1822. (2000).
   Google Scholar
• T. F. Coleman, J. J. More, Estimation of sparse Jacobian matrices and graph colouring problems. SIAM J Numer Anal. Volume 20, pp187–209. (1983).
   Google Scholar
• A. R. Curtis, M. J. D. Powell, J. K. Reid, On the estimation of sparse Jacobian matrices. J Inst Math Appl. Volume 13, pp117–119. (1974).
   Google Scholar
• I. S. Duff, A. M. Erisman, J. K. Reid, Direct Methods for Sparse Matrices. Oxford University Press. (1986).
   Google Scholar
• J. Freericks, Transport in Multilayered Nanostructures. The Dynamical Mean-field Theory Approach. Imperial College. London (2006).
   Google Scholar
• A. H. Gebremedhin, F. Manne, A. Pothen, What colour is your Jacobian? Graph colouring for computing derivatives. SIAM Rev. Volume 47, pp629–705. (2005).
   Google Scholar
• M. Hutchinson, A stochastic estimator of the trace of the influence matrix for Laplacian smoothing splines. Commun Stat Simul Comput. Volume 19, pp433–450. (1990).
   Google Scholar
• S. Li, S. Ahmed, G. Klimeck, E. Darve, Computing entries of the inverse of a sparse matrix using the find algorithm. J Comput Phys. Volume 227, pp9408–9427. (2008).
   Google Scholar
• L. Lin, J. Lu, R. Car, W. E, Multipole representation of the Fermi operator with application to the electronic structure analysis of metallic systems. Phys Rev B (Condensed Matter and Materials Physics). Volume 79, pp115–133. (2009).
   Google Scholar
• L. Lin, J. Lu, L. Ying, R. Car, W. E, Fast algorithm for extracting the diagonal of the inverse matrix with application to the electronic structure analysis of metallic systems. Commun Math Sci. Volume 7, pp755–777. (2009).
   Google Scholar
• G. Meurant, A review on the inverse of symmetric tridiagonal and block tridiagonal matrices. SIAM J Matrix Anal Appl. Volume 13, pp707–728. (1992).
   Google Scholar
• C. Rasmussen, C. Williams, Gaussian Processes for Machine Learning. MIT Press. Cambridge, MA (2006).
   Google Scholar
• Y. Saad, Iterative Methods for Sparse Linear Systems. SIAM. Philadelphia, PA, USA (2003). (Second edition).
   Google Scholar
• Y. Saad, M. H. Schultz, GMRES: a generalised minimal residual algorithm for solving nonsymmetric linear systems. SIAM J Sci Stat Comput. Volume 7, pp856–859. (1986).
   Google Scholar
• K. Schmitt, M. Anitescu, D. Negrut, Efficient sampling for spatial uncertainty quantification in multibody system dynamics applications. Int J Numer Meth Eng. Volume 80, pp537–564. (2009).
   Google Scholar
• R. B. Sidje, Y. Saad, Rational approximation to the Fermi-dirac function with applications in density functional theory. Tech Rep umsi-2008–279. Minnesota Supercomputer Institute, University of Minnesota. (2008).
   Google Scholar
• C. Siefert, E. de Sturler, Probing methods for saddle-point problems. Elec Trans Numer Anal. Volume 22, pp163–183. (2006).
   Google Scholar
• W. P. Tang, Toward an effective sparse approximate inverse preconditioner, SIAM J. Matrix Anal Appl. Volume 20, pp970–986. (1999).
   Google Scholar