Computation of eigenvalues by numerical upscaling

DOI10.1007/S00211-014-0665-6MaRDI QIDQ888523zbMATH OpenOpenAlexFDO

Authors Axel Målqvist, Daniel Peterseim

Publication date 30 October 2015

Published in Numerische Mathematik (Search for Journal in Brave)

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

zbMATH Keywords

\(L\)-shaped domainsdiffusion equation: two-level methodeigenfunctioneigenvalue problemerror boundfinite element methodnumerical experimentself-adjoint linear elliptic second-order equationssuperconvergenceunstructured meshe

Mathematics Subject Classification ID

Estimates of eigenvalues in context of PDEs (35P15) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Error bounds for boundary value problems involving PDEs (65N15) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)

Abstract: We present numerical upscaling techniques for a class of linear second-order self-adjoint elliptic partial differential operators (or their high-resolution finite element discretization). As prototypes for the application of our theory we consider benchmark multi-scale eigenvalue problems in reservoir modeling and material science. We compute a low-dimensional generalized (possibly mesh free) finite element space that preserves the lowermost eigenvalues in a superconvergent way. The approximate eigenpairs are then obtained by solving the corresponding low-dimensional algebraic eigenvalue problem. The rigorous error bounds are based on two-scale decompositions of $H_0^1(Omega)$ by means of a certain Cl'ement-type quasi-interpolation operator.

Review text

The paper presents a two-level technique for the computation of lowermost eigenvalues of self-adjoint linear elliptic second-order partial differential equations. In order to avoid the solution of the eigenvalue problem for the fine scale discretization, the authors construct a generalized finite element space on a coarser discretization scale \(H\) with dimension \(N_H\). The two-scale decomposition uses weighted Clement-type quasi-interpolation operators and involves the approximate solution of \(N_H\) independent linear equations on the fine scale. Then the solutions of the corresponding eigenvalue problem on this low-dimensional space approximate the first \(N_H\) eigenpairs of the fine scale problem in a superconvergent way. It is proved that without any assumptions on the smoothness of the eigenfunctions the error between the eigenvalues of the low-dimensional problem and the first \(N_H\) eigenvalues of the fine scale problem is at least of order \(H^4\). Numerical experiments for \(L\)-shaped domains, problems with rough coefficients, and unstructured meshes illustrate the theoretical results.

Recommendations

• Three-scale finite element eigenvalue discretizations
• Multiscale Finite Element Methods
• Subgrid Upscaling and Mixed Multiscale Finite Elements
• ON NUMERICAL UPSCALING FOR FLOWS IN HETEROGENEOUS POROUS MEDIA
• The adaptive finite element method based on multi-scale discretizations for eigenvalue problems

Cites work

• A Posteriori Error Estimates for the Finite Element Approximation of Eigenvalue Problems
• hp-finite elements for elliptic eigenvalue problems: Error estimates which are explicit with respect to , h, and p
• A convergent adaptive method for elliptic eigenvalue problems
• A framework for robust eigenvalue and eigenvector error estimation and Ritz value convergence enhancement
• A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems
• A localized orthogonal decomposition method for semi-linear elliptic problems
• A new multiscale finite element method for high-contrast elliptic interface problems
• A Posteriori and a Priori Error Analysis for Finite Element Approximations of Self-Adjoint Elliptic Eigenvalue Problems
• A two-grid discretization scheme for eigenvalue problems
• Adaptive computation of smallest eigenvalues of self-adjoint elliptic partial differential equations.
• An adaptive finite element eigenvalue solver of asymptotic quasi-optimal computational complexity
• An oscillation-free adaptive FEM for symmetric eigenvalue problems
• ARPACK Users' Guide
• Composite finite elements for elliptic interface problems
• CONVERGENCE OF ADAPTIVE FINITE ELEMENT METHODS FOR EIGENVALUE PROBLEMS
• Edge Residuals Dominate A Posteriori Error Estimates for Low Order Finite Element Methods
• Efficient solution of symmetric eigenvalue problems using multigrid preconditioners in the locally optimal block conjugate gradient method
• FEM for elliptic eigenvalue problems: how coarse can the coarsest mesh be chosen? An experimental study
• Finite element approximation of eigenvalue problems
• Finite element network approximation of conductivity in particle composites
• Finite elements for elliptic problems with highly varying, nonperiodic diffusion matrix
• scientific article; zbMATH DE number 3438337 (Why is no real title available?)
• scientific article; zbMATH DE number 1827885 (Why is no real title available?)
• scientific article; zbMATH DE number 2113718 (Why is no real title available?)
• scientific article; zbMATH DE number 2206696 (Why is no real title available?)
• Localization of elliptic multiscale problems
• Localized orthogonal decomposition techniques for boundary value problems
• Multiscale partition of unity
• New A Priori FEM Error Estimates for Eigenvalues
• On the Computation of Approximate Eigenvalues and Eigenfunctions of Elliptic Operators by Means of a Multi-Grid Method
• Oversampling for the multiscale finite element method
• Rayleigh-Ritz Approximation by Piecewise Cubic Polynomials
• Two-level discretization techniques for ground state computations of Bose-Einstein condensates
• Weak approximation properties of elliptic projections with functional constraints

