Jump to content
Change search PrimeFaces.cw("Fieldset","widget_formSmash_search",{id:"formSmash:search",widgetVar:"widget_formSmash_search",toggleable:true,collapsed:true,toggleSpeed:500,behaviors:{toggle:function(ext) {PrimeFaces.ab({s:"formSmash:search",e:"toggle",f:"formSmash",p:"formSmash:search"},ext);}}});
$(function(){PrimeFaces.cw("Dialog","citationDialog",{id:"formSmash:upper:j_idt183",widgetVar:"citationDialog",width:"800",height:"600"});});
$(function(){PrimeFaces.cw("ImageSwitch","widget_formSmash_j_idt964",{id:"formSmash:j_idt964",widgetVar:"widget_formSmash_j_idt964",fx:"fade",speed:500,timeout:8000},"imageswitch");});
#### Open Access in DiVA

No full text in DiVA
#### Other links

Publisher's full textScopus
#### Authority records

Granat, RobertKågström, Bo
#### Search in DiVA

##### By author/editor

Granat, RobertKågström, Bo
##### By organisation

Department of Computing ScienceHPC2N (High Performance Computing Centre North)
##### In the same journal

BIT Numerical Mathematics
#### Search outside of DiVA

GoogleGoogle ScholarfindCitings = function() {PrimeFaces.ab({s:"formSmash:j_idt1155",f:"formSmash",u:"formSmash:citings",pa:arguments[0]});};$(function() {findCitings();}); $(function(){PrimeFaces.cw('Chart','widget_formSmash_visits',{id:'formSmash:visits',type:'bar',responsive:true,data:[[1,1,1,3,1,4,1,1,3,2]],title:"Visits for this publication",axes:{xaxis: {label:"",renderer:$.jqplot.CategoryAxisRenderer,tickOptions:{angle:-90}},yaxis: {label:"",min:0,max:10,renderer:$.jqplot.LinearAxisRenderer,tickOptions:{angle:0}}},series:[{label:'diva2:212196'}],ticks:["Jun -22","Aug -23","Oct -23","Dec -23","Jan -24","Feb -24","Mar -24","Apr -24","Jun -24","Aug -24"],orientation:"vertical",barMargin:3,datatip:true,datatipFormat:"<span style=\"display:none;\">%2$d</span><span>%2$d</span>"},'charts');}); Total: 219 hits
$(function(){PrimeFaces.cw("Dialog","citationDialog",{id:"formSmash:lower:j_idt1248",widgetVar:"citationDialog",width:"800",height:"600"});});

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

Computing Periodic Deflating Subspaces Associated with a Specified Set of EigenvaluesPrimeFaces.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();
}
}
2007 (English)In: BIT Numerical Mathematics, ISSN 0006-3835, E-ISSN 1572-9125, Vol. 47, no 4, p. 763-791Article in journal (Refereed) Published
##### Abstract [en]

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

2007. Vol. 47, no 4, p. 763-791
##### Keywords [en]

generalized product of a K-cyclic matrix pair sequence, generalized periodic real Schur form, eigenvalue reordering, periodic generalized coupled Sylvester equation, K-cyclic equivalence transformation, generalized periodic eigenvalue problem
##### Identifiers

URN: urn:nbn:se:umu:diva-21939DOI: 10.1007/s10543-007-0143-yScopus ID: 2-s2.0-36749021070ISBN: 0006-3835 (print)OAI: oai:DiVA.org:umu-21939DiVA, id: diva2:212196
#####

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

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

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt467",{id:"formSmash:j_idt467",widgetVar:"widget_formSmash_j_idt467",multiple:true});
##### Note

Granat, R. Kagstroem, B. Kressner, D.Available from: 2009-04-21 Created: 2009-04-21 Last updated: 2023-03-24
##### In thesis

We present a direct method for reordering eigenvalues in the generalized periodic real Schur form of a regular K-cyclic matrix pair sequence (A (k) ,E (k) ). Following and generalizing existing approaches, reordering consists of consecutively computing the solution to an associated Sylvester-like equation and constructing K pairs of orthogonal matrices. These pairs define an orthogonal K-cyclic equivalence transformation that swaps adjacent diagonal blocks in the Schur form. An error analysis of this swapping procedure is presented, which extends existing results for reordering eigenvalues in the generalized real Schur form of a regular pair (A,E). Our direct reordering method is used to compute periodic deflating subspace pairs corresponding to a specified set of eigenvalues. This computational task arises in various applications related to discrete-time periodic descriptor systems. Computational experiments confirm the stability and reliability of the presented eigenvalue reordering method.

1. Algorithms and Library Software for Periodic and Parallel Eigenvalue Reordering and Sylvester-Type Matrix Equations with Condition Estimation$(function(){PrimeFaces.cw("OverlayPanel","overlay140959",{id:"formSmash:j_idt741:0:j_idt745",widgetVar:"overlay140959",target:"formSmash:j_idt741:0:parentLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

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

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