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
322 1998 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
265 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
265 1993 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
259 2004 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
181 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
172 * 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
172 * 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
172 * 1980 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
164 2002 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
160 1993 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
149 1989 Computing stable eigendecompositions of matrix pencils JW Demmel, B Kågström
Linear Algebra and its Applications 88, 139-186, 1987
140 1987 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
126 1999 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
122 2002 Distributed and Shared Memory Block Algorithms for the Triangular Sylvester Equation with B Kågström, P Poromaa
SIAM journal on matrix analysis and applications 13 (1), 90-101, 1992
119 * 1992 Recursive blocked data formats and BLAS’s for dense linear algebra algorithms F Gustavson, A Henriksson, I Jonsson, B Kågström, P Ling
Applied Parallel Computing Large Scale Scientific and Industrial Problems …, 1998
113 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, 369-407, 1996
100 1996 Bounds and perturbation bounds for the matrix exponential B Kågström
BIT Numerical Mathematics 17, 39-57, 1977
99 1977 A Perturbation Analysis of the Generalized Sylvester Equation (AR-LB,DR-LE)=(C,F) B Kågström
SIAM Journal on Matrix analysis and applications 15 (4), 1045-1060, 1994
78 1994 Parallel and cache-efficient in-place matrix storage format conversion F Gustavson, L Karlsson, B Kågström
ACM Transactions on Mathematical Software (TOMS) 38 (3), 1-32, 2012
77 2012 