Related papers: On a new notion of the solution to an ill-posed pr…
Let $A=A^*$ be a linear operator in a Hilbert space $H$. Assume that equation $Au=f \quad (1)$ is solvable, not necessarily uniquely, and $y$ is its minimal-norm solution. Assume that problem (1) is ill-posed. Let $f_\d$, $||f-f_d||\leq…
A linear equation Au=f (1) with a bounded, injective, but not boundedly invertible linear operator in a Hilbert space H is studied. A new approach to solving linear ill-posed problems is proposed. The approach consists of solving a Cauchy…
Consider an operator equation $F(u)=0$ in a real Hilbert space. The problem of solving this equation is ill-posed if the operator $F'(u)$ is not boundedly invertible, and well-posed otherwise. A general method, dynamical systems method…
We consider different concepts of well-posedness and ill-posedness and their relations for solving nonlinear and linear operator equations in Hilbert spaces. First, the concepts of Hadamard and Nashed are recalled which are appropriate for…
Consider an operator equation (*) $B(u)-f=0$ in a real Hilbert space. Let us call this equation ill-posed if the operator $B'(u)$ is not boundedly invertible, and well-posed otherwise. The DSM (dynamical systems method) for solving equation…
Many physical problems can be formulated as operator equations of the form Au = f. If these operator equations are ill-posed, we then resort to finding the approximate solutions numerically. Ill-posed problems can be found in the fields of…
The solution of linear inverse problems arising, for example, in signal and image processing is a challenging problem since the ill-conditioning amplifies, in the solution, the noise present in the data. Recently introduced algorithms based…
Consider an operator equation $F(u)=0$ in a real Hilbert space. Let us call this equation ill-posed if the operator $F'(u)$ is not boundedly invertible, and well-posed otherwise. If $F$ is monotone $C^2_{loc}(H)$ operator, then we construct…
In this paper, we study the inverse problem for a class of abstract ultraparabolic equations which is well-known to be ill-posed. We employ some elementary results of semi-group theory to present the formula of solution, then show the…
A sufficient condition for asymptotic stability of the zero solution to an abstract nonlinear evolution problem is given. The governing equation is $\dot{u}=A(t)u+F(t,u),$ where $A(t)$ is a bounded linear operator in Hilbert space $H$ and…
In this paper we discuss the adjoint stabilised finite element method introduced in, E. Burman, Stabilized finite element methods for nonsymmetric, noncoercive and ill-posed problems. Part I: elliptic equations, SIAM Journal on Scientific…
A review of the authors's results is given. Several methods are discussed for solving nonlinear equations $F(u)=f$, where $F$ is a monotone operator in a Hilbert space, and noisy data are given in place of the exact data. A discrepancy…
Assume that $$ Au=f,\quad (1) $$ is a solvable linear equation in a Hilbert space, $||A||<\infty$, and $R(A)$ is not closed, so problem (1) is ill-posed. Here $R(A)$ is the range of the linear operator $A$. A DSM (dynamical systems method)…
We consider the computation of stable approximations to the exact solution $x^\dag$ of nonlinear ill-posed inverse problems $F(x)=y$ with nonlinear operators $F:X\to Y$ between two Hilbert spaces $X$ and $Y$ by the Newton type methods $$…
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. The question then arises whether stable instances of NP--hard…
Algorithmic stability is a central concept in statistics and learning theory that measures how sensitive an algorithm's output is to small changes in the training data. Stability plays a crucial role in understanding generalization,…
Assume that $Au=f,\quad (1)$ is a solvable linear equation in a Hilbert space $H$, $A$ is a linear, closed, densely defined, unbounded operator in $H$, which is not boundedly invertible, so problem (1) is ill-posed. It is proved that the…
We describe the notion of stability of coherent systems as a framework to deal with redundancy. We define stable coherent systems and show how this notion can help the design of reliable systems. We demonstrate that the reliability of…
The stable allocation problem is a many-to-many generalization of the well-known stable marriage problem, where we seek a bipartite assignment between, say, jobs (of varying sizes) and machines (of varying capacities) that is "stable" based…
We propose a novel dynamical framework for solving inclusion problems of the form \(0 \in F(x) + G(x)\) in Hilbert spaces, where \(F\) is a maximal set-valued operator and \(G\) is a single-valued mapping. The analysis is conducted under a…