Condition Analysis of Overdetermined Algebraic Problems

Hans J. Stetter ()
Additional contact information
Hans J. Stetter: Tech.Univ. Vienna

A chapter in Computer Algebra in Scientific Computing, 2000, pp 345-365 from Springer

Abstract: Abstract In analogy to numerical linear algebra, the evolving numerical polynomial algebra studies the modifications of classical polynomial algebra necessary to accomodate inaccurate data and inexact computation. A standard part of this endeavor is a condition analysis of the problems to be solved, i.e. an assessment of the sensitivity of their results with respect to variations in their data. In this paper, we extend this condition analysis to overdetermined problems, like greatest common divisors, multivariate factorization etc. Here we must consider the fact that results exist only for data from restricted low-dimensional domains. The discontinuous dependence of the results on the data, however, is “smoothed” by their limited accuracy so that a condition analysis becomes meaningful. As usual, the condition numbers indicate the accuracy with which results may be specified.

Keywords: Polynomial System; Limited Accuracy; Great Common Divisor; Polynomial Algebra; Univariate Polynomial (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-57201-2_27

Ordering information: This item can be ordered from
http://www.springer.com/9783642572012

DOI: 10.1007/978-3-642-57201-2_27

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().