Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA thick-restart Lanczos type method for Hermitian $J$-symmetric eigenvalue problems
105
0
0.0
(
0
)
Added by
Ken-Ichi Ishikawa
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
A thick-restart Lanczos type algorithm is proposed for Hermitian $J$-symmetric matrices. Since Hermitian $J$-symmetric matrices possess doubly degenerate spectra or doubly multiple eigenvalues with a simple relation between the degenerate eigenvectors, we can improve the convergence of the Lanczos algorithm by restricting the search space of the Krylov subspace to that spanned by one of each pair of the degenerate eigenvector pairs. We show that the Lanczos iteration is compatible with the $J$-symmetry, so that the subspace can be split into two subspaces that are orthogonal to each other. The proposed algorithm searches for eigenvectors in one of the two subspaces without the multiplicity. The other eigenvectors paired to them can be easily reconstructed with the simple relation from the $J$-symmetry. We test our algorithm on randomly generated small dense matrices and a sparse large matrix originating from a quantum field theory.
rate research
Read More
We propose a thick-restart block Lanczos method, which is an extension of the thick-restart Lanczos method with the block algorithm, as an eigensolver of the large-scale shell-model calculations. This method has two advantages over the conventional Lanczos method: the precise computations of the near-degenerate eigenvalues, and the efficient computations for obtaining a large number of eigenvalues. These features are quite advantageous to compute highly excited states where the eigenvalue density is rather high. A shell-model code, named KSHELL, equipped with this method was developed for massively parallel computations, and it enables us to reveal nuclear statistical properties which are intensively investigated by recent experimental facilities. We describe the algorithm and performance of the KSHELL code and demonstrate that the present method outperforms the conventional Lanczos method.
A novel orthogonalization-free method together with two specific algorithms are proposed to solve extreme eigenvalue problems. On top of gradient-based algorithms, the proposed algorithms modify the multi-column gradient such that earlier columns are decoupled from later ones. Global convergence to eigenvectors instead of eigenspace is guaranteed almost surely. Locally, algorithms converge linearly with convergence rate depending on eigengaps. Momentum acceleration, exact linesearch, and column locking are incorporated to further accelerate both algorithms and reduce their computational costs. We demonstrate the efficiency of both algorithms on several random matrices with different spectrum distribution and matrices from computational chemistry.
Problems with localized nonhomogeneous material properties arise frequently in many applications and are a well-known source of difficulty in numerical simulations. In certain applications (including additive manufacturing), the physics of the problem may be considerably more complicated in relatively small portions of the domain, requiring a significantly finer local mesh compared to elsewhere in the domain. This can make the use of a uniform mesh numerically unfeasible. While nonuniform meshes can be employed, they may be challenging to generate (particularly for regions with complex boundaries) and more difficult to precondition. The problem becomes even more prohibitive when the region requiring a finer-level mesh changes in time, requiring the introduction of refinement and derefinement techniques. To address the aforementioned challenges, we employ a technique related to the Fat boundary method as a possible alternative. We analyze the proposed methodology, from a mathematical point of view and validate our findings on two-dimensional numerical tests.
Pole-swapping algorithms are generalizations of bulge-chasing algorithms for the generalized eigenvalue problem. Structure-preserving pole-swapping algorithms for the palindromic and alternating eigenvalue problems, which arise in control theory, are derived. A refinement step that guarantees backward stability of the algorithms is included. This refinement can also be applied to bulge-chasing algorithms that had been introduced previously, thereby guaranteeing their backward stability in all cases.
A thorough backward stability analysis of Hotellings deflation, an explicit external deflation procedure through low-rank updates for computing many eigenpairs of a symmetric matrix, is presented. Computable upper bounds of the loss of the orthogonality of the computed eigenvectors and the symmetric backward error norm of the computed eigenpairs are derived. Sufficient conditions for the backward stability of the explicit external deflation procedure are revealed. Based on these theoretical results, the strategy for achieving numerical backward stability by dynamically selecting the shifts is proposed. Numerical results are presented to corroborate the theoretical analysis and to demonstrate the stability of the procedure for computing many eigenpairs of large symmetric matrices arising from applications.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
