• Corpus ID: 244102648

GCGE: A Package for Solving Large Scale Eigenvalue Problems by Parallel Block Damping Inverse Power Method

@article{Li2021GCGEAP,
  title={GCGE: A Package for Solving Large Scale Eigenvalue Problems by Parallel Block Damping Inverse Power Method},
  author={Yu Li and Zijing Wang and Hehu Xie},
  journal={ArXiv},
  year={2021},
  volume={abs/2111.06552}
}
We propose an eigensolver and the corresponding package, GCGE, for solving large scale eigenvalue problems. This method is the combination of damping idea, subspace projection method and inverse power method with dynamic shifts. To reduce the dimensions of projection subspaces, a moving mechanism is developed when the number of desired eigenpairs is large. The numerical methods, implementing techniques and the structure of the package are presented. Plenty of numerical results are provided to… 

References

SHOWING 1-10 OF 26 REFERENCES

A parallel generalized conjugate gradient method for large scale eigenvalue problems

Techniques for orthogonalization and computing Rayleigh-Ritz problems are introduced to improve the stability, efficiency and scalability of the proposed generalized parallel conjugate gradient method for large scale eigenvalue problems.

SLEPc: A scalable and flexible toolkit for the solution of eigenvalue problems

The Scalable Library for Eigenvalue Problem Computations (SLEPc) is a software library for computing a few eigenvalues and associated eigenvectors of a large sparse matrix or matrix pencil. It has

Numerical methods for large eigenvalue problems

Over the past decade considerable progress has been made towards the numerical solution of large-scale eigenvalue problems, particularly for nonsymmetric matrices, and the methods and software that have led to these advances are surveyed.

Efficient solution of symmetric eigenvalue problems using multigridpreconditioners in the locally optimal block conjugate gradient method

Results of numerical tests are presented, which demonstrate practical effectiveness of the approach for the locally optimal block conjugate gradient method preconditioned by the standard V-cycle multigrid applied to the stiffness matrix.

Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method

  • A. Knyazev
  • Computer Science
    SIAM J. Sci. Comput.
  • 2001
Numerical results establish that the LOBPCG method is practically as efficient as the ``ideal'' algorithm when the same preconditioner is used in both methods, and direct numerical comparisons with the Jacobi--Davidson method show that the method is more robust and converges almost two times faster.

The Design and Implementation of hypre, a Library of Parallel High Performance Preconditioners

This chapter discusses the design of the conceptual interfaces in hypre and illustrates their use with various examples, and discusses the data structures and parallel implementation of these interfaces.

Parallel computing of large-scale modal ananlysis based on Jacobi-Davidson algorithm

The improved J-D method takes on an excellent parallel scalability that the speedup curves are almost linear within128 testing processors and the curve is gradually close to the ideal speedup one as the computing scale is accreting.

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

Numerically the scalability of BLOPEX is demonstrated by testing it on a number of distributed and shared memory parallel systems, including a Beowulf system, SUN Fire 880, an AMD dual-core Opteron workstation, and IBM BlueGene/L supercomputer, using PETSc domain decomposition and hypre multigrid preconditioning.

Real-space pseudopotential method for first principles calculations of general periodic and partially periodic systems

This work presents a real-space method based on the self-consistent solution of the Kohn-Sham equations, using first principles pseudopotentials, on a uniform three-dimensional non-Cartesian grid for electronic-structure calculations of systems with general full or partial periodicity.

Templates for the Solution of Algebraic Eigenvalue Problems

This book discusses iterative projection methods for solving Eigenproblems, and some of the techniques used to solve these problems came from the literature on Hermitian Eigenvalue.