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

Upper and lower bounds for solutions to the transport equation

โœ Scribed by Bruce A. Finlayson; L. E. Scriven

Publisher
American Institute of Chemical Engineers
Year
1966
Tongue
English
Weight
743 KB
Volume
12
Category
Article
ISSN
0001-1541

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The Lower Bounds of T-Periodic Solutions
The Lower Bounds of T-Periodic Solutions for the Forced Duffing Equation
โœ Chengwen Wang ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 98 KB

This paper is devoted to the discussion of the number of T -periodic solutions for the forced Duffing equation, x + kx + g t x = s 1 + h t , with g t x being a continuous function by using the degree theory, upper and lower solutions method, and the twisting theorem.

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