Please wait ... |

Jump to content
Change search PrimeFaces.cw("InputText","widget_formSmash_searchField",{id:"formSmash:searchField",widgetVar:"widget_formSmash_searchField"}); Search $(function(){PrimeFaces.cw("DefaultCommand","widget_formSmash_j_idt1678",{id:"formSmash:j_idt1678",widgetVar:"widget_formSmash_j_idt1678",target:"formSmash:searchButton",scope:"formSmash:simpleSearch"});}); Search PrimeFaces.cw("CommandButton","widget_formSmash_searchButton",{id:"formSmash:searchButton",widgetVar:"widget_formSmash_searchButton"});
Only documents with full text in DiVA
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);}}});
PrimeFaces.cw("InputText","widget_formSmash_upper_j_idt1209",{id:"formSmash:upper:j_idt1209",widgetVar:"widget_formSmash_upper_j_idt1209"}); More stylesPrimeFaces.cw("InputText","widget_formSmash_upper_j_idt1219",{id:"formSmash:upper:j_idt1219",widgetVar:"widget_formSmash_upper_j_idt1219"}); More languagesCreate PrimeFaces.cw("CommandButton","widget_formSmash_upper_j_idt1228",{id:"formSmash:upper:j_idt1228",widgetVar:"widget_formSmash_upper_j_idt1228"}); Close PrimeFaces.cw("CommandButton","widget_formSmash_upper_j_idt1229",{id:"formSmash:upper:j_idt1229",widgetVar:"widget_formSmash_upper_j_idt1229"});
$(function(){PrimeFaces.cw("Dialog","citationDialog",{id:"formSmash:upper:j_idt1198",widgetVar:"citationDialog",width:"800",height:"600"});});
5 10 20 50 100 250 $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_j_idt1241",{id:"formSmash:j_idt1241",widgetVar:"widget_formSmash_j_idt1241",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:j_idt1241",e:"change",f:"formSmash",p:"formSmash:j_idt1241"},ext);}}});});
Standard (Relevance) Author A-Ö Author Ö-A Title A-Ö Title Ö-A Publication type A-Ö Publication type Ö-A Issued (Oldest first) Issued (Newest first) Created (Oldest first) Created (Newest first) Last updated (Oldest first) Last updated (Newest first) Disputation date (earliest first) Disputation date (latest first) $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_j_idt1251",{id:"formSmash:j_idt1251",widgetVar:"widget_formSmash_j_idt1251",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:j_idt1251",e:"change",f:"formSmash",p:"formSmash:j_idt1251"},ext);}}});});
Standard (Relevance) Author A-Ö Author Ö-A Title A-Ö Title Ö-A Publication type A-Ö Publication type Ö-A Issued (Oldest first) Issued (Newest first) Created (Oldest first) Created (Newest first) Last updated (Oldest first) Last updated (Newest first) Disputation date (earliest first) Disputation date (latest first) $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_j_idt1254",{id:"formSmash:j_idt1254",widgetVar:"widget_formSmash_j_idt1254",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:j_idt1254",e:"change",f:"formSmash",p:"formSmash:j_idt1254"},ext);}}});});
all on this page PrimeFaces.cw("CommandButton","widget_formSmash_j_idt1262",{id:"formSmash:j_idt1262",widgetVar:"widget_formSmash_j_idt1262"}); 250 onwards PrimeFaces.cw("CommandButton","widget_formSmash_j_idt1263",{id:"formSmash:j_idt1263",widgetVar:"widget_formSmash_j_idt1263"});
Clear selection PrimeFaces.cw("CommandButton","widget_formSmash_j_idt1265",{id:"formSmash:j_idt1265",widgetVar:"widget_formSmash_j_idt1265"});
$(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_j_idt1268",{id:"formSmash:j_idt1268",widgetVar:"widget_formSmash_j_idt1268",target:"formSmash:selectHelpLink",showEffect:"blind",hideEffect:"fade",showCloseIcon:true});});
$(function(){PrimeFaces.cw("DataList","widget_formSmash_items_resultList",{id:"formSmash:items:resultList",widgetVar:"widget_formSmash_items_resultList"});});
PrimeFaces.cw("InputText","widget_formSmash_lower_j_idt1632",{id:"formSmash:lower:j_idt1632",widgetVar:"widget_formSmash_lower_j_idt1632"}); More stylesPrimeFaces.cw("InputText","widget_formSmash_lower_j_idt1642",{id:"formSmash:lower:j_idt1642",widgetVar:"widget_formSmash_lower_j_idt1642"}); More languagesCreate PrimeFaces.cw("CommandButton","widget_formSmash_lower_j_idt1651",{id:"formSmash:lower:j_idt1651",widgetVar:"widget_formSmash_lower_j_idt1651"}); Close PrimeFaces.cw("CommandButton","widget_formSmash_lower_j_idt1652",{id:"formSmash:lower:j_idt1652",widgetVar:"widget_formSmash_lower_j_idt1652"});
$(function(){PrimeFaces.cw("Dialog","citationDialog",{id:"formSmash:lower:j_idt1621",widgetVar:"citationDialog",width:"800",height:"600"});});

Refine search result

CiteExportLink to result list
https://umu.diva-portal.org/smash/resultList.jsf?query=&language=en&searchType=SIMPLE&noOfRows=50&sortOrder=author_sort_asc&sortOrder2=title_sort_asc&onlyFullText=false&sf=all&aq=%5B%5B%7B%22personId%22%3A%22authority-person%3A64830%22%7D%5D%5D&aqe=%5B%5D&aq2=%5B%5B%5D%5D&af=%5B%5D $(function(){PrimeFaces.cw("InputTextarea","widget_formSmash_upper_j_idt1186_recordPermLink",{id:"formSmash:upper:j_idt1186:recordPermLink",widgetVar:"widget_formSmash_upper_j_idt1186_recordPermLink",autoResize:true});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt1186_j_idt1188",{id:"formSmash:upper:j_idt1186:j_idt1188",widgetVar:"widget_formSmash_upper_j_idt1186_j_idt1188",target:"formSmash:upper:j_idt1186:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Permanent link

Cite

Citation styleapa ieee modern-language-association-8th-edition vancouver Other style $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_upper_j_idt1204",{id:"formSmash:upper:j_idt1204",widgetVar:"widget_formSmash_upper_j_idt1204",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:upper:j_idt1204",e:"change",f:"formSmash",p:"formSmash:upper:j_idt1204",u:"formSmash:upper:otherStyle"},ext);}}});});

