𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An easy computable upper bound for the price of an arithmetic Asian option

✍ Scribed by S. Simon; M.J. Goovaerts; J. Dhaene

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
86 KB
Volume
26
Category
Article
ISSN
0167-6687

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The upper bound theorem for polytopes: a
The upper bound theorem for polytopes: an easy proof of its asymptotic version
✍ Raimund Seidel πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 128 KB

Since at least half of the d edges incident to a vertex u of a simple d-polytope P either all point "up" or all point "down," v must be the unique "bottom" or "top" vertex of a face of P of dimension at least d/2. Thus the number of P's vertices is at most twice the number of such high-dimensional f

A fast algorithm for the computation of
A fast algorithm for the computation of an upper bound on the ΞΌ-norm
✍ Craig T. Lawrence; AndrΓ© L. Tits; Paul Van Dooren πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 269 KB

A fast algorithm for the computation of the optimally frequency-dependent scaled H -norm of a "nite-dimensional LTI system is presented. It is well known that this quantity is an upper bound to the ` -norma; furthermore, it was recently shown to play a special role in the context of slowly time-vary

An upper bound for the diameter of a pol
An upper bound for the diameter of a polytope
✍ David Barnette πŸ“‚ Article πŸ“… 1974 πŸ› Elsevier Science 🌐 English βš– 515 KB

The distance between two vertices of a polytope is the minimum number of edges in a path joining them. The diameter of a polytope is the greatest distance between two vertices of the polytope. We show that if P is a d-dimensional polytope with n facets, then the diameter of P is at most $ $-3(,r -d