Related papers: Even Order Explicit Symplectic Geometric Algorithm…
We present a new direct logarithmically optimal in theory and fast in practice algorithm to implement the high order finite element method on multi-dimensional rectangular parallelepipeds for solving PDEs of the Poisson kind. The key points…
The conjugate gradient (CG) method is an efficient iterative method for solving large-scale strongly convex quadratic programming (QP). In this paper we propose some generalized CG (GCG) methods for solving the $\ell_1$-regularized…
In this paper we develop finite difference schemes for elliptic problems with piecewise continuous coefficients that have (possibly huge) jumps across fixed internal interfaces. In contrast with such problems involving one smooth…
We introduce in this paper a technique for the reduced order approximation of parametric symmetric elliptic partial differential equations. For any given dimension, we prove the existence of an optimal subspace of at most that dimension…
In this article, we introduce a kind of numerical schemes, based on Pad$\acute{e}$ approximation, for two stochastic Hamiltonian systems which are treated separately. For the linear stochastic Hamiltonian systems, it is shown that the…
We propose a novel Rayleigh quotient based sparse quadratic dimension reduction method - named QUADRO (Quadratic Dimension Reduction via Rayleigh Optimization) - for analyzing high- dimensional data. Unlike in the linear setting where…
This paper presents an algorithm for the efficient approximation of the saddle-extremum persistence diagram of a scalar field. Vidal et al. introduced recently a fast algorithm for such an approximation (by interrupting a progressive…
We introduce two new methods for deterministic convex optimization problems: QCC (Quadratic Cuts for Convex optimization) and QB (Quadratic Bundle method). We prove the complexity of these methods for composite optimization problems which…
We study optimal control problems that are governed by semilinear elliptic partial differential equations that involve non-Lipschitzian nonlinearities. It is shown that, for a certain class of such PDEs, the solution map is Fr\'{e}chet…
We propose an inexact variable-metric proximal point algorithm to accelerate gradient-based optimization algorithms. The proposed scheme, called QNing can be notably applied to incremental first-order methods such as the stochastic…
This work introduces and rigorously analyzes a novel operator-splitting finite element scheme for approximating viscosity solutions of a broad class of constrained second-order partial differential equations. By decoupling the primary PDE…
In this work, we introduce new integral formulations based on the convolution quadrature method for the time-domain modeling of perfectly electrically conducting scatterers that overcome some of the most critical issues of the standard…
Quaternion-valued differential equations (QDEs) is a new kind of differential equations which have many applications in physics and life sciences. The largest difference between QDEs and ODEs is the algebraic structure. On the…
We introduce a generalized finite difference method for solving a large range of fully nonlinear elliptic partial differential equations in three dimensions. Methods are based on Cartesian grids, augmented by additional points carefully…
We seek discrete approximations to solutions $u:\Omega \to R$ of semilinear elliptic partial differential equations of the form $\Delta u + f_s(u) = 0$, where $f_s$ is a one-parameter family of nonlinear functions and $\Omega$ is a domain…
In a recent paper we presented a new ultra efficient numerical method for solving kinetic equations of the Boltzmann type (G. Dimarco, R. Loubere, Towards an ultra efficient kinetic scheme. Part I: basics on the 689 BGK equation, J. Comp.…
Quadratization of polynomial and nonpolynomial systems of ordinary differential equations is advantageous in a variety of disciplines, such as systems theory, fluid mechanics, chemical reaction modeling and mathematical analysis. A…
In this paper, we propose a fast and convergent algorithm to solve unassigned distance geometry problems (uDGP). Technically, we construct a novel quadratic measurement model by leveraging $\ell_0$-norm instead of $\ell_1$-norm in the…
High-order numerical methods for solving elliptic equations over arbitrary domains typically require specialized machinery, such as high-quality conforming grids for finite elements method, and quadrature rules for boundary integral…
We take advantage of the fact that in lambda phi ^4 problems a large field cutoff phi_max makes perturbative series converge toward values exponentially close to the exact values, to make optimal choices of phi_max. For perturbative series…