Searcharxiv⌕ Search

arXiv subjects

Helmut Podhaisky

Publications and source records attributed to Helmut Podhaisky.

3 recordsLinked to original sources

Optimal Polyomino Fences

The $n$-omino fence problem asks how many cells can be surrounded by placing every $n$-omino exactly once in the grid. We present a new dynamic programming approach for this problem, allowing us to prove optimality for the pentomino and hexomino fence and to classify all possible pentomino orders by optimal area. For the first time we also provide strong heuristic solutions and upper bounds for all fences up to $n = 15$, after which we even approximate the $500$-omino fence with computational experiments. Finally, we generalize the problem to 3D, where we prove optimality for pentacubes and derive heuristic solutions for hexacubes and heptacubes.

math.CO↗

Error Bound and Stability Analysis for a Randomized Singly Diagonally Implicit Runge-Kutta Method

A randomized Singly Diagonally Implicit Runge-Kutta (SDIRK) method, based on the randomized trapezoidal rule as the underlying quadrature scheme, is proposed. Every realization of the scheme is an algebraically stable SDIRK method of at least second order. The main result is the proof that the randomized scheme converges with order 2.5 in the root mean square sense under low regularity assumptions. Numerical experiments illustrate the robustness of the new scheme when applied to nonsmooth problems.

math.NA↗

Isomeric trees and the order of Runge--Kutta methods

The conditions for a Runge--Kutta method to be of order $p$ with $p\ge 5$ for a scalar non-autonomous problem are a proper subset of the order conditions for a vector problem. Nevertheless, Runge--Kutta methods that were derived historically only for scalar problems happened to be of the same order for vector problems. We relate the order conditions for scalar problems to factorisations of the Runge--Kutta trees into "atomic stumps" and enumerate those conditions up to $p=20$. Using a special search procedure over unsatisfied order conditions, new Runge--Kutta methods of "ambiguous orders" five and six are constructed. These are used to verify the validity of the results.

math.NA↗