Introduction to the solution of polynomial systems

From MaRDI portal
Revision as of 15:49, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:880210

DOI10.1007/978-3-540-71647-1zbMath1127.13001OpenAlexW401533562MaRDI QIDQ880210

Mohamed Elkadi, Mourrain, Bernard

Publication date: 14 May 2007

Published in: Mathématiques \& Applications (Berlin) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71647-1




Related Items (34)

Polynomial-exponential decomposition from momentsOn the construction of general cubature formula by flat extensionsLinear algebra for computing Gröbner bases of linear recursive multidimensional sequencesEfficient computation of dual space and directional multiplicity of an isolated pointMatrix-F5 algorithms and tropical Gröbner bases computationStable normal forms for polynomial system solvingA stabilized normal form algorithm for generic systems of polynomial equationsDetecting rigid convexity of bivariate polynomialsNumerical root finding via Cox ringsSymmetric tensor decompositionToric eigenvalue methods for solving sparse polynomial systemsA comparison of different notions of ranks of symmetric tensorsAbout a non-standard interpolation problemSubresultants in multiple rootsInverse systems of zero-dimensional schemes in \(\mathbb P^n\)Border basis relaxation for polynomial optimizationTruncated normal forms for solving polynomial systems: generalized and efficient algorithmsMatrix-F5 algorithms over finite-precision complete discrete valuation fieldsOn the computation of matrices of traces and radicals of idealsOn the bit complexity of polynomial system solvingSolving a sparse system using linear algebraOn the structure of positive semi-definite finite rank general domain Hankel and Toeplitz operators in several variablesStructured low rank decomposition of multivariate Hankel matricesThe number of real eigenvectors of a real polynomialSolving Polynomial Systems via Truncated Normal FormsThe Approach of Moments for Polynomial EquationsTopology and arrangement computation of semi-algebraic planar curvesAn algorithm for implicit interpolationCauchy-Weil formula, Schur-Agler type classes, new Hardy spaces of the polydisk and interpolation problemsComputing minimal Gorenstein coversPrimary ideals and their differential equationsGuessing Gröbner bases of structured ideals of relations of sequencesIsotopic triangulation of a real algebraic surfaceNewton-type methods for simultaneous matrix diagonalization


Uses Software






This page was built for publication: Introduction to the solution of polynomial systems