On preconditioning and solving an extended class of interval parametric linear systems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10437014" target="_blank" >RIV/00216208:11320/21:10437014 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=m.cZjjFSOR" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=m.cZjjFSOR</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s11075-020-01018-0" target="_blank" >10.1007/s11075-020-01018-0</a>
Alternative languages
Result language
angličtina
Original language name
On preconditioning and solving an extended class of interval parametric linear systems
Original language description
We deal with interval parametric systems of linear equations and the goal is to solve such systems, which basically comes down to finding an enclosure for a parametric solution set. Obviously, we want this enclosure to be tight and cheap to compute; unfortunately, these two objectives are conflicting. The review of the available literature shows that in order to make a system more tractable, most of the solution methods use left preconditioning of the system by the midpoint inverse. Surprisingly, and in contrast to standard interval linear systems, our investigations have shown that double preconditioning can be more efficient than a single one, both in terms of checking the regularity of the system matrix and enclosing the solution set, which is demonstrated by numerical examples. Consequently, right (which was hitherto mentioned in the context of checking regularity of interval parametric matrices) and double preconditioning together with the p-solution concept enable us to solve a larger class of interval parametric linear systems than most existing methods. The applicability of the proposed approach to solving interval parametric linear systems is illustrated by several numerical examples. (C) 2020, Springer Science+Business Media, LLC, part of Springer Nature.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA18-04735S" target="_blank" >GA18-04735S: Novel approaches for relaxation and approximation techniques in deterministic global optimization</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Numerical Algorithms
ISSN
1017-1398
e-ISSN
—
Volume of the periodical
87
Issue of the periodical within the volume
4
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
28
Pages from-to
1535-1562
UT code for WoS article
000582426300001
EID of the result in the Scopus database
2-s2.0-85094115482