Randomized sparse direct solvers

SIAM Journal on Matrix Analysis and Applications

Volumn 34, Issue 1, 2012, Pages 197-227

  Xia, Jianlin ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

Adaptive scheme; Hierarchically semiseparable matrix; Randomized sparse solver; Rank relaxation; Skinny extend add operation; Structured multifrontal method

Indexed keywords

ADAPTIVE SCHEME; HIERARCHICALLY SEMISEPARABLE MATRIXES; MULTIFRONTAL METHODS; RANK RELAXATION; SKINNY EXTEND-ADD OPERATION; SPARSE SOLVERS;

FACTORIZATION; LINEAR SYSTEMS;

RANDOM PROCESSES;

EID: 84877319988     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/12087116X     Document Type: Article

References (42)

1. M. Bebendorf and W. Hackbusch, Existence of H-matrix approximants to the inverse FEmatrix of elliptic operators with L∞-Coefficients, Numer. Math., 95 (2003), pp. 1-28.
2. T. Bella, Y. Eidelman, I. Gohberg, and V. Olshevsky, Computations with quasiseparable polynomials and matrices, Theoret. Comput. Sci., 409 (2008), pp. 158-179.
3. S. Börm, Efficient Numerical Methods for Non-local Operators, European Mathematical Society, Zurich, 2010.
4. S. Börm and W. Hackbusch, Data-sparse approximation by adaptive H2-matrices, Computing, 69 (2002), pp. 1-35.
5. S. Chandrasekaran, P. Dewilde, M. Gu, W. Lyons, and T. Pals, A fast solver for HSS representations via sparse matrices, SIAM J. Matrix Anal. Appl., 29 (2006), pp. 67-81.
6. S. Chandrasekaran, P. Dewilde, M. Gu, and T. Pals, A fast ULV decomposition solver for hierarchically semiseparable representations, SIAM J. Matrix Anal. Appl., 28 (2006), pp. 603-622.
7. S. Chandrasekaran, P. Dewilde, M. Gu, T. Pals, X. Sun, A.-J. van der Veen, and D. White, Some fast algorithms for sequentially semiseparable representations, SIAM J. Matrix Anal. Appl, 27 (2005), pp. 341-364.
8. S. Chandrasekaran, P. Dewilde, M. Gu, and N. Somasunderam, On the numerical rank of the off-diagonal blocks of Schur complements of discretized elliptic PDEs, SIAM J.Matrix Anal. Appl., 31 (2010), pp. 2261-2290.
9. L. Chen, iFEM: An Integrated Finite Element Methods Package in MATLAB, Technical report, University of California at Irvine, Irvine, CA, 2009, available online at http://math. uci.edu/?chenlong/Papers/iFEMpaper.pdf.
10. T. A. Davis and Y. Hu, University of Florida Sparse Matrix Collection, available online at http://www.cise.ufl.edu/research/sparse/matrices/index.html.
11. J.W. Demmel, J. R. Gilbert, and X. S. Li, SuperLU Users' Guide, available online at http:// crd.lbl.gov/?xiaoye/SuperLU/ (2003).
12. I. S. Duff and J. K. Reid, The multifrontal solution of indefinite sparse symmetric linear equations, ACM Trans. Math. Software, 9 (1983), pp. 302-325.
13. Y. Eidelman and I. Gohberg, On a new class of structured matrices, Integral Equations Operator Theory, 34 (1999) pp. 293-324.
14. B. Engquist and L. Ying, Sweeping preconditioner for the Helmholtz equation: Hierarchical matrix representation, Comm. Pure Appl. Math., 64 (2011), pp. 697-735.
15. J. A. George, Nested dissection of a regular finite element mesh, SIAM J. Numer. Anal., 10 (1973), pp. 345-363.
16. L. Grasedyck, R. Kriemann, and S. Le Borne, Parallel Black Box Domain Decomposition Based H-LU Preconditioning, Technical report 115, Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany, 2005.
17. L. Grasedyck, R. Kriemann, and S. Le Borne, Domain-decomposition Based H-LU Preconditioners, in Domain Decomposition Methods in Science and Engineering XVI, O.B. Widlund and D.E. Keyes, eds., Lect. Notes in Comput. Sci. Eng. 55, Springer, 2006, pp. 661-668.
18. L. Greengard and V. Rokhlin, A fast algorithm for particle simulations, J. Comput. Phys., 73 (1987), pp. 325-348.
19. M. Gu and S. C. Eisenstat, Efficient algorithms for computing a strong-rank revealing QR factorization, SIAM J. Sci. Comput., 17 (1996), pp. 848-869.
20. W. Hackbusch, A sparse matrix arithmetic based on H-matrices. Part I: Introduction to H-matrices, Computing, 62 (1999), pp. 89-108.
21. N. Halko, P.G. Martinsson, and J.A. Tropp, Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions, SIAM Rev., 53 (2011), pp. 217-288.
22. A. J. Hoffman, M. S. Martin, and D. J. Rose, Complexity bounds for regular finite difference and finite element grids, SIAM J. Numer. Anal., 10 (1973), pp. 364-369.
23. E. Liberty, F. Woolfe, P.-G. Martinsson, V. Rokhlin, and M. Tygert, Randomized algorithms for the low-rank approximation of matrices, Proc. Natl. Acad. Sci. USA, 104 (2007), pp. 20167-20172.
24. L. Lin, J. Lu, and L. Ying, Fast construction of hierarchical matrix representation from matrix-vector multiplication, J. Comput. Phys., 230 (2011), pp. 4071-4087.
25. J. W. H. Liu, The multifrontal method for sparse matrix solution: Theory and practice, SIAM Rev., 34 (1992), pp. 82-109.
26. W. Lyons, Fast Algorithms with Applications to PDEs, Ph.D. thesis, University of California, Santa Barbara, Santa Barbara, CA, 2005.
27. P.-G. Martinsson, A fast direct solver for a class of elliptic partial differential equations, J. Sci. Comput., 38 (2009), pp. 316-330
28. P.-G. Martinsson, A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix, SIAM. J. Matrix Anal. Appl., 32 (2011), pp. 1251-1274.
29. P.-G. Martinsson, V. Rokhlin, and M. Tygert, A randomized algorithm for the decomposition of matrices, Appl. Comput. Harmon. Anal., 30 (2011), pp. 47-68.
30. V. Y. Pan and G. Qian, Randomized preprocessing of homogeneous linear systems of equations, Linear Algebra Appl., 432 (2010), pp. 3272-3318.
31. S. V. Parter, The use of linear graphs in Gauss elimination, SIAM Rev., 3 (1961), pp. 119- 130.
32. P. G. Schmitz and L. Ying, A fast direct solver for elliptic problems on general meshes in 2D, J. Comput. Phys., 231 (2012), pp. 1314-1338.
33. R. P. Tewarson, On the product form of inverses of sparse matrices and graph theory, SIAM Rev., 9 (1967), pp. 91-99.
34. R. Vandebril, M. Van Barel, G. Golub, and N. Mastronardi, A bibliography on semiseparable matrices, Calcolo, 42 (2005), pp. 249-270.
35. S. Wang, M. V. de Hoop, and J. Xia, Acoustic inverse scattering via Helmholtz operator factorization and optimization, J. Comput. Phys., 229 (2010), pp. 8445-8462.
36. S. Wang, M. V. de Hoop, and J. Xia, On 3D modeling of seismic wave propagation via a structured parallel multifrontal direct Helmholtz solver, Geophys. Prospect., 59 (2011), pp. 857-873.
37. J. Xia, Robust and efficient multifrontal solver for large discretized PDEs, in High-Perform. Sci. Comput., M. W. Berry et al., eds., Springer-Verlag, London, 2012, pp. 199-217.
38. J. Xia, On the complexity of some hierarchical structured matrix algorithms, SIAM J. Matrix Anal. Appl., 33 (2012), pp. 388-410.
39. J. Xia, Efficient structured multifrontal factorization for general large sparse matrices, SIAM J. Sci. Comput., to appear, available online at http://www.math.purdue.edu/?xiaj/work/mfhsss.pdf.
40. J. Xia, S. Chandrasekaran, M. Gu, and X. S. Li, Superfast multifrontal method for large structured linear systems of equations, SIAM J. Matrix Anal. Appl., 31 (2009), pp. 1382- 1411.
41. J. Xia, S. Chandrasekaran, M. Gu, and X. S. Li, Fast algorithms for hierarchically semiseparable matrices, Numer. Linear Algebra Appl., 17 (2010), pp. 953-976.
42. J. Xia, Y. Xi, and M. Gu, A superfast structured solver for Toeplitz linear systems via randomized sampling, SIAM J. Matrix Anal. Appl., 33 (2012), pp. 837-858.