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 Science
##### In the same journal

ACM Transactions on Mathematical Software
On the subject

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:[[2,3,5,6,4,5,6,11,6,1]],title:"Visits for this publication",axes:{xaxis: {label:"",renderer:$.jqplot.CategoryAxisRenderer,tickOptions:{angle:-90}},yaxis: {label:"",min:0,max:20,renderer:$.jqplot.LinearAxisRenderer,tickOptions:{angle:0}}},series:[{label:'diva2:140956'}],ticks:["Sep -23","Oct -23","Nov -23","Dec -23","Jan -24","Feb -24","Mar -24","Apr -24","May -24","Jun -24"],orientation:"vertical",barMargin:3,datatip:true,datatipFormat:"<span style=\"display:none;\">%2$d</span><span>%2$d</span>"},'charts');}); Total: 367 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});});

Parallel Solvers for Sylvester-type Matrix Equations with Applications in Condition Estimation, Part I: Theory and AlgorithmsPrimeFaces.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();
}
}
2010 (English)In: ACM Transactions on Mathematical Software, ISSN 0098-3500, E-ISSN 1557-7295, Vol. 37, no 3, p. 32:1-32:32Article in journal (Refereed) Published
##### Abstract [en]

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

New York: ACM Press, 2010. Vol. 37, no 3, p. 32:1-32:32
##### National Category

Mathematics
##### Identifiers

URN: urn:nbn:se:umu:diva-2708DOI: 10.1145/1824801.1824810ISI: 000282761200009Scopus ID: 2-s2.0-77957584129OAI: oai:DiVA.org:umu-2708DiVA, id: diva2:140956
#####

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

##### In thesis

Parallel ScaLAPACK-style algorithms for solving eight common standard and generalized Sylvester-type matrix equations and various sign and transposed variants are presented. All algorithms are blocked variants based on the Bartels--Stewart method and involve four major steps: reduction to triangular form, updating the right-hand side with respect to the reduction, computing the solution to the reduced triangular problem, and transforming the solution back to the original coordinate system. Novel parallel algorithms for solving reduced triangular matrix equations based on wavefront-like traversal of the right-hand side matrices are presented together with a generic scalability analysis. These algorithms are used in condition estimation and new robust parallel sep^{ − 1}-estimators are developed. Experimental results from three parallel platforms, including results from a mixed OpenMP/MPI platform, are presented and analyzed using several performance and accuracy metrics. The analysis includes results regarding general and triangular parallel solvers as well as parallel condition estimators.

Artikelnummer/article number: 32

Available from: 2007-11-01 Created: 2007-11-01 Last updated: 2023-03-24Bibliographically approved1. 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
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});});