相关论文: New Stability Results for Explicit Runge-Kutta Met…

A novel optimization procedure for the generation of stability polynomials of stabilized explicit Runge-Kutta methods is devised. Intended for semidiscretizations of hyperbolic partial differential equations, the herein developed approach…

We study the stability of explicit Runge-Kutta methods for high order Lagrangian finite element approximation of linear parabolic equations and establish bounds on the largest eigenvalue of the system matrix which determines the largest…

A new Chebyshev-type family of stabilized explicit methods for solving mildly stiff ODEs is presented. Besides conventional conditions of order and stability we impose an additional restriction on the methods: their stability function must…

We study the radius of absolute monotonicity R of rational functions with numerator and denominator of degree s that approximate the exponential function to order p. Such functions arise in the application of implicit s-stage, order p…

In this paper, Runge-Kutta-Gegenbauer (RKG) stability polynomials of arbitrarily high order of accuracy are introduced in closed form. The stability domain of RKG polynomials extends in the the real direction with the square of polynomial…

Polynomial stability of exact solution and modified truncated Euler-Maruyama method for stochastic differential equations with time-dependent delay are investigated in this paper. By using the well known discrete semimartingale convergence…

It is shown that for a parabolic problem with maximal $L^p$-regularity (for $1<p<\infty$), the time discretization by a linear multistep method or Runge--Kutta method has maximal $\ell^p$-regularity uniformly in the stepsize if the method…

We prove that Runge-Kutta (RK) methods for numerical integration of arbitrarily large systems of Ordinary Differential Equations are linearly stable. Standard stability arguments -- based on spectral analysis, resolvent condition or strong…

Linearized numerical stability bounds for solving the nonlinear time-dependent Schr\"odinger equation (NLSE) using explicit finite-differencing are shown. The bounds are computed for the fourth-order Runge-Kutta scheme in time and both…

Stabilized methods (also called Chebyshev methods) are explicit methods with extended stability domains along the negative real axis. These methods are intended for large mildly stiff problems, originating mainly from parabolic PDEs. In…

Results on unconditional convergence in the Maximum norm for ADI-type methods, such as the Douglas method, applied to the time integration of semilinear parabolic problems are quite difficult to get, mainly when the number of space…

We study existence and stability properties of entire solutions of a polyharmonic equation with an exponential nonlinearity. We study existence of radial entire solutions and we provide some asymptotic estimates on their behavior at…

In this work, we present approaches to rigorously certify $A$- and $A(\alpha)$-stability in Runge-Kutta methods through the solution of convex feasibility problems defined by linear matrix inequalities. We adopt two approaches. The first is…

For a large class of fully nonlinear parabolic equations, which include gradient flows for energy functionals that depend on the solution gradient, the semidiscretization in time by implicit Runge-Kutta methods such as the Radau IIA methods…

The algebraic stability theorem for $\mathbb{R}$-persistence modules is a fundamental result in topological data analysis. We present a stability theorem for $n$-dimensional rectangle decomposable persistence modules up to a constant…

Certain numerical methods for initial value problems have as stability function the nth partial sum of the exponential function. We study the stability region, i.e., the set in the complex plane over which the nth partial sum has at most…

Explicit Runge-Kutta methods are classical and widespread techniques in the numerical solution of ordinary differential equations (ODEs). Considering partial differential equations, spatial semidiscretisations can be used to obtain systems…

The analytic form of a new class of factorized Runge-Kutta-Chebyshev (FRKC) stability polynomials of arbitrary order $N$ is presented. Roots of FRKC stability polynomials of degree $L=MN$ are used to construct explicit schemes comprising…

Stabilized Runge-Kutta methods are especially efficient for the numerical solution of large systems of stiff nonlinear differential equations because they are fully explicit. For semi-discrete parabolic problems, for instance, stabilized…

Partition functions arise in statistical physics and probability theory as the normalizing constant of Gibbs measures and in combinatorics and graph theory as graph polynomials. For instance the partition functions of the hard-core model…