相关论文: Kozlov-Maz'ya iteration as a form of Landweber ite…
This work concerns the use of the iterative algorithm (KMF algorithm) proposed by Kozlov, Mazya and Fomin to solve the Cauchy problem for Laplaces equation. This problem consists to recovering the lacking data on some part of the boundary…
We investigate the Cauchy problem for elliptic operators with $C^\infty$-coefficients at a regular set $\Omega \subset R^2$, which is a classical example of an ill-posed problem. The Cauchy data are given at the subset $\Gamma \subset…
We investigate the Cauchy problem for linear elliptic operators with $C^\infty$-coefficients at a regular set $\Omega \subset R^2$, which is a classical example of an ill-posed problem. The Cauchy data are given at the manifold $\Gamma…
We investigate the iterative methods proposed by Maz'ya and Kozlov (see [KM1], [KM2]) for solving ill-posed inverse problems modeled by partial differential equations. We consider linear evolutionary problems of elliptic, hyperbolic and…
We investigate the iterative methods proposed by Maz'ya and Kozlov (see [3], [4]) for solving ill-posed reconstruction problems modeled by PDE's. We consider linear time dependent problems of elliptic, hyperbolic and parabolic types. Each…
In this paper we propose the design of an iterative observer using space as a time-like variable and prove its convergence. The iterative observer algorithm solves boundary estimation problem for a steady-state elliptic equation system…
We investigate the Cauchy problem for a class of nonlinear elliptic operators with $C^\infty$-coefficients at a regular set $\Omega \subset R^n$. The Cauchy data are given at a manifold $\Gamma \subset \partial\Omega$ and our goal is to…
The paper is devoted to investigating a Cauchy problem for nonlinear elliptic PDEs in the abstract Hilbert space. The problem is hardly solved by computation since it is severely ill-posed in the sense of Hadamard. We shall use a modified…
We consider the Cauchy problem for the Helmholtz equation with a domain in R^d, d>2 with N cylindrical outlets to infinity with bounded inclusions in R^{d-1}. Cauchy data are prescribed on the boundary of the bounded domains and the aim is…
This paper explores variants of the subspace iteration algorithm for computing approximate invariant subspaces. The standard subspace iteration approach is revisited and new variants that exploit gradient-type techniques combined with a…
We consider the solution to the biharmonic equation in mixed form discretized by the Hybrid High-Order (HHO) methods. The two resulting second-order elliptic problems can be decoupled via the introduction of a new unknown, corresponding to…
This paper considers optimization problems on Riemannian manifolds and analyzes iteration-complexity for gradient and subgradient methods on manifolds with non-negative curvature. By using tools from the Riemannian convex analysis and…
A fundamental task in numerical computation is the solution of large linear systems. The conjugate gradient method is an iterative method which offers rapid convergence to the solution, particularly when an effective preconditioner is…
A novel method which is called the Chebyshev inertial iteration for accelerating the convergence speed of fixed-point iterations is presented. The Chebyshev inertial iteration can be regarded as a valiant of the successive over relaxation…
This paper examines inverse Cauchy problems that are governed by a kind of elliptic partial differential equation. The inverse problems involve recovering the missing data on an inaccessible boundary from the measured data on an accessible…
The conjugate gradient method is a widely used algorithm for the numerical solution of a system of linear equations. It is particularly attractive because it allows one to take advantage of sparse matrices and produces (in case of infinite…
In this paper we revisit the classical Cauchy problem for Laplace's equation as well as two further related problems in the light of regularisation of this highly ill-conditioned problem by replacing integer derivatives with fractional…
Stable computational algorithms for the approximate solution of the Cauchy problem for nonstationary problems are based on implicit time approximations. Computational costs for boundary value problems for systems of coupled multidimensional…
Two methods of level set type are proposed for solving the Cauchy problem for an elliptic equation. Convergence and stability results for both methods are proven, characterizing the iterative methods as regularization methods for this…
We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address…