A probing method for computing the diagonal of a matrix inverse

Numerical Linear Algebra with Applications

Volumn 19, Issue 3, 2012, Pages 485-501

  Tang, Jok M ^a   Saad, Yousef ^a  

^a University of Minnesota   (United States)

Author keywords

Covariance matrices; Graph theory; Green's functions; Krylov subspace methods; Matrix diagonal extraction; Probing; Sparse approximate inverses

Indexed keywords

EID: 84859712276     PISSN: 10705325     EISSN: 10991506     Source Type: Journal    
DOI: 10.1002/nla.779     Document Type: Article

References (51)

1. Bekas C, Curioni A, Fedulova I, Low cost high performance uncertainty quantification. WHPCF '09: Proceedings of the Second Workshop on High Performance Computational Finance. ACM: New York, NY, U.S.A., 2009; 1-8.
2. Sidje RB, Saad Y, Rational approximation to the Fermi-Dirac function with applications in density functional theory. Technical Report umsi-2008-279, Minnesota Supercomputer Institute, University of Minnesota, 2008.
3. Freericks J, Transport in Multilayered Nanostructures. The Dynamical Mean-field Theory Approach. Imperial College: London, 2006.
4. Golub G, Strakos Z, Estimates in quadratic formulas. Numerical Algorithms 1994; 8: 241-268.
5. Golub GH, Meurant G, Matrices, moments and quadrature. In Numerical Analysis 1993: Proceedings of the 15th Dundee Conference, June-July 1993, Griffiths DF, Watson GA (eds)., Pitman Research Notes in Mathematics Series, vol. 303. Longman Scientific and Technical: Essex, U.K., 1994; 105-156.
6. Hutchinson M, A stochastic estimator of the trace of the influence matrix for Laplacian smoothing splines. Communications in Statistics-Simulation and Computation 1990; 19: 433-450.
7. Golub G, Meurant G, Matrices, Moments and Quadrature with Applications. Princeton University Press: Princeton, NJ, 2009.
8. Drabold DA, Sankey OF, Maximum entropy approach for linear scaling in the electronic structure problem. Physical Review Letters 1993; 70: 3631-3634.
9. Wang LW, Calculating the density of sates and optical-absorption spectra of large quantum systems by the plane-wave moments method. Physical Review B 1994; 49: 10154-10158.
10. Roder H, Silver R, Drabold D, Dong J, The kernel polynomial method for non-orthogonal electronic structure calculation of amorphous diamond. Physical Review B 1997; 55: 15382-15385.
11. Coleman TF, More JJ, Estimation of sparse Jacobian matrices and graph coloring problems. SIAM Journal on Numerical Analysis 1983; 20: 187-209.
12. Coleman TF, Garbow BS, More JJ, Fortran subroutines for estimating sparse Jacobian matrices. ACM Transactions on Mathematical Software 1984; 10: 346-347.
13. Curtis AR, Powell MJD, Reid JK, On the estimation of sparse Jacobian matrices. Journal of the Institute of Mathematics and its Applications 1974; 13: 117-119.
14. Dennis JE, Schnabel RB, Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall: Englewood Cliffs, NJ, 1983.
15. Duff IS, Erisman AM, Reid JK, Direct Methods for Sparse Matrices. Oxford University Press: Oxford, 1986.
16. Takahashi K, Fagan J, Chin M-S, Formation of a sparse bus impedance matrix and its application to short circuit study. Proceedings of the Eighth International PICA Conference, Minneapolis, MN, IEEE Power Engineering Society, 1973; 63-69.
17. Ran R-S, Huang T-Z, An inversion algorithm for a banded matrix. Computers and Mathematics with Applications 2009; 58: 1699-1710.
18. Lin L, Lu J, Ying L, Car R, E W, Fast algorithm for extracting the diagonal of the inverse matrix with application to the electronic structure analysis of metallic systems. Communications in Mathematical Sciences 2009; 7: 755-777.
19. Li S, Ahmed S, Klimeck G, Darve E, Computing entries of the inverse of a sparse matrix using the find algorithm. Journal of Computational Physics 2008; 227: 9408-9427.
20. Benzi M, Golub GH, Bounds for the entries of matrix functions with applications to preconditioning. BIT Numerical Mathematics 1999; 39: 417-438.
21. Bai Z, Fahey M, Golub G, Some large-scale matrix computation problems. Journal of Computational and Applied Mathematics 1996; 74: 71-89.
22. Householder AS, Theory of Matrices in Numerical Analysis. Blaisdell Pub. Co.: Johnson, CO, 1964.
23. Pan V, Reif J, Efficient parallel solution of linear systems. STOC '85: Proceedings of the 17th ACM STOC. ACM: New York, U.S.A., 1985; 143-152.
24. Ceriotti M, Kühne TD, Parrinello M, An efficient and accurate decomposition of the Fermi operator. Journal of Chemical Physics 2008; 129: 024707.
25. Lin L, Lu J, Car R, E W, Multipole representation of the Fermi operator with application to the electronic structure analysis of metallic systems. Physical Review B (Condensed Matter and Materials Physics) 2009; 79: 115-133.
26. Bekas C, Kokiopoulou E, Saad Y, An estimator for the diagonal of a matrix. Applied Numerical Mathematics 2007; 57: 1214-1229.
27. Chow E, A priori sparsity patterns for parallel sparse approximate inverse preconditioners. SIAM Journal on Scientific Computing 2000; 21: 1804-1822.
28. Chow E, Parallel implementation and practical use of sparse approximate inverse preconditioners with a priori sparsity patterns. International Journal of High Performance Computing Applications 2001; 15: 56-74.
29. Huckle T, Approximate sparsity patterns for the inverse of a matrix and preconditioning. Applied Numerical Mathematics 1999; 30: 291-303.
30. Demko S, Moss WF, Smith PW, Decay rates for inverses of band matrices. Mathematics of Computation 1984; 43: 491-499.
31. Benzi M, Razouk N, Decay bounds and O(n) algorithms for approximating functions of sparse matrices. Electronic Transactions on Numerical Analysis 2007; 28: 16-39.
32. Eijkhout V, Polman B, Decay rates of inverses of banded M-matrices that are near to Toeplitz matrices. Linear Algebra and its Applications 1988; 109: 247-277.
33. Meurant G, A review on the inverse of symmetric tridiagonal and block tridiagonal matrices. SIAM Journal on Matrix Analysis and Applications 1992; 13: 707-728.
34. Nabben R, Decay rates of the inverse of nonsymmetric tridiagonal and band matrices. SIAM Journal on Matrix Analysis and Applications 1999; 20: 820-837.
35. Tang W-P, Toward an effective sparse approximate inverse preconditioner. SIAM Journal on Matrix Analysis and Applications 1999; 20: 970-986.
36. Benzi M, Tûma M, A comparative study of sparse approximate inverse preconditioners. Applied Numerical Mathematics 1999; 30: 305-340.
37. Chan TF, Mathew TP, The interface probing technique in domain decomposition. SIAM Journal on Matrix Analysis and Applications 1992; 13: 212-238.
38. Siefert C, de Sturler E, Probing methods for saddle-point problems. Electronic Transactions on Numerical Analysis 2006; 22: 163-183.
39. Luby M, A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing 1986; 15: 1036-1055.
40. Gebremedhin AH, Manne F, Pothen A, What color is your Jacobian? graph coloring for computing derivatives. SIAM Review 2005; 47: 629-705.
41. Kubale M, Graph Colorings. American Mathematical Society: Providence, Rhode Island, 2004.
42. Saad Y, Iterative Methods for Sparse Linear Systems (2nd edn). SIAM: Philadelphia, PA, U.S.A., 2003.
43. Saad Y, Schultz MH, GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM Journal on Scientific and Statistical Computing 1986; 7: 856-869.
44. Freund RW, Nachtigal NM, QMR: a quasi-minimal residual method for non-Hermitian linear systems. Numerische Mathematik 1991; 60: 315-339.
45. van der Vorst HA, BI-CGSTAB: a fast and smoothly converging variant of BI-CG for the solution of nonsymmetric linear systems. SIAM Journal on Scientific and Statistical Computing 1992; 13: 631-644.
46. Sonneveld P, van Gijzen MB, IDR(s): a family of simple and fast algorithms for solving large nonsymmetric linear systems. SIAM Journal on Scientific Computing 2008; 31: 1035-1062.
47. Darnell D, Morgan R, Wilcox W, Deflated GMRES for systems with multiple shifts and multiple right-hand sides. Linear Algebra and its Applications 2008; 429: 2415-2434.
48. Parks M, de Sturler E, Mackey G, Johnson D, Maiti S, Recycling Krylov subspaces for sequences of linear systems. SIAM Journal on Scientific Computing 2006; 28: 1651-1674.
49. Golub GH, van Loan CF, Matrix Computations (3rd edn). Johns Hopkins University Press: Baltimore, MD, 1996.
50. Schmitt K, Anitescu M, Negrut D, Efficient sampling for spatial uncertainty quantification in multibody system dynamics applications. International Journal for Numerical Methods in Engineering 2009; 80: 537-564.
51. Rasmussen C, Williams C, Gaussian Processes for Machine Learning. MIT Press: Cambridge, MA, 2006.