Related papers: Subordination methods for free deconvolution
In a fractional Cauchy problem, the usual first order time derivative is replaced by a fractional derivative. This problem was first considered by \citet{nigmatullin}, and \citet{zaslavsky} in $\mathbb R^d$ for modeling some physical…
In this article we introduce powerful tools and techniques from invariant theory to free analysis. This enables us to study free maps with involution. These maps are free noncommutative analogs of real analytic functions of several…
We study the question of extracting a sequence of functions $\{\boldsymbol{f}_i, \boldsymbol{g}_i\}_{i=1}^s$ from observing only the sum of their convolutions, i.e., from $\boldsymbol{y} = \sum_{i=1}^s \boldsymbol{f}_i\ast…
We introduce a new projection-free (Frank-Wolfe) method for optimizing structured nonconvex functions that are expressed as a difference of two convex functions. This problem class subsumes smooth nonconvex minimization, positioning our…
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place convolutions, the memory requirements are identical with the…
This paper develops a rigorous probabilistic framework that extends denoising diffusion models to the setting of noncommutative random variables. Building on Voiculescu's theory of free entropy and free Fisher information, we formulate…
In this paper we give sharp extension results for convoluted solutions of abstract Cauchy problems in Banach spaces. The main technique is the use of algebraic structure (for usual convolution product $\ast$) of these solutions which are…
There is extensive mathematical literature on the inverse problem of deautoconvolution for a function with support in the unit interval $[0,1] \subset \mathbb R$, but little is known about the multidimensional situation. This article tries…
We study the Cauchy problem for a class of linear evolution equations of arbitrary order with coefficients depending both on time and space variables. Under suitable decay assumptions on the coefficients of the lower order terms for $|x|$…
Existing results on decomposition methods and algorithms for nonconvex problems are minimal. Parallel decomposition algorithms do not exist for nonconvex problems with coupling nonlinear equality constraints. Besides, decomposition…
We develop a compositional approach for automatic and symbolic differentiation based on categorical constructions in functional analysis where derivatives are linear functions on abstract vectors rather than being limited to scalars,…
We propose a method to reduce the computational effort to solve a partial differential equation on a given domain. The main idea is to split the domain of interest in two subdomains, and to use different approximation methods in each of the…
Various aspects of the four point function for scalar fields in conformally invariant theories are analysed. This depends on an arbitrary function of two conformal invariants u,v. A recurrence relation for the function corresponding to the…
The derivative expansion of the effective action is considered in the model with two interacting real scalar fields in curved spacetime. Using the functional approach and local momentum representation, the coefficient of the derivative term…
This paper explores a key question in numerical linear algebra: how can we compute projectors onto the deflating subspaces of a regular matrix pencil $(A,B)$, in particular without using matrix inversion or defaulting to an expensive Schur…
In random allocation rules, typically first an optimal fractional point is calculated via solving a linear program. The calculated point represents a fractional assignment of objects or more generally packages of objects to agents. In order…
A numerical method is developed for recovering both the source locations and the obstacle from the scattered Cauchy data of the time-harmonic acoustic field. First of all, the incident and scattered components are decomposed from the…
We propose a new randomized optimization method for high-dimensional problems which can be seen as a generalization of coordinate descent to random subspaces. We show that an adaptive sampling strategy for the random subspace significantly…
The usual Helmholtz decomposition gives a decomposition of any vector valued function into a sum of gradient of a scalar function and rotation of a vector valued function under some mild condition. In this paper we show that the vector…
We consider a class of abstract nonlinear evolution equations in supermanifolds (smf's) modelled over Z_2-graded locally convex spaces. We show uniqueness, local existence, smoothness, and an abstract version of causal propagation of the…