On computing the dispersion function (Q1094128): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf00939689 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2153862782 / rank | |||
Normal rank | |||
Latest revision as of 10:37, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On computing the dispersion function |
scientific article |
Statements
On computing the dispersion function (English)
0 references
1988
0 references
A two-dimensional analogue of the well-known bisection method for root finding is presented in order to solve the following problem, related to the dispersion function of a set of random variables: given distribution functions \(F_ 1,...,F_ n\) and a probability p, find an interval [a,b] of minimum width such that \(F_ i(b)-F_ i(a^ -)\geq p\), for \(i=1,...,n\).
0 references
bisection method
0 references
root finding
0 references
dispersion function
0 references
distribution functions
0 references
concentration function
0 references
interval minimization
0 references
0 references
