Related papers: Formal factorization of higher order irregular lin…
We consider an $\ell_1$-regularized inverse problem where both the forward and regularization operators have a Kronecker product structure. By leveraging this structure, a joint decomposition can be obtained using generalized singular value…
Given an approximation to a multiple isolated solution of a polynomial system of equations, we have provided a symbolic-numeric deflation algorithm to restore the quadratic convergence of Newton's method. Using first-order derivatives of…
This paper is devoted to studying the first-order variational analysis of non-convex and non-differentiable functions that may not be subdifferentially regular. To achieve this goal, we entirely rely on two concepts of directional…
We solve the normal ordering problem for (A* A)^n where A* (resp. A) are one mode deformed bosonic creation (resp. annihilation) operators satisfying [A,A*]=[N+1]-[N]. The solution generalizes results known for canonical and q-bosons. It…
This paper presents a survey on formal moduli problems. It starts with an introduction to pointed formal moduli problems and a sketch of proof of a Theorem (independently proven by Lurie and Pridham) which gives a precise mathematical…
Differential operators usually result in derivatives expressed as a ratio of differentials. For all but the simplest derivatives, these ratios are typically not algebraically manipulable, but must be held together as a unit in order to…
We consider solution operators of linear ordinary boundary problems with "too many" boundary conditions, which are not always solvable. These generalized Green's operators are a certain kind of generalized inverses of differential…
We study the computability of the operator norm of a matrix with respect to norms induced by linear operators. Our findings reveal that this problem can be solved exactly in polynomial time in certain situations, and we discuss how it can…
We present a method for the explicit diagonalization of some Hankel operators. This method allows us to recover classical results on the diagonalization of Hankel operators with the absolutely continuous spectrum. It leads also to new…
We propose an algorithm for solving nonlinear convex programs defined in terms of a symmetric positive semidefinite matrix variable $X$. This algorithm rests on the factorization $X=Y Y^T$, where the number of columns of Y fixes the rank of…
The linearization of a quadratic form gives rise to a Clifford algebra structure, as seen in Dirac's factorization of the d'Alembert operator. A similar structure known as a generalized Clifford algebra arises from the continuation of this…
Low rank approximation is a commonly occurring problem in many computer vision and machine learning applications. There are two common ways of optimizing the resulting models. Either the set of matrices with a given rank can be explicitly…
We systematically introduce the idea of applying differential operator method to find a particular solution of an ordinary nonhomogeneous linear differential equation with constant coefficients when the nonhomogeneous term is a polynomial…
For a nonlinear ordinary differential equation solved with respect to the highest order derivative and rational in the other derivatives and in the independent variable, we devise two algorithms to check if the equation can be reduced to a…
We develop an approach to the deformation quantization on the real plane with an arbitrary Poisson structure which based on Weyl symmetrically ordered operator products. By using a polydifferential representation for deformed coordinates…
Root subgroup factorization is a refinement of triangular (or LDU) factorization. For a complex reductive Lie group, and a choice of reduced factorization of the longest Weyl group element, the forward map from root subgroup coordinates to…
We define a class of discrete operators acting on infinite, finite or periodic sequences mimicking the standard properties of pseudo-differential operators. In particular we can define the notion of order and regularity, and we recover the…
In this paper we address the rotation synchronization problem, where the objective is to recover absolute rotations starting from pairwise ones, where the unknowns and the measures are represented as nodes and edges of a graph,…
This paper belongs to a group of work in the intersection of symbolic computation and group analysis aiming for the symbolic analysis of differential equations. The goal is to extract important properties without finding the explicit…
Recent years have witnessed the introduction and development of extremely fast rational function algorithms. Many ideas in this realm arose from polynomial-based linear-algebraic algorithms. However, polynomial approximation is occasionally…