A recursive algorithm for constructing complicated Dixon matrices

DOI10.1016/j.amc.2010.07.072zbMath1202.65065OpenAlexW2055643109MaRDI QIDQ606826

Hongguang Fu, Ying Wang, Qingxian Wang, Shizhong Zhao

Publication date: 18 November 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2010.07.072

zbMATH Keywords

numerical examplesquantifier eliminationrecursive algorithmformal power seriesdynamic programming algorithmsystem of polynomial equationsDixon matrixDixon polynomial

Mathematics Subject Classification ID

Related Items (2)

Complexity of constructing Dixon resultant matrix ⋮ Parallel computation of real solving bivariate polynomial systems by zero-matching method

Cites Work

• Basic principles of mechanical theorem proving in elementary geometries
• Fast computation of the Bézout and Dixon resultant matrices
• Conic tangency equations and Apollonius problems in biochemistry and pharmacology
• An extended fast algorithm for constructing the Dixon resultant matrix
• Unnamed Item

This page was built for publication: A recursive algorithm for constructing complicated Dixon matrices