An efficient method for computing resultant systems

DOI10.1007/S002000050105MaRDI QIDQ1277246zbMATH OpenOpenAlexFDO

Authors Mark J. Encarnación

Publication date 6 April 1999

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002000050105

zbMATH Keywords

elimination theorypolynomial equationresultant system

Mathematics Subject Classification ID

Computational aspects and applications of commutative rings (13P99)

Recommendations

• An Efficient Derivative-Free Method for the Solution of Systems of Equations
• The Method of Resultants for Computing Real Solutions of Polynomial Systems
• Efficient polynomial system solving by numerical methods
• Efficient polynomial system-solving by numerical methods
• scientific article; zbMATH DE number 1273645
• Efficient Algorithms for MultiPolynomial Resultant
• Computations of multi-resultant with mechanization
• Efficient solution of linear systems of equations with recursive structure
• Efficient method for solving a system of nonlinear equations
• Fast computation of special resultants

Cited in

(5)

• scientific article; zbMATH DE number 16644 (Why is no real title available?)
• Resultant over the residual of a complete intersection.
• A resultant system as the set of coefficients of a single resultant
• Minimal resultant systems
• Resultants for systems of multivariate polynomials

This page was built for publication: An efficient method for computing resultant systems

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