Hans J. Stetter
- {1} W. Auzinger, H.J. Stetter: An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations, in: Intern. Series in Numer. Math. (Birkhäuser) vol. 86, 11-30, 1988.Google Scholar
Cross Ref
- {2} J. Canny, I. Emiris: An efficient algorithm for the sparse mixed resultant, in: Lect. Notes in Comp. Science vol. 263, 89-104, 1993. Google ScholarDigital Library
- {3} R.M. Corless, P.M. Gianni, B.M. Trager, Stephen M. Watt: The Singular Value Decomposition for Polynomial Systems, in: Proc. ISSAC '95, Montréal, A.H.M. Levelt, ed., 195-207, 1995. Google ScholarDigital Library
- {4} D. Lazard: Résolution des systèmes d'équations algébriques, Theor. Comp. Sci 15, 77-110, 1981.Google ScholarCross Ref
- {5} M.G. Marinari, H.M. Moeller, T. Mora: Groebner duality and multiplicities in polynomial system solving , to appear in Trans. AMS.Google Scholar
- {6} H.M. Moeller, H.J. Stetter: Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems , Numer. Math. 70, 311-329, 1995. Google ScholarDigital Library
- {7} H.J. Stetter: Multivariate polynomial equations as matrix eigenproblems, in: Series in Applicable Analysis (World Scientific) vol. 2, 355-371, 1993.Google Scholar
Index Terms
- Matrix eigenproblems are at the heart of polynomial system solving
Recommendations
Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems
In this paper we consider the application of polynomial root-finding methods to the solution of the tridiagonal matrix eigenproblem. All considered solvers are based on evaluating the Newton correction. We show that the use of scaled three-term ...
Jacobi-davidson type methods for generalized eigenproblems and polynomial eigenproblems
AbstractIn this paper we will show how the Jacobi-Davidson iterative method can be used to solve generalized eigenproblems. Similar ideas as for the standard eigenproblem are used, but the projections, that are required to reduce the given problem to a ...
On polynomial Schur's matrix
Classical Schur's matrix is a different evaluation, provided by Schur, of the quadratic Gaussian sum from Gauss. The advanced information was studied by L. Carlitz who determined its eigenvalues, and by P. Morton who determined its eigenvectors. In this ...
Comments