Alternative correction equations in the Jacobi-Davidson method
The paper deals with variants of correction equations in the general framework of Jacobi-Davidson method for solving a nonsymmetric eigenvalue problem. A more restrictive correction equation for this method is proposed and its properties are investigated. The paper presents some theoretical considerations concerning relations of the standard and new techniques with respect to generated Krylov subspaces. The possible different behavior of the approaches is demonstrated by simple examples. The paper contains a set of results of a few numerical experiments. NEWLINENEWLINENEWLINEThe introduction and the subsequent section of the paper are devoted to an introduction into the Jacobi-Davidson method which is an iterative method for solving the nonsymmetric eigenvalue problem. Its relation to some Krylov space iterative solvers is explained. Starting from a description of the Rayleigh-Ritz procedure a derivation of the whole algorithm is given. Then a new and more restrictive correction equation for the search of new approximation in the space orthogonal to the current search space is introduced. A similarity of the resulting equations with the equations of the truncated RQ algorithm is mentioned. NEWLINENEWLINENEWLINELater, two simple examples which give some insight into the differences between the standard, restricted and intermediate forms of the correction equations are presented. NEWLINENEWLINENEWLINEThe problem of the exact solving of the correction equations is treated in the subsequent section. In particular, the relation between search vectors and Krylov subspaces is investigated. This section forms a theoretical core of the paper giving a theoretical insight into the search spaces induced by different correction equations. NEWLINENEWLINENEWLINEThe last section of the paper is devoted to numerical experiments. It is shown that both the standard and the restricted correction equations give comparable convergence rates in finite precision arithmetic provided the correction equations are solved very precisely. If the Krylov structure of the search space is seriously perturbed then the new restricted correction equation suffers more and its convergence rate in the experiments is significantly slower. In spite of the fact that the new restricted correction equation may have more favourable spectral properties which often corresponds to better solvability by linear solvers, this may not necessarily compensate the slower convergence of the algorithm.
- A refined Jacobi-Davidson method and its correction equation
- On the correction equation of the Jacobi-Davidson method
- Behavior of the correction equations in the Jacobi-Davidson method
- Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems
- Studies on Jacobi–Davidson, Rayleigh quotient iteration, inverse iteration generalized Davidson and Newton updates
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- A Truncated RQ Iteration for Large Scale Eigenvalue Calculations
- Accelerated Inexact Newton Schemes for Large Systems of Nonlinear Equations
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
- GMRESR: a family of nested GMRES methods
- scientific article; zbMATH DE number 3671573 (Why is no real title available?)
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils
- Robust preconditioning of large, sparse, symmetric eigenvalue problems
- Truncation Strategies for Optimal Krylov Subspace Methods
- VLUGR3: A vectorizable adaptive grid solver for PDEs in 3D. I: Algorithmic aspects and applications
- On correction equations and domain decomposition for computing invariant subspaces
- Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems
- New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem
- Computing eigenpairs in augmented Krylov subspace produced by Jacobi-Davidson correction equation
- The least squares and line search in extracting eigenpairs in Jacobi-Davidson method
- Behavior of the correction equations in the Jacobi-Davidson method
- Computing eigenpairs of Hermitian matrices in augmented Krylov subspace produced by Rayleigh quotient iterations
- Rayleigh quotient minimization method for symmetric eigenvalue problems
- Filtered Krylov-like sequence method for symmetric eigenvalue problems
- A refined Jacobi-Davidson method and its correction equation
- The Jacobi-Davidson method
- Studies on Jacobi–Davidson, Rayleigh quotient iteration, inverse iteration generalized Davidson and Newton updates
- Modified block Jacobi-Davidson method for solving large sparse eigenproblems
- A Case for a Biorthogonal Jacobi--Davidson Method: Restarting and Correction Equation
- On the subspace projected approximate matrix method.
- On the correction equation of the Jacobi-Davidson method
- An integrated Davidson and multigrid solution approach for very large scale symmetric eigenvalue problems
This page was built for publication: Alternative correction equations in the Jacobi-Davidson method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760355)
