Related papers: Convergence of the complex block Jacobi methods un…
We consider sequential and parallel decomposition methods for a dual problem of a general total variation minimization problem with applications in several image processing tasks, like image inpainting, estimation of optical flow and…
This paper considers efficient spectral solutions for weakly singular nonlocal diffusion equations with Dirichlet-type volume constraints. The equation we consider contains an integral operator that typically has a singularity at the…
In one dimensional transport problems the scattering matrix $S$ is decomposed into a block structure corresponding to reflection and transmission matrices at the two ends. For $S$ a random unitary matrix, the singular value probability…
For a long time it has been a challenging goal to identify all orthogonal polynomial systems that occur as eigenfunctions of a linear differential equation. One of the widest classes of such eigenfunctions known so far, is given by…
We introduce a new machinery to study the large time behavior for general classes of Hamilton--Jacobi type equations, which include degenerate parabolic equations and weakly coupled systems. We establish the convergence results by using the…
We consider the numerical solution of Hamilton-Jacobi-Bellman equations arising in stochastic control theory. We introduce a class of monotone approximation schemes relying on monotone interpolation. These schemes converge under very weak…
We focus on the linear convergence of generalized proximal point algorithms for solving monotone inclusion problems. Under the assumption that the associated monotone operator is metrically subregular or that the inverse of the monotone…
Based on the reduction of degree in polynomial mappings and some known results in algebraic geometry, by introducing the Brouwer degree, a tool from differential topology, algebraic topology and algebraic geometry, we completely prove the…
We study asymptotics of the recurrence coefficients of orthogonal polynomials associated to the generalized Jacobi weight, which is a weight function with a finite number of algebraic singularities on $[-1,1]$. The recurrence coefficients…
We propose a decomposition framework for the parallel optimization of the sum of a differentiable (possibly nonconvex) function and a (block) separable nonsmooth, convex one. The latter term is usually employed to enforce structure in the…
This paper introduces a parallel and distributed extension to the alternating direction method of multipliers (ADMM) for solving convex problem: minimize $\sum_{i=1}^N f_i(x_i)$ subject to $\sum_{i=1}^N A_i x_i=c, x_i\in \mathcal{X}_i$. The…
In this paper we analyze a family of general random block coordinate descent methods for the minimization of $\ell_0$ regularized optimization problems, i.e. the objective function is composed of a smooth convex function and the $\ell_0$…
In this note, we present a generalization of some results concerning the spectral properties of a certain class of block matrices. As applications, we study some of its implications on nonnegative matrices, doubly stochastic matrices and…
The goal of this work is to introduce a local and a global interpolator in Jacobi-weighted spaces, with optimal order of approximation in the context of the $p$-version of finite element methods. Then, an a posteriori error indicator of the…
In this short note we deal with a constructive scheme to decompose a continuous family of matrices $A(\rho)$ asymptotically as $\rho\to0$ into blocks corresponding to groups of eigenvalues of the limit matrix A(0). We also discuss the…
We study the approximation of parabolic Hamilton-Jacobi-Bellman (HJB) equations in bounded domains with strong Dirichlet boundary conditions. We work under the assumption of the existence of a sufficiently regular barrier function for the…
In this paper we study cohomology and deformations of Jacobi-Jordan algebras. We develop their formal deformation theory. In particular, we introduce a method to construct a versal deformation for a given Jacobi-Jordan algebra, which can…
In this paper, we propose a Jacobi-type algorithm to solve the low rank orthogonal approximation problem of symmetric tensors. This algorithm includes as a special case the well-known Jacobi CoM2 algorithm for the approximate orthogonal…
The Kaczmarz algorithm is one of the most popular methods for solving large-scale over-determined linear systems due to its simplicity and computational efficiency. This method can be viewed as a special instance of a more general class of…
We use the well-known observation that the solutions of Jacobi's differential equation can be represented via non-oscillatory phase and amplitude functions to develop a fast algorithm for computing multi-dimensional Jacobi polynomial…