default search action
Bo Kågström
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
- [j41]Andrii Dmytryshyn
, Stefan Johansson, Bo Kågström, Paul Van Dooren:
Geometry of Matrix Polynomial Spaces. Found. Comput. Math. 20(3): 423-450 (2020)
2010 – 2019
- 2018
- [j40]Björn Adlerborn, Lars Karlsson, Bo Kågström:
Distributed One-Stage Hessenberg-Triangular Reduction with Wavefront Scheduling. SIAM J. Sci. Comput. 40(2) (2018) - [c40]Mahmoud Eljammaly, Lars Karlsson, Bo Kågström:
An Auto-Tuning Framework for a NUMA-Aware Hessenberg Reduction Algorithm. ICPE Companion 2018: 5-8 - 2017
- [j39]Andrii Dmytryshyn
Canonical Structure Transitions of System Pencils. SIAM J. Matrix Anal. Appl. 38(4): 1249-1267 (2017) - [c39]Mahmoud Eljammaly, Lars Karlsson, Bo Kågström:
On the Tunability of a New Hessenberg Reduction Algorithm Using Parallel Cache Assignment. PPAM (1) 2017: 579-589 - 2015
- [j38]Andrii Dmytryshyn
Coupled Sylvester-type Matrix Equations and Block Diagonalization. SIAM J. Matrix Anal. Appl. 36(2): 580-593 (2015) - [j37]Robert A. Granat, Bo Kågström, Daniel Kressner, Meiyue Shao
Algorithm 953: Parallel Library Software for the Multishift QR Algorithm with Aggressive Early Deflation. ACM Trans. Math. Softw. 41(4): 29:1-29:23 (2015) - 2014
- [j36]Lars Karlsson, Bo Kågström, Eddie Wadbro
Fine-grained bulge-chasing kernels for strongly scalable parallel QR algorithms. Parallel Comput. 40(7): 271-288 (2014) - [j35]Andrii Dmytryshyn
Orbit Closure Hierarchies of Skew-symmetric Matrix Pencils. SIAM J. Matrix Anal. Appl. 35(4): 1429-1443 (2014) - [j34]Björn Adlerborn, Bo Kågström, Daniel Kressner:
A Parallel QZ Algorithm for Distributed Memory HPC Systems. SIAM J. Sci. Comput. 36(5) (2014) - 2013
- [c38]Lars Karlsson, Carl Christian Kjelgaard Mikkelsen, Bo Kågström:
Improving Perfect Parallelism. PPAM (1) 2013: 76-85 - 2012
- [j33]Fred G. Gustavson, Lars Karlsson, Bo Kågström:
Parallel and Cache-Efficient In-Place Matrix Storage Format Conversion. ACM Trans. Math. Softw. 38(3): 17:1-17:32 (2012) - [c37]Carl Christian Kjelgaard Mikkelsen, Bo Kågström:
Approximate Incomplete Cyclic Reduction for Systems Which Are Tridiagonal and Strictly Diagonally Dominant by Rows. PARA 2012: 250-264 - 2011
- [j32]Lars Karlsson, Bo Kågström:
Parallel two-stage reduction to Hessenberg form using dynamic scheduling on shared-memory architectures. Parallel Comput. 37(12): 771-782 (2011) - [c36]Carl Christian Kjelgaard Mikkelsen, Bo Kågström:
Incomplete Cyclic Reduction of Banded and Strictly Diagonally Dominant Linear Systems. PPAM (1) 2011: 80-91 - 2010
- [j31]Robert Granat, Bo Kågström, Daniel Kressner
A Novel Parallel QR Algorithm for Hybrid Distributed Memory HPC Systems. SIAM J. Sci. Comput. 32(4): 2345-2378 (2010) - [j30]Robert Granat, Bo Kågström:
Parallel Solvers for Sylvester-Type Matrix Equations with Applications in Condition Estimation, Part I: Theory and Algorithms. ACM Trans. Math. Softw. 37(3): 32:1-32:32 (2010) - [j29]Robert Granat, Bo Kågström:
Algorithm 904: The SCASY Library - Parallel Solvers for Sylvester-Type Matrix Equations with Applications in Condition Estimation, Part II. ACM Trans. Math. Softw. 37(3): 33:1-33:4 (2010) - [c35]Bo Kågström, Daniel Kressner
On Aggressive Early Deflation in Parallel Variants of the QR Algorithm. PARA (1) 2010: 1-10 - [c34]Lars Karlsson, Bo Kågström:
Efficient Reduction from Block Hessenberg Form to Hessenberg Form Using Shared Memory. PARA (2) 2010: 258-268 - [c33]Carl Christian Kjelgaard Mikkelsen, Bo Kågström:
Parallel Solution of Narrow Banded Diagonally Dominant Linear Systems. PARA (2) 2010: 280-290
2000 – 2009
- 2009
- [j28]Robert Granat, Bo Kågström, Daniel Kressner
Parallel eigenvalue reordering in real Schur forms. Concurr. Comput. Pract. Exp. 21(9): 1225-1250 (2009) - [j27]Erik Elmroth, Stefan Johansson, Bo Kågström:
Stratification of Controllability and Observability Pairs - Theory and Use in Applications. SIAM J. Matrix Anal. Appl. 31(2): 203-226 (2009) - [j26]Fred G. Gustavson, Lars Karlsson, Bo Kågström:
Distributed SBP Cholesky factorization algorithms with near-optimal scheduling. ACM Trans. Math. Softw. 36(2): 11:1-11:25 (2009) - 2008
- [c32]Robert Granat, Bo Kågström, Daniel Kressner
A parallel Schur method for solving continuous-time algebraic Riccati equations. CACSD 2008: 583-588 - [c31]Per Andersson, Robert Granat, Isak Jonsson, Bo Kågström:
Parallel Algorithms for Triangular Periodic Sylvester-Type Matrix Equations. Euro-Par 2008: 780-789 - 2007
- [c30]Stefan Johansson, Bo Kågström, Anton S. Shiriaev, András Varga:
Comparing one-shot and multi-shot methods for solving periodic Riccati differential equations. PSYCO 2007: 163-168 - [c29]Robert Granat, Bo Kågström, Daniel Kressner:
MATLAB tools for solving periodic eigenvalue problems. PSYCO 2007: 169-174 - [e2]Bo Kågström, Erik Elmroth, Jack J. Dongarra, Jerzy Wasniewski:
Applied Parallel Computing. State of the Art in Scientific Computing, 8th International Workshop, PARA 2006, Umeå, Sweden, June 18-21, 2006, Revised Selected Papers. Lecture Notes in Computer Science 4699, Springer 2007, ISBN 978-3-540-75754-2 [contents] - 2006
- [j25]Jeanette Tångrot, Lixiao Wang, Bo Kågström, Uwe H. Sauer:
FISH - family identification of sequence homologues using structure anchored hidden Markov models. Nucleic Acids Res. 34(Web-Server-Issue): 10-14 (2006) - [j24]Robert A. Granat, Bo Kågström:
Direct Eigenvalue Reordering in a Product of Matrices in Periodic Schur Form. SIAM J. Matrix Anal. Appl. 28(1): 285-300 (2006) - [j23]Bo Kågström, Daniel Kressner
Multishift Variants of the QZ Algorithm with Aggressive Early Deflation. SIAM J. Matrix Anal. Appl. 29(1): 199-227 (2006) - [c28]Björn Adlerborn, Bo Kågström, Daniel Kressner:
Parallel Variants of the Multishift QZ Algorithm with Advanced Deflation Techniques. PARA 2006: 117-126 - [c27]Robert Granat, Bo Kågström:
Parallel Algorithms and Condition Estimators for Standard and Generalized Triangular Sylvester-Type Matrix Equations. PARA 2006: 127-136 - [c26]Robert Granat, Isak Jonsson, Bo Kågström:
Recursive Blocked Algorithms for Solving Periodic Triangular Sylvester-Type Matrix Equations. PARA 2006: 531-539 - [c25]Fred G. Gustavson, Lars Karlsson, Bo Kågström:
Three Algorithms for Cholesky Factorization on Distributed Memory Using Packed Storage. PARA 2006: 550-559 - [c24]Jeanette Tångrot, Lixiao Wang, Bo Kågström, Uwe H. Sauer:
Design, Construction and Use of the FISH Server. PARA 2006: 647-657 - 2004
- [j22]Niklas Edmundsson, Erik Elmroth, Bo Kågström, Markus Mårtensson, Mats Nylén, Åke Sandgren, Mattias Wadenstein:
Design and evaluation of a TOP100 Linux Super Cluster system. Concurr. Pract. Exp. 16(8): 735-750 (2004) - [j21]Erik Elmroth, Fred G. Gustavson, Isak Jonsson, Bo Kågström:
Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Library Software. SIAM Rev. 46(1): 3-45 (2004) - [c23]Robert Granat, Isak Jonsson, Bo Kågström:
Combining Explicit, Recursive Blocking for Solving Triangular Sylvester-Type Matrix Equations on Distributed Memory Platforms. Euro-Par 2004: 742-750 - [c22]Bo Kågström:
Management of Deep Memory Hierarchies - Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Computations. PARA 2004: 21-32 - [c21]Robert Granat, Bo Kågström:
Evaluating Parallel Algorithms for Solving Sylvester-Type Matrix Equations: Direct Transformation-Based Versus Iterative Matrix-Sign-Function-Based Methods. PARA 2004: 719-729 - 2003
- [c20]Robert Granat, Bo Kågström, Peter Poromaa:
Parallel ScaLAPACK-Style Algorithms for Solving Continuous-Time Sylvester Matrix Equations. Euro-Par 2003: 800-809 - [c19]Isak Jonsson, Bo Kågström:
RECSY - A High Performance Library for Sylvester-Type Matrix Equations. Euro-Par 2003: 810-819 - 2002
- [j20]Isak Jonsson, Bo Kågström:
Recursive blocked algorithms for solving triangular systems - Part I: one-sided and coupled Sylvester-type matrix equations. ACM Trans. Math. Softw. 28(4): 392-415 (2002) - [j19]Isak Jonsson, Bo Kågström:
Recursive blocked algorithms for solving triangular systems - Part II: two-sided and generalized Sylvester and Lyapunov matrix equations. ACM Trans. Math. Softw. 28(4): 416-435 (2002) - [c18]Isak Jonsson, Bo Kågström:
Parallel Two-Sided Sylvester-Type Matrix Equation Solvers for SMP Systems Using Recursive Blocking. PARA 2002: 297-306 - [c17]Björn Adlerborn, Krister Dackland, Bo Kågström:
Parallel and Blocked Algorithms for Reduction of a Regular Matrix Pair to Hessenberg-Triangular and Generalized Schur Forms. PARA 2002: 319-328 - 2001
- [j18]Erik Elmroth, Pedher Johansson, Bo Kågström:
Computation and presentation of graphs displaying closure hierarchies of Jordan and Kronecker structures. Numer. Linear Algebra Appl. 8(6-7): 381-399 (2001) - 2000
- [j17]Bo Kågström, Petter Wiberg:
Extracting partial canonical structure for large scale eigenvalue problems. Numer. Algorithms 24(3): 195-237 (2000) - [c16]Isak Jonsson, Bo Kågström:
Parallel Triangular Sylvester-Type Matrix Equation Solvers for SMP Systems Using Recursive Blocking. PARA 2000: 64-73 - [c15]Björn Adlerborn, Krister Dackland, Bo Kågström:
Parallel Two-Stage Reduction of a Regular Matrix Pair to Hessenberg-Triangular Form. PARA 2000: 92-102 - [p1]Gerard L. G. Sleijpen, Henk A. van der Vorst, Axel Ruhe, Zhaojun Bai, T. Ericsson, T. Kowalski, Bo Kågström, Ruipeng Li:
Generalized Non-Hermitian Eigenvalue Problems. Templates for the Solution of Algebraic Eigenvalue Problems 2000: 233-279
1990 – 1999
- 1999
- [j16]Alan Edelman, Erik Elmroth, Bo Kågström:
A Geometric Approach to Perturbation Theory of Matrices and Matrix Pencils. Part II: A Stratification-Enhanced Staircase Algorithm. SIAM J. Matrix Anal. Appl. 20(3): 667-699 (1999) - [j15]Krister Dackland, Bo Kågström:
Blocked algorithms and software for reduction of a regular matrix pair to generalized Schur form. ACM Trans. Math. Softw. 25(4): 425-454 (1999) - [c14]Krister Dackland, Bo Kågström:
Blocked Algorithms for Reduction of a Regular Matrix Pair to Generalized Schur Form. PP 1999 - [c13]Fred G. Gustavson, Isak Jonsson, Bo Kågström, Per Ling:
Towards Peak Performance on Hierarchical SMP Memory Architectures - New Recursive Blocked Data Formats and BLAS. PP 1999 - 1998
- [j14]Bo Kågström, Per Ling, Charles Van Loan:
GEMM-based level 3 BLAS: high-performance model implementations and performance evaluation benchmark. ACM Trans. Math. Softw. 24(3): 268-302 (1998) - [j13]Bo Kågström, Charles Van Loan:
Algorithm 784: GEMM-based level 3 BLAS: portability and optimization issues. ACM Trans. Math. Softw. 24(3): 303-316 (1998) - [c12]Krister Dackland, Bo Kågström:
A ScaLAPACK-Style Algorithm for Reducing a Regular Matrix Pair to Block Hessenberg-Triangular Form. PARA 1998: 95-103 - [c11]Fred G. Gustavson, André Henriksson, Isak Jonsson, Bo Kågström, Per Ling:
Recursive Blocked Data Formats and BLAS's for Dense Linear Algebra Algorithms. PARA 1998: 195-206 - [c10]Fred G. Gustavson, André Henriksson, Isak Jonsson, Bo Kågström, Per Ling:
Superscalar GEMM-based Level 3 BLAS - The On-going Evolution of a Portable and High-Performance Library. PARA 1998: 207-215 - [e1]Bo Kågström, Jack J. Dongarra, Erik Elmroth, Jerzy Wasniewski:
Applied Parallel Computing, Large Scale Scientific and Industrial Problems, 4th International Workshop, PARA '98, Umeå, Sweden, June 14-17, 1998, Proceedings. Lecture Notes in Computer Science 1541, Springer 1998, ISBN 3-540-65414-3 [contents] - 1997
- [j12]Alan Edelman, Erik Elmroth, Bo Kågström:
A Geometric Approach to Perturbation Theory of Matrices and Matrix Pencils. Part I: Versal Deformations. SIAM J. Matrix Anal. Appl. 18(3): 653-692 (1997) - 1996
- [j11]Bo Kågström, Peter Poromaa:
Computing eigenspaces with specified eigenvalues of a regular matrix pair (A, B) and condition estimation: theory, algorithms and software. Numer. Algorithms 12(2): 369-407 (1996) - [j10]Erik Elmroth, Bo Kågström:
The Set of 2-by-3 Matrix Pencils - Kronecker Structures and Their Transitions under Perturbations. SIAM J. Matrix Anal. Appl. 17(1): 1-34 (1996) - [j9]Bo Kågström, Peter Poromaa:
LAPACK-Style Algorithms and Software for Solving the Generalized Sylvester Equation and Estimating the Separation Between Regular Matrix Pairs. ACM Trans. Math. Softw. 22(1): 78-103 (1996) - [c9]Krister Dackland, Bo Kågström:
A Hierarchical Approach for Performance Analysis of ScaLAPACK-Based Routines Using the Distributed Linear Algebra Machine. PARA 1996: 186-195 - 1995
- [c8]Krister Dackland, Bo Kågström:
Reduction of a Regular Matrix Pair (A, B) to Block Hessenberg Triangular Form. PARA 1995: 125-133 - [c7]Bo Kågström, Mikael Rännar:
Distributed General Matrix Multiply and Add for a 2D Mesh Processor Network. PARA 1995: 333-344 - 1994
- [j8]Bo Kågström:
A Perturbation Analysis of the Generalized Sylvester Equation $( AR - LB,DR - LE ) = ( C,F )$. SIAM J. Matrix Anal. Appl. 15(4): 1045-1060 (1994) - 1993
- [j7]James Demmel, Bo Kågström:
The generalized Schur decomposition of an arbitrary pencil A-λB - robust software with error bounds and applications. Part I: theory and algorithms. ACM Trans. Math. Softw. 19(2): 160-174 (1993) - [j6]James Demmel, Bo Kågström:
The generalized Schur decomposition of an arbitrary pencil A-λB - robust software with error bounds and applications. Part II: software and applications. ACM Trans. Math. Softw. 19(2): 175-201 (1993) - [c6]Krister Dackland, Erik Elmroth, Bo Kågström:
A Ring-Oriented Approach for Block Matrix Factorizations on Shared and Distributed Memory Architectures. PPSC 1993: 330-338 - [c5]Bo Kågström, Per Ling, Charles Van Loan:
Portable High Performance GEMM-Based Level 3 BLAS. PPSC 1993: 339-346 - [c4]Peter Drakenberg, Peter Jacobson, Bo Kågström:
A CONLAB Compiler for a Distributed Memory Multicomputer. PPSC 1993: 814-821 - 1992
- [j5]Bo Kågström, Peter Poromaa:
Distributed and Shared Memory Block Algorithms for the Triangular Sylvester Equation with øperatornamesep - 1 Estimators. SIAM J. Matrix Anal. Appl. 13(1): 90-101 (1992) - [j4]Bo Kågström:
Scientific Programming Techniques and Experiences. Sci. Program. 1(1): 8 (1992) - [j3]Peter Jacobson, Bo Kågström, Mikael Rännar:
Algorithm Development for Distributed Memory Multicomputers Using CONLAB. Sci. Program. 1(2): 185-203 (1992) - 1991
- [c3]Krister Dackland, Erik Elmroth, Bo Kågström, Charles Van Loan:
Design and Evaluation of Parallel Block Algorithms: LU Factorization on an IBM 3090 VF/600J. PP 1991: 3-10
1980 – 1989
- 1989
- [c2]Bo Kågström, Peter Poromaa:
Distributed Block Algorithms for the Triangular Sylvester Equation with Condition Estimator. PP 1989: 103-119 - [c1]Jerry Eriksson, Peter Jacobson, Bo Kågström, Erik Lindström:
The CONLAB Environment: Algorithm Design for and Simulation of MIMD Architectures. PP 1989: 406-412 - 1980
- [j2]Bo Kågström, Axel Ruhe:
An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix. ACM Trans. Math. Softw. 6(3): 398-419 (1980) - [j1]Bo Kågström, Axel Ruhe:
Algorithm 560: JNF, An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix [F2]. ACM Trans. Math. Softw. 6(3): 437-443 (1980)
Coauthor Index
Robert A. Granat
aka: Robert Granat
aka: Robert Granat
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-04 22:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: