20 research outputs found

    Heuristic regularization methods for numerical differentiation

    Get PDF
    AbstractIn this paper, we use smoothing splines to deal with numerical differentiation. Some heuristic methods for choosing regularization parameters are proposed, including the L-curve method and the de Boor method. Numerical experiments are performed to illustrate the efficiency of these methods in comparison with other procedures

    Identification of nonlinear heat transfer laws from boundary observations

    Get PDF
    We consider the problem of identifying a nonlinear heat transfer law at the boundary, or of the temperature-dependent heat transfer coefficient in a parabolic equation from boundary observations. As a practical example, this model applies to the heat transfer coefficient that describes the intensity of heat exchange between a hot wire and the cooling water in which it is placed. We reformulate the inverse problem as a variational one which aims to minimize a misfit functional and prove that it has a solution. We provide a gradient formula for the misfit functional and then use some iterative methods for solving the variational problem. Thorough investigations are made with respect to several initial guesses and amounts of noise in the input data. Numerical results show that the methods are robust, stable and accurate

    A meshless method for an inverse two-phase one-dimensional nonlinear Stefan problem

    Get PDF
    We extend a meshless method of fundamental solutions recently proposed by the authors for the one-dimensional two-phase inverse linear Stefan problem, to the nonlinear case. In this latter situation the free surface is also considered unknown which is more realistic from the practical point of view. Building on the earlier work, the solution is approximated in each phase by a linear combination of fundamental solutions to the heat equation. The implementation and analysis are more complicated in the present situation since one needs to deal with a nonlinear minimization problem to identify the free surface. Furthermore, the inverse problem is ill-posed since small errors in the input measured data can cause large deviations in the desired solution. Therefore, regularization needs to be incorporated in the objective function which is minimized in order to obtain a stable solution. Numerical results are presented and discussed

    Identification of the forcing term in hyperbolic equations

    No full text
    We investigate the problem of recovering the possibly both space and time-dependent forcing term along with the temperature in hyperbolic systems from many integral observations. In practice, these average weighted integral observations can be considered as generalized interior point measurements. This linear but ill-posed problem is solved using the Tikhonov regularization method in order to obtain the closest stable solution to a given a priori known initial estimate. We prove the Fréchet differentiability of the Tikhonov regularization functional and derive a formula for its gradient. This minimization problem is solved iteratively using the conjugate gradient method. The numerical discretization of the well-posed problems, that are: the direct, adjoint and sensitivity problems that need to be solved at each iteration is performed using finite-difference methods. Numerical results are presented and discussed for one and two-dimensional problems

    Convergence rates for total variation regularization of coefficient identification problems in elliptic equations II

    Get PDF
    AbstractWe investigate the convergence rates for total variation regularization of the problem of identifying (i) the coefficient q in the Neumann problem for the elliptic equation −div(q∇u)=f in Ω, q∂u/∂n=g on ∂Ω, (ii) the coefficient a in the Neumann problem for the elliptic equation −Δu+au=f in Ω, ∂u/∂n=g on ∂Ω, Ω⊂Rd, dâ©Ÿ1, when u is imprecisely given by zΎ∈H1(Ω), ‖u−zή‖H1(Ω)⩜Ύ, ÎŽ>0. We regularize these problems by correspondingly minimizing the strictly convex functionals12∫Ωq|∇(U(q)−zÎŽ)|2dx+ρ(12‖q‖L2(Ω)2+∫Ω|∇q|), and12∫Ω|∇(U(a)−zÎŽ)|2dx+12∫Ωa(U(a)−zÎŽ)2dx+ρ(12‖a‖L2(Ω)2+∫Ω|∇a|) over admissible sets, where U(q) (U(a)) is the solution of the first (second) Neumann boundary value problem, ρ>0 is the regularization parameter. Taking the solutions of these optimization problems as the regularized solutions to the corresponding identification problems, we obtain the convergence rates of them to the solution of the inverse problem in the sense of the Bregman distance and in the L2-norm under relatively simple source conditions without the smallness requirement on the source functions
    corecore