Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method

From MaRDI portal
Publication:477157

DOI10.1007/s11425-014-4791-5zbMath1312.65054arXiv1109.5455OpenAlexW2118497999MaRDI QIDQ477157

Zhongxiao Jia, Cen Li

Publication date: 2 December 2014

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.5455




Related Items (18)

iSIRA: integrated shift-invert residual Arnoldi method for graph Laplacian matrices from big dataA convergence analysis of the inexact simplified Jacobi-Davidson algorithm for polynomial eigenvalue problemsTheoretical and Computable Optimal Subspace Expansions for Matrix Eigenvalue ProblemsElectromagnetic field behavior of 3D Maxwell's equations for chiral mediaThe inexact residual iteration method for quadratic eigenvalue problem and the analysis of convergenceA hybrid Jacobi-Davidson method for interior cluster eigenvalues with large null-space in three dimensional lossless drude dispersive metallic photonic crystalsTwo harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pairA cross-product free Jacobi-Davidson type method for computing a partial generalized singular value decomposition of a large matrix pairThe bi-Lebedev scheme for the Maxwell eigenvalue problem with 3D bi-anisotropic complex mediaOn expansion of search subspaces for large non-Hermitian eigenproblemsAn extended shift-invert residual Arnoldi methodOn the correction equation of the Jacobi-Davidson methodEigenvalue solvers for three dimensional photonic crystals with face-centered cubic latticeHarmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problemsAn efficient contour integral based eigensolver for 3D dispersive photonic crystalOn Inner Iterations of Jacobi--Davidson Type Methods for Large SVD ComputationsA Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse MatricesA positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible \(M\)-matrix


Uses Software


Cites Work


This page was built for publication: Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method