139 research outputs found

    Pinsker estimators for local helioseismology

    Full text link
    A major goal of helioseismology is the three-dimensional reconstruction of the three velocity components of convective flows in the solar interior from sets of wave travel-time measurements. For small amplitude flows, the forward problem is described in good approximation by a large system of convolution equations. The input observations are highly noisy random vectors with a known dense covariance matrix. This leads to a large statistical linear inverse problem. Whereas for deterministic linear inverse problems several computationally efficient minimax optimal regularization methods exist, only one minimax-optimal linear estimator exists for statistical linear inverse problems: the Pinsker estimator. However, it is often computationally inefficient because it requires a singular value decomposition of the forward operator or it is not applicable because of an unknown noise covariance matrix, so it is rarely used for real-world problems. These limitations do not apply in helioseismology. We present a simplified proof of the optimality properties of the Pinsker estimator and show that it yields significantly better reconstructions than traditional inversion methods used in helioseismology, i.e.\ Regularized Least Squares (Tikhonov regularization) and SOLA (approximate inverse) methods. Moreover, we discuss the incorporation of the mass conservation constraint in the Pinsker scheme using staggered grids. With this improvement we can reconstruct not only horizontal, but also vertical velocity components that are much smaller in amplitude

    Iteratively regularized Newton-type methods for general data misfit functionals and applications to Poisson data

    Get PDF
    We study Newton type methods for inverse problems described by nonlinear operator equations F(u)=gF(u)=g in Banach spaces where the Newton equations F(un;un+1un)=gF(un)F'(u_n;u_{n+1}-u_n) = g-F(u_n) are regularized variationally using a general data misfit functional and a convex regularization term. This generalizes the well-known iteratively regularized Gauss-Newton method (IRGNM). We prove convergence and convergence rates as the noise level tends to 0 both for an a priori stopping rule and for a Lepski{\u\i}-type a posteriori stopping rule. Our analysis includes previous order optimal convergence rate results for the IRGNM as special cases. The main focus of this paper is on inverse problems with Poisson data where the natural data misfit functional is given by the Kullback-Leibler divergence. Two examples of such problems are discussed in detail: an inverse obstacle scattering problem with amplitude data of the far-field pattern and a phase retrieval problem. The performence of the proposed method for these problems is illustrated in numerical examples

    Attosecond electron pulse trains and quantum state reconstruction in ultrafast transmission electron microscopy

    Get PDF
    Ultrafast electron and X-ray imaging and spectroscopy are the basis for an ongoing revolution in the understanding of dynamical atomic-scale processes in matter. The underlying technology relies heavily on laser science for the generation and characterization of ever shorter pulses. Recent findings suggest that ultrafast electron microscopy with attosecond-structured wavefunctions may be feasible. However, such future technologies call for means to both prepare and fully analyse the corresponding free-electron quantum states. Here, we introduce a framework for the preparation, coherent manipulation and characterization of free-electron quantum states, experimentally demonstrating attosecond electron pulse trains. Phase-locked optical fields coherently control the electron wavefunction along the beam direction. We establish a new variant of quantum state tomography—‘SQUIRRELS’—for free-electron ensembles. The ability to tailor and quantitatively map electron quantum states will promote the nanoscale study of electron–matter entanglement and new forms of ultrafast electron microscopy down to the attosecond regime

    The Iteratively Regularized Gau{\ss}-Newton Method with Convex Constraints and Applications in 4Pi-Microscopy

    Full text link
    This paper is concerned with the numerical solution of nonlinear ill-posed operator equations involving convex constraints. We study a Newton-type method which consists in applying linear Tikhonov regularization with convex constraints to the Newton equations in each iteration step. Convergence of this iterative regularization method is analyzed if both the operator and the right hand side are given with errors and all error levels tend to zero. Our study has been motivated by the joint estimation of object and phase in 4Pi microscopy, which leads to a semi-blind deconvolution problem with nonnegativity constraints. The performance of the proposed algorithm is illustrated both for simulated and for three-dimensional experimental data

    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

    Simulations of energetic beam deposition: from picoseconds to seconds

    Full text link
    We present a new method for simulating crystal growth by energetic beam deposition. The method combines a Kinetic Monte-Carlo simulation for the thermal surface diffusion with a small scale molecular dynamics simulation of every single deposition event. We have implemented the method using the effective medium theory as a model potential for the atomic interactions, and present simulations for Ag/Ag(111) and Pt/Pt(111) for incoming energies up to 35 eV. The method is capable of following the growth of several monolayers at realistic growth rates of 1 monolayer per second, correctly accounting for both energy-induced atomic mobility and thermal surface diffusion. We find that the energy influences island and step densities and can induce layer-by-layer growth. We find an optimal energy for layer-by-layer growth (25 eV for Ag), which correlates with where the net impact-induced downward interlayer transport is at a maximum. A high step density is needed for energy induced layer-by-layer growth, hence the effect dies away at increased temperatures, where thermal surface diffusion reduces the step density. As part of the development of the method, we present molecular dynamics simulations of single atom-surface collisions on flat parts of the surface and near straight steps, we identify microscopic mechanisms by which the energy influences the growth, and we discuss the nature of the energy-induced atomic mobility

    Self-diffusion along step bottoms on Pt(111)

    Get PDF
    First-principles total energies of periodic vicinals are used to estimate barriers for Pt-adatom diffusion along straight and kinked steps on Pt(111), and around a corner where straight steps intersect. In all cases studied, hopping diffusion has a lower barrier than concerted substitution. In conflict with simulations of dendritic Pt island formation on Pt(111), hopping from a corner site to a step whose riser is a (111)-micro facet is predicted to be more facile than to one whose riser is a (100)
    corecore