Symbolic-numerical algorithms for polynomials: Some recent results
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to systems of equations (65H10)
Short tutorial paper on the subject of the title. The main ideas to use Gröbner bases with lex-ordered and (better) grevlex-ordered Gröbner bases together with the transformation to eigenproblems of related commuting families of matrices are presented. A Maple program sheet with three examples is given. For the entire collection see [Zbl 0963.00018].
- Some tapas of computer algebra
- Some examples for solving systems of algebraic equations by calculating Gröbner bases
- Working with multivariate polynomials in Maple
- Algorithmische Aspekte zur Theorie der Gröbner-Basen. (Algorithmic aspects of the theory of Gröbner bases)
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- A reliable symbolic implementation of algorithm for calculating Adomian polynomials
- Symbolic-numeric QD-algorithms with applications in function theory and linear algebra
- scientific article; zbMATH DE number 4137315 (Why is no real title available?)
- Algorithms for Symbolic Polynomials
- An effective algorithm of computing symbolic determinants with multivariate polynomial entries
This page was built for publication: Symbolic-numerical algorithms for polynomials: Some recent results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2738477)
