Explicit solution of the finite time \(L_{2}\)-norm polynomial approximation problem (Q545984): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.amc.2011.03.032 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1984332703 / rank | |||
Normal rank |
Revision as of 19:28, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Explicit solution of the finite time \(L_{2}\)-norm polynomial approximation problem |
scientific article |
Statements
Explicit solution of the finite time \(L_{2}\)-norm polynomial approximation problem (English)
0 references
24 June 2011
0 references
For a function \(y: [0,\,T] \to \mathbb R\) with \(m\) known repeated integrals, the authors consider the following \(L_2\)-approximation problem: Find an algebraic polynomial \(p\) of degree \(m-1\) such that \[ \int_0^T (y(t) - p(t))^2 \, dt = \min. \] Using the basis of Laguerre and Bernstein polynomials, respectively, the coefficients of the polynomial of best approximation are obtained by matrix-vector multiplications. Numerical tests are not presented.
0 references
polynomial approximation
0 references
\(L_2\)-approximation
0 references
Laguerre polynomials
0 references
Bernstein polynomials
0 references