A subresultant-like theory for Buchberger's procedure

DOI10.1007/S13160-013-0133-1zbMATH Open1361.68304OpenAlexW2004254369MaRDI QIDQ2452291FDOQ2452291

Authors: Tateaki Sasaki 

Publication date: 2 June 2014

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13160-013-0133-1

Recommendations

• scientific article; zbMATH DE number 1263402
• Term cancellations in computing floating-point Gröbner bases
• On improving approximate results of Buchberger's algorithm by Newton's method
• Buchberger's algorithm: a constraint-based completion procedure
• A practical method for floating-point Gröbner basis computation

zbMATH Keywords

subresultantBuchberger's proceduremain-term cancellation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Solving polynomial systems; resultants (13P15)

Cites Work

• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Subresultants and Reduced Polynomial Remainder Sequences
• Term cancellations in computing floating-point Gröbner bases
• Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A practical method for floating-point Gröbner basis computation
• Theory of multiple polynomial remainder sequence

Cited In (2)

• On improving approximate results of Buchberger's algorithm by Newton's method
• A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs)

This page was built for publication: A subresultant-like theory for Buchberger's procedure

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