Bo Kågström
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Bo Kågström has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Daniel Kressner
Institute of Mathematics, EPF Lausanne, 1015 Lausanne, Switzerland
4 shared publications - Andrii Dmytryshyn
Department of Mathematical Sciences Chalmers University of Technology and University of Gothenburg Gothenburg Sweden
3 shared publications - Isak Jonsson
Umeå University
3 shared publications - Robert Granat
Umeå University
3 shared publications - Stefan Johansson
Umeå University
3 shared publications - André Henriksson
Umeå University
2 shared publications
Latest Publications
- Open Access
- 21 June 2019
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 20 (3) , 423-450
Geometry of Matrix Polynomial Spaces
- 21 June 2019
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 20 (3) , 423-450
Open AccessGeometry of Matrix Polynomial Spaces
- Open Access
Change of the congruence canonical form of 2-by-2 and 3-by-3 matrices under perturbations and bundles of matrices under congruence
We construct the Hasse diagrams $G_2$ and $G_3$ for the closure ordering on the sets of congruence classes of $2\times 2$ and $3\times 3$ complex matrices. In other words, we construct two directed graphs whose vertices are $2\times 2$ or, respectively, $3\times 3$ canonical matrices under congruence and there is a directed path from $A$ to $B$ if and only if $A$ can be transformed by an arbitrarily small perturbation to a matrix that is congruent to $B$. A bundle of matrices under congruence is defined as a set of square matrices $A$ for which the pencils $A+\lambda A^T$ belong to the same bundle under strict equivalence. In support of this definition, we show that all matrices in a congruence bundle of $2\times 2$ or $3\times 3$ matrices have the same properties with respect to perturbations. We construct the Hasse diagrams $G_2^{\rm B}$ and $G_3^{\rm B}$ for the closure ordering on the sets of congruence bundles of $2\times 2$ and, respectively, $3\times 3$ matrices. We find the isometry groups of $2\times 2$ and $3\times 3$ congruence canonical matrices.Open AccessChange of the congruence canonical form of 2-by-2 and 3-by-3 matrices under perturbations and bundles of matrices under congruence
We construct the Hasse diagrams $G_2$ and $G_3$ for the closure ordering on the sets of congruence classes of $2\times 2$ and $3\times 3$ complex matrices. In other words, we construct two directed graphs whose vertices are $2\times 2$ or, respectively, $3\times 3$ canonical matrices under congruence and there is a directed path from $A$ to $B$ if and only if $A$ can be transformed by an arbitrarily small perturbation to a matrix that is congruent to $B$. A bundle of matrices under congruence is defined as a set of square matrices $A$ for which the pencils $A+\lambda A^T$ belong to the same bundle under strict equivalence. In support of this definition, we show that all matrices in a congruence bundle of $2\times 2$ or $3\times 3$ matrices have the same properties with respect to perturbations. We construct the Hasse diagrams $G_2^{\rm B}$ and $G_3^{\rm B}$ for the closure ordering on the sets of congruence bundles of $2\times 2$ and, respectively, $3\times 3$ matrices. We find the isometry groups of $2\times 2$ and $3\times 3$ congruence canonical matrices. - Open Access
- 15 August 2013
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 439 (4) , 1062-1090
Stratification of full rank polynomial matrices
- 15 August 2013
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 439 (4) , 1062-1090
Open AccessStratification of full rank polynomial matrices
- 1 April 2013
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 438 (8) , 3375-3396
Skew-symmetric matrix pencils: Codimension counts and the solution of a pair of matrix equations
- 1 April 2013
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 438 (8) , 3375-3396
Skew-symmetric matrix pencils: Codimension counts and the solution of a pair of matrix equations
- 1 December 2011
- Published by Elsevier in Parallel Computing
- Vol. 37 (12) , 771-782
Parallel two-stage reduction to Hessenberg form using dynamic scheduling on shared-memory architectures
- 1 December 2011
- Published by Elsevier in Parallel Computing
- Vol. 37 (12) , 771-782
Parallel two-stage reduction to Hessenberg form using dynamic scheduling on shared-memory architectures
- 23 February 2010
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 50 (2) , 301-329
A numerical evaluation of solvers for the periodic Riccati differential equation
- 23 February 2010
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 50 (2) , 301-329
A numerical evaluation of solvers for the periodic Riccati differential equation
- 11 February 2009
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 21 (9) , 1225-1250
Parallel eigenvalue reordering in real Schur forms
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. Copyright © 2009 John Wiley & Sons, Ltd.
- 11 February 2009
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 21 (9) , 1225-1250
Parallel eigenvalue reordering in real Schur forms
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. Copyright © 2009 John Wiley & Sons, Ltd.
- 15 July 2008
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 48 (3) , 563-584
Blocked algorithms for the reduction to Hessenberg-triangular form revisited
- 15 July 2008
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 48 (3) , 563-584
Blocked algorithms for the reduction to Hessenberg-triangular form revisited
- 11 September 2007
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 47 (4) , 763-791
Computing periodic deflating subspaces associated with a specified set of eigenvalues
- 11 September 2007
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 47 (4) , 763-791
Computing periodic deflating subspaces associated with a specified set of eigenvalues