Fetching the paper…
Reading the bibliography…
This article presents a fast solver for the dense "frontal" matrices that arise from the multifrontal sparse elimination process of 3D elliptic PDEs.
Hestenes, M. R., Stiefel, E., 1952. Methods of conjugate gradients for solving linear systems. Journal of Research of the National Bureau of Standards 49 (6), 409–436
1952
Earlier work this paper cites.
Irons, B., 1970. A frontal solution program for finite element analysis. International Journal for Numerical Methods in Engineering 2, 5–32
1970
Earlier work this paper cites.
George, A., 1973. Nested dissection of a regular finite element mesh. SIAM J. Numer. Anal
1973
Earlier work this paper cites.
Duff, I., Reid, J., 1983. The multifrontal solution of indefinite sparse symmetric linear equations. ACM Transactions on Mathematical Software 9 (3), 302–325
1983
Earlier work this paper cites.
Saad, Y., Schultz, M. H., 1986. GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM Journal on Scientific and Statistical Computing 7 (3), 856–869
1986
Earlier work this paper cites.
Hager, W. W., 1989. Updating the inverse of a matrix. SIAM review 31 (2), 221–239
1989
Earlier work this paper cites.
Pellegrini, F., Roman, J., 1996. S C O T C H {SCOTCH} : A {A} software package for static mapping by dual recursive bipartitioning of process and architecture graphs. High-Performance Computing and Networking 1067, 493–498
1996
Earlier work this paper cites.
Benamou, J., Despres, B., 1997. A domain decomposition method for the Helmholtz equation and related optimal control problems. Journal of Computational Physics 136, 68–82
1997
Earlier work this paper cites.
Goreinov, S., Tyrtyshnikov, E., Zamarashkin, N., 1997. A theory of pseudoskeleton approximations. Linear Algebra and Its Applications 261, 1–21
1997
Earlier work this paper cites.
Hackbusch, W., 1999. A sparse matrix arithmetic based on ℋ \mathcal{H} -matrices. Part I: Introduction to ℋ \mathcal{H} -matrices. Computing 62 (2), 89–108
1999
Earlier work this paper cites.
Bebendorf, M., 2000. Approximation of boundary element matrices. Numerische Mathematik 86 (4), 565–589
2000
Earlier work this paper cites.
Hackbusch, W., Khoromskij, B., Sauter, S. A., 2000. On ℋ 2 \mathcal{H}^{2} -matrices. In: Bungartz, H.-J., Hoppe, R. H., Zenger, C. (Eds.), Lectures on Applied Mathematics. Springer Berlin Heidelberg, pp. 9–29
2000
Earlier work this paper cites.
Farhat, C., Lesoinne, M., LeTallec, P., Pierson, K., Rixen, D., 2001. FETI-DP: a dual-primal unified FETI method – Part 1: A faster alternative to the two-level FETI method. International Journal for Numerical Methods in Engineering 50, 1523–1544
2001
Earlier work this paper cites.
Rjasanow, S., 2002. Adaptive cross approximation of dense matrices. In: International Association for Boundary Element Methods Conference, IABEM
2002
Earlier work this paper cites.
Börm, S., Grasedyck, L., Hackbusch, W., 2003. Hierarchical matrices. Lecture notes 21
2003
Earlier work this paper cites.
Grasedyck, L., Hackbusch, W., 2003. Construction and arithmetics of ℋ \mathcal{H} -matrices. Computing 70 (4), 295–334
2003
Earlier work this paper cites.
Frieze, A., Kannan, R., Vempala, S., 2004. Fast monte-carlo algorithms for finding low-rank approximations. Journal of the ACM
2004
Cited alongside, same era.
Cheng, H., Gimbutas, Z., Martinsson, P., Rokhlin, V., 2005. On the compression of low rank matrices. SIAM J. Sci. Comput
2005
Cited alongside, same era.
Li, J., O.Widlund, 2005. FETI-DP, BDDC, and block Cholesky methods. International Journal for Numerical Methods in Engineering
2005
Cited alongside, same era.
Martinsson, P., Rokhlin, V., 2005. A fast direct solver for boundary integral equations in two dimensions. Journal of Computational Physics, 1–23
2005
Cited alongside, same era.
Deshpande, A., Vempala, S., 2006. Adaptive sampling and fast low-rank matrix approximation. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
2006
Kong, W., Bremer, J., Rokhlin, V., 2011. An adaptive fast direct solver for boundary integral equations in two dimensions. Applied and Computational Harmonic Analysis 31, 346–369
2011
Later among the works it cites.
Martinsson, P., 2011. A fast randomized algorithm for computing a hierarchially semiseperable representation of a matrix. SIAM J. Matrix Anal
2011
Later among the works it cites.
Sapp, B. J., 2011. Randomized algorithms for low-rank matrix decomposition. Computer and Information Science, University of Pennsylvania
2011
Later among the works it cites.
Amestoy, P., Ashcraft, C., Boiteau, O., Buttari, A., L’Excellent, J. Y., Weisbecker, C., 2012. Improving multifrontal methods by means of block low-rank representations. SIAM J. Sci. Comput. (Under Revision)
2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Bebendorf, M., 2008. Hierarchical Matrices: A Means to Efficiently Solve Elliptic Boundary Value Problems. Vol. 63 of Lecture Notes in Computational Science and Engineering (LNCSE). Springer-Verlag, iSBN 978-3-540-77146-3
2008
Cited alongside, same era.
Chandrasekaran, S., Gu, M., Li, X., Xia, J., 2008. Some fast algorithms for hierarchially semiseparable matrices. Tech. rep., UCLA
2008
Cited alongside, same era.
Woolfe, F., Liberty, E., Rokhlin, V., Tygert, M., 2008. A fast randomized algorithm for the approximation of matrices. Applied and Computational Harmonic Analysis 25 (335-366)
2008
Cited alongside, same era.
Halko, N., Martinsson, P., Tropp., J., 2009. Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM Review
2009
Cited alongside, same era.
Mahoney, M. W., Drineas, P., 2009. Cur matrix decompositions for improved data analysis. Proceedings of the National Academy of Sciences
2009
Cited alongside, same era.
Martinsson, P., 2009. A fast direct solver for a class of elliptic partial differential equations. Journal of Scientific Computing 38, 316–330
2009
Cited alongside, same era.
Xia, J., Chandrasekaran, S., Gu, M., Li, X. S., 2009. Superfast multifrontal method for large structured linear systems of equations. SIAM Journal on Matrix Analysis and Applications 31 (3), 1382–1411
2009
Cited alongside, same era.
2012
Later among the works it cites.
Ho, K., Greengard, L., 2012. A fast direct solver for structured linear systems by recursive skeletonization. SIAM J. Sci. Comput. 34 (5), A2507–2532
2012
Later among the works it cites.
Schmitz, P., Ying, L., 2012. A fast direct solver for elliptic problems on general meshes in 2D. Journal of Computational Physics 231, 1314–1338
2012
Later among the works it cites.
Ambikasaran, S., 2013. Fast algorithms for dense numerical linear algebra and applications. Ph.D. thesis, Stanford University
2013
Later among the works it cites.
Ambikasaran, S., Darve, E. F., 2013. An 𝒪 ( N log N ) \mathcal{O}({N}\log{N}) fast direct solver for partial hierarchically semi-separable matrices. Journal of Scientific Computing 57 (3), 477–501
2013
Later among the works it cites.
2013
Later among the works it cites.
Ambikasaran, S., Darve, E., 2014. The inverse fast multipole method. arXiv preprint arXiv:1407.1572
2014
Closest in time.
2014
Closest in time.
Chen, J., 2014. Data structure and algorithms for recursively low-rank compressed matrices. Argonne National Laboratory
2014
Closest in time.
Gillman, A., Martinsson, P., 2014. An O(n) algorithm for constructing the solution operator to 2d elliptic boundary value problems in the absence of body loads. Advances in Computational Mathematics
2014
Closest in time.
Lai, J., Ambikasaran, S., Greengard, L. F., 2014. A fast direct solver for high frequency scattering from a large cavity in two dimensions. SIAM Journal on Scientific and Statistical Computing
2014
Closest in time.
Li, J. Y., Ambikasaran, S., Darve, E. F., Kitanidis, P. K., 2014. A Kalman filter powered by ℋ 2 \mathcal{H}^{2} -matrices for quasi-continuous data assimilation problems. Water Resources Research
2014
Closest in time.