scientific article; zbMATH DE number 5049913

MaRDI QIDQ5482450zbMATH OpenFDO

Authors Teresa Krick

Publication date 28 August 2006

zbMATH Keywords

algorithmscomplexitypolynomial equation systems

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05)

Recommendations

• Interpolation of polynomials given by straight-line programs
• scientific article; zbMATH DE number 3637614
• scientific article; zbMATH DE number 3644821
• scientific article; zbMATH DE number 4062814
• Solving systems of linear equations over polynomials
• scientific article; zbMATH DE number 3890617
• On solutions of linear equations with polynomial coefficients
• Real roots of univariate polynomials and straight line programs
• Straight-line programs in geometric elimination theory

Cited in

(8)

• Functional programming concepts and straight-line programs in computer algebra
• Variety evasive subspace families
• Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces
• Probabilistic algorithms for computing resolvent representations of regular differential ideals
• EVALUATION PROPERTIES OF SYMMETRIC POLYNOMIALS
• Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
• scientific article; zbMATH DE number 939812 (Why is no real title available?)
• Computing real radicals and \(S\)-radicals of polynomial systems

Describes a project that uses

Uses Software

• Kronecker

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5482450)