Discrete approximations to continuous density functions that are \(L_ 1\) optimal (Q1064774): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Q688742 / rank | |||
Property / reviewed by | |||
Property / reviewed by: Dietrich Braess / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: IMSL Numerical Libraries / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0167-9473(83)90089-0 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2060088048 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Adaptive control of linear stochastic systems / rank | |||
Normal rank |
Latest revision as of 19:15, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Discrete approximations to continuous density functions that are \(L_ 1\) optimal |
scientific article |
Statements
Discrete approximations to continuous density functions that are \(L_ 1\) optimal (English)
0 references
1983
0 references
Let f(x), \(a\leq x\leq b\), be a continuous density function. The corresponding distribution function F(x) is to be approximated by a piecewise constant function \(G(x)=\sum_{(x<x_ i)}g(x_ i)\). The 2n parameters \(x_ i\) and \(D_ i=G(x_ i)\) for \(i=1,2,...,n\) are to be determined, such that the \(L_ 1\)-distance \(\int | F(x)-(x)| dx\) is minimal. From the characterization of a best approximation as a critical point, it follows that \(D_ i=F(x_ i+x_{i+1})/2\) and \(F(x_ i)=(D_{i-1}+D_ i)/2\) holds for \(i=1,2,...,n\). The author shows that all parameters are given, if \(x_ 1\) is known. Therefore, the approximation problem is reduced to a one-dimensional optimization problem.
0 references
optimal discrete approximation
0 references
continuous density function
0 references
density approximation
0 references