On Root Classification in Kinetic Data Structures

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F11%3A43897723" target="_blank" >RIV/49777513:23520/11:43897723 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

On Root Classification in Kinetic Data Structures

Popis výsledku v původním jazyce

In this paper we discuss the mathematical properties of kinetic events computation for kinetic data structures with polynomial-type certi?cate functions. We show that it is neither theoretically possible nor numerically safe to ignore the multiplicitiesof roots of these equations. The multiplicities of the roots are sometimes ignored in order to speed up the process of estimating their location, however, they must be taken into account during the management of the kinetic data structures. Some of the roots obtained by the computations of these equations do not necessarily carry the expected information (i.e., the times of future kinetic events) and they may be therefore avoided entirely during the computation. This text shows how to distinguish theseroots before their exact location is computed and thus to avoid their computation.

Název v anglickém jazyce

On Root Classification in Kinetic Data Structures

Popis výsledku anglicky

In this paper we discuss the mathematical properties of kinetic events computation for kinetic data structures with polynomial-type certi?cate functions. We show that it is neither theoretically possible nor numerically safe to ignore the multiplicitiesof roots of these equations. The multiplicities of the roots are sometimes ignored in order to speed up the process of estimating their location, however, they must be taken into account during the management of the kinetic data structures. Some of the roots obtained by the computations of these equations do not necessarily carry the expected information (i.e., the times of future kinetic events) and they may be therefore avoided entirely during the computation. This text shows how to distinguish theseroots before their exact location is computed and thus to avoid their computation.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2011

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

ADVCOMP 2011

ISBN

978-1-61208-172-4

ISSN

—

e-ISSN

—

Počet stran výsledku

4

Strana od-do

32-35

Název nakladatele

IARIA

Místo vydání

Lisabon

Místo konání akce

Lisbon, Portugal

Datum konání akce

20. 11. 2011

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—