activity
20122025
most citedReal root finding for low rank linear matrices

7 citations · 26 across the 13 of their papers we have counts for

collaborators
Showing cs.SCShow all

6 papers · 1 filter

cs.SC2025

Solving generic parametric linear matrix inequalities

Simone Naldi, Mohab Safey El Din, Adrien Taylor +1

We consider linear matrix inequalities (LMIs) with the 's being symmetric matrices, with entries in a ring $\mathcal…

cs.SC2020★ 3 cited

A divide-and-conquer algorithm for computing Gröbner bases of syzygies in finite dimension

Simone Naldi, Vincent Neiger

Let be elements in a quotient which has finite dimension as a -vector space, where and is an -submodule of . We ad…

cs.SC2018

Exact algorithms for semidefinite programs with degenerate feasible set

Didier Henrion, Simone Naldi, Mohab Safey El Din

Given symmetric matrices of size with rational entries, the set of real vectors such that the matrix $A_0 + x_1 A_1 + \cdots +…

cs.SC2015★ 7 cited

Real root finding for low rank linear matrices

Didier Henrion, Simone Naldi, Mohab Safey El Din

We consider matrices (with ) in a real affine subspace of dimension . The problem of finding elements of low rank in such spaces finds many applications in…

cs.SC2015

Real root finding for rank defects in linear Hankel matrices

Didier Henrion, Simone Naldi, Mohab Safey El Din

Let be matrices with entries in $\QQ$ and Hankel structure, i.e. constant skew diagonals. We consider the linear Hankel matrix $H(\vecx)=H\_0+\X\_1H\…

cs.SC2014★ 2 cited

Real root finding for determinants of linear matrices

Didier Henrion, Simone Naldi, Mohab Safey El Din

Let $\A_0, \A_1, \ldots, \A_n$ be given square matrices of size with rational coefficients. The paper focuses on the exact computation of one point in each connected component…