umu.sePublications

CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_upper_j_idt205",{id:"formSmash:upper:j_idt205",widgetVar:"widget_formSmash_upper_j_idt205",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:upper:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt206_j_idt212",{id:"formSmash:upper:j_idt206:j_idt212",widgetVar:"widget_formSmash_upper_j_idt206_j_idt212",target:"formSmash:upper:j_idt206:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Coupled Sylvester-type Matrix Equations and Block DiagonalizationPrimeFaces.cw("AccordionPanel","widget_formSmash_some",{id:"formSmash:some",widgetVar:"widget_formSmash_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_all",{id:"formSmash:all",widgetVar:"widget_formSmash_all",multiple:true});
function selectAll()
{
var panelSome = $(PrimeFaces.escapeClientId("formSmash:some"));
var panelAll = $(PrimeFaces.escapeClientId("formSmash:all"));
panelAll.toggle();
toggleList(panelSome.get(0).childNodes, panelAll);
toggleList(panelAll.get(0).childNodes, panelAll);
}
/*Toggling the list of authorPanel nodes according to the toggling of the closeable second panel */
function toggleList(childList, panel)
{
var panelWasOpen = (panel.get(0).style.display == 'none');
// console.log('panel was open ' + panelWasOpen);
for (var c = 0; c < childList.length; c++) {
if (childList[c].classList.contains('authorPanel')) {
clickNode(panelWasOpen, childList[c]);
}
}
}
/*nodes have styleClass ui-corner-top if they are expanded and ui-corner-all if they are collapsed */
function clickNode(collapse, child)
{
if (collapse && child.classList.contains('ui-corner-top')) {
// console.log('collapse');
child.click();
}
if (!collapse && child.classList.contains('ui-corner-all')) {
// console.log('expand');
child.click();
}
}
2015 (English)In: SIAM Journal on Matrix Analysis and Applications, ISSN 0895-4798, E-ISSN 1095-7162, Vol. 36, no 2, p. 580-593Article in journal (Refereed) Published
##### Abstract [en]

##### Place, publisher, year, edition, pages

2015. Vol. 36, no 2, p. 580-593
##### Keywords [en]

matrix equation, Sylvester equation, Stein equation, Roth's theorem, nsistency, block diagonalization, MMEL JW, 1987, LINEAR ALGEBRA AND ITS APPLICATIONS, V88-9, P139 anat R., 2007, BIT NUMERICAL MATHEMATICS, V47, P763
##### National Category

Computer Sciences Mathematical Analysis
##### Identifiers

URN: urn:nbn:se:umu:diva-107104DOI: 10.1137/151005907ISI: 000357407800011OAI: oai:DiVA.org:umu-107104DiVA, id: diva2:856028
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt667",{id:"formSmash:j_idt667",widgetVar:"widget_formSmash_j_idt667",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt674",{id:"formSmash:j_idt674",widgetVar:"widget_formSmash_j_idt674",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt683",{id:"formSmash:j_idt683",widgetVar:"widget_formSmash_j_idt683",multiple:true}); Available from: 2015-09-23 Created: 2015-08-18 Last updated: 2018-06-07Bibliographically approved
##### In thesis

We prove Roth-type theorems for systems of matrix equations including an arbitrary mix of Sylvester and $\star$-Sylvester equations, in which the transpose or conjugate transpose of the unknown matrices also appear. In full generality, we derive consistency conditions by proving that such a system has a solution if and only if the associated set of $2 \times 2$ block matrix representations of the equations are block diagonalizable by (linked) equivalence transformations. Various applications leading to several particular cases have already been investigated in the literature, some recently and some long ago. Solvability of these cases follow immediately from our general consistency theory. We also show how to apply our main result to systems of Stein-type matrix equations.

1. Tools for Structured Matrix Computations: Stratifications and Coupled Sylvester Equations$(function(){PrimeFaces.cw("OverlayPanel","overlay872408",{id:"formSmash:j_idt1096:0:j_idt1115",widgetVar:"overlay872408",target:"formSmash:j_idt1096:0:parentLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

doi
urn-nbn$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_j_idt1932",{id:"formSmash:j_idt1932",widgetVar:"widget_formSmash_j_idt1932",showEffect:"fade",hideEffect:"fade",showDelay:500,hideDelay:300,target:"formSmash:altmetricDiv"});});

CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_lower_j_idt1985",{id:"formSmash:lower:j_idt1985",widgetVar:"widget_formSmash_lower_j_idt1985",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:lower:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt1986_j_idt1988",{id:"formSmash:lower:j_idt1986:j_idt1988",widgetVar:"widget_formSmash_lower_j_idt1986_j_idt1988",target:"formSmash:lower:j_idt1986:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});