A geometric consistency theorem for a symbolic perturbation scheme

Research output: Contribution to journalArticle

Abstract

In a previous paper, we introduced a generic solution to the problem of data degeneracy in geometric algorithms. The scheme is simple to use: algorithms qualifying under our requirements just have to use a prescribed blackbox for polynomial evaluation in order to achieve a symbolic perturbation of data. In this paper, we introduce the concept of an infinitesimal perturbation and show that our method is consistent relative to such perturbations.

Original languageEnglish (US)
Pages (from-to)2-18
Number of pages17
JournalJournal of Computer and System Sciences
Volume40
Issue number1
DOIs
StatePublished - 1990

Fingerprint

Perturbation
Theorem
Polynomial Evaluation
Geometric Algorithms
Polynomials
Black Box
Degeneracy
Requirements
Concepts

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

A geometric consistency theorem for a symbolic perturbation scheme. / Yap, Chee.

In: Journal of Computer and System Sciences, Vol. 40, No. 1, 1990, p. 2-18.

Research output: Contribution to journalArticle

@article{3aa91af8bce544ef8caec51cbf993b76,
title = "A geometric consistency theorem for a symbolic perturbation scheme",
abstract = "In a previous paper, we introduced a generic solution to the problem of data degeneracy in geometric algorithms. The scheme is simple to use: algorithms qualifying under our requirements just have to use a prescribed blackbox for polynomial evaluation in order to achieve a symbolic perturbation of data. In this paper, we introduce the concept of an infinitesimal perturbation and show that our method is consistent relative to such perturbations.",
author = "Chee Yap",
year = "1990",
doi = "10.1016/0022-0000(90)90016-E",
language = "English (US)",
volume = "40",
pages = "2--18",
journal = "Journal of Computer and System Sciences",
issn = "0022-0000",
publisher = "Academic Press Inc.",
number = "1",

}

TY - JOUR

T1 - A geometric consistency theorem for a symbolic perturbation scheme

AU - Yap, Chee

PY - 1990

Y1 - 1990

N2 - In a previous paper, we introduced a generic solution to the problem of data degeneracy in geometric algorithms. The scheme is simple to use: algorithms qualifying under our requirements just have to use a prescribed blackbox for polynomial evaluation in order to achieve a symbolic perturbation of data. In this paper, we introduce the concept of an infinitesimal perturbation and show that our method is consistent relative to such perturbations.

AB - In a previous paper, we introduced a generic solution to the problem of data degeneracy in geometric algorithms. The scheme is simple to use: algorithms qualifying under our requirements just have to use a prescribed blackbox for polynomial evaluation in order to achieve a symbolic perturbation of data. In this paper, we introduce the concept of an infinitesimal perturbation and show that our method is consistent relative to such perturbations.

UR - http://www.scopus.com/inward/record.url?scp=0025384373&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025384373&partnerID=8YFLogxK

U2 - 10.1016/0022-0000(90)90016-E

DO - 10.1016/0022-0000(90)90016-E

M3 - Article

VL - 40

SP - 2

EP - 18

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

SN - 0022-0000

IS - 1

ER -