In this paper, a new variant of the Jacobi-Davidson (JD) method is presented that is specifically designed for real unsymmetric matrix pencils. Whenever a pencil has a complex conjugate pair of eigenvalues, the method computes the two-dimensional real invariant subspace spanned by the two corresponding complex conjugated eigenvectors. This is beneficial for memory costs and in many cases it also accelerates the convergence of the JD method. Both real and complex formulations of the correction equation are considered. In numerical experiments, the RJDQZ variant is compared with the original JDQZ method
We discuss a new method for the iterative computation of a portion of the spectrum of a large sparse...
. We discuss a new method for the iterative computation of a portion of the spectrum of a large spar...
We propose Jacobi-Davidson type methods for polynomial two-parameter eigenvalue problems (PMEP). Suc...
In this paper, a new variant of the Jacobi-Davidson (JD) method is presented that is specifically de...
In this paper, a new variant of the Jacobi-Davidson (JD) method is presented that is specifically de...
In this paper, a new variant of the Jacobi-Davidson (JD) method is presented that is specifically de...
In this paper, a new variant of the Jacobi-Davidson (JD) method is presented that is specifically de...
In this paper, a new variant of the Jacobi-Davidson method is presented that is specifically designe...
In this paper, a new variant of the Jacobi-Davidson method is presented that is specifically designe...
In this paper, a new variant of the Jacobi-Davidson method is presented that is specifically designe...
In this paper, a new variant of the Jacobi-Davidson method is presented that is specifically designe...
Abstract. In this paper, an adapted variant of the Jacobi-Davidson method is presented that is speci...
The Jacobi-Davidson subspace iteration method oers possibilities for solving a variety of eigenprobl...
AbstractWe develop a Jacobi-like scheme for computing the generalized Schur form ofa regular pencil ...
AbstractWe give a cubic correction step for improving the current eigenvalue algorithms for computin...
We discuss a new method for the iterative computation of a portion of the spectrum of a large sparse...
. We discuss a new method for the iterative computation of a portion of the spectrum of a large spar...
We propose Jacobi-Davidson type methods for polynomial two-parameter eigenvalue problems (PMEP). Suc...
In this paper, a new variant of the Jacobi-Davidson (JD) method is presented that is specifically de...
In this paper, a new variant of the Jacobi-Davidson (JD) method is presented that is specifically de...
In this paper, a new variant of the Jacobi-Davidson (JD) method is presented that is specifically de...
In this paper, a new variant of the Jacobi-Davidson (JD) method is presented that is specifically de...
In this paper, a new variant of the Jacobi-Davidson method is presented that is specifically designe...
In this paper, a new variant of the Jacobi-Davidson method is presented that is specifically designe...
In this paper, a new variant of the Jacobi-Davidson method is presented that is specifically designe...
In this paper, a new variant of the Jacobi-Davidson method is presented that is specifically designe...
Abstract. In this paper, an adapted variant of the Jacobi-Davidson method is presented that is speci...
The Jacobi-Davidson subspace iteration method oers possibilities for solving a variety of eigenprobl...
AbstractWe develop a Jacobi-like scheme for computing the generalized Schur form ofa regular pencil ...
AbstractWe give a cubic correction step for improving the current eigenvalue algorithms for computin...
We discuss a new method for the iterative computation of a portion of the spectrum of a large sparse...
. We discuss a new method for the iterative computation of a portion of the spectrum of a large spar...
We propose Jacobi-Davidson type methods for polynomial two-parameter eigenvalue problems (PMEP). Suc...