We introduce a novel variant of the Lanczos method for computing a few eigenvalues of sparse and/or dense non-Hermitian systems arising from the discretization of Maxwell- or Helmholtz-type operators in electromagnetics. We develop a Krylov subspace projection technique built upon short-term vector recurrences that does not require full reorthogonalization and can approximate simultaneously both left and right eigenvectors. We report on experiments for solving eigenproblems arising in the analysis of dielectric waveguides and scattering applications from PEC structures. The theoretical and numerical results reported in this study will contribute to highlight the potential and enrich the database of this technology for solving generalized ei...
AbstractLarge sparse Hamiltonian eigenvalue problems arise in a variety of contexts. These problems ...
Applications such as the modal analysis of structures and acoustic cavities require a number of eige...
The Lanczos algorithm is evaluated for solving the time-independent as well as the time-dependent Di...
We introduce a novel variant of the Lanczos method for computing a few eigenvalues of sparse and/or ...
An efficient scheme based on the bi-Lanczos algorithm has been developed for analysis of the dielect...
We discuss several techniques for nding leading eigenvalues and eigenvectors for large sparse matric...
Includes bibliographical references (p. 70-74)We are interested in computing eigenvalues and eigenve...
This dissertation proposes an efficient eigenvalue solution method for structures by improving Lancz...
We investigate algorithms for computing steady state electromagnetic waves in cavities. The Maxwell ...
Two Krylov subspace-based methods are used to solve the sparse matrix generated by the finite differ...
. We investigate algorithms for computing steady state electromagnetic waves in cavities. The Maxwel...
The authors are interested in determining the electromagnetic fields within closed perfectly conduct...
We consider large and sparse eigenproblems where the spectrum exhibits special symmetries. Here we ...
Two stage process was used to solve the eigenvalue problems posed by dielectric waveguide formulatio...
Eigenvalue problems for very large sparse matrices based on the Lanczos' minimized iteration method ...
AbstractLarge sparse Hamiltonian eigenvalue problems arise in a variety of contexts. These problems ...
Applications such as the modal analysis of structures and acoustic cavities require a number of eige...
The Lanczos algorithm is evaluated for solving the time-independent as well as the time-dependent Di...
We introduce a novel variant of the Lanczos method for computing a few eigenvalues of sparse and/or ...
An efficient scheme based on the bi-Lanczos algorithm has been developed for analysis of the dielect...
We discuss several techniques for nding leading eigenvalues and eigenvectors for large sparse matric...
Includes bibliographical references (p. 70-74)We are interested in computing eigenvalues and eigenve...
This dissertation proposes an efficient eigenvalue solution method for structures by improving Lancz...
We investigate algorithms for computing steady state electromagnetic waves in cavities. The Maxwell ...
Two Krylov subspace-based methods are used to solve the sparse matrix generated by the finite differ...
. We investigate algorithms for computing steady state electromagnetic waves in cavities. The Maxwel...
The authors are interested in determining the electromagnetic fields within closed perfectly conduct...
We consider large and sparse eigenproblems where the spectrum exhibits special symmetries. Here we ...
Two stage process was used to solve the eigenvalue problems posed by dielectric waveguide formulatio...
Eigenvalue problems for very large sparse matrices based on the Lanczos' minimized iteration method ...
AbstractLarge sparse Hamiltonian eigenvalue problems arise in a variety of contexts. These problems ...
Applications such as the modal analysis of structures and acoustic cavities require a number of eige...
The Lanczos algorithm is evaluated for solving the time-independent as well as the time-dependent Di...