๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The combination of complex scaling and the Lanczos algorithm

โœ Scribed by Stefan Dallwig; Norman Fahrer; Christoph Schlier

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
677 KB
Volume
191
Category
Article
ISSN
0009-2614

No coin nor oath required. For personal study only.

โœฆ Synopsis

We present a symbiosis of three very powerful mathematical tools: the discrete variable representation (DVR), complex scaling, and the Lanczos algorithm, by which we demonstrate that the widespread negative view on combining the Lanczos algorithm with the complex coordinate method for large systems may be too pessimistic. We apply a complex version of the DVR method suitable for homogeneous operators in the DVR, such as f, and make use of a Mobius transform inducing a spectral shift, which enhances significantly the efficiency of the complex symmetric matrix adapted Lanczos algorithm. This is done without any loss of the advantages provided by each method on its own. A numerical application to a collinear A-B-A molecule is given.

๐Ÿ“œ SIMILAR VOLUMES

A combination of the lanczos algorithm w
A combination of the lanczos algorithm with the substructure technique
โœ I.-W. Lee; G.-H. Jung ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 394 KB

A modified Lanczos method combined with a substructure technique was used for calculating natural frequencies and mode shapes of large structural systems. The method does not require generation and storage of stiffness and mass matrices of the original structure. It uses only the stiffness and mass

The Lanczos algorithm applied to Kron's
The Lanczos algorithm applied to Kron's method
โœ N. S. Sehmi ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 992 KB

In this paper Kron's primitive composite system matrix is shown to be reducible to a symmetric indefinite matrix. This matrix, although never formed explicitly, can then be transformed to a tridiagonal matrix of reduced order by the Lanczos algorithm. Eigenvalue solutions of this partially tridiagon

Linear combination of Lanczos vectors: A
Linear combination of Lanczos vectors: A storage-efficient algorithm for sparse matrix eigenvector computations
โœ T. Koslowski; W. Von Niessen ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 634 KB

We present a storage-efficient and robust algorithm for the computation of eigenvectors of large sparse symmetrical matrices using a Lanczos scheme. The algorithm is based upon a linear combination of Lanczos vectors (LCLV) with a variable iteration depth. A simple method is given to determine the i