Cited in

(42)

• Generalized Rayleigh quotient and finite element two-grid discretization schemes
• Multiscale techniques for parabolic equations
• Efficient implementation of the localized orthogonal decomposition method
• Smoothed-adaptive perturbed inverse iteration for elliptic eigenvalue problems
• Equation-free patch scheme for efficient computational homogenisation via self-adjoint coupling
• Convergence analysis of the localized orthogonal decomposition method for the semiclassical Schrödinger equations with multiscale potentials
• Multiscale methods for problems with complex geometry
• A multiscale method for linear elasticity reducing Poisson locking
• Localized orthogonal decomposition for two-scale Helmholtz-type problems
• Convergence analysis for GMsFEM approximation of elliptic eigenvalue problems
• Relaxing the CFL condition for the wave equation on adaptive meshes
• A combined multiscale finite element method based on the LOD technique for the multiscale elliptic problems with singularities
• scientific article; zbMATH DE number 1714603 (Why is no real title available?)
• Localized orthogonal decomposition method for the wave equation with a continuum of scales
• Variational multiscale stabilization and the exponential decay of fine-scale correctors
• Eliminating the pollution effect in Helmholtz problems by local subscale correction
• Robust numerical upscaling of elliptic multiscale problems at high contrast
• Acoustic vibration problem for dissipative fluids
• A high-order approach to elliptic multiscale problems with general unstructured coefficients
• Superconvergence of time invariants for the Gross-Pitaevskii equation
• A generalized finite element method for the strongly damped wave equation with rapidly varying data
• Numerical upscaling of perturbed diffusion problems
• Computing eigenvalues and eigenfunctions of Schrödinger equations using a model reduction approach
• Fast eigenpairs computation with operator adapted wavelets and hierarchical subspace correction
• A multiscale method for porous microstructures
• A Multiscale Finite Element Method for Oscillating Neumann Problem on Rough Domain
• Spectral upscaling for graph Laplacian problems with application to reservoir simulation
• A Multiscale Method for Heterogeneous Bulk-Surface Coupling
• Numerical homogenization beyond scale separation
• FEM for elliptic eigenvalue problems: how coarse can the coarsest mesh be chosen? An experimental study
• Iterative solution of spatial network models by subspace decomposition
• Enhanced error estimates for augmented subspace method
• Localized Orthogonal Decomposition for a Multiscale Parabolic Stochastic Partial Differential Equation
• A CutFE-LOD method for the multiscale elliptic problems on complex domains
• Efficient finite element methods for semiclassical nonlinear Schrödinger equations with random potentials
• Efficient numerical method for the Schrödinger equation with high-contrast potentials
• Offline-online approximation of multiscale eigenvalue problems with random defects
• An IPDG multiscale method based on the LOD technique for elliptic problems with highly varying coefficients
• Super-localised wave function approximation of Bose-Einstein condensates
• Multiscale mixed finite elements
• Essentially optimal finite elements for multiscale elliptic eigenvalue problems
• Three-scale finite element eigenvalue discretizations

Describes a project that uses

Uses Software

• ARPACK

This page was built for publication: Computation of eigenvalues by numerical upscaling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q888523)