In this paper, we survey some of the latest development in using inexact Newton-like methods for solving inverse eigenvalue problems. These methods require the solutions of nonsymmetric and large linear systems. One can solve the approximate Jacobian equation by iterative methods. However, iterative methods usually oversolve the problem in the sense that they require far more (inner) iterations...

Solving inverse problems, in particular inverse scattering problems, parameterfitting procedures are used quite often because the analytical inversion procedures are not available. The general scheme for such procedures is simple: one has a relation B(q) = A, where B is some operator, q is an unknown function, and A is the data. In inverse scattering problems q is a potential, and A is the scat...

Inverse problems related to the estimation of coeecients of partial diierential equations are illposed. Practical applications often use the t-to-data output-least-square's method to recover the coeecients. In this work, we develop parallel nonoverlapping domain decomposition algorithms to estimate the diiusion coeecient associated with elliptic diierential equations. In order to realize the do...

An inverse problem of doubly center matrices is discussed. By translating the constrained problem into unconstrained problem, two iterative methods are proposed. A numerical example illustrate our algorithms.

In this paper we consider new regularization methods for linear inverse problems of dynamic type. These are based on programming techniques quadratic optimal control problems. Two different approaches followed: a continuous and discrete one. We prove properties also obtain rates convergence the derived from both approaches. A numerical example concerning EIT problem is used to illustrate theore...