Distributed solution of Laplacian eigenvalue problems

DOI10.1137/20M1342653MaRDI QIDQ5023825zbMATH OpenOpenAlexFDO

Authors Antti Hannukainen, Jarmo Malinen, Antti Ojalammi

Publication date 25 January 2022

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

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

zbMATH Keywords

dimension reductiondomain decompositioneigenvalue problemsubspace method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) 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) Numerical algorithms for specific classes of architectures (65Y10)

Abstract: The purpose of this article is to approximately compute the eigenvalues of the symmetric Dirichlet Laplacian within an interval $(0,Lambda)$. A novel domain decomposition Ritz method, partition of unity condensed pole interpolation method, is proposed. This method can be used in distributed computing environments where communication is expensive, e.g., in clusters running on cloud computing services or networked workstations. The Ritz space is obtained from local subspaces consistent with a decomposition of the domain into subdomains. These local subspaces are constructed independently of each other, using data only related to the corresponding subdomain. Relative eigenvalue error is analysed. Numerical examples on a cluster of workstations validate the error analysis and the performance of the method.

Recommendations

• scientific article; zbMATH DE number 218070
• scientific article; zbMATH DE number 218267
• Local and parallel finite element method for Laplace eigenvalue problem
• A domain decomposition Rayleigh-Ritz algorithm for symmetric generalized eigenvalue problems
• Domain decomposition methods for eigenvalue problems

Cites work

• A comparison of eigensolvers for large-scale 3D modal analysis using AMG-preconditioned iterative methods
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• An Automated Multilevel Substructuring Method for Eigenspace Computation in Linear Elastodynamics
• An Implementation and Evaluation of the AMLS Method for Sparse Eigenvalue Problems
• Beyond automated multilevel substructuring: domain decomposition with rational filtering
• Component mode synthesis and eigenvalues of second order operators : discretization and algorithm
• Computation of Smallest Eigenvalues using Spectral Schur Complements
• Coupling of substructures for dynamic analyses.
• Efficient solution of symmetric eigenvalue problems from families of coupled systems
• Finite element approximation of eigenvalue problems
• Finite Element-Galerkin Approximation of the Eigenvalues and Eigenvectors of Selfadjoint Problems
• scientific article; zbMATH DE number 107781 (Why is no real title available?)
• scientific article; zbMATH DE number 3491650 (Why is no real title available?)
• scientific article; zbMATH DE number 3516003 (Why is no real title available?)
• scientific article; zbMATH DE number 613872 (Why is no real title available?)
• scientific article; zbMATH DE number 1049353 (Why is no real title available?)
• scientific article; zbMATH DE number 1181255 (Why is no real title available?)
• La méthode de Rayleigh Ritz appliquee à des opérateurs différentiels elliptiques - ordre de convergence des éléments propres
• New A Priori FEM Error Estimates for Eigenvalues
• On the Lebesgue Function for Polynomial Interpolation
• Optimal Local Approximation Spaces for Generalized Finite Element Methods with Application to Multiscale Problems
• Randomized local model order reduction
• Regularity of the solutions of elliptic systems in polyhedral domains
• The partition of unity finite element method: basic theory and applications

Cited in

(6)

• A symmetry-based decomposition approach to eigenvalue problems
• Communication-Efficient Distributed Eigenspace Estimation
• Spectral distributed Lagrange multiplier method: algorithm and benchmark tests
• Hybrid Nitsche method for distributed computing
• Distributed finite element solution using model order reduction
• Maximizing the smallest eigenvalue of grounded Laplacian matrices via edge addition

Describes a project that uses

Uses Software

• GNU parallel

This page was built for publication: Distributed solution of Laplacian eigenvalue problems

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