Computing Enclosures of Overdetermined Interval Linear Systems

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10173087" target="_blank" >RIV/00216208:11320/13:10173087 - isvavai.cz</a>

Výsledek na webu

<a href="http://interval.louisiana.edu/reliable-computing-journal/volume-19/reliable-computing-19-pp-142-155.pdf" target="_blank" >http://interval.louisiana.edu/reliable-computing-journal/volume-19/reliable-computing-19-pp-142-155.pdf</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Computing Enclosures of Overdetermined Interval Linear Systems

Popis výsledku v původním jazyce

This work considers special types of interval linear systems - overdetermined systems, systems consisting of more equations than variables. The solution set of an interval linear system is a collection of all solutions of all instances of an interval system. By the instance, we mean a point real system that emerges when we independently choose a real number from each interval coefficient of the interval system. Enclosing the solution set of these systems is in some ways more difficult than for square systems. This work presents various methods for computing enclosures of overdetermined interval linear systems. We would like to present them in an understandable way even for nonspecialists in the field of linear systems. The second goal is a numerical comparison of all mentioned methods on random interval linear systems regarding tightness of enclosures, computation times, and other special properties of methods.

Název v anglickém jazyce

Computing Enclosures of Overdetermined Interval Linear Systems

Popis výsledku anglicky

This work considers special types of interval linear systems - overdetermined systems, systems consisting of more equations than variables. The solution set of an interval linear system is a collection of all solutions of all instances of an interval system. By the instance, we mean a point real system that emerges when we independently choose a real number from each interval coefficient of the interval system. Enclosing the solution set of these systems is in some ways more difficult than for square systems. This work presents various methods for computing enclosures of overdetermined interval linear systems. We would like to present them in an understandable way even for nonspecialists in the field of linear systems. The second goal is a numerical comparison of all mentioned methods on random interval linear systems regarding tightness of enclosures, computation times, and other special properties of methods.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BD - Teorie informace

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2013

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 periodika

Reliable Computing [online]

ISSN

1573-1340

e-ISSN

—

Svazek periodika

19

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

14

Strana od-do

142-155

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—