相关论文: PASE: A Massively Parallel Augmented Subspace Eige…
A type of parallel augmented subspace scheme for eigenvalue problems is proposed by using coarse space in the multigrid method. With the help of coarse space in multigrid method, solving the eigenvalue problem in the finest space is…
In this paper, we present a nonnested augmented subspace algorithm and its multilevel correction method for solving eigenvalue problems with curved interfaces. The augmented subspace algorithm and the corresponding multilevel correction…
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…
This study proposes a class of augmented subspace schemes for the weak Galerkin (WG) finite element method used to solve eigenvalue problems. The augmented subspace is built with the conforming linear finite element space defined on the…
As modern massively parallel clusters are getting larger with beefier compute nodes, traditional parallel eigensolvers, such as direct solvers, struggle keeping the pace with the hardware evolution and being able to scale efficiently due to…
Large-scale eigenvalue problems arise in various fields of science and engineering and demand computationally efficient solutions. In this study, we investigate the subspace approximation for parametric linear eigenvalue problems, aiming to…
Solving dense Hermitian eigenproblems arranged in a sequence with direct solvers fails to take advantage of those spectral properties which are pertinent to the entire sequence, and not just to the single problem. When such features take…
In this paper, a new type of multi-level correction scheme is proposed for solving eigenvalue problems by finite element method. With this new scheme, the accuracy of eigenpair approximations can be improved after each correction step which…
Studying the optoelectronic structure of materials can require the computation of several thousands of the smallest positive eigenpairs of a pseudo-hermitian Hamiltonian. Iterative eigensolvers may be preferred over direct methods for this…
The history of research on eigenvalue problems is rich with many outstanding contributions. Nonetheless, the rapidly increasing size of data sets requires new algorithms for old problems in the context of extremely large matrix dimensions.…
In this paper, some enhanced error estimates are derived for the augmented subspace methods which are designed for solving eigenvalue problems. We will show that the augmented subspace methods have the second order convergence rate which is…
In one of the most important methods in Density Functional Theory - the Full-Potential Linearized Augmented Plane Wave (FLAPW) method - dense generalized eigenproblems are organized in long sequences. Moreover each eigenproblem is strongly…
Occluded person re-identification (Re-ID), the task of searching for the same person's images in occluded environments, has attracted lots of attention in the past decades. Recent approaches concentrate on improving performance on occluded…
A local and parallel algorithm based on the multilevel discretization is proposed in this paper to solve the eigenvalue problem by the finite element method. With this new scheme, solving the eigenvalue problem in the finest grid is…
In this paper the author introduces a new domain decomposition method for the solution of discretised integral equation eigenvalue problems. The new domain decomposition method is motivated by the so-called automated multi-level…
As supercomputers become larger with powerful Graphics Processing Unit (GPU), traditional direct eigensolvers struggle to keep up with the hardware evolution and scale efficiently due to communication and synchronization demands.…
Iterative multiscale methods for electronic structure calculations offer several advantages for large-scale problems. Here we examine a nonlinear full approximation scheme (FAS) multigrid method for solving fixed potential and…
The linear response eigenvalue problem, which arises from many scientific and engineering fields, is quite challenging numerically for large-scale sparse/dense system, especially when it has zero eigenvalues. Based on a direct sum…
A parallel implementation of an eigensolver designed for electronic structure calculations is presented. The method is applicable to computational tasks that solve a sequence of eigenvalue problems where the solution for a particular…
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…