"False"
Umeå University
printicon
Main menu hidden.
Staff photo Carl C Kjelgaard Mikkelsen

Carl C Kjelgaard Mikkelsen

Please contact me only using my email address at the Department of Computing Science: spock@cs.umu.se

Contact

E-mail
carl.c.kjelgaard.mikkelsen@umu.se
Phone
+46 90 786 57 59

Works at

Affiliation
Research fellow at Department of Computing Science
Location
MIT-huset, Umeå universitet, MIT.C.438 Umeå universitet, 901 87 Umeå

I am researcher in the field of numerical analysis and high performance parallel computing. I tend to specialize in the worst case analysis of algorithms and the development of algorithms which cannot fail. I am a co-author of the StarNEig library for solving dense nonsymmetric standard and generalized eigenvalue problems in parallel.

Task‐based, GPU‐accelerated and robust library for solving dense nonsymmetric eigenvalue problems
Concurrency and Computation, John Wiley & Sons 2021, Vol. 33, (11)
Myllykoski, Mirko; Kjelgaard Mikkelsen, Carl Christian
Parallel Robust Computation of Generalized Eigenvectors of Matrix Pencils
Parallel Processing and Applied Mathematics: Revised Selected Papers, Part I, Springer 2020 : 58-69
Kjelgaard Mikkelsen, Carl Christian; Myllykoski, Mirko
Introduction to StarNEig: A Task-based Library for Solving Nonsymmetric Eigenvalue Problems
Parallel Processing and Applied Mathematics: Revised Selected Papers, Part I, Springer 2020 : 70-81
Myllykoski, Mirko; Kjelgaard Mikkelsen, Carl Christian
Robust Task-Parallel Solution of the Triangular Sylvester Equation
Parallel Processing and Applied Mathematics: 13th International Conference, PPAM 2019, Bialystok, Poland, September 8–11, 2019, Revised Selected Papers, Part I, Springer 2020 : 82-92
Schwarz, Angelika Beatrix; Kjelgaard Mikkelsen, Carl Christian
Robust Parallel Eigenvector Computation for the Non-Symmetric Eigenvalue Problem
Report / UMINF, 20.02
Schwarz, Angelika Beatrix; Kjelgaard Mikkelsen, Carl Christian; Karlsson, Lars
Robust parallel eigenvector computation for the non-symmetric eigenvalue problem
Parallel Computing, Elsevier 2020, Vol. 100
Schwarz, Angelika Beatrix; Kjelgaard Mikkelsen, Carl Christian; Karlsson, Lars
Parallel robust solution of triangular linear systems
Concurrency and Computation, John Wiley & Sons 2019, Vol. 31, (19)
Kjelgaard Mikkelsen, Carl Christian; Schwarz, Angelika Beatrix; Karlsson, Lars
D7.8 Release of the NLAFET library
NLAFET Consortium; Umeå University 2019
Kågström, Bo; Myllykoski, Mirko; Karlsson, Lars; et al.
D2.7 Eigenvalue solvers for nonsymmetric problems
NLAFET Consortium; Umeå University 2019
Myllykoski, Mirko; Kjelgaard Mikkelsen, Carl Christian; Schwarz, Angelika Beatrix; et al.
Blocked Algorithms for Robust Solution of Triangular Linear Systems
Parallel Processing and Applied Mathematics: 12th International Conference, PPAM 2017, Lublin, Poland, September 10-13, 2017, Revised Selected Papers, Part I, Springer 2018 : 68-78
Kjelgaard Mikkelsen, Carl Christian; Karlsson, Lars
Towards Highly Parallel and Compute-Bound Computation of Eigenvectors of Matrices in Schur Form
Report / UMINF, 17.10
Adlerborn, Björn; Kjelgaard Mikkelsen, Carl Christian; Karlsson, Lars; et al.
Negative stride in the column-major format makes sense and has useful applications
Report / UMINF, 17.17
Karlsson, Lars; Kjelgaard Mikkelsen, Carl Christian
Robust Solution of Triangular Linear Systems
Report / UMINF, 17.09
Kjelgaard Mikkelsen, Carl Christian; Karlsson, Lars
D2.5 Eigenvalue problem solvers
NLAFET 2017
Kjelgaard Mikkelsen, Carl Christian; Myllykoski, Mirko; Adlerborn, Björn; et al.
Task-Based Parallel Algorithms for Eigenvalue Reordering of Matrices in Real Schur Forms
Report / UMINF, 17.11
Myllykoski, Mirko; Kjelgaard Mikkelsen, Carl Christian; Karlsson, Lars; et al.
Accelerating Sparse Arithmetic in the Context of Newton's Method for Small Molecules with Bond Constraints
Parallel Processing and Applied Mathematics, PPAM 2015, Part I, Cham: Springer International Publishing Switzerland 2016 : 160-171
Kjelgaard Mikkelsen, Carl Christian; Alastruey-Benede, Jesus; Ibanez-Marin, Pablo; et al.
Improving Perfect Parallelism
Parallel Processing and Applied Mathematics: 10th International Conference, PPAM 2013, Warsaw, Poland, September 8-11, 2013, Revised Selected Papers, Part I, Springer Berlin/Heidelberg 2014 : 76-85
Karlsson, Lars; Kjelgaard Mikkelsen, Carl Christian; Kågström, Bo
Approximate incomplete cyclic reduction for systems which are tridiagonal and strictly diagonally dominant by rows
Applied Parallel and Scientific Computing: 11th International Conference, PARA 2012, Helsinki, Finland, June 10-13, 2012, Revised Selected Papers, Springer Berlin/Heidelberg 2013 : 250-264
Kjelgaard Mikkelsen, Carl Christian; Kågström, Bo
The explicit Spike algorithm: Iterative solution of the reduced system
High-performance scientific computing: algorithms and applications, London: Springer 2012 : 147-156
Kjelgaard Mikkelsen, Carl Christian
Parallel solution of narrow banded diagonally dominant linear systems
Applied Parallel and Scientific Computing, Pt II, Springer Berlin/Heidelberg 2012 : 280-290
Kjelgaard Mikkelsen, Carl Christian; Kågström, Bo
Incomplete cyclic reduction of banded and strictly diagonally dominant linear systems
PARALLEL PROCESSING AND APPLIED MATHEMATICS, PT I, Springer 2012 : 80-91
Kjelgaard Mikkelsen, Carl Christian; Kågström, Bo
Retracing the residual curve of a Lyapunov equation solver
BIT Numerical Mathematics, Springer 2011, Vol. 51, (4) : 959-975
Kjelgaard Mikkelsen, Carl Christian
Any positive residual history is possible for the EKSM for Lyapunov matrix equations
UMINF, 10.04
Kjelgaard Mikkelsen, Carl Christian
Any positive residual history is possible for the Arnoldi method for Lyapunov matrix equations
Report / UMINF, 10.03
Kjelgaard Mikkelsen, Carl Christian
Well-conditioned eigenvalue problems that overflow
Kjelgaard Mikkelsen, Carl Christian
View publications in DiVA

I teach numerical analysis and scientific computing . My long term objective is to teach my students how analyse and design algorithms for solving complicated problems using modern computers. My focus is on the profound difference between the exact arithmetic used by humans and the finite precision arithmetic used by computers.