Optimal Recovery of a Family of Operators from Inaccurate Measurements on a Compact Set

Given a one-parameter family of continuous linear operators , with , we consider the optimal recovery of the values of on the whole space by approximate information on the values of , where runs over a compact set and . We find a family of optimal methods for recovering the values of . Each of these...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Siberian mathematical journal Ročník 65; číslo 2; s. 495 - 504
Hlavní autor: Sivkova, E. O.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Moscow Pleiades Publishing 01.03.2024
Springer Nature B.V
Témata:
Accuracy
Constraints
Dirichlet problem
Fourier transforms
Half spaces
Hyperplanes
Inequality
Linear operators
Linear programming
Mathematics
Mathematics and Statistics
Methods
Operators (mathematics)
Recovery
Thermodynamics
Upper bounds
Vector spaces
heat equation
optimal method
517.9
extremal problem
Fourier transform
Dirichlet problem
optimal recovery
ISSN:0037-4466, 1573-9260
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Given a one-parameter family of continuous linear operators , with , we consider the optimal recovery of the values of on the whole space by approximate information on the values of , where runs over a compact set and . We find a family of optimal methods for recovering the values of . Each of these methods uses approximate measurements at no more than two points in and depends linearly on these measurements. As a corollary, we provide some families of optimal methods for recovering the solution of the heat equation at a given moment of time from inaccurate measurements on other time intervals and for solving the Dirichlet problem for a half-space on a hyperplane by inaccurate measurements on other hyperplanes. The optimal recovery of the values of from the indicated information reduces to finding the value of an extremal problem for the maximum with continuum many inequality-type constraints, i.e., to finding the exact upper bound of the maximized functional under these constraints. This rather complicated task reduces to the infinite-dimensional problem of linear programming on the vector space of all finite real measures on the -algebra of Lebesgue measurable sets in . This problem can be solved by some generalization of the Karush–Kuhn–Tucker theorem, and its significance coincides with the significance of the original problem.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0037-4466
1573-9260
DOI:10.1134/S0037446624020228