A numerical elimination method for polynomial computations

DOI10.1016/j.tcs.2008.09.035zbMath1156.65049OpenAlexW2031299026MaRDI QIDQ2378510

Zhonggang Zeng

Publication date: 8 January 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.09.035

zbMATH Keywords

numerical examplespolynomial systemsmeasurementelimination algorithmeliminant polynomialsstability sensitivity

Mathematics Subject Classification ID

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

Related Items

A fast recursive orthogonalization scheme for the Macaulay matrix, Overdetermined Weierstrass iteration and the nearest consistent system, Regularization and Matrix Computation in Numerical Polynomial Algebra, On the Sensitivity of Singular and Ill-Conditioned Linear Systems

Uses Software

• MultRoot
• PHCpack
• ApaTools
• MR

Cites Work

• Newton's method with deflation for isolated singularities of polynomial systems
• Algebraic algorithms for structure determination in biological chemistry
• The Method of Resultants for Computing Real Solutions of Polynomial Systems
• Algorithm 795
• The approximate GCD of inexact polynomials
• Solving algebraic systems using matrix computations
• Accurate solution of polynomial equations using Macaulay resultant matrices
• Computing the multiplicity structure in solving polynomial systems
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• A Rank-Revealing Method with Updating, Downdating, and Applications
• Computer Algebra in Scientific Computing
• Perturbation bounds in connection with singular value decomposition
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item