Abstract The Jacobi–Davidson method is a popular technique to compute a few eigenpairs of large sparse matrices. Its introduction, about a decade ago, was motivated by the fact that …
J Rommes - Mathematics of Computation, 2008 - ams.org
In many physical situations, a few specific eigenvalues of a large sparse generalized eigenvalue problem $ Ax=\lambda Bx $ are needed. If exact linear solves with $ A-\sigma B …
We consider the problem of determining an optimal semi‐active damping of vibrating systems. For this damping optimization we use a minimization criterion based on the …
E Romero, JE Roman - ACM Transactions on Mathematical Software …, 2014 - dl.acm.org
In the context of large-scale eigenvalue problems, methods of Davidson type such as Jacobi- Davidson can be competitive with respect to other types of algorithms, especially in some …
J Rommes, N Martins - Linear Algebra and its Applications, 2009 - Elsevier
The rapid increase in complexity of systems such as electrical circuits and power systems calls for the development of efficient numerical methods. In many cases, direct application of …
Das Verständnis von geometrischen Strukturen und dynamischen Eigenschaften molekularer Konformationen ist essentiell für die Vorhersage des Langzeitverhaltens von …
Obtaining solutions to the k-eigenvalue form of the radiation transport equation is an important topic in the design and analysis of nuclear reactors. Although this has been an …
SH Tsai, CY Lee, YK Wu - IET generation, transmission & distribution, 2010 - IET
The real variant of the Jacobi–Davidson QR (RJDQR) method is a novel and efficient subspace iteration method to find a selected subset eigenvalues of a real unsymmetric …