Fast Eigenpairs Computation with Operator Adapted Wavelets and Hierarchical Subspace Correction

DOI10.1137/18M1194079zbMath1447.65165arXiv1806.00565OpenAlexW2984061542WikidataQ126865466 ScholiaQ126865466MaRDI QIDQ5242937

Houman Owhadi, Lei Zhang, Hehu Xie

Publication date: 8 November 2019

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.00565

zbMATH Keywords

multigrid iterationnumerical homogenizationsubspace correctiongamblet decompositionmultiscale eigenvalue problem

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Numerical methods for wavelets (65T60) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25) Numerical solution of eigenvalue problems involving ordinary differential equations (65L15) Acceleration of convergence in numerical analysis (65B99)

Related Items (13)

Essentially optimal finite elements for multiscale elliptic eigenvalue problems ⋮ Convergence Analysis of Newton–Schur Method for Symmetric Elliptic Eigenvalue Problem ⋮ Optimal Control for Multiscale Elliptic Equations with Rough Coefficients ⋮ A nonnested augmented subspace method for elliptic eigenvalue problems with curved interfaces ⋮ Enhanced error estimates for augmented subspace method ⋮ Subspace decomposition based DNN algorithm for elliptic type multi-scale PDEs ⋮ A locally optimal preconditioned Newton-Schur method for symmetric elliptic eigenvalue problems ⋮ Quantitative Anderson localization of Schrödinger eigenstates under disorder potentials ⋮ A Parallel Augmented Subspace Method for Eigenvalue Problems ⋮ A Fast Hierarchically Preconditioned Eigensolver Based on Multiresolution Matrix Decomposition ⋮ The \(J\)-method for the Gross-Pitaevskii eigenvalue problem ⋮ Localized Computation of Eigenstates of Random Schrödinger Operators ⋮ Convergence analysis of the localized orthogonal decomposition method for the semiclassical Schrödinger equations with multiscale potentials

Uses Software

• lobpcg.m

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexity
• A full multigrid method for nonlinear eigenvalue problems
• A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix
• An indefinite variant of LOBPCG for definite matrix pencils
• Multiscale finite element algorithm of the eigenvalue problems for the elastic equations in composite materials
• A subspace preconditioning algorithm for eigenvector/eigenvalue computation
• Gamblets for opening the complexity-bottleneck of implicit schemes for hyperbolic and parabolic ODEs/PDEs with rough coefficients
• A full multigrid method for eigenvalue problems
• A multigrid method for eigenvalue problem
• Computation of eigenvalues by numerical upscaling
• Minimization of the computational labor in determining the first eigenvalues of differential operators
• Preconditioning eigensolvers -- an Oxymoron?
• The variational multiscale method -- a paradigm for computational mechanics
• Efficient solution of symmetric eigenvalue problems using multigrid preconditioners in the locally optimal block conjugate gradient method
• Asymptotic expansions and numerical algorithms of eigenvalues and eigenfunctions of the Dirichlet problem for second order elliptic equations in perforated domains
• A multi-level mixed element method for the eigenvalue problem of biharmonic equation
• A multiresolution strategy for numerical homogenization
• De-noising by thresholding operator adapted wavelets
• Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
• Polyharmonic homogenization, rough polyharmonic splines and sparse super-localization
• Iterative Methods for Linear Systems
• Multigrid with Rough Coefficients and Multiresolution Operator Decomposition from Hierarchical Information Games
• Numerical Methods for Large Eigenvalue Problems
• An analysis of a class of variational multiscale methods based on subspace decomposition
• Localization of elliptic multiscale problems
• A Multilevel Correction Type of Adaptive Finite Element Method for Eigenvalue Problems
• Analytic Properties of Bloch Waves and Wannier Functions
• Finite Element-Galerkin Approximation of the Eigenvalues and Eigenvectors of Selfadjoint Problems
• Wavelet-Based Numerical Homogenization
• An Energy-minimizing Interpolation for Robust Multigrid Methods
• A two-grid discretization scheme for eigenvalue problems
• Templates for the Solution of Algebraic Eigenvalue Problems
• A Fast Hierarchically Preconditioned Eigensolver Based on Multiresolution Matrix Decomposition
• A Robust and Efficient Implementation of LOBPCG
• Minimization Principles for the Linear Response Eigenvalue Problem I: Theory
• Operator-Adapted Wavelets, Fast Solvers, and Numerical Homogenization
• Quantitative Anderson localization of Schrödinger eigenstates under disorder potentials
• Numerical Homogenization of Elliptic Multiscale Problems by Subspace Decomposition
• A type of multilevel method for the Steklov eigenvalue problem
• A multi-level correction scheme for eigenvalue problems
• Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. I. Extreme eigenvalues

This page was built for publication: Fast Eigenpairs Computation with Operator Adapted Wavelets and Hierarchical Subspace Correction