VLDB 2026 Research / reviewers in the wild / expert
Patrick E. Farrell
dblp:84/11269
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2021
0000-0002-1241-7060ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 first-author · 2 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Irksome: Automating Runge-Kutta Time-stepping for Finite Element MethodsabstractWhile implicit Runge–Kutta (RK) methods possess high order accuracy and important stability properties, implementation difficulties and the high expense of solving the coupled algebraic system at each time step are frequently cited as impediments. We present Irksome , a high-level library for manipulating UFL (Unified Form Language) expressions of semidiscrete variational forms to obtain UFL expressions for the coupled Runge–Kutta stage equations at each time step. Irksome works with the Firedrake package to enable the efficient solution of the resulting coupled algebraic systems. Numerical examples confirm the efficacy of the software and our solver techniques for various problems. Patrick E. Farrell, Robert C. Kirby, Jorge Marchena-Menendez |
ACM Trans. Math. Softw. | 1 |
| 2021 | PCPATCH: Software for the Topological Construction of Multigrid Relaxation MethodsabstractEffective relaxation methods are necessary for good multigrid convergence. For many equations, standard Jacobi and Gauß–Seidel are inadequate, and more sophisticated space decompositions are required; examples include problems with semidefinite terms or saddle point structure. In this article, we present a unifying software abstraction, PCPATCH, for the topological construction of space decompositions for multigrid relaxation methods. Space decompositions are specified by collecting topological entities in a mesh (such as all vertices or faces) and applying a construction rule (such as taking all degrees of freedom in the cells around each entity). The software is implemented in PETSc and facilitates the elegant expression of a wide range of schemes merely by varying solver options at runtime. In turn, this allows for the very rapid development of fast solvers for difficult problems. Patrick E. Farrell, Matthew G. Knepley, Lawrence Mitchell, Florian Wechsung |
ACM Trans. Math. Softw. | 1 |