- apa
- ieee
- modern-language-association-8th-edition
- vancouver
- Other style

Languagede-DE en-GB en-US fi-FI nn-NO nn-NB sv-SE Other locale $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_upper_j_idt1215",{id:"formSmash:upper:j_idt1215",widgetVar:"widget_formSmash_upper_j_idt1215",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:upper:j_idt1215",e:"change",f:"formSmash",p:"formSmash:upper:j_idt1215",u:"formSmash:upper:otherLanguage"},ext);}}});});

- de-DE
- en-GB
- en-US
- fi-FI
- nn-NO
- nn-NB
- sv-SE
- Other locale

Output formathtml text asciidoc rtf $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_upper_j_idt1225",{id:"formSmash:upper:j_idt1225",widgetVar:"widget_formSmash_upper_j_idt1225"});});

- html
- text
- asciidoc
- rtf

Rows per page

- 5
- 10
- 20
- 50
- 100
- 250

Sort

- Standard (Relevance)
- Author A-Ö
- Author Ö-A
- Title A-Ö
- Title Ö-A
- Publication type A-Ö
- Publication type Ö-A
- Issued (Oldest first)
- Issued (Newest first)
- Created (Oldest first)
- Created (Newest first)
- Last updated (Oldest first)
- Last updated (Newest first)
- Disputation date (earliest first)
- Disputation date (latest first)

- Standard (Relevance)
- Author A-Ö
- Author Ö-A
- Title A-Ö
- Title Ö-A
- Publication type A-Ö
- Publication type Ö-A
- Issued (Oldest first)
- Issued (Newest first)
- Created (Oldest first)
- Created (Newest first)
- Last updated (Oldest first)
- Last updated (Newest first)
- Disputation date (earliest first)
- Disputation date (latest first)

Select

The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.

