Related papers: Roundoff error problem in L2-type methods for time…
In this paper we consider a sub-diffusion problem where the fractional time derivative is approximated either by the L1 scheme or by Convolution Quadrature. We propose new interpretations of the numerical schemes which lead to a posteriori…
Neural networks have achieved remarkable success in many cognitive tasks. However, when they are trained sequentially on multiple tasks without access to old data, their performance on early tasks tend to drop significantly. This problem is…
In this paper we develop a novel two-stage fourth order time-accurate discretization for time-dependent flow problems, particularly for hyperbolic conservation laws. Different from the classical Runge-Kutta (R-K) temporal discretization for…
Convolution quadrature (CQ) methods have enjoyed tremendous interest in recent years as an efficient tool for solving time-domain wave problems in unbounded domains via boundary integral equation techniques. In this paper we consider CQ…
We present a higher-order extension of the dual cell method for the time-domain Maxwell equations in three spatial dimensions. The approach builds upon a variational reinterpretation of the Finite Integration Technique on dual meshes and…
Time-fractional semilinear and quasilinear parabolic equations with a Caputo time derivative of order $\alpha\in(0,1)$ are considered, solutions of which exhibit a singular behaviour at an initial time of type $t^\sigma$ for any fixed…
In this paper we develop randomized Krylov subspace methods for efficiently computing regularized solutions to large-scale linear inverse problems. Building on the recently developed randomized Gram-Schmidt process, where sketched inner…
We revisit multi-agent asynchronous online optimization with delays, where only one of the agents becomes active for making the decision at each round, and the corresponding feedback is received by all the agents after unknown delays.…
We propose a successive generation of cutting inequalities for binary quadratic optimization problems. Multiple cutting inequalities are successively generated for the convex hull of the set of the optimal solutions $\subset \{0, 1\}^n$,…
We describe a series of algorithms that efficiently implement Gaussian model-X knockoffs to control the false discovery rate on large scale feature selection problems. Identifying the knockoff distribution requires solving a large scale…
We present improved $L^2$-error estimates on the time-integrated primal variable for the wave equation in its first-order formulation. The space discretization relies on a hybrid nonconforming method, such as the hybridizable discontinuous…
We introduce a novel data-driven method to mitigate the risk of cascading failures in delayed discrete-time Linear Time-Invariant (LTI) systems. Our approach involves formulating a distributionally robust finite-horizon optimal control…
We formulate and solve the H-SARA Problem, a Vehicle Routing and Appointment Scheduling Problem motivated by home services management. We assume that travel times, service durations, and customer cancellations are stochastic. We use a…
A wide range of implicit time integration methods, including multi-step, implicit Runge-Kutta, and Galerkin finite-time element schemes, is evaluated in the context of chaotic dynamical systems. The schemes are applied to solve the Lorenz…
Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration…
This paper is devoted to the theoretical and numerical investigation of an augmented Lagrangian method for the solution of optimization problems with geometric constraints. Specifically, we study situations where parts of the constraints…
Computation of moments of transformed random variables is a problem appearing in many engineering applications. The current methods for moment transformation are mostly based on the classical quadrature rules which cannot account for the…
The numerical solution of implicit and stiff differential equations by implicit numerical integrators has been largely investigated and there exist many excellent efficient codes available in the scientific community, as Radau5 (based on a…
In the framework of tensor spaces, we consider orthogonalization kernels to generate an orthogonal basis of a tensor subspace from a set of linearly independent tensors. In particular, we experimentally study the loss of orthogonality of…
In this paper we suggest a moment matching method for quadratic-bilinear dynamical systems. Most system-theoretic reduction methods for nonlinear systems rely on multivariate frequency representations. Our approach instead uses univariate…