Related papers: Strong stability preserving explicit linear multis…
Learning a stable Linear Dynamical System (LDS) from data involves creating models that both minimize reconstruction error and enforce stability of the learned representation. We propose a novel algorithm for learning stable LDSs. Using a…
A new, improved split-step backward Euler (SSBE) method is introduced and analyzed for stochastic differential delay equations(SDDEs) with generic variable delay. The method is proved to be convergent in mean-square sense under conditions…
In this paper, we consider an integrated MSP-MDP framework which captures features of Markov decision process (MDP) and multistage stochastic programming (MSP). The integrated framework allows one to study a dynamic decision-making process…
Strong stability, defined by bounds that decay not only over time but also with the number of impulses, has been established as a requirement to ensure robustness properties for impulsive systems with respect to inputs or disturbances. Most…
Estimation of structure, such as in variable selection, graphical modelling or cluster analysis is notoriously difficult, especially for high-dimensional data. We introduce stability selection. It is based on subsampling in combination with…
This thesis aims at investigating the first steps toward an unconditionally stable space-time isogeometric method, based on splines of maximal regularity, for the linear acoustic wave equation. The unconditional stability of space-time…
Deep neural networks have achieved state-of-the-art performance in a variety of fields. Recent works observe that a class of widely used neural networks can be viewed as the Euler method of numerical discretization. From the numerical…
In this paper, we study numerical approximations for stochastic differential equations (SDEs) that use adaptive step sizes. In particular, we consider a general setting where decisions to reduce step sizes are allowed to depend on the…
We propose and study Sparse Polyak, a variant of Polyak's adaptive step size, designed to solve high-dimensional statistical estimation problems where the problem dimension is allowed to grow much faster than the sample size. In such…
Recent applications (e.g. active gels and self-assembly of elastic sheets) motivate the need to efficiently simulate the dynamics of thin elastic sheets. We present semi-implicit time stepping algorithms to improve the time step constraints…
For constrained system which has several independent first integrals, we give a new stabilization method which named adjustment-stabilization method. It can stabilize all known constants of motion for a given dynamical system very well…
Modified Patankar schemes are linearly implicit time integration methods designed to be unconditionally positive and conservative. In the present work we extend the Patankar-type approach to linear multistep methods and prove that the…
We use the semi-discrete method, originally proposed in Halidias (2012), Semi-discrete approximations for stochastic differential equations and applications, International Journal of Computer Mathematics, 89(6), to reproduce qualitative…
This paper focuses on the construction and analysis of explicit numerical methods of high dimensional stochastic nonlinear Schrodinger equations (SNLSEs). We first prove that the classical explicit numerical methods are unstable and suffer…
In this article we are interested in the boundary stabilization in finite time of one-dimensional linear hyperbolic balance laws with coefficients depending on time and space. We extend the so called "backstepping method" by introducing…
Semi-implicit spectral deferred correction (SDC) methods provide a systematic approach to construct time integration methods of arbitrarily high order for nonlinear evolution equations including conservation laws. They converge towards $A$-…
The convergence behavior of Stochastic Gradient Descent (SGD) crucially depends on the stepsize configuration. When using a constant stepsize, the SGD iterates form a Markov chain, enjoying fast convergence during the initial transient…
We propose a first-order method for stochastic strongly convex optimization that attains $O(1/n)$ rate of convergence, analysis show that the proposed method is simple, easily to implement, and in worst case, asymptotically four times…
A recent study by Gassner et al. [J. Sci. Comput. 90:79 (2022)] demonstrates that local energy stability--that is, ensuring the asymptotic numerical growth rate does not exceed the continuous growth rate--is crucial for achieving accurate…
Stochastic momentum methods have been widely adopted in training deep neural networks. However, their theoretical analysis of convergence of the training objective and the generalization error for prediction is still under-explored. This…