Computing the real variety of an ideal: a real algebraic and symbolic-numeric algorithm

@inproceedings{Lasserre2008ComputingTR,
  title={Computing the real variety of an ideal: a real algebraic and symbolic-numeric algorithm},
  author={Jean B. Lasserre and Monique Laurent and Philipp Rostalski},
  booktitle={SAC},
  year={2008}
}
Solving systems of polynomial equations is a classical problem of mathematics with an emerging number of modern applications, such as coding theory, robotics, computational statistics, etc. Its importance is reflected by the broad literature that deals with algorithms, ranging from numerical continuation methods to exact methods based e.g. on Gröbner or border bases; see e.g. the monograph [1] and the references therein. However in many practical applications one is only interested in real… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-2 OF 2 REFERENCES

Semidefinite characterization and computation of real radical ideals

Jean Bernard Lasserre-Monique Laurent-Philipp Rostalski
  • 2008
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL