The multivariate calibration problem in chemistry solved by the PLS method S Wold, H Martens, H Wold Matrix pencils, 286-293, 1983 | 1117 | 1983 |

GEMM-based level 3 BLAS: High-performance model implementations and performance evaluation benchmark B Kågström, P Ling, C Van Loan ACM Transactions on Mathematical Software (TOMS) 24 (3), 268-302, 1998 | 273 | 1998 |

Recursive blocked algorithms and hybrid data structures for dense matrix library software E Elmroth, F Gustavson, I Jonsson, B Kågström SIAM review 46 (1), 3-45, 2004 | 243 | 2004 |

The generalized Schur decomposition of an arbitrary pencil A–&lgr; B—robust software with error bounds and applications. Part I: theory and algorithms J Demmel, B Kågström ACM Transactions on Mathematical Software (TOMS) 19 (2), 160-174, 1993 | 243 | 1993 |

The generalized Schur decomposition of an arbitrary pencil A–&lgr; B—robust software with error bounds and applications. Part I: theory and algorithms J Demmel, B Kågström ACM Transactions on Mathematical Software (TOMS) 19 (2), 160-174, 1993 | 243 | 1993 |

A geometric approach to perturbation theory of matrices and matrix pencils. Part I: Versal deformations A Edelman, E Elmroth, B Kågström SIAM Journal on Matrix Analysis and Applications 18 (3), 653-692, 1997 | 172 | 1997 |

An algorithm for numerical computation of the Jordan normal form of a complex matrix B Kågström, A Ruhe ACM Transactions on Mathematical Software (TOMS) 6 (3), 398-419, 1980 | 156* | 1980 |

An algorithm for numerical computation of the Jordan normal form of a complex matrix B Kågström, A Ruhe ACM Transactions on Mathematical Software (TOMS) 6 (3), 398-419, 1980 | 156* | 1980 |

An algorithm for numerical computation of the Jordan normal form of a complex matrix B Kågström, A Ruhe ACM Transactions on Mathematical Software (TOMS) 6 (3), 398-419, 1980 | 156* | 1980 |

The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II: software and applications J Demmel, B Kågström ACM Transactions on Mathematical Software (TOMS) 19 (2), 175-201, 1993 | 149 | 1993 |

Recursive blocked algorithms for solving triangular systems—Part I: One-sided and coupled Sylvester-type matrix equations I Jonsson, B Kågström ACM Transactions on Mathematical Software (TOMS) 28 (4), 392-415, 2002 | 146 | 2002 |

The condition number of equivalence transformations that block diagonalize matrix pencils J Demmel SIAM Journal on Numerical Analysis 20 (3), 599-610, 1983 | 145* | 1983 |

Generalized Schur methods with condition estimators for solving the generalized Sylvester equation B Kagstrom, L Westin IEEE Transactions on Automatic Control 34 (7), 745-751, 1989 | 136 | 1989 |

Computing stable eigendecompositions of matrix pencils JW Demmel, B Kågström Linear Algebra and its Applications 88, 139-186, 1987 | 130 | 1987 |

Distributed and Shared Memory Block Algorithms for the Triangular Sylvester Equation with Estimators B Kågström, P Poromaa SIAM journal on matrix analysis and applications 13 (1), 90-101, 1992 | 111* | 1992 |

Recursive blocked algorithms for solving triangular systems—Part II: Two-sided and generalized Sylvester and Lyapunov matrix equations I Jonsson, B Kågström ACM Transactions on Mathematical Software (TOMS) 28 (4), 416-435, 2002 | 108 | 2002 |

A geometric approach to perturbation theory of matrices and matrix pencils. Part II: A stratification-enhanced staircase algorithm A Edelman, E Elmroth, B Kågström SIAM Journal on Matrix Analysis and Applications 20 (3), 667-699, 1999 | 107 | 1999 |

Recursive blocked data formats and BLAS’s for dense linear algebra algorithms F Gustavson, A Henriksson, I Jonsson, B Kågström, P Ling International Workshop on Applied Parallel Computing, 195-206, 1998 | 102 | 1998 |

Computing eigenspaces with specified eigenvalues of a regular matrix pair (A, B) and condition estimation: theory, algorithms and software B Kågström, P Poromaa Numerical Algorithms 12 (2), 369-407, 1996 | 91 | 1996 |

Bounds and perturbation bounds for the matrix exponential B Kågström BIT Numerical Mathematics 17 (1), 39-57, 1977 | 83 | 1977 |