50 research outputs found

    Discretization of variational regularization in Banach spaces

    Full text link
    Consider a nonlinear ill-posed operator equation F(u)=yF(u)=y where FF is defined on a Banach space XX. In general, for solving this equation numerically, a finite dimensional approximation of XX and an approximation of FF are required. Moreover, in general the given data \yd of yy are noisy. In this paper we analyze finite dimensional variational regularization, which takes into account operator approximations and noisy data: We show (semi-)convergence of the regularized solution of the finite dimensional problems and establish convergence rates in terms of Bregman distances under appropriate sourcewise representation of a solution of the equation. The more involved case of regularization in nonseparable Banach spaces is discussed in detail. In particular we consider the space of finite total variation functions, the space of functions of finite bounded deformation, and the L∞L^\infty--space

    Unstable Attractors: Existence and Robustness in Networks of Oscillators With Delayed Pulse Coupling

    Full text link
    We consider unstable attractors; Milnor attractors AA such that, for some neighbourhood UU of AA, almost all initial conditions leave UU. Previous research strongly suggests that unstable attractors exist and even occur robustly (i.e. for open sets of parameter values) in a system modelling biological phenomena, namely in globally coupled oscillators with delayed pulse interactions. In the first part of this paper we give a rigorous definition of unstable attractors for general dynamical systems. We classify unstable attractors into two types, depending on whether or not there is a neighbourhood of the attractor that intersects the basin in a set of positive measure. We give examples of both types of unstable attractor; these examples have non-invertible dynamics that collapse certain open sets onto stable manifolds of saddle orbits. In the second part we give the first rigorous demonstration of existence and robust occurrence of unstable attractors in a network of oscillators with delayed pulse coupling. Although such systems are technically hybrid systems of delay differential equations with discontinuous `firing' events, we show that their dynamics reduces to a finite dimensional hybrid system system after a finite time and hence we can discuss Milnor attractors for this reduced finite dimensional system. We prove that for an open set of phase resetting functions there are saddle periodic orbits that are unstable attractors.Comment: 29 pages, 8 figures,submitted to Nonlinearit

    Necessary conditions for variational regularization schemes

    Full text link
    We study variational regularization methods in a general framework, more precisely those methods that use a discrepancy and a regularization functional. While several sets of sufficient conditions are known to obtain a regularization method, we start with an investigation of the converse question: How could necessary conditions for a variational method to provide a regularization method look like? To this end, we formalize the notion of a variational scheme and start with comparison of three different instances of variational methods. Then we focus on the data space model and investigate the role and interplay of the topological structure, the convergence notion and the discrepancy functional. Especially, we deduce necessary conditions for the discrepancy functional to fulfill usual continuity assumptions. The results are applied to discrepancy functionals given by Bregman distances and especially to the Kullback-Leibler divergence.Comment: To appear in Inverse Problem

    Existence and approximation of fixed points of right Bregman nonexpansive operators

    Get PDF
    We study the existence and approximation of fixed points of right Bregman nonexpansive operators in reflexive Banach space. We present, in particular, necessary and sufficient conditions for the existence of fixed points and an implicit scheme for approximating them

    Greedy Solution of Ill-Posed Problems: Error Bounds and Exact Inversion

    Full text link
    The orthogonal matching pursuit (OMP) is an algorithm to solve sparse approximation problems. Sufficient conditions for exact recovery are known with and without noise. In this paper we investigate the applicability of the OMP for the solution of ill-posed inverse problems in general and in particular for two deconvolution examples from mass spectrometry and digital holography respectively. In sparse approximation problems one often has to deal with the problem of redundancy of a dictionary, i.e. the atoms are not linearly independent. However, one expects them to be approximatively orthogonal and this is quantified by the so-called incoherence. This idea cannot be transfered to ill-posed inverse problems since here the atoms are typically far from orthogonal: The ill-posedness of the operator causes that the correlation of two distinct atoms probably gets huge, i.e. that two atoms can look much alike. Therefore one needs conditions which take the structure of the problem into account and work without the concept of coherence. In this paper we develop results for exact recovery of the support of noisy signals. In the two examples in mass spectrometry and digital holography we show that our results lead to practically relevant estimates such that one may check a priori if the experimental setup guarantees exact deconvolution with OMP. Especially in the example from digital holography our analysis may be regarded as a first step to calculate the resolution power of droplet holography

    Inverse scale space decomposition

    Get PDF
    We investigate the inverse scale space flow as a decomposition method for decomposing data into generalised singular vectors. We show that the inverse scale space flow, based on convex and absolutely one-homogeneous regularisation functionals, can decompose data represented by the application of a forward operator to a linear combination of generalised singular vectors into its individual singular vectors. We verify that for this decomposition to hold true, two additional conditions on the singular vectors are sufficient: orthogonality in the data space and inclusion of partial sums of the subgradients of the singular vectors in the subdifferential of the regularisation functional at zero. We also address the converse question of when the inverse scale space flow returns a generalised singular vector given that the initial data is arbitrary (and therefore not necessarily in the range of the forward operator). We prove that the inverse scale space flow is guaranteed to return a singular vector if the data satisfies a novel dual singular vector condition. We conclude the paper with numerical results that validate the theoretical results and that demonstrate the importance of the additional conditions required to guarantee the decomposition result

    Interaktion durch Gesten im Pervasive Computing

    No full text
    corecore