Parallel computing of linear systems with linearly dependent intervals in MATLAB

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10385583" target="_blank" >RIV/00216208:11320/18:10385583 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1007/978-3-319-78054-2_37" target="_blank" >https://doi.org/10.1007/978-3-319-78054-2_37</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-319-78054-2_37" target="_blank" >10.1007/978-3-319-78054-2_37</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Parallel computing of linear systems with linearly dependent intervals in MATLAB

Popis výsledku v původním jazyce

We implemented several known algorithms for finding an interval enclosure of the solution set of a linear system with linearly dependent interval parameters. To do that we have chosen MATLAB environment with use of INTLAB and VERSOFT libraries. Because our implementation is tested on Toeplitz and symmetric matrices, among others, there is a problem with a sparsity. We introduce straightforward format for representing such matrices, which seems to be almost as effective as the standard matrix representation but with less memory demands. Moreover, we take an advantage of Parallel Computing Toolbox to enhance the performance of implemented methods and to get more insights on how the methods stands in a scope of a tightness-performance ratio. The contribution is a time-tightness performance comparison of such methods, memory efficient representation and an exploration of explicit parallelization impact.

Název v anglickém jazyce

Parallel computing of linear systems with linearly dependent intervals in MATLAB

Popis výsledku anglicky

We implemented several known algorithms for finding an interval enclosure of the solution set of a linear system with linearly dependent interval parameters. To do that we have chosen MATLAB environment with use of INTLAB and VERSOFT libraries. Because our implementation is tested on Toeplitz and symmetric matrices, among others, there is a problem with a sparsity. We introduce straightforward format for representing such matrices, which seems to be almost as effective as the standard matrix representation but with less memory demands. Moreover, we take an advantage of Parallel Computing Toolbox to enhance the performance of implemented methods and to get more insights on how the methods stands in a scope of a tightness-performance ratio. The contribution is a time-tightness performance comparison of such methods, memory efficient representation and an exploration of explicit parallelization impact.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

50201 - Economic Theory

Projekt

<a href="/cs/project/GA13-10660S" target="_blank" >GA13-10660S: Intervalové metody pro optimalizační úlohy</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2018

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

Parallel Processing and Applied Mathematics

ISBN

978-3-319-78054-2

ISSN

1611-3349

e-ISSN

neuvedeno

Počet stran výsledku

11

Strana od-do

391-401

Název nakladatele

Springer

Místo vydání

Cham

Místo konání akce

Lublin

Datum konání akce

10. 9. 2017

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

WRD - Celosvětová akce

Kód UT WoS článku

—