Solving polynomial systems via symbolic-numeric reduction to geometric involutive form

A new efficient algorithm for computing Gröbner bases without reduction to zero ( <i>F</i> ₅ )

Jean Charles Faugère · 2002 · 769 citations

Computing, Computer Science, Mathematics +7

The singular value decomposition for polynomial systems

Robert M. Corless, Patrizia Gianni, Barry Trager et al. · 1995 · 205 citations

Computing, Computer Science, Mathematics +14

The numerical solution of&amp;lt;tex&amp;gt;A'Q+QA = -C&amp;lt;/tex&amp;gt;

W. D. Hoskins, D.S. Meek, D. J. Walton · IEEE Transactions on Automatic Control · 1977 · 199 citations

Computing, Mathematics, Algorithms +9

Involutive bases of polynomial ideals

Vladimir P. Gerdt, Yu. A. Blinkov · Mathematics and Computers in Simulation · 1998 · 198 citations · Full text

Natural Sciences, Mathematics, Algebra +6

Total Least Norm Formulation and Solution for Structured Problems

J. B. Rosen, Haesun Park, John Glick · SIAM Journal on Matrix Analysis and Applications · 1996 · 188 citations

Natural Sciences, Computer Science, Mathematics +12