𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the rapid computation of matrix elements

✍ Scribed by Franklin Prosser; Stanley Hagstrom


Publisher
John Wiley and Sons
Year
1968
Tongue
English
Weight
564 KB
Volume
2
Category
Article
ISSN
0020-7608

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Numerical instabilities in the computati
✍ Christoph van WΓΌllen πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 99 KB

## Abstract Steep high angular momentum Gaussian basis functions in the vicinity of a nucleus whose inner electrons are replaced by an effective core potential may lead to numerical instabilities when calculating matrix elements of the core potential. Numerical roundoff errors may be amplified to a

On the rapid evaluation of cofactors in
✍ Fokke Dijkstra; Joop H. Van Lenthe πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 153 KB

The calculation of matrix elements involving nonorthogonal orbitals is speeded up by recognizing the orthogonalities between orbitals, leading to generalized Slater rules. The block structure present in the overlap matrix makes an efficient evaluation of its cofactors possible. These cofactors are c

On the computation of matrix elements be
✍ H. Kobeissi; M. Dagher; A. El-Hajj; M. Kobeissi πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 727 KB

The problem of the computation of the matrix elements Z ( v , v ' ; k ) = [ q U ( r ) ( r -rJkqUr(r)dr, is considered when q u ( r ) and q J r ) are eigenfunctions related to a diatomic potential of the RKR type (defined by the coordinates of its turning points Pi with polynomial interpolations). Th

Parallel experience on the inverse matri
✍ E. Francomano; A. Pecorella; A. Tortorici Macaluso πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 229 KB

In this paper a new structure of computation to evaluate the inverse matrix has been performed, composing in an opportune way the bordering-method and the recursive partitioning method. The scheme reported is based on the block decomposition and on the elimination of the recursion in the process\_ T