A multivariate Weierstrass iterative rootfinder

DOI10.1145/384101.384138MaRDI QIDQ2958945zbMATH OpenOpenAlexFDO

Authors Olivier Ruatta

Publication date 3 February 2017

Published in Proceedings of the 2001 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/384101.384138

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10)

Recommendations

• On a Method of Weierstraß for the Simultaneous Calculation of the Roots of a Polynomial
• Solving triangular algebraic systems by means of simultaneous iterations
• The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence
• The simultaneous approximation of polynomial roots
• Nearest multivariate system with given root multiplicities

Cited in

(6)

• On the solutions of polynomial systems obtained with Weierstrass method
• Nearest multivariate system with given root multiplicities
• Overdetermined Weierstrass iteration and the nearest consistent system
• Relations between roots and coefficients, interpolation and application to system solving
• Solving triangular algebraic systems by means of simultaneous iterations
• Artificial neural network-based single-step method for solving biomedical engineering application

Describes a project that uses

Uses Software

• Maple

This page was built for publication: A multivariate Weierstrass iterative rootfinder

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