A Jacobi--Davidson Method for Solving Complex Symmetric Eigenvalue Problems
From MaRDI portal
Publication:4652286
DOI10.1137/S1064827502410992zbMath1061.65027MaRDI QIDQ4652286
Michiel E. Hochstenbach, Peter Arbenz
Publication date: 25 February 2005
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
numerical examplespreconditionerscubic convergenceRayleigh quotient iterationinterior eigenvalueslarge sparse matrixJacobi-Davidson algorithmgeneralized complex symmetric eigenvalue problem
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items
Mode Selecting Eigensolvers for 3D Computational Models, A large-scale nonlinear eigensolver for the analysis of dispersive nanostructures, The Joint Bidiagonalization of a Matrix Pair with Inaccurate Inner Iterations, Fast optimization of viscosities for frequency‐weighted damping of second‐order systems, A time-domain discontinuous Galerkin method for mechanical resonator quality factor computations, Computation and Applications of Mathieu Functions: A Historical Perspective, On solving complex-symmetric eigenvalue problems arising in the design of axisymmetric VCSEL devices, Approximate antilinear eigenvalue problems and related inequalities, The Jacobi-Davidson method, Diagonalization of complex symmetric matrices: generalized Householder reflections, iterative deflation and implicit shifts
Uses Software
