NADec 7, 2011
Optimized high-order splitting methods for some classes of parabolic equationsSergio Blanes, Fernando Casas, Philippe Chartier et al.
We are concerned with the numerical solution obtained by splitting methods of certain parabolic partial differential equations. Splitting schemes of order higher than two with real coefficients necessarily involve negative coefficients. It has been demonstrated that this second-order barrier can be overcome by using splitting methods with complex-valued coefficients (with positive real parts). In this way, methods of orders 3 to 14 by using the Suzuki--Yoshida triple (and quadruple) jump composition procedure have been explicitly built. Here we reconsider this technique and show that it is inherently bounded to order 14 and clearly sub-optimal with respect to error constants. As an alternative, we solve directly the algebraic equations arising from the order conditions and construct methods of orders 6 and 8 that are the most accurate ones available at present time, even when low accuracies are desired. We also show that, in the general case, 14 is not an order barrier for splitting methods with complex coefficients with positive real part by building explicitly a method of order 16 as a composition of methods of order 8.
NAFeb 8, 2018
Uniformly accurate methods for Vlasov equations with non-homogeneous strong magnetic fieldPhilippe Chartier, Nicolas Crouseilles, Mohammed Lemou et al.
In this paper, we consider the numerical solution of highly-oscillatory Vlasov and Vlasov-Poisson equations with non-homogeneous magnetic field. Designed in the spirit of recent uniformly accurate methods, our schemes remain insensitive to the stiffness of the problem, in terms of both accuracy and computational cost. The specific difficulty (and the resulting novelty of our approach) stems from the presence of a non-periodic oscillation, which necessitates a careful ad-hoc reformulation of the equations. Our results are illustrated numerically on several examples.
NAJan 10, 2019
A new class of uniformly accurate numerical schemes for highly oscillatory evolution equationsPhilippe Chartier, Mohammed Lemou, Florian Méhats et al.
We introduce a new methodology to design uniformly accurate methods for oscillatory evolution equations. The targeted models are envisaged in a wide spectrum of regimes, from non-stiff to highly-oscillatory. Thanks to an averaging transformation, the stiffness of the problem is softened, allowing for standard schemes to retain their usual orders of convergence. Overall, high-order numerical approximations are obtained with errors and at a cost independent of the regime.
NANov 14, 2016
Averaging of highly-oscillatory transport equationsPhilippe Chartier, Nicolas Crouseilles, Mohammed Lemou
In this paper, we develop a new strategy aimed at obtaining high-order asymptotic models for transport equations with highly-oscillatory solutions. The technique relies upon recent developments averaging theory for ordinary differential equations, in particular normal form expansions in the vanishing parameter. Noteworthy, the result we state here also allows for the complete recovery of the exact solution from the asymptotic model. This is done by solving a companion transport equation that stems naturally from the change of variables underlying high-order averaging. Eventually, we apply our technique to the Vlasov equation with external electric and magnetic fields. Both constant and non-constant magnetic fields are envisaged, and asymptotic models already documented in the literature and re-derived using our methodology. In addition, it is shown how to obtain new high-order asymptotic models.
NAJul 20, 2018
Highly-oscillatory problems with time-dependent vanishing frequencyPhilippe Chartier, Mohammed Lemou, Florian Méhats et al.
In the analysis of highly-oscillatory evolution problems, it is commonly assumed that a single frequency is present and that it is either constant or, at least, bounded from below by a strictly positive constant uniformly in time. Allowing for the possibility that the frequency actually depends on time and vanishes at some instants introduces additional difficulties from both the asymptotic analysis and numerical simulation points of view. This work is a first step towards the resolution of these difficulties. In particular, we show that it is still possible in this situation to infer the asymptotic behaviour of the solution at the price of more intricate computations and we derive a second order uniformly accurate numerical method.
APMay 11, 2016
Uniformly accurate time-splitting methods for the semiclassical Schrödinger equation Part 1 : Construction of the schemes and simulationsPhilippe Chartier, Loïc Le Treust, Florian Méhats
This article is devoted to the construction of new numerical methods for the semiclassical Schrödinger equation. A phase-amplitude reformulation of the equation is described where the Planck constant epsilon is not a singular parameter. This allows to build splitting schemes whose accuracy is spectral in space, of up to fourth order in time, and independent of epsilon before the caustics. The second-order method additionally preserves the L^2-norm of the solution just as the exact flow does. In this first part of the paper, we introduce the basic splitting scheme in the nonlinear case, reveal our strategy for constructing higher-order methods, and illustrate their properties with simulations. In the second part, we shall prove a uniform convergence result for the first-order splitting scheme applied to the linear Schrödinger equation with a potential.
CRSep 1, 2025
Practical and Private Hybrid ML Inference with Fully Homomorphic EncryptionSayan Biswas, Philippe Chartier, Akash Dhasade et al.
In contemporary cloud-based services, protecting users' sensitive data and ensuring the confidentiality of the server's model are critical. Fully homomorphic encryption (FHE) enables inference directly on encrypted inputs, but its practicality is hindered by expensive bootstrapping and inefficient approximations of non-linear activations. We introduce Safhire, a hybrid inference framework that executes linear layers under encryption on the server while offloading non-linearities to the client in plaintext. This design eliminates bootstrapping, supports exact activations, and significantly reduces computation. To safeguard model confidentiality despite client access to intermediate outputs, Safhire applies randomized shuffling, which obfuscates intermediate values and makes it practically impossible to reconstruct the model. To further reduce latency, Safhire incorporates advanced optimizations such as fast ciphertext packing and partial extraction. Evaluations on multiple standard models and datasets show that Safhire achieves 1.5X - 10.5X lower inference latency than Orion, a state-of-the-art baseline, with manageable communication overhead and comparable accuracy, thereby establishing the practicality of hybrid FHE inference.