A unified approach to computing real and complex zeros of zero-dimensional ideals
From MaRDI portal
Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Equations in general fields (12E12) Ideals and multiplicative ideal theory in commutative rings (13A15) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Symbolic computation and algebraic computation (68W30)
Recommendations
- Radical computations of zero-dimensional ideals and real root counting.
- scientific article; zbMATH DE number 503184
- Computing the isolated roots by matrix methods
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- A modular method to compute the rational univariate representation of zero-dimensional ideals
Cited in
(13)- A prolongation-projection algorithm for computing the finite real variety of an ideal
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Radical computations of zero-dimensional ideals and real root counting.
- Flat extension and ideal projection
- Moment matrices, border bases and real radical computation
- Roots of bivariate polynomial systems via determinantal representations
- The approach of moments for polynomial equations
- Computation with polynomial equations and inequalities arising in combinatorial optimization
- A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals
- scientific article; zbMATH DE number 5494027 (Why is no real title available?)
- On the computation of matrices of traces and radicals of ideals
- Unlabeled sensing using rank-one moment matrix completion
- Border basis relaxation for polynomial optimization
This page was built for publication: A unified approach to computing real and complex zeros of zero-dimensional ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3601989)
