Related papers: A direct PinT algorithm for higher-order nonlinear…
In the classical Subset Sum problem we are given a set $X$ and a target $t$, and the task is to decide whether there exists a subset of $X$ which sums to $t$. A recent line of research has resulted in $\tilde{O}(t)$-time algorithms, which…
In this work, we develop an $\mathcal{O}(N)$ implicit real space method in 1D and 2D for the Cahn Hilliard (CH) and vector Cahn Hilliard (VCH) equations, based on the Method Of Lines Transpose (MOL$^\text{T}$) formulation. This formulation…
Stiff systems of ordinary differential equations (ODEs) and sparse training data are common in scientific problems. This paper describes efficient, implicit, vectorized methods for integrating stiff systems of ordinary differential…
Solving the reactive low-Mach Navier-Stokes equations with high-order adaptive methods in time is still a challenging problem, in particular due to the handling of the algebraic variables involved in the mass constraint. We focus on the…
The solution of large systems of nonlinear differential equations is needed for many applications in science and engineering. In this study, we present three main improvements to existing quantum algorithms based on the Carleman…
We present direct logarithmically optimal in theory and fast in practice algorithms to implement the tensor product high order finite element method on multi-dimensional rectangular parallelepipeds for solving PDEs of the Poisson kind. They…
We address complexity issues for linear differential equations in characteristic $p>0$: resolution and computation of the $p$-curvature. For these tasks, our main focus is on algorithms whose complexity behaves well with respect to $p$. We…
We develop adaptive discretization algorithms for locally optimal experimental design of nonlinear prediction models. With these algorithms, we refine and improve a pertinent state-of-the-art algorithm in various respects. We establish…
We propose a class of temporally high-order parametric finite element methods for simulating solid-state dewetting of thin films in two dimensions using a sharp-interface model. The process is governed by surface diffusion and contact point…
Exponential integrators based on contour integral representations lead to powerful numerical solvers for a variety of ODEs, PDEs, and other time-evolution equations. They are embarrassingly parallelizable and lead to global-in-time…
A generalized eigenvalue algorithm for tridiagonal matrix pencils is presented. The algorithm appears as the time evolution equation of a nonautonomous discrete integrable system associated with a polynomial sequence which has some…
In this paper, we consider the task of efficiently computing the numerical solution of evolutionary complex Ginzburg--Landau equations on Cartesian product domains with homogeneous Dirichlet/Neumann or periodic boundary conditions. To this…
We introduce polynomial couplings, a generalization of probabilistic couplings, to develop an algorithm for the computation of equivalence relations which can be interpreted as a lifting of probabilistic bisimulation to polynomial…
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled by evolutionary algorithms that use a representation which…
The isentropic compressible Cahn-Hilliard-Navier-Stokes equations is a system of fourth-order partial differential equations that model the evolution of some binary fluids under convection. The purpose of this paper is the design of…
We provide of a method to integrate first order non-linear systems of differential equations with variable coefficients. It determines approximate solutions given initial or boundary conditions or even for Sturm-Liouville problems. This…
This paper demonstrates new methods and implementations of nonlinear solvers with higher-order of convergence, which is achieved by efficiently computing higher-order derivatives. Instead of computing full derivatives, which could be…
This survey describes a class of methods known as "fast direct solvers". These algorithms address the problem of solving a system of linear equations $\boldsymbol{Ax}=\boldsymbol{b}$ arising from the discretization of either an elliptic PDE…
This paper provides a block coordinate descent algorithm to solve unconstrained optimization problems. In our algorithm, computation of function values or gradients is not required. Instead, pairwise comparison of function values is used.…
We proposed a parallel-in-time method based on preconditioner for Biot's consolidation model in poroelasticity. In order to achieve a fast and stable convergence for the matrix system of the Biot's model, we design two preconditioners with…