𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the growth of off-diagonal matrix elements in bordering methods

✍ Scribed by Kh.D. Ikramov

Book ID
104263280
Publisher
Elsevier Science
Year
1983
Weight
275 KB
Volume
23
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

✦ Synopsis

where ,'),=min {6/6>2q(q-O log. (9nm(6+1Β»}.

The proof follows from the construction of the set of algorithms {X}. and from Theorem 1.

In conclusion the author sincerely thanks Yu.I. Zhuravlev for suggesting the problem and for his interest. REFERENCES 1. VAPNIK V.N. and CHERVONENKIS A.YA., Theory of pattern recognition (Teoriya raspoznavaniya obrazov), Nauka, Moscow, 1974. 2. ZHURAVLEV YU.I., Correct algebras over sets of ill-posed (heuristic) algorithms, I.,

πŸ“œ SIMILAR VOLUMES

Long-range behavior of the off-diagonal
Long-range behavior of the off-diagonal Fock matrix elements of localized molecular orbitals
✍ JΓ‘nos Pipek πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 470 KB

The behavior of the off-diagonal Fock matrix elements of Boys-localized Hartree-Fock orbitals is studied versus the spatial separation of the localized orbitals. A universal upper bound in terms of appropriately defined vicinity quantities was found, which shows that the largest Fock matrix elements