1000 resultados para Lanczos-algorithm
Resumo:
The stable similarity reduction of a nonsymmetric square matrix to tridiagonal form has been a long-standing problem in numerical linear algebra. The biorthogonal Lanczos process is in principle a candidate method for this task, but in practice it is confined to sparse matrices and is restarted periodically because roundoff errors affect its three-term recurrence scheme and degrade the biorthogonality after a few steps. This adds to its vulnerability to serious breakdowns or near-breakdowns, the handling of which involves recovery strategies such as the look-ahead technique, which needs a careful implementation to produce a block-tridiagonal form with unpredictable block sizes. Other candidate methods, geared generally towards full matrices, rely on elementary similarity transformations that are prone to numerical instabilities. Such concomitant difficulties have hampered finding a satisfactory solution to the problem for either sparse or full matrices. This study focuses primarily on full matrices. After outlining earlier tridiagonalization algorithms from within a general framework, we present a new elimination technique combining orthogonal similarity transformations that are stable. We also discuss heuristics to circumvent breakdowns. Applications of this study include eigenvalue calculation and the approximation of matrix functions.
Resumo:
The electronic structure of a bounded intrinsic stacking fault in silicon is calculated. The method used is an LCAO-scheme (Linear Combinations of Atomic Orbitals) taking ten atomic orbitals of s-, p-, and d-type into account. The levels in the band gap are extracted using Lanczos' algorithm and a continued fraction representation of the local density of states. We find occupied states located up to 0.3 eV above the valence band maximum (E(v)). This significantly differs from the result obtained for the ideal infinite fault for which the interface state is located at E(v)+ 0.1 eV.
Resumo:
The advantages of the supercell model in employing the recursion method are discussed in comparison with the cluster model. A transformation for changing complex Bloch-sum seed states to real seed states in recursion calculations is presented and band dispersion in the recursion method is extracted with use of the Lanczos algorithm. The method is illustrated by the band structure of GaAs in the empirical tight-binding parametrized model. In the supercell model, the treatment of boundary conditions is discussed for various seed-state choices. The method is useful in applying tight-binding techniques to systems with substantial deviations from periodicity.
Resumo:
An LCAO scheme (linear combination of atomic orbitals) taking into account ten atomic orbitals (s-, p-, and d-type) is used to calculate the electronic structure of a vacancy present in the core of the reconstructed 90 degrees partial dislocation in silicon. The levels in the band gap are extracted using Lanczos' algorithm and a continued fraction representation of the local density of states. The three-fold degenerate stale of the ideal vacancy is split into three levels with energies 0.26, 1.1, and 1.9 eV measured from the valence band edge.
Resumo:
The electronic excitations of naphthalene and a family of bridged naphthalene dimers are calculated and analyzed by using the Collective Electronic Oscillator method combined with the oblique Lanczos algorithm. All experimentally observed trends in absorption profiles and radiative lifetimes are reproduced. Each electronic excitation is linked to the corresponding real-space transition density matrix, which represents the motions of electrons and holes created in the molecule by photon absorption. Two-dimensional plots of these matrices help visualize the degree of exciton localization and explain the dependence of the electronic interaction between chromophores on their separation.
Resumo:
We extend our Lanczos subspace time-independent wave packet method [J. Chem. Phys. 116 (2002) 2354] to investigate the issue of symmetry contaminations for the challenging deep-well H + O-2 reaction. Our central objective is to address the issue of whether significant symmetry contamination can occur if a wavepacket initially possessing the correct O-O exchange symmetry is propagated over tens of thousands of recursive steps using a basis which does not explicitly enforce the correct symmetry, and if so how seriously this affects the results. We find that symmetry contamination does exist where the symmetry constraint is not explicitly enforced in the basis. While it affects individual resonances and the associated peak amplitudes, the overall shape of the more averaged quantities such as total reaction probabilities and vibrational branching ratios are not seriously affected. (C) 2004 Elsevier B.V. All rights reserved.
Resumo:
The treatment of the Random-Phase Approximation Hamiltonians, encountered in different frameworks, like time-dependent density functional theory or Bethe-Salpeter equation, is complicated by their non-Hermicity. Compared to their Hermitian Hamiltonian counterparts, computational methods for the treatment of non-Hermitian Hamiltonians are often less efficient and less stable, sometimes leading to the breakdown of the method. Recently [Gruning et al. Nano Lett. 8 (2009) 28201, we have identified that such Hamiltonians are usually pseudo-Hermitian. Exploiting this property, we have implemented an algorithm of the Lanczos type for Random-Phase Approximation Hamiltonians that benefits from the same stability and computational load as its Hermitian counterpart, and applied it to the study of the optical response of carbon nanotubes. We present here the related theoretical grounds and technical details, and study the performance of the algorithm for the calculation of the optical absorption of a molecule within the Bethe-Salpeter equation framework. (C) 2011 Elsevier B.V. All rights reserved.
Resumo:
We present an efficient and robust method for the calculation of all S matrix elements (elastic, inelastic, and reactive) over an arbitrary energy range from a single real-symmetric Lanczos recursion. Our new method transforms the fundamental equations associated with Light's artificial boundary inhomogeneity approach [J. Chem. Phys. 102, 3262 (1995)] from the primary representation (original grid or basis representation of the Hamiltonian or its function) into a single tridiagonal Lanczos representation, thereby affording an iterative version of the original algorithm with greatly superior scaling properties. The method has important advantages over existing iterative quantum dynamical scattering methods: (a) the numerically intensive matrix propagation proceeds with real symmetric algebra, which is inherently more stable than its complex symmetric counterpart; (b) no complex absorbing potential or real damping operator is required, saving much of the exterior grid space which is commonly needed to support these operators and also removing the associated parameter dependence. Test calculations are presented for the collinear H+H-2 reaction, revealing excellent performance characteristics. (C) 2004 American Institute of Physics.