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

On energy bounds derived from the conjugate eigenvalue problem

โœ Scribed by Peter D. Robinson; Saul T. Epstein

Publisher
John Wiley and Sons
Year
1970
Tongue
English
Weight
397 KB
Volume
4
Category
Article
ISSN
0020-7608

No coin nor oath required. For personal study only.

โœฆ Synopsis

Abstract

An upper bound for E~0~, which has been derived from the conjugate eigenvalue problem by Hall, is discussed. It is emphasized that the bound is only guaranteed when V is negativeโ€definite. An alternative bound is presented which is free from this restriction, and the underlying iterative procedure is given. Hall's result is generalized to admit internuclear distances, and the theory is illustrated by a oneโ€dimensional system with deltaโ€function potentials. Some disadvantages of the approach are mentioned.

๐Ÿ“œ SIMILAR VOLUMES

Derivation of the fourth-order tangent o
Derivation of the fourth-order tangent operator based on a generalized eigenvalue problem
โœ P. Betsch; P. Steinmann ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 187 KB

Continuous and algorithmic forms of the fourth-order tangent operator corresponding to isotropic multiplicative elasto-plasticity are derived by generalizing an approach originally developed for ยฎnite elasticity. The Lagrangian description of large-strain elasto-plasticity leads to a generalized eig

The performance of an eigenvalue bound o
The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
โœ C. Delorme; S. Poljak ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 683 KB

Delorme, C. and S. Poljak, The performance of an eigenvalue bound on the max-cut problem in some classes of graphs, Discrete Mathematics 111 (1993) 145-156. The authors earlier introduced a number q(C), which gives a well-computable upper bound on the maximum bipartite subgraph of a graph or, more