Related papers: Algebraic Conditions for Stability in Runge-Kutta …
We propose a technique for investigating stability properties like positivity and forward invariance of an interval for method-of-lines discretizations, and apply the technique to study positivity preservation for a class of TVD…
Linearly implicit Runge-Kutta methods with approximate matrix factorization can solve efficiently large systems of differential equations that have a stiff linear part, e.g. reaction-diffusion systems. However, the use of approximate…
We study solutions to nonlinear hyperbolic systems with fully nonlinear relaxation terms in the limit of, both, infinitely stiff relaxation and arbitrary late time. In this limit, the dynamics is governed by effective systems of parabolic…
We present novel entropy-conservative and entropy-stable multirate Runge-Kutta methods based on Paired Explicit Runge-Kutta (P-ERK) schemes with relaxation for conservation laws and related systems of partial differential equations.…
Let $A$ be a square matrix with a given structure (e.g. real matrix, sparsity pattern, Toeplitz structure, etc.) and assume that it is unstable, i.e. at least one of its eigenvalues lies in the complex right half-plane. The problem of…
We present the formulation and optimization of a Runge-Kutta-type time-stepping scheme for solving the shallow water equations, aimed at substantially increasing the effective allowable time-step over that of comparable methods. This…
Extending the thoroughly studied theory of group stability, we study Ulam stability type problems for associative and Lie algebras; namely, we investigate obstacles to rank-approximation of almost solutions by exact solutions for systems of…
We study the convergence of a class of Runge-Kutta type schemes for backward stochastic differential equations (BSDEs) in a Markovian framework. The schemes belonging to the class under consideration benefit from a certain stability…
A methodology that can generate the optimal coefficients of a numerical method with the use of an artificial neural network is presented in this work. The network can be designed to produce a finite difference algorithm that solves a…
This paper is concerned with the absolute stability analysis of discrete-time feedback systems with slope-restricted nonlinearities. By employing static O'Shea-Zames-Falb multipliers in the framework of integral quadratic constraints, we…
Mixed precision Runge--Kutta methods have been recently developed and used for the time-evolution of partial differential equations. Two-derivative Runge--Kutta schemes may offer enhanced stability and accuracy properties compared to…
In the present paper, a robust approach to a special class of convex feasibility problems is considered. By techniques of convex and variational analysis, conditions for the existence of robust feasible solutions and related error bounds…
We introduce a new class of Runge-Kutta type methods suitable for time stepping to propagate hyperbolic solutions within tent-shaped spacetime regions. Unlike standard Runge-Kutta methods, the new methods yield expected convergence…
We consider the question of diagonal Riccati stability for a pair of real matrices A, B. A necessary and sufficient condition for diagonal Riccati stability is derived and applications of this to two distinct cases are presented. We also…
In this paper, we present a novel numerical scheme for solving a class of nonlinear degenerate parabolic equations with non-smooth solutions. The proposed method relies on a special kernel based formulation of the solutions found in our…
In this article, we discuss quantitative Runge approximation properties for the acoustic Helmholtz equation and prove stability improvement results in the high frequency limit for an associated partial data inverse problem modelled on…
Exponential integrators are explicit methods for solving ordinary differential equations that treat linear behaviour exactly. The stiff-order conditions for exponential integrators derived in a Banach space framework by Hochbruck and…
Farkas' lemma is a fundamental result from linear programming providing linear certificates for infeasibility of systems of linear inequalities. In semidefinite programming, such linear certificates only exist for strongly infeasible linear…
In this paper, we consider the problem of computing the nearest stable matrix to an unstable one. We propose new algorithms to solve this problem based on a reformulation using linear dissipative Hamiltonian systems: we show that a matrix…
In this paper, we demonstrate that in many NP-complete variants of the stable matching problem, such as the Stable Hypergraph Matching problem, the Stable Multicommodity Flow problem, and the College Admission problem with common quotas, a…