Efficient approaches for enclosing the united solution set of the interval generalized Sylvester matrix equations

From MaRDI portal
Publication:1690908

DOI10.1016/J.APNUM.2017.12.003zbMATH Open1380.65078arXiv1510.04853OpenAlexW2218910308MaRDI QIDQ1690908FDOQ1690908


Authors: Marzieh Dehghani-Madiseh, Milan Hladík Edit this on Wikidata


Publication date: 12 January 2018

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Abstract: In this work, we investigate the interval generalized Sylvester matrix equation and develop some techniques for obtaining outer estimations for the so-called united solution set of this interval system. First, we propose a modified variant of the Krawczyk operator which causes reducing computational complexity to cubic, compared to Kronecker product form. We then propose an iterative technique for enclosing the solution set. These approaches are based on spectral decompositions of the midpoints of , , and and in both of them we suppose that the midpoints of and are simultaneously diagonalizable as well as for the midpoints of the matrices and . Some numerical experiments are given to illustrate the performance of the proposed methods.


Full work available at URL: https://arxiv.org/abs/1510.04853




Recommendations




Cites Work


Cited In (15)

Uses Software





This page was built for publication: Efficient approaches for enclosing the united solution set of the interval generalized Sylvester matrix equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1690908)