Fredrik Johansson's website
Contact: fredrik.johansson@gmail.com
I'm interested in arbitraryprecision arithmetic, polynomial arithmetic, and computation of special functions. I'm the main author of mpmath and Arb, and coauthor of FLINT.
Starting in September 2014, I'm a postdoc at Inria BordeauxSudOuest and Institut de MathÃ©matiques de Bordeaux, working in the LFANT projectteam headed by Andreas Enge and Karim Belabas.
From 2010 to 2014, I did my PhD in symbolic computation at RISC, Linz, where Manuel Kauers was my advisor. I have an MSc in engineering physics from Chalmers University of Technology, Gothenburg. I was born in Sweden.
Updates
Publications

A fast algorithm for reversion of power series
Mathematics of Computation, vol ?, 2014?, pp. ?, DOI: 10.1090/S002557182014028573

A bound for the error term in the BrentMcMillan algorithm (with Richard P. Brent)
to appear in Mathematics of Computation

Fast and rigorous computation of special functions to high precision
PhD thesis, RISC, Johannes Kepler University, Linz, 2014

Evaluating parametric holonomic sequences using rectangular splitting
ISSAC 2014 pp. 256263, DOI: 10.1145/2608628.2608629

Using functional equations to enumerate 1324avoiding permutations (with Brian Nakamura)
Advances in Applied Mathematics, vol 56, 2014, pp. 2034, DOI: 10.1016/j.aam.2014.01.006

Rigorous highprecision computation of the Hurwitz zeta function and its derivatives
to appear in Numerical Algorithms, DOI: 10.1007/s1107501498931

Ore polynomials in Sage (with Manuel Kauers and Maximilian Jaroschek)
to appear in Computer Algebra and Polynomials, Springer Lecture Notes in Computer Science

Arb: a C library for ball arithmetic
ACM Communications in Computer Algebra, vol 47, issue 4, December 2013, pp. 166169, DOI: 10.1145/2576802.2576828

Finding hyperexponential solutions of linear ODEs by numerical evaluation (with Manuel Kauers and Marc Mezzarobba)
ISSAC 2013, pp. 211218, DOI: 10.1145/2465506.2465513

Efficient implementation of the HardyRamanujanRademacher formula
LMS Journal of Computation and Mathematics, vol 15, 2012, pp. 341359, DOI: 10.1112/S1461157012001088
Mathematical software
My most wellknown project is probably mpmath, a Python library for arbitraryprecision floatingpoint arithmetic with support for complex numbers, special functions, numerical integration, linear algebra, etc. Notably, the selection of special functions may be the most extensive in any currently available open source project, comparable to Mathematica and Maple (see DLMF). The mpmath library has been cited in numerous publications. I started mpmath in 2007 and have written the majority of the code (various other people have made significant contributions).
I'm the author of Arb, a C library for asymptotically fast numerical computation with rigorous error bounds, using the concept of ball arithmetic. Arb supports complex numbers, polynomials, power series, matrices, and some special functions. I started developing Arb in 2012.
I'm a coauthor (since 2010) of FLINT, a C library for computational number theory with emphasis on asymptotically fast polynomial arithmetic. My work includes power series functions, exact linear algebra, numbertheoretic special functions, and general optimizations.
In 2013, I helped develop ore_algebra, a Sage package for holonomic functions, together with Manuel Kauers and Maximilian Jaroschek. I've contributed to the Sage project since 2009, mainly by writing wrapper code for mpmath and FLINT. I attended Sage Days 15, 23, 24, 35. I also contributed extensively to the purePython computer algebra system SymPy from around 2007 to 2008, and designed SymPy's logo, but I'm no longer actively involved in that project.
Talks
 July 2014: Evaluating parametric holonomic sequences using rectangular splitting, ISSAC 2014, Kobe University, Japan
 May 2014: Making change for 10^{20}, seminar, TU Kaiserslautern
 March 2014: Making change for 10^{20}, Algorithmic Combinatorics Seminar, RISC, Hagenberg
 October 2013: Progress on algorithms for highprecision evaluation of special functions, Algorithmic Combinatorics Seminar, RISC, Hagenberg
 July 2013: Efficient implementation of the HardyRamanujanRademacher formula, 2013 SIAM Annual Meeting, San Diego, CA
 June 2013: Arb: a C library for ball arithmetic, ISSAC 2013, Boston, MA [Received the ISSAC 2013 Distinguished Software Presentation Award]
 June 2013: Finding Hyperexponential Solutions of Linear ODEs by Numerical Evaluation, ISSAC 2013, Boston, MA
 March 2013: Fast, rigorous, arbitrary precision numerics with ball arithmetic, Algorithmic Combinatorics Seminar, RISC, Hagenberg
 November 2012: Algorithms for hyperexponential solutions of differential equations, Algorithmic Combinatorics Seminar, RISC, Hagenberg
 May 2012: Fast special function computations with FLINT, RISCDESY Workshop, RISC, Hagenberg.
 December 2011: Fast combinatorial special functions, Sage Days 35: Algorithms in Number Theory and FLINT, University of Warwick
 November 2011: Partitions in the quintillions or Billions of congruences, Algorithmic Combinatorics Seminar, RISC, Hagenberg
 November 2011: Fast reversion of power series, Algorithmic Combinatorics Seminar, RISC, Hagenberg
 July 2010: Computation of special functions in mpmath, Sage Days 24: Symbolic Computation in Differential Algebra and Special Functions, RISC, Hagenberg
 July 2010: Computation of special functions in mpmath, Sage Days 23: Number Theory and Algebra, Lorentz Center, Leiden
 May 2009: mpmath: arbitraryprecision floatingpoint arithmetic and special functions, Sage Days 15, University of Washington, Seattle, WA
Music
I compose MIDI music. I also have a YouTube channel with some recordings.
On the off chance that you want to know what I'm listening to at the moment, check my last.fm account.
Doom
My Doom maps and related information.