Andreas Kloeckner

@inducer
45 Followers
108 Following
28 Posts
The Ides of Mac.
i have been staring at this all day
Just published in JOSS: 'modepy: Basis Functions, Interpolation, and Quadrature (not just) for Finite Elements' https://doi.org/10.21105/joss.09294
modepy: Basis Functions, Interpolation, and Quadrature (not just) for Finite Elements

Kloeckner et al., (2026). modepy: Basis Functions, Interpolation, and Quadrature (not just) for Finite Elements. Journal of Open Source Software, 11(117), 9294, https://doi.org/10.21105/joss.09294

Journal of Open Source Software
Just published in JOSS: 'Ratel: Performance portable solid mechanics with libCEED and PETSc' https://doi.org/10.21105/joss.08388
Ratel: Performance portable solid mechanics with libCEED and PETSc

Atkins et al., (2026). Ratel: Performance portable solid mechanics with libCEED and PETSc. Journal of Open Source Software, 11(118), 8388, https://doi.org/10.21105/joss.08388

Journal of Open Source Software
If you write about the messy reality behind "free" internet services: we're seeing #OpenStreetMap hammered by scrapers hiding behind residential proxy/embedded-SDK networks. We're a volunteer-run service and the costs are real. We'd love to talk to a journalist about what we're seeing + how we're responding. #AI #Bots #Abuse

Next semester I will teach a very experimental class called "Build your own Proof Assistant," in which we come together as a class to build a proof assistant from scratch, targeting some specific set of users (I'm thinking about making it a proof assistant for educational purposes). In doing so we will learn about every piece of the proof assistant, from the foundations to the automation to the interface.

Worst case we learn a lot. Best case we build something useful and get to write a paper about it too.

📢 BREAKING NEWS 📢
EFF and co-counsel have filed a lawsuit against the Departments of State and Homeland Security for their viewpoint-based surveillance and suppression of First Amendment-protected speech online. (1/5)
A new patch series for the perf ilist python/textual app:
https://lore.kernel.org/lkml/202507102[email protected]/
This series improves a little of the layout of the PMU+event display, as well as adding a tree for metrics with things like topdown showing the drill down.
Making sure you're not a bot!

I was just happy to see that @joss passed 2500 published papers sometime in the last couple of weeks!

This is a nice demonstration of volunteer-run diamond open access succeeding, over about 8 years now.

And we seem to be accelerating, with a bunch of new editors.

Accepted papers per month for this year:
Jan 41
Feb 38
Mar 47
Apr 37
May 51 (a new record for a month!)
Jun 41 (so far)

Ever wondered whether fast direct solvers are compatible with Quadrature by Expansion, a method for the evaluation of singular layer potentials? Wonder no more 🙂 In https://arxiv.org/abs/2504.13809, we offer an algorithmic recipe, analysis, an end-to-end error model, and some weighting tricks, the latter two applicable beyond QBX, along with numerical experiments. #layerpot #fastalg #fastalgorithm #numpde #numerics #scicomp #paper 🎓 📖
A Fast Direct Solver for Boundary Integral Equations Using Quadrature By Expansion

We construct and analyze a hierarchical direct solver for linear systems arising from the discretization of boundary integral equations using the Quadrature by Expansion (QBX) method. Our scheme builds on the existing theory of Hierarchical Semi-Separable (HSS) matrix operators that contain low-rank off-diagonal submatrices. We use proxy-based approximations of the far-field interactions and the Interpolative Decomposition (ID) to construct compressed HSS operators that are used as fast direct solvers for the original system. We describe a number of modifications to the standard HSS framework that enable compatibility with the QBX family of discretization methods. We establish an error model for the direct solver that is based on a multipole expansion of the QBX-mediated proxy interactions and standard estimates for the ID. Based on these theoretical results, we develop an automatic approach for setting scheme parameters based on user-provided error tolerances. The resulting solver seamlessly generalizes across two- and tree-dimensional problems and achieves state-of-the-art asymptotic scaling. We conclude with numerical experiments that support the theoretical expectations for the error and computational cost of the direct solver.

arXiv.org