Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal

Details:

   
TitleApproximate Gr\"obner bases, overdetermined polynomial systems, and approximate GCDs.
Author(s) Daniel Lichtblau
TypeArticle in Journal
AbstractWe discuss computation of Gröbner bases using approximate arithmetic for coefficients. We show how certain considerations of tolerance, corresponding roughly to absolute and relative error from numeric computation, allow us to obtain good approximate solutions to problems that are overdetermined. We provide examples of solving overdetermined systems of polynomial equations. As a secondary feature we show handling of approximate polynomial GCD computations, using benchmarks from the literature.
ISSN2090-7842/e
File
URL http://www.hindawi.com/journals/isrn/2013/352806/
LanguageEnglish
JournalISRN Comput. Math.
Volume2013
Pages12
PublisherHindawi (International Scholarly Research Network - ISRN), New York, NY
Year2013
Edition0
Translation No
Refereed No
Webmaster