Related papers: Linearizations for interpolation bases -- a compar…
Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by parametrized polynomial matrix inequalities (PMI). These…
Bernstein polynomials, long a staple of approximation theory and computational geometry, have also increasingly become of interest in finite element methods. Many fundamental problems in interpolation and approximation give rise to…
A new iterative method for solving large scale symmetric nonlinear eigenvalue problems is presented. We firstly derive an infinite dimensional symmetric linearization of the nonlinear eigenvalue problem, then we apply the indefinite Lanczos…
The assumed hardness of the Linear Code Equivalence problem (LCE) lies at the core of the security of the LESS signature scheme and other signature schemes with advanced functionalities. The LCE problem asks to determine whether two linear…
This paper presents a general high-order kernel regularization technique applicable to all four integral operators of Calder\'on calculus associated with linear elliptic PDEs in two and three spatial dimensions. Like previous density…
First of all we give some reasons that "natural proofs" built not a barrier to prove P $\not=$ NP using Boolean complexity. Then we investigate the approximation method for its extension to prove super-polynomial lower bounds for the…
The classical problem of two uniformly charged infinite planes in electrochemical equilibrium with an infinite monovalent salt reservoir is solved exactly at the mean-field nonlinear Poisson-Boltzmann (PB) level, including an explicit…
Low-degree polynomials have emerged as a powerful paradigm for providing evidence of statistical-computational gaps across a variety of high-dimensional statistical models [Wein25]. For detection problems -- where the goal is to test a…
We establish a general convergence theory of the Rayleigh--Ritz method and the refined Rayleigh--Ritz method for computing some simple eigenpair $(\lambda_{*},x_{*})$ of a given analytic regular nonlinear eigenvalue problem (NEP). In terms…
We study a combinatorial problem arising from microarrays synthesis. The synthesis is done by a light-directed chemical process. The objective is to minimize unintended illumination that may contaminate the quality of experiments.…
Consider a matrix polynomial $P \left( \lambda \right)= A_0 + \lambda A_1 + \ldots + \lambda^d A_d$, with $A_0,\ldots, A_d$ complex (or real) matrices with a certain structure. In this paper we discuss an iterative method to numerically…
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 power series being given as the solution of a linear differential equation with appropriate initial conditions, minimization consists in finding a non-trivial linear differential equation of minimal order having this power series as a…
As a conclusion in classical linear algebra, an underdetermined linear equations usually have an infinite number of solutions. The sparest one among these solutions is significant in many applications. This problem can be modeled as the…
We show how the combination of new "linearization" ideas in free probability theory with the powerful "realization" machinery -- developed over the last 50 years in fields including systems engineering and automata theory -- allows solving…
The matrix chain problem consists in finding the parenthesization of a matrix product $M := A_1 A_2 \cdots A_n$ that minimizes the number of scalar operations. In practical applications, however, one frequently encounters more complicated…
In this paper we generalize the technique of deflation to define two new methods to systematically find many local minima of a nonlinear least squares problem. The methods are based on the Gauss-Newton algorithm, and as such do not require…
We compute minimal bases of solutions for a general interpolation problem, which encompasses Hermite-Pad\'e approximation and constrained multivariate interpolation, and has applications in coding theory and security. This problem asks to…
In this paper, we examine linear programming (LP) relaxations based on Bernstein polynomials for polynomial optimization problems (POPs). We present a progression of increasingly more precise LP relaxations based on expressing the given…
In a previous paper, we have given an algebraic model to the set of intervals. Here, we apply this model in a linear frame. We define a notion of diagonalization of square matrices whose coefficients are intervals. But in this case, with…