Related papers: An Alternating KMF Algorithm to Solve the Cauchy P…
We derive sufficient criteria for the uniqueness and existence of solutions of the abstract Cauchy problem in locally convex Hausdorff spaces. Our approach is based on a suitable notion of an asymptotic Laplace transform and extends results…
The goals and contributions of this paper are twofold. It provides a new computational tool for data driven Koopman spectral analysis by taking up the formidable challenge to develop a numerically robust algorithm by following the natural…
The use of Cauchy Markov random field priors in statistical inverse problems can potentially lead to posterior distributions which are non-Gaussian, high-dimensional, multimodal and heavy-tailed. In order to use such priors successfully,…
In this paper, we identify two different sets of problems. The first covers the problems that the iterative proportional fitting (IPF) algorithm was developed to solve. These concern completing a population table by using a sample. The…
For the first time, a globally convergent numerical method is presented for ill-posed Cauchy problems for quasilinear PDEs. The key idea is to use Carleman Weight Functions to construct globally strictly convex Tikhonov-like cost…
In this paper, we consider a class of nonconvex problems with linear constraints appearing frequently in the area of image processing. We solve this problem by the penalty method and propose the iteratively reweighted alternating…
In a fractional Cauchy problem, the usual first order time derivative is replaced by a fractional derivative. The fractional derivative models time delays in a diffusion process. The order of the fractional derivative can be distributed…
A formulation of the boundary integral method for solving partial differential equations has been developed whereby the usual weakly singular integral and the Cauchy principal value integral can be removed analytically. The broad…
We introduce the delayed Mittag-Leffler type matrix functions, delayed fractional cosine, delayed fractional sine and use the Laplace transform to obtain an analytical solution to the IVP for a Hilfer type fractional linear time-delay…
We study the Kaczmarz methods for solving systems of quadratic equations, i.e., the generalized phase retrieval problem. The methods extend the Kaczmarz methods for solving systems of linear equations by integrating a phase selection…
Many different simulation methods for Stokes flow problems involve a common computationally intense task -- the summation of a kernel function over $O(N^2)$ pairs of points. One popular technique is the Kernel Independent Fast Multipole…
In this paper we present an iterative method, inspired by the inverse iteration with shift technique of finite linear algebra, designed to find the eigenvalues and eigenfunctions of the Laplacian with homogeneous Dirichlet boundary…
This paper studies global solvability of the Cauchy problem for a generalized time-fractional Kuramoto-Sivashinsky equation in the Shwartz space, which is a complete topological space generated by a family of semi-norms. The main approach…
Over the last two decades, a significant line of work in theoretical algorithms has made progress in solving linear systems whose coefficient matrix is the Laplacian matrix of a weighted graph. The solution of the linear system can be…
State-space smoothing has found many applications in science and engineering. Under linear and Gaussian assumptions, smoothed estimates can be obtained using efficient recursions, for example Rauch-Tung-Striebel and Mayne-Fraser algorithms.…
With the huge influx of various data nowadays, extracting knowledge from them has become an interesting but tedious task among data scientists, particularly when the data come in heterogeneous form and have missing information. Many data…
Kernel Adaptive Filtering (KAF) are mathematically principled methods which search for a function in a Reproducing Kernel Hilbert Space. While they work well for tasks such as time series prediction and system identification they are…
In this paper, we study the equality constrained nonlinear least squares problem, where the Jacobian matrices of the objective function and constraints are unavailable or expensive to compute. We approximate the Jacobian matrices via…
Switching Kalman Filters (SKF) are well known for their ability to solve the piecewise linear dynamic system estimation problem using the standard Kalman Filter (KF). Practical SKFs are heuristic, approximate filters that are not guaranteed…
We propose a mesh refinement technique for solving elliptic difference equations on unbounded domains based on the fast lattice Green's function (FLGF) method. The FLGF method exploits the regularity of the Cartesian mesh and uses the fast…