Related papers: Convergence Results for Implicit--Explicit General…
High-order discretizations of partial differential equations (PDEs) necessitate high-order time integration schemes capable of handling both stiff and nonstiff operators in an efficient manner. Implicit-explicit (IMEX) integration based on…
Implicit-explicit (IMEX) time stepping methods can efficiently solve differential equa- tions with both stiff and nonstiff components. IMEX Runge-Kutta methods and IMEX linear multistep methods have been studied in the literature. In this…
In the numerical solution of partial differential equations using a method-of-lines approach, the availability of high order spatial discretization schemes motivates the development of sophisticated high order time integration methods. For…
For many systems of differential equations modeling problems in science and engineering, there are natural splittings of the right hand side into two parts, one non-stiff or mildly stiff, and the other one stiff. For such systems…
Although implicit-explicit (IMEX) methods for approximating solutions to semilinear parabolic equations are relatively standard, most recent works examine the case of a fully discretized model. We show that by discretizing time only, one…
Dynamical systems with sub-processes evolving on many different time scales are ubiquitous in applications. Their efficient solution is greatly enhanced by automatic time step variation. This paper is concerned with the theory, construction…
Eigenvalue perturbation theory is applied to justify using complex-valued linear scalar test equations to characterize the stability of implicit-explicit general linear methods (IMEX GLMs) solving autonomous linear ordinary differential…
Many recent applications in machine learning and data fitting call for the algorithmic solution of structured smooth convex optimization problems. Although the gradient descent method is a natural choice for this task, it requires exact…
In this paper, we extend the implicit-explicit (IMEX) methods of Peer type recently developed in [Lang, Hundsdorfer, J. Comp. Phys., 337:203--215, 2017] to a broader class of two-step methods that allow the construction of super-convergent…
Subgradient methods are the natural extension to the non-smooth case of the classical gradient descent for regular convex optimization problems. However, in general, they are characterized by slow convergence rates, and they require…
In this note we propose and analyze novel implicit-explicit methods based on second order strong stability preserving multistep time discretizations. Several schemes are developed, and a linear stability analysis is performed to study their…
High order implicit-explicit (IMEX) methods are often desired when evolving the solution of an ordinary differential equation that has a stiff part that is linear and a non-stiff part that is nonlinear. This situation often arises in…
The incremental aggregated gradient algorithm is popular in network optimization and machine learning research. However, the current convergence results require the objective function to be strongly convex. And the existing convergence…
The article addresses the convergence of implicit and semi-implicit, fully discrete approximations of a class of nonlinear parabolic evolution problems. Such schemes are popular in the numerical solution of evolutions defined with the…
In this paper we investigate a new class of implicit-explicit (IMEX) two-step methods of Peer type for systems of ordinary differential equations with both non-stiff and stiff parts included in the source term. An extrapolation approach…
We generalize the theory of underlying one-step methods to strictly stable general linear methods (GLMs) solving nonautonomous ordinary differential equations (ODEs) that satisfy a global Lipschitz condition. We combine this theory with the…
We propose second-order implicit-explicit (IMEX) time-stepping schemes for nonlinear fractional differential equations with fractional order $0<\beta<1$. From the known structure of the non-smooth solution and by introducing corresponding…
It is well known that as a famous type of iterative methods in numerical linear algebra, Gauss-Seidel iterative methods are convergent for linear systems with strictly or irreducibly diagonally dominant matrices, invertible $H-$matrices…
Although it is relatively easy to apply, the gradient method often displays a disappointingly slow rate of convergence. Its convergence is specially based on the structure of the matrix of the algebraic linear system, and on the choice of…
As a popular meta-learning approach, the model-agnostic meta-learning (MAML) algorithm has been widely used due to its simplicity and effectiveness. However, the convergence of the general multi-step MAML still remains unexplored. In this…