Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc

DOI10.1137/060661624zbMath1149.65026arXiv0705.2626OpenAlexW3102398037WikidataQ56519604 ScholiaQ56519604MaRDI QIDQ3525963

Ilya V. Lashuk, Evgueni E. Ovtchinnikov, Andrew V. Knyazev, Merico E. Argentati

Publication date: 23 September 2008

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

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

zbMATH Keywords

numerical examples domain decomposition preconditioning iterative method parallel computing multigrid conjugate gradient

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05) Packaged methods for numerical algorithms (65Y15) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (39)

Convergence Analysis of Newton–Schur Method for Symmetric Elliptic Eigenvalue Problem ⋮ Basis selection in LOBPCG ⋮ Heavy ball restarted CMRH methods for linear systems ⋮ Efficient iterative method for solving the Dirac-Kohn-Sham density functional theory ⋮ A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix ⋮ Preconditioned Locally Harmonic Residual Method for Computing Interior Eigenpairs of Certain Classes of Hermitian Matrices ⋮ Trace-penalty minimization for large-scale eigenspace computation ⋮ Numerical solution of the Kohn-Sham equation by finite element methods with an adaptive mesh redistribution technique ⋮ On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems ⋮ An indefinite variant of LOBPCG for definite matrix pencils ⋮ Extracting connectivity paths in digital core images using solution of partial minimum eigenvalue problem ⋮ Block subspace projection preconditioned conjugate gradient method in modal structural analysis ⋮ A locally optimal preconditioned Newton-Schur method for symmetric elliptic eigenvalue problems ⋮ Sharp Majorization-Type Cluster Robust Bounds for Block Filters and Eigensolvers ⋮ Weighted Trace-Penalty Minimization for Full Configuration Interaction ⋮ Solution of the Schrödinger equation for quasi-one-dimensional materials using helical waves ⋮ Fast iterative interior eigensolver for millions of atoms ⋮ An \(h\)-adaptive finite element solver for the calculations of the electronic structures ⋮ Computing the smallest singular triplets of a large matrix ⋮ A Parallel Augmented Subspace Method for Eigenvalue Problems ⋮ Low-rank Riemannian eigensolver for high-dimensional Hamiltonians ⋮ Computing the null space of finite element problems ⋮ TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems ⋮ State-of-the-art eigensolvers for electronic structure calculations of large scale nano-systems ⋮ GPU-Accelerated LOBPCG Method with Inexact Null-Space Filtering for Solving Generalized Eigenvalue Problems in Computational Electromagnetics Analysis with Higher-Order FEM ⋮ On Stabilizing and Accelerating SCF Using ITP in Solving Kohn–Sham Equation ⋮ An asymptotics-based adaptive finite element method for Kohn-Sham equation ⋮ Efficient parallel solution to large‐size sparse eigenproblems with block FSAI preconditioning ⋮ JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices ⋮ Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems ⋮ A Robust and Efficient Implementation of LOBPCG ⋮ A spectral scheme for Kohn-Sham density functional theory of clusters ⋮ Preconditioned gradient iterations for the eigenproblem of definite matrix pairs ⋮ Robust a posteriori error estimation for finite element approximation to \(\boldsymbol{H}(\mathbf{curl})\) problem ⋮ Complexity of linear minimization and projection on some sets ⋮ The Eigenvalues Slicing Library (EVSL): Algorithms, Implementation, and Software ⋮ Feast Eigensolver for Non-Hermitian Problems ⋮ A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc ⋮ Recent advances in adaptive coarse spaces and availability in open source libraries

Uses Software

This page was built for publication: Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc