Related papers: Applying Wirtinger derivatives to the radio interf…
The lifting scheme of discrete wavelet transform (DWT) is now quite well established as an efficient technique for image compression, and has been incorporated into the JPEG2000 standards. However, the potential of the lifting scheme has…
We obtain the rigorous WKB expansion to all orders for the radial Kepler problem, using the residue calculus in evaluating the WKB quantization condition in terms of a complex contour integral in the complexified coordinate plane. The…
Many matching, tracking, sorting, and ranking problems require probabilistic reasoning about possible permutations, a set that grows factorially with dimension. Combinatorial optimization algorithms may enable efficient point estimation,…
We study the inverse medium scattering problem to reconstruct the unknown inhomogeneous medium from the far-field patterns of scattered waves. The inverse scattering problem is generally ill-posed and nonlinear, and the iterative…
In this work, the conformable Bateman Lagrangian for the damped harmonic oscillator system is proposed using the conformable derivative concept. In other words, the integer derivatives are replaced by conformable derivatives of order…
We present a method based on Mueller calculus to calibrate linear polarimetric observations. The key advantages of the proposed way of calibration are: (1) that it can be implemented in a data reduction pipeline, (2) that it is possible to…
Statistical calibration where the curve is nonlinear is important in many areas, such as analytical chemistry and radiometry. Especially in radiometry, instrument characteristics change over time, thus calibration is a process that must be…
We present quadrature schemes to calculate matrices, where the so-called modified Hilbert transformation is involved. These matrices occur as temporal parts of Galerkin finite element discretizations of parabolic or hyperbolic problems when…
Splitting methods are widely used for solving initial value problems (IVPs) due to their ability to simplify complicated evolutions into more manageable subproblems which can be solved efficiently and accurately. Traditionally, these…
In appropriate frameworks, automatic differentiation is transparent to the user at the cost of being a significant computational burden when the number of operations is large. For iterative algorithms, implicit differentiation alleviates…
The classic method for computing the spectral decomposition of a real symmetric matrix, the Jacobi algorithm, can be accelerated by using mixed precision arithmetic. The Jacobi algorithm is aiming to reduce the off-diagonal entries…
In this work, the benefits of the phase fitting technique are embedded in high order discrete Lagrangian integrators. The proposed methodology creates integrators with zero phase lag in a test Lagrangian in a similar way used in phase…
This paper presents a fast iterative solver for Lippmann-Schwinger equation for high-frequency waves scattered by a smooth medium with a compactly supported inhomogeneity. The solver is based on the sparsifying preconditioner and a domain…
A practical and simple stable method for calculating Fourier integrals is proposed, effective both at low and at high frequencies. An approach based on the fruitful idea of Levin, to use of the collocation method to approximate the slowly…
We address the problem of calibrating a polarimetric backscattering setup that includes a beamsplitter, taking its optical properties into account. Using Fisher information, we justify a specific calibration configuration involving…
A new iterative method for non-LTE multilevel polarized radiative transfer in hydrogen lines is presented. Iterative methods (such as the Jacobi method) tend to damp out high-frequency components of the error fast, but converges poorly due…
A global solution of the Schr\"odinger equation for explicitly time-dependent Hamiltonians is derived by integrating the non-linear differential equation associated with the time-dependent wave operator. A fast iterative solution method is…
We consider the problem of reconstructing an infinite set of sparse, finite-dimensional vectors, that share a common sparsity pattern, from incomplete measurements. This is in contrast to the work [17], where the single vector signal can be…
In many applications and physical phenomena, bivariate signals are polarized, i.e. they trace an elliptical trajectory over time when viewed in the 2D planes of their two components. The smooth evolution of this elliptical trajectory,…
We propose a high precision algorithm for solving the Gelfand-Levitan-Marchenko equation. The algorithm is based on the block version of the Toeplitz Inner-Bordering algorithm of Levinson's type. To approximate integrals, we use the…