Related papers: Chebyshev symplectic methods based on continuous-s…
A general class of functionally-fitted explicit pseudo two-step Runge-Kutta-Nystr\"{o}m (FEPTRKN) methods for solving second-order initial value problems has been studied. These methods can be considered generalized explicit pseudo two-step…
Low-storage explicit Runge-Kutta schemes are particularly popular for the numerical integration of time-dependent partial differential equations based on the method-of-lines due to their efficiency and their reduced memory requirements. We…
A family of explicit 15-stage Runge-Kutta methods of order 10 is derived.
We prove a constant term theorem which is useful for finding weight polynomials for Ballot/Motzkin paths in a strip with a fixed number of arbitrary `decorated' weights as well as an arbitrary `background' weight. Our CT theorem, like…
We construct admissible polynomial meshes on piecewise polynomial or trigonometric curves of the complex plane, by mapping univariate Chebyshev points. Such meshes can be used for polynomial least-squares, for the extraction of Fekete-like…
We construct a family of two new optimized explicit Runge-Kutta methods with zero phase-lag and derivatives for the numerical solution of the time-independent radial Schr\"odinger equation and related ordinary differential equations with…
We analyze Su-Schrieffer-Heeger (SSH) models using the doubling method for orthogonal polynomial sequences. This approach yields the analytical spectrum and exact eigenstates of the models. We demonstrate that the standard SSH model is…
Orthogonal polynomials have very useful properties in the solution of mathematical problems, so recent years have seen a great deal in the field of approximation theory using orthogonal polynomials. In this paper, we characterize the…
This letter studies symmetric and symplectic exponential integrators when applied to numerically computing nonlinear Hamiltonian systems. We first establish the symmetry and symplecticity conditions of exponential integrators and then show…
We study the construction and convergence of semi-explicit and iterative decoupling schemes for an elliptic-parabolic problem using higher-order Runge-Kutta methods. For the semi-explicit schemes, which are constructed using a nearby delay…
In this paper we present the result of successively applying a Chebyshev polynomial to a continuous random variable. In particular we show that under mild assumptions the limiting distribution will be the same as the weight with respect to…
These notes accompany a lecture about the topology of symplectic (and other) quotients. The aim is two-fold: first to advertise the ease of computation in the symplectic category; and second to give an account of some new computations for…
This paper illuminates the derivation, the applicability, and the efficiency of the Multiplicative Runge-Kutta Method, derived in the frame- work of geometric multiplicative calculus. The removal of the restrictions of geometric…
We employ the generalized Remez algorithm, initially suggested by P. T. P. Tang, to perform an experimental study of Chebyshev polynomials in the complex plane. Our focus lies particularly on the examination of their norms and zeros. What…
This paper introduces the Runge-Kutta Chebyshev descent method (RKCD) for strongly convex optimisation problems. This new algorithm is based on explicit stabilised integrators for stiff differential equations, a powerful class of numerical…
An explicit stabilized additive Runge-Kutta scheme is proposed. The method is based on a splitting of the problem in severely stiff and mildly stiff subproblems, which are then independently solved using a Runge-Kutta-Chebyshev scheme. The…
We consider the efficient numerical solution of coupled dynamical systems, consisting of a small nonlinear part and a large linear time invariant part, possibly stemming from spatial discretization of an underlying partial differential…
The aim of this paper is to construct and analyze explicit exponential Runge-Kutta methods for the temporal discretization of linear and semilinear integro-differential equations. By expanding the errors of the numerical method in terms of…
An expansion procedure using third kind Chebyshev polynomials as base functions is suggested for solving second type Volterra integral equations with logarithmic kernels. The algorithm's convergence is studied and some illustrative examples…
A novel method which is called the Chebyshev inertial iteration for accelerating the convergence speed of fixed-point iterations is presented. The Chebyshev inertial iteration can be regarded as a valiant of the successive over relaxation…