✦ LIBER ✦

Upper and lower bounds on scattering matrix elements for complex systems

✍ Scribed by L.M. Delves

Publisher: Elsevier Science
Year: 1963
Weight: 250 KB
Volume: 45
Category: Article
ISSN: 0029-5582
DOI: 10.1016/0029-5582(63)90819-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper and lower bounds for inverse eleme

Upper and lower bounds for inverse elements of finite and infinite tridiagonal matrices

✍ P.N. Shivakumar; Chuanxiang Ji 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 881 KB

Complementary upper and lower truncated

Complementary upper and lower truncated sum, multiple scattering bounds on the effective emissivity

✍ Yong Xia; William Strieder 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 914 KB

Upper and lower bounds on eigenvalues of

Upper and lower bounds on eigenvalues of second-order Sturm-Liouville systems

✍ Joyce R McLaughlin 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 573 KB

Upper bound on the neutron-deuteron doub

Upper bound on the neutron-deuteron doublet scattering length (I): Matrix elements of the Hamiltonian

✍ L.M. Delves; J.N. Lyness 📂 Article 📅 1963 🏛 Elsevier Science ⚖ 520 KB

Upper and lower bounds for the solution

Upper and lower bounds for the solution of the general matrix Riccati differential equation

✍ K.N. Murty; K.R. Prasad; M.A.S. Srinivas 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 411 KB

Upper and lower bounds for the average-c

Upper and lower bounds for the average-case complexity of path-search

✍ Pippenger, Nicholas 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 1 views

A channel graph is the union of all paths between a given input and a given output in an interconnection network. At any moment in time, each vertex in such a graph is either idle or busy. The search problem that we consider is to find a path (from the given input to the given output) consisting ent