The generalized eigenvalue problem for a symmetric definite matrix pencil obtained from finite-element modeling of electroelastic materials is solved numerically by the Lanczos algorithm. The mass matrix is singular in the considered problem, and therefore the process proceeds with the semi-inner product defined by this matrix. The shift-and-invert Lanczos algorithm is used to find multiple eigenvalues closest to some shift and the corresponding eigenvectors. The results of the numerical experiments are presented
AbstractFirst we identify five options which can be used to distinguish one Lanczos eigenelement pro...
Ab-initio methods for calculating electronic structure represent an important field of material phys...
We consider a large-scale quadratic eigenvalue problem (QEP), formulated using P1 finite e...
<div><p>Abstract An adaptation of the conventional Lanczos algorithm is proposed to solve the gener...
The purpose of this work is to analyse the efficiency of some techniques to solve the generalized ei...
Eigenvalue problems for very large sparse matrices based on the Lanczos' minimized iteration method ...
In this thesis, we develop an efficient accurate numerical algorithm for evaluating a few of the sma...
AbstractWe are concerned with eigenvalue problems for definite and indefinite symmetric matrix penci...
ABSTRACT: This paper presents a parallel implementation of the implicitly restarted Lanc-zos method ...
AbstractIterative algorithms for the eigensolution of symmetric pencils of matrices are considered. ...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/...
We consider a large-scale quadratic eigenvalue problem (QEP), formulated using P1 finite elements on...
This paper is the second part of educational series dedicated to numerical methods in mechanics of s...
In the present paper, we analyse the computational performance of the Lanczos method and a recent op...
Includes bibliographical references (p. 70-74)We are interested in computing eigenvalues and eigenve...
AbstractFirst we identify five options which can be used to distinguish one Lanczos eigenelement pro...
Ab-initio methods for calculating electronic structure represent an important field of material phys...
We consider a large-scale quadratic eigenvalue problem (QEP), formulated using P1 finite e...
<div><p>Abstract An adaptation of the conventional Lanczos algorithm is proposed to solve the gener...
The purpose of this work is to analyse the efficiency of some techniques to solve the generalized ei...
Eigenvalue problems for very large sparse matrices based on the Lanczos' minimized iteration method ...
In this thesis, we develop an efficient accurate numerical algorithm for evaluating a few of the sma...
AbstractWe are concerned with eigenvalue problems for definite and indefinite symmetric matrix penci...
ABSTRACT: This paper presents a parallel implementation of the implicitly restarted Lanc-zos method ...
AbstractIterative algorithms for the eigensolution of symmetric pencils of matrices are considered. ...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/...
We consider a large-scale quadratic eigenvalue problem (QEP), formulated using P1 finite elements on...
This paper is the second part of educational series dedicated to numerical methods in mechanics of s...
In the present paper, we analyse the computational performance of the Lanczos method and a recent op...
Includes bibliographical references (p. 70-74)We are interested in computing eigenvalues and eigenve...
AbstractFirst we identify five options which can be used to distinguish one Lanczos eigenelement pro...
Ab-initio methods for calculating electronic structure represent an important field of material phys...
We consider a large-scale quadratic eigenvalue problem (QEP), formulated using P1 finite e...