Thumbnail
Access Restriction
Subscribed

Author Cucker, Felipe ♦ Smale, Steve
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1999
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Conditioning ♦ Error analysis ♦ Feasibility of polynomial systems ♦ Iterative methods
Abstract This paper has two agendas. One is to develop the foundations of round-off in computation. The other is to describe an algorithm for deciding feasibility for polynomial systems of equations and inequalities together with its complexity analysis and its round-off properties. Each role reinforces the other.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1999-01-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 46
Issue Number 1
Page Count 72
Starting Page 113
Ending Page 184


Open content in new tab

   Open content in new tab
Source: ACM Digital Library