相关论文: Computing the B\'ezier Control Points of the Lagra…

Lagrangian descriptions of irreducible and reducible integer higher-spin representations of the Poincare group subject to a Young tableaux $Y[\hat{s}_1,\hat{s}_2]$ with two columns are constructed within a metric-like formulation in a…

This paper studies algorithms for efficiently computing Brascamp-Lieb constants, a task that has recently received much interest. In particular, we reduce the computation to a nonlinear matrix-valued iteration, whose convergence we analyze…

The reduction of a large number of scalar integrals to a small set of master integrals via Laporta's algorithm is common practice in multi-loop calculations. It is also a major bottleneck in terms of running time and memory consumption. It…

In this paper we study nonconvex penalization using Bernstein functions whose first-order derivatives are completely monotone. The Bernstein function can induce a class of nonconvex penalty functions for high-dimensional sparse estimation…

The problem of extracting a well conditioned submatrix from any rectangular matrix (with normalized columns) has been studied for some time in functional and harmonic analysis; see…

In this article, we study bivariate polynomial interpolation on the node points of degenerate Lissajous figures. These node points form Chebyshev lattices of rank $1$ and are generalizations of the well-known Padua points. We show that…

In this paper we develop a convergence analysis in an infinite dimensional setting of the Levenberg-Marquardt iteration for the solution of a hybrid conductivity imaging problem. The problem consists in determining the spatially varying…

The multivariate resultant is a fundamental tool of computational algebraic geometry. It can in particular be used to decide whether a system of n homogeneous equations in n variables is satisfiable (the resultant is a polynomial in the…

We present a novel approach to Gaussian Berezin correlation functions. A formula well known in the literature expresses these quantities in terms of submatrices of the inverse matrix appearing in the Gaussian action. By using a recently…

The main purpose of this paper is to propose a variance-based Bregman extragradient algorithm with line search for solving stochastic variational inequalities, which is robust with respect an unknown Lipschitz constant. We prove the almost…

We present an alternative method for computing primary decomposition of zero-dimensional ideals over finite fields. Based upon the further decomposition of the invariant subspace of the Frobenius map acting on the quotient algebra in the…

In this work, Bernstein's concentration inequalities for squared integrable matrix-valued discrete-time martingales are obtained. Based on Lieb's theory and Bernstein's condition, a suitable supermartingale can be constructed. Our proof is…

We give an algorithm for reversion of formal power series, based on an efficient way to implement the Lagrange inversion formula. Our algorithm requires $O(n^{1/2}(M(n) + MM(n^{1/2})))$ operations where $M(n)$ and $MM(n)$ are the costs of…

In many applications, it is desired to obtain extreme eigenvalues and eigenvectors of large Hermitian matrices by efficient and compact algorithms. In particular, orthogonalization-free methods are preferred for large-scale problems for…

Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…

A factorization of the inverse of a Hermetian positive definite matrix based on a diagonal by diagonal recurrence formulae permits the inversion of Toeplitz Block Toeplitz matrices using minimized matrix-vector products, with a complexity…

In this paper we establish for the first time local semiconvexity estimates for fully nonlinear equations and for obstacle problems driven by integro-differential operators with general kernels. Our proof is based on the Bernstein…

Binary optimization, a representative subclass of discrete optimization, plays an important role in mathematical optimization and has various applications in computer vision and machine learning. Usually, binary optimization problems are…

This paper presents a fast algorithm for full-polarisation, direction dependent calibration in radio interferometry. It is based on Wirtinger's approach to complex differentiation. Compared to the classical case, and under reasonable…

We extend the classical Bernstein technique to the setting of integro-differential operators. As a consequence, we provide first and one-sided second derivative estimates for solutions to fractional equations, including some convex fully…