Related papers: Truncated Normal Forms for Solving Polynomial Syst…

Unsupervised representation learning methods are widely used for gaining insight into high-dimensional, unstructured, or structured data. In some cases, users may have prior topological knowledge about the data, such as a known cluster…

For every algebraically closed field $\boldsymbol k$ of characteristic different from $2$, we prove the following: (1) Generic finite dimensional (not necessarily associative) $\boldsymbol k$-algebras of a fixed dimension, considered up to…

A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…

We examine several of the normal-form multivariate polynomial rootfinding methods of Telen, Mourrain, and Van Barel and some variants of those methods. We analyze the performance of these variants in terms of their asymptotic temporal…

In this paper, we explain a new Iterative Method-Fixed Point and develop its convergence theory for finding approximate solutions of nonlinear equations in the setting of Banach spaces. First, we discuss the convergence analysis of our…

Recovering a large matrix from limited measurements is a challenging task arising in many real applications, such as image inpainting, compressive sensing and medical imaging, and this kind of problems are mostly formulated as low-rank…

In this paper, we present a generic parametrization of generically zero-dimensional parametric polynomial systems. More specifically, we study the specialization properties of the Rational Univariate Representation and derive bounds on the…

We analyze the problem of global reconstruction of functions as accurately as possible, based on partial information in the form of a truncated power series at some point, and additional analyticity properties. This situation occurs…

We study the complexity of solving the \emph{generalized MinRank problem}, i.e. computing the set of points where the evaluation of a polynomial matrix has rank at most $r$. A natural algebraic representation of this problem gives rise to a…

We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials…

Normalization of polynomials plays a vital role in the approximate basis computation of vanishing ideals. Coefficient normalization, which normalizes a polynomial with its coefficient norm, is the most common method in computer algebra.…

In this paper, a polynomial-time algorithm is given to compute the generalized Hermite normal form for a matrix F over Z[x], or equivalently, the reduced Groebner basis of the Z[x]-module generated by the column vectors of F. The algorithm…

We introduce a generalization $G^{(\alpha)}(X)$ of the truncated logarithm $\mathcal{L}_1(X) = \sum_{k=1}^{p-1}X^k/k$ in characteristic $p$, which depends on a parameter $\alpha$. The main motivation of this study is $G^{(\alpha)}(X)$ being…

This paper introduces a novel tangential-normal ($t$-$n$) decomposition for finite element differential forms, presenting a new framework for constructing bases in finite element exterior calculus. The main contribution is the development…

Standard noncommutative Gr\"obner basis procedures are used for computing ideals of free noncommutative polynomial rings over fields. This paper describes Gr\"obner basis procedures for one-sided ideals in finitely presented noncommutative…

The Poincare'-Dulac normal form of a given resonant system is in general non unique; given a specific normal form, one would like to further reduce it to a simplest normal form. In this note we give an algorithm, based on the Lie algebraic…

We present a new algorithm for isolating the real roots of a system of multivariate polynomials, given in the monomial basis. It is inspired by existing subdivision methods in the Bernstein basis; it can be seen as generalization of the…

Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…

We introduce a fast and robust algorithm for finding a plane $\Gamma$ with given normal $\vec{n}_\Gamma$, which truncates an arbitrary polyhedron $\mathcal{P}$ such that the remaining sub-polyhedron admits a given volume…

Let $V$ be a finite dimensional vector space over a field $\mathrm{k}$ of characteristic $0$. Let $A$ be a linear mapping of $V$ into itself. This paper gives a normal form for $A$, which gives a better description of the structure of $A$…