Related papers: A sparse spectral method for Volterra integral equ…
We investigate type I multiple orthogonal polynomials on $r$ intervals which have a common point at the origin and endpoints at the $r$ roots of unity $\omega^j$, $j=0,1,\ldots,r-1$, with $\omega = \exp(2\pi i/r)$. We use the weight…
We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest…
Recently, sparsity-based algorithms are proposed for super-resolution spectrum estimation. However, to achieve adequately high resolution in real-world signal analysis, the dictionary atoms have to be close to each other in frequency,…
We present a novel and unifying framework for constructing spectral approximations to fractional integral operators. These spectral approximations are based on transplanted Chebyshev polynomials, which are obtained by composing Chebyshev…
Solving systems of polynomial equations is a central problem in nonlinear and computational algebra. Since Buchberger's algorithm for computing Gr\"obner bases in the 60s, there has been a lot of progress in this domain. Moreover, these…
A class of splitting alternating algorithms is proposed for finding the sparse solution of linear systems with concatenated orthogonal matrices. Depending on the number of matrices concatenated, the proposed algorithms are classified into…
A fast and reliable algorithm for the optimal interpolation of scattered data on the torus by multivariate trigonometric polynomials is presented. The algorithm is based on a variant of the conjugate gradient method in combination with the…
For an arbitrary Hermitian period-$T$ Jacobi operator, we assume a perturbation by a Wigner-von Neumann type potential to devise subordinate solutions to the formal spectral equation for a (possibly infinite) real set, $S$, of the spectral…
In this chapter, we introduce the relaxed inertial proximal splitting algorithm (RIPSA) for hierarchical equilibrium problems. Using Opial-Passty's lemma, we first establish weak ergodic and weak convergence of the sequence generated by the…
This paper derives sparse recurrence relations between orthogonal polynomials on a triangle and their partial derivatives, which are analogous to recurrence relations for Jacobi polynomials. We derive these recurrences in a systematic…
Many computer vision applications require robust and efficient estimation of camera geometry. The robust estimation is usually based on solving camera geometry problems from a minimal number of input data measurements, i.e., solving minimal…
The purpose of this paper is to propose a non-iterative method for the inverse conductivity problem of recovering multiple small anomalies from the boundary measurements. When small anomalies are buried in a conducting object, the electric…
We investigate the geometric properties of the Volterra-type integral operator \begin{equation*} T_g[f](z) = \int_{0}^{z} f(s)\, g'(s)\, ds, \quad |z|<1, \end{equation*} acting on various subclasses of analytic functions in the unit disk.…
We address the computational spectral theory of Jacobi operators that are compact perturbations of the free Jacobi operator via the asymptotic properties of a connection coefficient matrix. In particular, for finite-rank perturbation we…
A parallel splitting method is proposed for solving systems of coupled monotone inclusions in Hilbert spaces. Convergence is established for a wide class of coupling schemes. Unlike classical alternating algorithms, which are limited to two…
The existence of strong solutions and pathwise uniqueness are established for one-dimensional stochastic Volterra equations with locally H{\"o}lder continuous diffusion coefficients and sufficiently regular kernels. Moreover, we study the…
In this paper, we consider the problem of compressed sensing where the goal is to recover almost all the sparse vectors using a small number of fixed linear measurements. For this problem, we propose a novel partial hard-thresholding…
In this paper, indirect collocation approach based on compactly supported radial basis function is applied for solving Volterras population model. The method reduces the solution of this problem to the solution of a system of algebraic…
Proximal gradient methods are popular in sparse optimization as they are straightforward to implement. Nevertheless, they achieve biased solutions, requiring many iterations to converge. This work addresses these issues through a suitable…
We apply the monotone domain decomposition iterative method to a nonlinear integro-differential equation of Volterra type and prove its convergence. To do this, by adding a term in both sides of the original equation we make a linear…