Linear ill-posed problems are solvable on the average for all Gaussian measures (Q1345067): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5816908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the average case solvability of ill-posed problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian measures in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blaschke products and optimal recovery in \(H^{\infty}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3475789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3341778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4064239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian mean boundedness of densely defined linear operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What is the complexity of ill-posed problems? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal residual algorithms for linear operator equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000361 / rank
 
Normal rank

Revision as of 12:06, 23 May 2024

scientific article
Language Label Description Also known as
English
Linear ill-posed problems are solvable on the average for all Gaussian measures
scientific article

    Statements

    Linear ill-posed problems are solvable on the average for all Gaussian measures (English)
    0 references
    0 references
    0 references
    0 references
    1 March 1995
    0 references
    By an inverse problem the authors understand a pair consisting of a mapping \(A\) from a normed space \(G\) to a normed space \(F_1\) and of a subset \(D\) of \(F_1\). An inverse problem is said to be well-posed if \(AF_1 \subset D\), \(A\) is injective on \(A^{-1} D\), and the inverse of \(A\) on \(D\) is continuous. A problem is called ill-posed if it is not well-posed. The authors introduce a notion of approximation (related to approximation of solutions via computer). A problem which admits arbitrarily close approximation is called solvable. A weaker approximation property leads to weakly-solvable problems. The use of measure theoretical methods makes it possible to introduce the concept of problems well-posed on average. The article provides seven interesting theorems exposing relations among the introduced notions. Explanations linking the mathematics with applications and the computer approach are supplied. Highly readable.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Gaussian measures
    0 references
    inverse problem
    0 references
    well-posed
    0 references
    ill-posed
    0 references
    approximation of solutions via computer
    0 references
    weakly-solvable problems
    0 references
    measure theoretical methods
    0 references
    problems well-posed on average
    0 references