1. Parallel Algorithms for Triangular Periodic Sylvester-Type Matrix Equations Andersson, Per PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_0_j_idt1289",{id:"formSmash:items:resultList:0:j_idt1289",widgetVar:"widget_formSmash_items_resultList_0_j_idt1289",onLabel:"Andersson, Per ",offLabel:"Andersson, Per ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_0_j_idt1292",{id:"formSmash:items:resultList:0:j_idt1292",widgetVar:"widget_formSmash_items_resultList_0_j_idt1292",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Umeå University, Faculty of Science and Technology, Department of Computing Science.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:0:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Granat, RobertUmeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, HPC2N (High Performance Computing Centre North).Jonsson, IsakUmeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, HPC2N (High Performance Computing Centre North).Kågström, BoUmeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, HPC2N (High Performance Computing Centre North).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:0:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Parallel Algorithms for Triangular Periodic Sylvester-Type Matrix Equations2008In: Euro-Par 2008 - Parallel Processing: 14th International Euro-Par Conference Conference Location: Las Palmas de Gran Canaria, SPAIN, Springer , 2008, p. 780-789Conference paper (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_0_j_idt1327_0_j_idt1328",{id:"formSmash:items:resultList:0:j_idt1327:0:j_idt1328",widgetVar:"widget_formSmash_items_resultList_0_j_idt1327_0_j_idt1328",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We present parallel algorithms for triangular periodic Sylvester-type matrix equations, conceptually being the third step of a periodic Bartels-Stewart-like solution method for general periodic Sylvester-type matrix equations based on variants of the periodic Schur decomposition. The presented algorithms are designed and implemented in the framework of the recently developed HPG library SCASY and are based on explicit blocking, 2-dimensional block cyclic data distribution and a wavefront-like traversal of the right hand side matrices. High performance is obtained by rich usage of level 3 BLAS operations. It is also demonstrated how several important key concepts of SCASY regarding communications and the treatment of quasi-triangular coefficient matrices are generalized to the periodic case. Some experimental results from a distributed memory Linux cluster demonstrate are also presented.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:0:j_idt1327:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 2. Algorithms and Library Software for Periodic and Parallel Eigenvalue Reordering and Sylvester-Type Matrix Equations with Condition Estimation Granat, Robert PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_1_j_idt1289",{id:"formSmash:items:resultList:1:j_idt1289",widgetVar:"widget_formSmash_items_resultList_1_j_idt1289",onLabel:"Granat, Robert ",offLabel:"Granat, Robert ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Umeå University, Faculty of Science and Technology, Department of Computing Science.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:1:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:1:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Algorithms and Library Software for Periodic and Parallel Eigenvalue Reordering and Sylvester-Type Matrix Equations with Condition Estimation2007Doctoral thesis, comprehensive summary (Other academic)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_1_j_idt1327_0_j_idt1328",{id:"formSmash:items:resultList:1:j_idt1327:0:j_idt1328",widgetVar:"widget_formSmash_items_resultList_1_j_idt1327_0_j_idt1328",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); This Thesis contains contributions in two different but closely related subfields of Scientific and Parallel Computing which arise in the context of various eigenvalue problems: periodic and parallel eigenvalue reordering and parallel algorithms for Sylvestertype matrix equations with applications in condition estimation.

Many real world phenomena behave periodically, e.g., helicopter rotors, revolving satellites and dynamic systems corresponding to natural processes, like the water flow in a system of connected lakes, and can be described in terms of periodic eigenvalue problems. Typically, eigenvalues and invariant subspaces (or, specifically, eigenvectors) to certain periodic matrix products are of interest and have direct physical interpretations. The eigenvalues of a matrix product can be computed without forming the product explicitly via variants of the periodic Schur decomposition. In the first part of the Thesis, we propose direct methods for eigenvalue reordering in the periodic standard and generalized real Schur forms which extend earlier work on the standard and generalized eigenvalue problems. The core step of the methods consists of solving periodic Sylvester-type equations to high accuracy. Periodic eigenvalue reordering is vital in the computation of periodic eigenspaces corresponding to specified spectra. The proposed direct reordering methods rely on orthogonal transformations and can be generalized to more general periodic matrix products where the factors have varying dimensions and ±1 exponents of arbitrary order.

In the second part, we consider Sylvester-type matrix equations, like the continuoustime Sylvester equation AX −XB =C, where A of size m×m, B of size n×n, and C of size m×n are general matrices with real entries, which have applications in many areas. Examples include eigenvalue problems and condition estimation, and several problems in control system design and analysis. The parallel algorithms presented are based on the well-known Bartels–Stewart’s method and extend earlier work on triangular Sylvester-type matrix equations resulting in a novel software library SCASY. The parallel library provides robust and scalable software for solving 44 sign and transpose variants of eight common Sylvester-type matrix equations. SCASY also includes a parallel condition estimator associated with each matrix equation.

In the last part of the Thesis, we propose parallel variants of the direct eigenvalue reordering method for the standard and generalized real Schur forms. Together with the existing and future parallel implementations of the non-symmetric QR/QZ algorithms and the parallel Sylvester solvers presented in the Thesis, the developed software can be used for parallel computation of invariant and deflating subspaces corresponding to specified spectra and associated reciprocal condition number estimates.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:1:j_idt1327:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Download full text (pdf)FULLTEXT01$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_items_resultList_1_j_idt1552_0_j_idt1555",{id:"formSmash:items:resultList:1:j_idt1552:0:j_idt1555",widgetVar:"widget_formSmash_items_resultList_1_j_idt1552_0_j_idt1555",showEffect:"fade",hideEffect:"fade",target:"formSmash:items:resultList:1:j_idt1552:0:fullText"});}); 3. Combining Explicit and Recursive Blocking for Solving Triangular Sylvester-Type Matrix Equations on Distributed Memory Platforms Granat, Robert PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_2_j_idt1289",{id:"formSmash:items:resultList:2:j_idt1289",widgetVar:"widget_formSmash_items_resultList_2_j_idt1289",onLabel:"Granat, Robert ",offLabel:"Granat, Robert ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_2_j_idt1292",{id:"formSmash:items:resultList:2:j_idt1292",widgetVar:"widget_formSmash_items_resultList_2_j_idt1292",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Umeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, HPC2N (High Performance Computing Centre North).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:2:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Jonsson, IsakUmeå University, Faculty of Science and Technology, Department of Computing Science.Kågström, BoUmeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, HPC2N (High Performance Computing Centre North).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:2:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Combining Explicit and Recursive Blocking for Solving Triangular Sylvester-Type Matrix Equations on Distributed Memory Platforms2004In: Euro-Par 2004 Parallel Processing: 10th International Euro-Par Conference, Springer , 2004, p. 742-750Conference paper (Refereed)4. RECSY and SCASY library software Granat, Robert PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_3_j_idt1289",{id:"formSmash:items:resultList:3:j_idt1289",widgetVar:"widget_formSmash_items_resultList_3_j_idt1289",onLabel:"Granat, Robert ",offLabel:"Granat, Robert ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_3_j_idt1292",{id:"formSmash:items:resultList:3:j_idt1292",widgetVar:"widget_formSmash_items_resultList_3_j_idt1292",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Umeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, High Performance Compting Center North (HPC2N).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:3:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Jonsson, IsakUmeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, High Performance Compting Center North (HPC2N).Kågström, BoUmeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, High Performance Compting Center North (HPC2N).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:3:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); RECSY and SCASY library software: recursive blocked and parallel algorithms for Sylvester-type matrix equations with some applications2009In: Parallel scientific computing and optimization: advances and applications / [ed] Raimondas Čiegis, David Henty, Bo Kågström, Julius Žilinskas, Springer-Verlag New York, 2009, p. 3-24Chapter in book (Other academic)5. Recursive Blocked Algorithms for Solving Periodic Triangular Sylvester-Type Matrix Equations Granat, Robert PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_4_j_idt1289",{id:"formSmash:items:resultList:4:j_idt1289",widgetVar:"widget_formSmash_items_resultList_4_j_idt1289",onLabel:"Granat, Robert ",offLabel:"Granat, Robert ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_4_j_idt1292",{id:"formSmash:items:resultList:4:j_idt1292",widgetVar:"widget_formSmash_items_resultList_4_j_idt1292",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Umeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, HPC2N (High Performance Computing Centre North).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:4:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Jonsson, IsakUmeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, HPC2N (High Performance Computing Centre North).Kågström, BoUmeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, HPC2N (High Performance Computing Centre North).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:4:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Recursive Blocked Algorithms for Solving Periodic Triangular Sylvester-Type Matrix Equations2007In: Applied Parallel Computing - State of the Art in Scientific Computing: 8th International Workshop, PARA 2006, Springer , 2007, p. 531-539Conference paper (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_4_j_idt1327_0_j_idt1328",{id:"formSmash:items:resultList:4:j_idt1327:0:j_idt1328",widgetVar:"widget_formSmash_items_resultList_4_j_idt1327_0_j_idt1328",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Recently, recursive blocked algorithms for solving triangular one-sided and two-sided Sylvester-type equations were introduced by Jonsson and Kagstrom. This elegant yet simple technique enables an automatic variable blocking that has the potential of matching the memory hierarchies of today's HPC systems. The main parts of the computations are performed as level 3 general matrix multiply and add (GEMM) operations. We extend and apply the recursive blocking technique to solving periodic Sylvester-type matrix equations. Successive recursive splittings are performed on 3-dimensional arrays, where the third dimension represents the periodicity of a matrix equation.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:4:j_idt1327:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 6. Algorithm 953 Granat, Robert PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_5_j_idt1289",{id:"formSmash:items:resultList:5:j_idt1289",widgetVar:"widget_formSmash_items_resultList_5_j_idt1289",onLabel:"Granat, Robert ",offLabel:"Granat, Robert ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_5_j_idt1292",{id:"formSmash:items:resultList:5:j_idt1292",widgetVar:"widget_formSmash_items_resultList_5_j_idt1292",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Umeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, High Performance Computing Center North (HPC2N).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:5:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Kagstrom, BoUmeå University, Faculty of Science and Technology, High Performance Computing Center North (HPC2N). Umeå University, Faculty of Science and Technology, Department of Computing Science.Kressner, DanielShao, MeiyueUmeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, High Performance Computing Center North (HPC2N).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:5:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Algorithm 953: Parallel Library Software for the Multishift QR Algorithm with Aggressive Early Deflation2015In: ACM Transactions on Mathematical Software, ISSN 0098-3500, E-ISSN 1557-7295, Vol. 41, no 4, article id 29Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_5_j_idt1327_0_j_idt1328",{id:"formSmash:items:resultList:5:j_idt1327:0:j_idt1328",widgetVar:"widget_formSmash_items_resultList_5_j_idt1327_0_j_idt1328",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Library software implementing a parallel small-bulge multishift QR algorithm with Aggressive Early Deflation (AED) targeting distributed memory high-performance computing systems is presented. Starting from recent developments of the parallel multishift QR algorithm [Granat et al., SIAM J. Sci. Comput. 32(4), 2010], we describe a number of algorithmic and implementation improvements. These include communication avoiding algorithms via data redistribution and a refined strategy for balancing between multishift QR sweeps and AED. Guidelines concerning several important tunable algorithmic parameters are provided. As a result of these improvements, a computational bottleneck within AED has been removed in the parallel multishift QR algorithm. A performance model is established to explain the scalability behavior of the new parallel multishift QR algorithm. Numerous computational experiments confirm that our new implementation significantly outperforms previous parallel implementations of the QR algorithm.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:5:j_idt1327:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 7. Algorithm 904 Granat, Robert PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_6_j_idt1289",{id:"formSmash:items:resultList:6:j_idt1289",widgetVar:"widget_formSmash_items_resultList_6_j_idt1289",onLabel:"Granat, Robert ",offLabel:"Granat, Robert ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_6_j_idt1292",{id:"formSmash:items:resultList:6:j_idt1292",widgetVar:"widget_formSmash_items_resultList_6_j_idt1292",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Umeå University, Faculty of Science and Technology, Department of Computing Science.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:6:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Kågström, BoUmeå University, Faculty of Science and Technology, Department of Computing Science.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:6:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Algorithm 904: the SCASY library - parallel solvers for Sylvester-type matrix equations with applications in condition estimation, part II2010In: ACM Transactions on Mathematical Software, ISSN 0098-3500, E-ISSN 1557-7295, Vol. 37, no 3, article id 33Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_6_j_idt1327_0_j_idt1328",{id:"formSmash:items:resultList:6:j_idt1327:0:j_idt1328",widgetVar:"widget_formSmash_items_resultList_6_j_idt1327_0_j_idt1328",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We continue our presentation of parallel ScaLAPACK-style algorithms for solving Sylvester-type matrix equations. In Part II, we present SCASY (SCAlable SYlvester solvers), a state-of-the-art HPC software library for solving 44 sign and transpose variants of eight common standard and generalized Sylvester-type matrix equations.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:6:j_idt1327:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 8. Direct Eigenvalue Reordering in a Product of Matrices in Periodic Schur Form Granat, Robert PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_7_j_idt1289",{id:"formSmash:items:resultList:7:j_idt1289",widgetVar:"widget_formSmash_items_resultList_7_j_idt1289",onLabel:"Granat, Robert ",offLabel:"Granat, Robert ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_7_j_idt1292",{id:"formSmash:items:resultList:7:j_idt1292",widgetVar:"widget_formSmash_items_resultList_7_j_idt1292",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Umeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, HPC2N (High Performance Computing Centre North).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:7:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Kågström, BoUmeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, HPC2N (High Performance Computing Centre North).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:7:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Direct Eigenvalue Reordering in a Product of Matrices in Periodic Schur Form2006In: SIAM Journal on Matrix Analysis and Applications, ISSN 0895-4798, E-ISSN 1095-7162, Vol. 28, no 1, p. 285-300Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_7_j_idt1327_0_j_idt1328",{id:"formSmash:items:resultList:7:j_idt1327:0:j_idt1328",widgetVar:"widget_formSmash_items_resultList_7_j_idt1327_0_j_idt1328",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); A direct method for eigenvalue reordering in a product of a K-periodic matrix sequence in periodic or extended periodic real Schur form is presented and analyzed. Each reordering of two adjacent sequences of diagonal blocks is performed tentatively to guarantee backward stability and involves solving a K-periodic Sylvester equation (PSE) and constructing a K-periodic sequence of orthogonal transformation matrices. An error analysis of the direct reordering method is presented, and results from computational experiments confirm the stability and accuracy of the method for well-conditioned as well as ill-conditioned problems. These include matrix sequences with fixed and time-varying dimensions, and sequences of small and large periodicity.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:7:j_idt1327:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 9. Evaluating Parallel Algorithms for Solving Sylvester-Type Matrix Equations: Direct Transformation-Based versus Iterative Matrix-Sign-Function-Based Methods. Granat, Robert PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_8_j_idt1289",{id:"formSmash:items:resultList:8:j_idt1289",widgetVar:"widget_formSmash_items_resultList_8_j_idt1289",onLabel:"Granat, Robert ",offLabel:"Granat, Robert ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_8_j_idt1292",{id:"formSmash:items:resultList:8:j_idt1292",widgetVar:"widget_formSmash_items_resultList_8_j_idt1292",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:8:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Kågström, BoUmeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, HPC2N (High Performance Computing Centre North).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:8:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Evaluating Parallel Algorithms for Solving Sylvester-Type Matrix Equations: Direct Transformation-Based versus Iterative Matrix-Sign-Function-Based Methods.2006In: Applied Parallel Computing - State of the Art in Scientific Computing: 7th International Workshop, PARA 2004, Springer , 2006, p. 717-729Conference paper (Refereed)10. Parallel Algorithms and Condition Estimators for Standard and Generalized Triangular Sylvester-Type Matrix Equations Granat, Robert PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_9_j_idt1289",{id:"formSmash:items:resultList:9:j_idt1289",widgetVar:"widget_formSmash_items_resultList_9_j_idt1289",onLabel:"Granat, Robert ",offLabel:"Granat, Robert ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_9_j_idt1292",{id:"formSmash:items:resultList:9:j_idt1292",widgetVar:"widget_formSmash_items_resultList_9_j_idt1292",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:9:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Kågström, BoUmeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, HPC2N (High Performance Computing Centre North).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:9:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Parallel Algorithms and Condition Estimators for Standard and Generalized Triangular Sylvester-Type Matrix Equations2006In: Applied Parallel Computing - State of the Art in Scientific Computing: 7th International Workshop, PARA 2004, Springer , 2006, p. 127-136Conference paper (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_9_j_idt1327_0_j_idt1328",{id:"formSmash:items:resultList:9:j_idt1327:0:j_idt1328",widgetVar:"widget_formSmash_items_resultList_9_j_idt1327_0_j_idt1328",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We discuss parallel algorithms for solving eight common standard and generalized triangular Sylvester-type matrix equation. Our parallel algorithms are based on explicit blocking, 2D block-cyclic data distribution of the matrices and wavefront-like traversal of the right hand side matrices while solving small-sized matrix equations at different nodes and updating the rest of the right hand side using level 3 operations. We apply the triangular solvers in condition estimation, developing parallel sep(-1)-estimators. Some experimental results are presented.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:9:j_idt1327:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 11. Parallel Solvers for Sylvester-type Matrix Equations with Applications in Condition Estimation, Part I Granat, Robert PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_10_j_idt1289",{id:"formSmash:items:resultList:10:j_idt1289",widgetVar:"widget_formSmash_items_resultList_10_j_idt1289",onLabel:"Granat, Robert ",offLabel:"Granat, Robert ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_10_j_idt1292",{id:"formSmash:items:resultList:10:j_idt1292",widgetVar:"widget_formSmash_items_resultList_10_j_idt1292",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Umeå University, Faculty of Science and Technology, Department of Computing Science.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:10:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Kågström, BoUmeå University, Faculty of Science and Technology, Department of Computing Science.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:10:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Parallel Solvers for Sylvester-type Matrix Equations with Applications in Condition Estimation, Part I: Theory and Algorithms2010In: ACM Transactions on Mathematical Software, ISSN 0098-3500, E-ISSN 1557-7295, Vol. 37, no 3, p. 32:1-32:32Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_10_j_idt1327_0_j_idt1328",{id:"formSmash:items:resultList:10:j_idt1327:0:j_idt1328",widgetVar:"widget_formSmash_items_resultList_10_j_idt1327_0_j_idt1328",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); 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.PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:10:j_idt1327:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 12. A Parallel Schur Method for Solving Continuous-Time Algebraic Riccati Equations Granat, Robert PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_11_j_idt1289",{id:"formSmash:items:resultList:11:j_idt1289",widgetVar:"widget_formSmash_items_resultList_11_j_idt1289",onLabel:"Granat, Robert ",offLabel:"Granat, Robert ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_11_j_idt1292",{id:"formSmash:items:resultList:11:j_idt1292",widgetVar:"widget_formSmash_items_resultList_11_j_idt1292",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:11:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Kågström, BoUmeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, HPC2N (High Performance Computing Centre North).Kressner, DanielUmeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, HPC2N (High Performance Computing Centre North).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:11:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); A Parallel Schur Method for Solving Continuous-Time Algebraic Riccati Equations2008In: Conference Name: 2008 IEEE Conference on Computer-Aided Control System Design (CACSD) Conference Location: San Antonio, TX, 2008, p. 51-56Conference paper (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_11_j_idt1327_0_j_idt1328",{id:"formSmash:items:resultList:11:j_idt1327:0:j_idt1328",widgetVar:"widget_formSmash_items_resultList_11_j_idt1327_0_j_idt1328",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Numerical algorithms for solving the continuous-time algebraic Riccati matrix equation on a distributed memory parallel computer are considered. In particular, it is shown that the Schur method, based on computing the stable invariant subspace of a Hamiltonian matrix, can be parallelized in an efficient and scalable way. Our implementation employs the state-of-the-art library ScaLAPACK as well as recently developed parallel methods for reordering the eigenvalues in a real Schur form. Some experimental results are presented, confirming the scalability of our implementation and comparing it with an existing implementation of the matrix sign iteration from the PLiCOC library.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:11:j_idt1327:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 13. Computing Periodic Deflating Subspaces Associated with a Specified Set of Eigenvalues Granat, Robert PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_12_j_idt1289",{id:"formSmash:items:resultList:12:j_idt1289",widgetVar:"widget_formSmash_items_resultList_12_j_idt1289",onLabel:"Granat, Robert ",offLabel:"Granat, Robert ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_12_j_idt1292",{id:"formSmash:items:resultList:12:j_idt1292",widgetVar:"widget_formSmash_items_resultList_12_j_idt1292",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:12:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Kågström, BoUmeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, HPC2N (High Performance Computing Centre North).Kressner, DanielETH Zürich.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:12:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Computing Periodic Deflating Subspaces Associated with a Specified Set of Eigenvalues2007In: BIT Numerical Mathematics, ISSN 0006-3835, E-ISSN 1572-9125, Vol. 47, no 4, p. 763-791Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_12_j_idt1327_0_j_idt1328",{id:"formSmash:items:resultList:12:j_idt1327:0:j_idt1328",widgetVar:"widget_formSmash_items_resultList_12_j_idt1327_0_j_idt1328",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); 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.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:12:j_idt1327:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 14. Parallel Eigenvalue Reordering in Real Schur Forms Granat, Robert PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_13_j_idt1289",{id:"formSmash:items:resultList:13:j_idt1289",widgetVar:"widget_formSmash_items_resultList_13_j_idt1289",onLabel:"Granat, Robert ",offLabel:"Granat, Robert ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_13_j_idt1292",{id:"formSmash:items:resultList:13:j_idt1292",widgetVar:"widget_formSmash_items_resultList_13_j_idt1292",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Umeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, High Performance Computing Center North (HPC2N).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:13:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Kågström, BoUmeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, High Performance Computing Center North (HPC2N).Kressner, DanielETH, Zürich.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:13:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Parallel Eigenvalue Reordering in Real Schur Forms2009In: Concurrency and Computation, ISSN 1532-0626, E-ISSN 1532-0634, Vol. 21, no 9, p. 1225-1250Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_13_j_idt1327_0_j_idt1328",{id:"formSmash:items:resultList:13:j_idt1327:0:j_idt1328",widgetVar:"widget_formSmash_items_resultList_13_j_idt1327_0_j_idt1328",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); A parallel algorithm for reordering the eigenvalues in the real Schur form of a matrix is presented and discussed. Our novel approach adopts computational windows and delays multiple outside-window updates until each window has been completely reordered locally. By using multiple concurrent windows the parallel algorithm has a high level of concurrency, and most work is level 3 BLAS operations. The presented algorithm is also extended to the generalized real Schur form. Experimental results for ScaLAPACK-style Fortran 77 implementations on a Linux cluster confirm the efficiency and scalability of our algorithms in terms of more than 16 times of parallel speedup using 64 processors for large-scale problems. Even on a single processor our implementation is demonstrated to perform significantly better compared with the state-of-the-art serial implementation.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:13:j_idt1327:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 15. Reordering the Eigenvalues of a Periodic Matrix Pair with Applications in Control Granat, Robert PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_14_j_idt1289",{id:"formSmash:items:resultList:14:j_idt1289",widgetVar:"widget_formSmash_items_resultList_14_j_idt1289",onLabel:"Granat, Robert ",offLabel:"Granat, Robert ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_14_j_idt1292",{id:"formSmash:items:resultList:14:j_idt1292",widgetVar:"widget_formSmash_items_resultList_14_j_idt1292",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:14:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Kågström, BoUmeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, HPC2N (High Performance Computing Centre North).Kressner, DanielETH, Zürich.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:14:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Reordering the Eigenvalues of a Periodic Matrix Pair with Applications in Control2006In: 2006 IEEE Conferences on Computer Aided Control System Design (CACSD), 2006, p. 25-30Conference paper (Refereed)16. Parallel ScaLAPACK-Style Algorithms for Solving Continuous-Time Sylvester Matrix Equations Granat, Robert PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_15_j_idt1289",{id:"formSmash:items:resultList:15:j_idt1289",widgetVar:"widget_formSmash_items_resultList_15_j_idt1289",onLabel:"Granat, Robert ",offLabel:"Granat, Robert ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_15_j_idt1292",{id:"formSmash:items:resultList:15:j_idt1292",widgetVar:"widget_formSmash_items_resultList_15_j_idt1292",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:15:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Kågström, BoUmeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, HPC2N (High Performance Computing Centre North).Poromaa, PeterUmeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Science and Technology, HPC2N (High Performance Computing Centre North).PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:15:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Parallel ScaLAPACK-Style Algorithms for Solving Continuous-Time Sylvester Matrix Equations2003In: Euro-Par 2003 Parallel Processing: Conference Name: 9th International Euro-Par Conference Conference Location: Klagenfurt, Austria, Springer , 2003, p. 800-809Conference paper (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_15_j_idt1327_0_j_idt1328",{id:"formSmash:items:resultList:15:j_idt1327:0:j_idt1328",widgetVar:"widget_formSmash_items_resultList_15_j_idt1327_0_j_idt1328",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); An implementation of a parallel ScaLAPACK-style solver for the general Sylvester equation, op(A)X - Xop(B) = C, where op(A) denotes A or its transpose AT, is presented. The parallel algorithm is based on explicit blocking of the Bartels-Stewart method. An initial transformation of the coefficient matrices A and B to Schur form leads to a reduced triangular matrix equation. We use different matrix traversing strategies to handle the transposes in the problem to solve, leading to different new parallel wave-front algorithms. We also present a strategy to handle the problem when 2 x 2 diagonal blocks of the matrices in Schur form, corresponding to complex conjugate pairs of eigenvalues, are split between several blocks in the block partitioned matrices. Finally, the solution of the reduced matrix equation is transformed back to the originally coordinate system. The implementation acts in a ScaLAPACK environment using 2-dimensional block cyclic mapping of the matrices onto a rectangular grid of processes. Real performance results are presented which verify that our parallel algorithms are reliable and scalable.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:15:j_idt1327:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500});

CiteExportLink to result list
https://umu.diva-portal.org/smash/resultList.jsf?query=&language=en&searchType=SIMPLE&noOfRows=50&sortOrder=author_sort_asc&sortOrder2=title_sort_asc&onlyFullText=false&sf=all&aq=%5B%5B%7B%22personId%22%3A%22authority-person%3A64830%22%7D%5D%5D&aqe=%5B%5D&aq2=%5B%5B%5D%5D&af=%5B%5D $(function(){PrimeFaces.cw("InputTextarea","widget_formSmash_lower_j_idt1609_recordPermLink",{id:"formSmash:lower:j_idt1609:recordPermLink",widgetVar:"widget_formSmash_lower_j_idt1609_recordPermLink",autoResize:true});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt1609_j_idt1611",{id:"formSmash:lower:j_idt1609:j_idt1611",widgetVar:"widget_formSmash_lower_j_idt1609_j_idt1611",target:"formSmash:lower:j_idt1609:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Permanent link

Cite

Citation styleapa ieee modern-language-association-8th-edition vancouver Other style $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_lower_j_idt1627",{id:"formSmash:lower:j_idt1627",widgetVar:"widget_formSmash_lower_j_idt1627",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:lower:j_idt1627",e:"change",f:"formSmash",p:"formSmash:lower:j_idt1627",u:"formSmash:lower:otherStyle"},ext);}}});});

- apa
- ieee
- modern-language-association-8th-edition
- vancouver
- Other style

Languagede-DE en-GB en-US fi-FI nn-NO nn-NB sv-SE Other locale $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_lower_j_idt1638",{id:"formSmash:lower:j_idt1638",widgetVar:"widget_formSmash_lower_j_idt1638",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:lower:j_idt1638",e:"change",f:"formSmash",p:"formSmash:lower:j_idt1638",u:"formSmash:lower:otherLanguage"},ext);}}});});

- de-DE
- en-GB
- en-US
- fi-FI
- nn-NO
- nn-NB
- sv-SE
- Other locale

Output formathtml text asciidoc rtf $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_lower_j_idt1648",{id:"formSmash:lower:j_idt1648",widgetVar:"widget_formSmash_lower_j_idt1648"});});

- html
- text
- asciidoc
- rtf