Related papers: Validity proof of Lazard's method for CAD construc…
We define and explicitly construct schemes evinced by generalized additive decompositions (GADs) of a given $d$-homogeneous polynomial $F$. We employ GADs to investigate the regularity of $0$-dimensional schemes apolar to $F$, focusing on…
We present a novel enhanced cyclic coordinate descent (ECCD) framework for solving generalized linear models with elastic net constraints that reduces training time in comparison to existing state-of-the-art methods. We redesign the CD…
We describe a type system for the linear-algebraic $\lambda$-calculus. The type system accounts for the linear-algebraic aspects of this extension of $\lambda$-calculus: it is able to statically describe the linear combinations of terms…
Linear Discriminant Analysis (LDA) is a fundamental method for classification. Its simple linear structure facilitates interpretation, and it is naturally suited to multi-class settings. LDA is also closely connected to several classical…
Linear Programming (LP) is an important decoding technique for binary linear codes. However, the advantages of LP decoding, such as low error floor and strong theoretical guarantee, etc., come at the cost of high computational complexity…
This note presents some numerical examples worked out in order to show the reader how to implement, within a widely accessible computational setting, the methodology for achieving zero cancellation in linear multivariable systems discussed…
A multi-Poisson structure on a Lie algebra $\mathfrak{g}$ provides a systematic way to construct completely integrable Hamiltonian systems on $\mathfrak{g}$ expressed in Lax form $\partial X_\lambda /\partial t = [X_\lambda , A_\lambda ]$…
We provide a computer-assisted approach to ensure that a given continuous or discrete-time polynomial system is (asymptotically) stable. Our framework relies on constructive analysis together with formally certified sums of squares Lyapunov…
Canonical Polyadic (or CANDECOMP/PARAFAC, CP) decompositions (CPD) are widely applied to analyze high order tensors. Existing CPD methods use alternating least square (ALS) iterations and hence need to unfold tensors to each of the $N$…
We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…
This paper is devoted to a fundamental system of equations in Linear Elasticity Theory: the famous Lam\'e-Navier system. The Clifford algebra language allows us to rewrite this system in terms of the euclidean Dirac operator, which at the…
The multigrid methodology is reviewed. By integrating numerical processes at all scales of a problem, it seeks to perform various computational tasks at a cost that rises as slowly as possible as a function of $n$, the number of degrees of…
We develop a new algorithm for factoring a bivariate polynomial $F\in \mathbb{K}[x,y]$ which takes fully advantage of the geometry of the Newton polygon of $F$. Under a non degeneracy hypothesis, the complexity is…
Faces play a central role in the combinatorial and computational aspects of polyhedra. In this paper, we present the first formalization of faces of polyhedra in the proof assistant Coq. This builds on the formalization of a library…
We discuss a numerical scheme to solve the continuum Kardar-Parisi-Zhang equation in generic spatial dimensions. It is based on a momentum-space discretization of the continuum equation and on a pseudo-spectral approximation of the…
We propose a new lifting and recombination scheme for rational bivariate polynomial factorization that takes advantage of the Newton polytope geometry. We obtain a deterministic algorithm that can be seen as a sparse version of an algorithm…
A challenge in image based metrology and forensics is intrinsic camera calibration when the used camera is unavailable. The unavailability raises two questions. The first question is how to find the projection model that describes the…
We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices. By "accurate" we mean that the computed…
We study filtration of quasi--coherent sheaves. We prove a version of Kaplansky Theorem for quasi--coherent sheaves, by using Drinfeld's notion of almost projective module and the Hill Lemma. We also show a Lazard-like theorem for flat…
Given a dataset an outlier can be defined as an observation that it is unlikely to follow the statistical properties of the majority of the data. Computation of the location estimate of is fundamental in data analysis, and it is well known…