{"title":"Sparse Recovery of Elliptic Solvers from Matrix-Vector Products","authors":"Florian Schäfer, Houman Owhadi","doi":"10.1137/22m154226x","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Scientific Computing, Volume 46, Issue 2, Page A998-A1025, April 2024. <br/> Abstract. In this work, we show that solvers of elliptic boundary value problems in [math] dimensions can be approximated to accuracy [math] from only [math] matrix-vector products with carefully chosen vectors (right-hand sides). The solver is only accessed as a black box, and the underlying operator may be unknown and of an arbitrarily high order. Our algorithm (1) has complexity [math] and represents the solution operator as a sparse Cholesky factorization with [math] nonzero entries, (2) allows for embarrassingly parallel evaluation of the solution operator and the computation of its log-determinant, (3) allows for [math] complexity computation of individual entries of the matrix representation of the solver that, in turn, enables its recompression to an [math] complexity representation. As a byproduct, our compression scheme produces a homogenized solution operator with near-optimal approximation accuracy. By polynomial approximation, we can also approximate the continuous Green’s function (in operator and Hilbert–Schmidt norm) to accuracy [math] from [math] solutions of the PDE. We include rigorous proofs of these results. To the best of our knowledge, our algorithm achieves the best known trade-off between accuracy [math] and the number of required matrix-vector products. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/f-t-s/sparse_recovery_of_elliptic_solution_operators_from_matrix-vector_products and in the supplementary materials (CompressingSolvers.jl-main.zip [2.50MB], sparse_recovery_of_elliptic_solution_operators_from_matrix-vector_products-main.zip [54.8KB]).","PeriodicalId":49526,"journal":{"name":"SIAM Journal on Scientific Computing","volume":"48 1","pages":""},"PeriodicalIF":2.6000,"publicationDate":"2024-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Scientific Computing","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/22m154226x","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
SIAM Journal on Scientific Computing, Volume 46, Issue 2, Page A998-A1025, April 2024. Abstract. In this work, we show that solvers of elliptic boundary value problems in [math] dimensions can be approximated to accuracy [math] from only [math] matrix-vector products with carefully chosen vectors (right-hand sides). The solver is only accessed as a black box, and the underlying operator may be unknown and of an arbitrarily high order. Our algorithm (1) has complexity [math] and represents the solution operator as a sparse Cholesky factorization with [math] nonzero entries, (2) allows for embarrassingly parallel evaluation of the solution operator and the computation of its log-determinant, (3) allows for [math] complexity computation of individual entries of the matrix representation of the solver that, in turn, enables its recompression to an [math] complexity representation. As a byproduct, our compression scheme produces a homogenized solution operator with near-optimal approximation accuracy. By polynomial approximation, we can also approximate the continuous Green’s function (in operator and Hilbert–Schmidt norm) to accuracy [math] from [math] solutions of the PDE. We include rigorous proofs of these results. To the best of our knowledge, our algorithm achieves the best known trade-off between accuracy [math] and the number of required matrix-vector products. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/f-t-s/sparse_recovery_of_elliptic_solution_operators_from_matrix-vector_products and in the supplementary materials (CompressingSolvers.jl-main.zip [2.50MB], sparse_recovery_of_elliptic_solution_operators_from_matrix-vector_products-main.zip [54.8KB]).
期刊介绍:
The purpose of SIAM Journal on Scientific Computing (SISC) is to advance computational methods for solving scientific and engineering problems.
SISC papers are classified into three categories:
1. Methods and Algorithms for Scientific Computing: Papers in this category may include theoretical analysis, provided that the relevance to applications in science and engineering is demonstrated. They should contain meaningful computational results and theoretical results or strong heuristics supporting the performance of new algorithms.
2. Computational Methods in Science and Engineering: Papers in this section will typically describe novel methodologies for solving a specific problem in computational science or engineering. They should contain enough information about the application to orient other computational scientists but should omit details of interest mainly to the applications specialist.
3. Software and High-Performance Computing: Papers in this category should concern the novel design and development of computational methods and high-quality software, parallel algorithms, high-performance computing issues, new architectures, data analysis, or visualization. The primary focus should be on computational methods that have potentially large impact for an important class of scientific or engineering problems.