Searcharxiv⌕ Search

arXiv subjects

Siddhartha Mishra

Publications and source records attributed to Siddhartha Mishra.

At least 91 records · Page 5Linked to original sources

On the approximation of rough functions with deep neural networks

Deep neural networks and the ENO procedure are both efficient frameworks for approximating rough functions. We prove that at any order, the ENO interpolation procedure can be cast as a deep ReLU neural network. This surprising fact enables the transfer of several desirable properties of the ENO procedure to deep neural networks, including its high-order accuracy at approximating Lipschitz functions. Numerical tests for the resulting neural networks show excellent performance for approximating solutions of nonlinear conservation laws and at data compression.

math.NA↗

Iterative Surrogate Model Optimization (ISMO): An active learning algorithm for PDE constrained optimization with deep neural networks

We present a novel active learning algorithm, termed as iterative surrogate model optimization (ISMO), for robust and efficient numerical approximation of PDE constrained optimization problems. This algorithm is based on deep neural networks and its key feature is the iterative selection of training data through a feedback loop between deep neural networks and any underlying standard optimization algorithm. Under suitable hypotheses, we show that the resulting optimizers converge exponentially fast (and with exponentially decaying variance), with respect to increasing number of training samples. Numerical examples for optimal control, parameter identification and shape optimization problems for PDEs are provided to validate the proposed theory and to illustrate that ISMO significantly outperforms a standard deep neural network based surrogate optimization algorithm.

math.OC↗

A Multi-level procedure for enhancing accuracy of machine learning algorithms

We propose a multi-level method to increase the accuracy of machine learning algorithms for approximating observables in scientific computing, particularly those that arise in systems modeled by differential equations. The algorithm relies on judiciously combining a large number of computationally cheap training data on coarse resolutions with a few expensive training samples on fine grid resolutions. Theoretical arguments for lowering the generalization error, based on reducing the variance of the underlying maps, are provided and numerical evidence, indicating significant gains over underlying single-level machine learning algorithms, are presented. Moreover, we also apply the multi-level algorithm in the context of forward uncertainty quantification and observe a considerable speed-up over competing algorithms.

math.NA↗

Enhancing accuracy of deep learning algorithms by training with low-discrepancy sequences

We propose a deep supervised learning algorithm based on low-discrepancy sequences as the training set. By a combination of theoretical arguments and extensive numerical experiments we demonstrate that the proposed algorithm significantly outperforms standard deep learning algorithms that are based on randomly chosen training data, for problems in moderately high dimensions. The proposed algorithm provides an efficient method for building inexpensive surrogates for many underlying maps in the context of scientific computing.

cs.LG↗

Deep learning observables in computational fluid dynamics

Many large scale problems in computational fluid dynamics such as uncertainty quantification, Bayesian inversion, data assimilation and PDE constrained optimization are considered very challenging computationally as they require a large number of expensive (forward) numerical solutions of the corresponding PDEs. We propose a machine learning algorithm, based on deep artificial neural networks, that predicts the underlying \emph{input parameters to observable} map from a few training samples (computed realizations of this map). By a judicious combination of theoretical arguments and empirical observations, we find suitable network architectures and training hyperparameters that result in robust and efficient neural network approximations of the parameters to observable map. Numerical experiments are presented to demonstrate low prediction errors for the trained network networks, even when the network has been trained with a few samples, at a computational cost which is several orders of magnitude lower than the underlying PDE solver. Moreover, we combine the proposed deep learning algorithm with Monte Carlo (MC) and Quasi-Monte Carlo (QMC) methods to efficiently compute uncertainty propagation for nonlinear PDEs. Under the assumption that the underlying neural networks generalize well, we prove that the deep learning MC and QMC algorithms are guaranteed to be faster than the baseline (quasi-) Monte Carlo methods. Numerical experiments demonstrating one to two orders of magnitude speed up over baseline QMC and MC algorithms, for the intricate problem of computing probability distributions of the observable, are also presented.

physics.comp-ph↗

On the convergence of the spectral viscosity method for the two-dimensional incompressible Euler equations with rough initial data

We propose a spectral viscosity method to approximate the two-dimensional Euler equations with rough initial data and prove that the method converges to a weak solution for a large class of initial data, including when the initial vorticity is in the so-called Delort class i.e. it is a sum of a signed measure and an integrable function. This provides the first convergence proof for a numerical method approximating the Euler equations with such rough initial data and closes the gap between the available existence theory and rigorous convergence results for numerical methods. We also present numerical experiments, including computations of vortex sheets and confined eddies, to illustrate the proposed method.

math.NA↗

Statistical solutions of the incompressible Euler equations

We propose and study the framework of dissipative statistical solutions for the incompressible Euler equations. Statistical solutions are time-parameterized probability measures on the space of square-integrable functions, whose time-evolution is determined from the underlying Euler equations. We prove partial well-posedness results for dissipative statistical solutions and propose a Monte Carlo type algorithm, based on spectral viscosity spatial discretizations, to approximate them. Under verifiable hypotheses on the computations, we prove that the approximations converge to a statistical solution in a suitable topology. In particular, multi-point statistical quantities of interest converge on increasing resolution. We present several numerical experiments to illustrate the theory.

math.NA↗

Statistical solutions of hyperbolic systems of conservation laws: numerical approximation

Statistical solutions are time-parameterized probability measures on spaces of integrable functions, that have been proposed recently as a framework for global solutions and uncertainty quantification for multi-dimensional hyperbolic system of conservation laws. By combining high-resolution finite volume methods with a Monte Carlo sampling procedure, we present a numerical algorithm to approximate statistical solutions. Under verifiable assumptions on the finite volume method, we prove that the approximations, generated by the proposed algorithm, converge in an appropriate topology to a statistical solution. Numerical experiments illustrating the convergence theory and revealing interesting properties of statistical solutions, are also presented.

math.NA↗

A machine learning framework for data driven acceleration of computations of differential equations

We propose a machine learning framework to accelerate numerical computations of time-dependent ODEs and PDEs. Our method is based on recasting (generalizations of) existing numerical methods as artificial neural networks, with a set of trainable parameters. These parameters are determined in an offline training process by (approximately) minimizing suitable (possibly non-convex) loss functions by (stochastic) gradient descent methods. The proposed algorithm is designed to be always consistent with the underlying differential equation. Numerical experiments involving both linear and non-linear ODE and PDE model problems demonstrate a significant gain in computational efficiency over standard numerical methods.

math.NA↗

Numerical approximation of statistical solutions of scalar conservation laws

We propose efficient numerical algorithms for approximating statistical solutions of scalar conservation laws. The proposed algorithms combine finite volume spatio-temporal approximations with Monte Carlo and multi-level Monte Carlo discretizations of the probability space. Both sets of methods are proved to converge to the entropy statistical solution. We also prove that there is a considerable gain in efficiency resulting from the multi-level Monte Carlo method over the standard Monte Carlo method. Numerical experiments illustrating the ability of both methods to accurately compute multi-point statistical quantities of interest are also presented.

math.NA↗

Statistical solutions of hyperbolic conservation laws I: Foundations

We seek to define statistical solutions of hyperbolic systems of conservation laws as time-parametrized probability measures on $p$-integrable functions. To do so, we prove the equivalence between probability measures on $L^p$ spaces and infinite families of \textit{correlation measures}. Each member of this family, termed a \textit{correlation marginal}, is a Young measure on a finite-dimensional tensor product domain and provides information about multi-point correlations of the underlying integrable functions. We also prove that any probability measure on a $L^p$ space is uniquely determined by certain moments (correlation functions) of the equivalent correlation measure. We utilize this equivalence to define statistical solutions of multi-dimensional conservation laws in terms of an infinite set of equations, each evolving a moment of the correlation marginal. These evolution equations can be interpreted as augmenting entropy measure-valued solutions, with additional information about the evolution of all possible multi-point correlation functions. Our concept of statistical solutions can accommodate uncertain initial data as well as possibly non-atomic solutions even for atomic initial data. For multi-dimensional scalar conservation laws we impose additional entropy conditions and prove that the resulting \textit{entropy statistical solutions} exist, are unique and are stable with respect to the $1$-Wasserstein metric on probability measures on $L^1$.

math.AP↗

Construction of approximate entropy measure valued solutions for hyperbolic systems of conservation laws

Entropy solutions have been widely accepted as the suitable solution framework for systems of conservation laws in several space dimensions. However, recent results in \cite{CDL1,CDL2} have demonstrated that entropy solutions may not be unique. In this paper, we present numerical evidence that demonstrates that state of the art numerical schemes \emph{may not} necessarily converge to an entropy solution of systems of conservation laws as the mesh is refined. Combining these two facts, we argue that entropy solutions may not be suitable as a solution framework for systems of conservation laws, particularly in several space dimensions. Furthermore, we propose a more general notion, that of \emph{entropy measure valued solutions}, as an appropriate solution paradigm for systems of conservation laws. To this end, we present a detailed numerical procedure, which constructs stable approximations to entropy measure valued solutions and provide sufficient conditions that guarantee that these approximations converge to an entropy measure valued solution as the mesh is refined, thus providing a viable numerical framework for systems of conservation laws in several space dimensions. A large number of numerical experiments that illustrate the proposed schemes are presented and are utilized to examine several interesting properties of the computed entropy measure valued solutions.

math.NA↗

Computation of measure-valued solutions for the incompressible Euler equations

We combine the spectral (viscosity) method and ensemble averaging to propose an algorithm that computes admissible measure valued solutions of the incompressible Euler equations. The resulting approximate young measures are proved to converge (with increasing numerical resolution) to a measure valued solution. We present numerical experiments demonstrating the robustness and efficiency of the proposed algorithm, as well as the appropriateness of measure valued solutions as a solution framework for the Euler equations. Furthermore, we report an extensive computational study of the two dimensional vortex sheet, which indicates that the computed measure valued solution is non-atomic and implies possible non-uniqueness of weak solutions constructed by Delort.

math.NA↗

Numerical methods with controlled dissipation for small-scale dependent shocks

We provide a `user guide' to the literature of the past twenty years concerning the modeling and approximation of discontinuous solutions to nonlinear hyperbolic systems that admit small-scale dependent shock waves. We cover several classes of problems and solutions: nonclassical undercompressive shocks, hyperbolic systems in nonconservative form, boundary layer problems. We review the relevant models arising in continuum physics and describe the numerical methods that have been proposed to capture small-scale dependent solutions. In agreement with the general well-posedness theory, small-scale dependent solutions are characterized by a kinetic relation, a family of paths, or an admissible boundary set. We provide a review of numerical methods (front tracking schemes, finite difference schemes, finite volume schemes), which, at the discrete level, reproduce the effect of the physically-meaningful dissipation mechanisms of interest in the applications. An essential role is played by the equivalent equation associated with discrete schemes, which is found to be relevant even for solutions containing shock waves.

math.AP↗

ENO reconstruction and ENO interpolation are stable

We prove stability estimates for the ENO reconstruction and ENO interpolation procedures. In particular, we show that the jump of the reconstructed ENO pointvalues at each cell interface has the same sign as the jump of the underlying cell averages across that interface. We also prove that the jump of the reconstructed values can be upper-bounded in terms of the jump of the underlying cell averages. Similar sign properties hold for the ENO interpolation procedure. These estimates, which are shown to hold for ENO reconstruction and interpolation of arbitrary order of accuracy and on non-uniform meshes, indicate a remarkable rigidity of the piecewise-polynomial ENO procedure.

math.NA↗

Entropy Stable Numerical Schemes for Two-Fluid Plasma Equations

Two-fluid ideal plasma equations are a generalized form of the ideal MHD equations in which electrons and ions are considered as separate species. The design of efficient numerical schemes for the these equations is complicated on account of their non-linear nature and the presence of stiff source terms, especially for high charge to mass ratios and for low Larmor radii. In this article, we design entropy stable finite difference schemes for the two-fluid equations by combining entropy conservative fluxes and suitable numerical diffusion operators. Furthermore, to overcome the time step restrictions imposed by the stiff source terms, we devise time-stepping routines based on implicit-explicit (IMEX)-Runge Kutta (RK) schemes. The special structure of the two-fluid plasma equations is exploited by us to design IMEX schemes in which only local (in each cell) linear equations need to be solved at each time step. Benchmark numerical experiments are presented to illustrate the robustness and accuracy of these schemes.

math.NA↗

Accurate numerical schemes for approximating initial-boundary value problems for systems of conservation laws

Solutions of initial-boundary value problems for systems of conservation laws depend on the underlying viscous mechanism, namely different viscosity operators lead to different limit solutions. Standard numerical schemes for approximating conservation laws do not take into account this fact and converge to solutions that are not necessarily physically relevant. We design numerical schemes that incorporate explicit information about the underlying viscosity mechanism and approximate the physically relevant solution. Numerical experiments illustrating the robust performance of these schemes are presented.

math.NA↗

Higher order finite difference schemes for the magnetic induction equations

We describe high order accurate and stable finite difference schemes for the initial-boundary value problem associated with the magnetic induction equations. These equations model the evolution of a magnetic field due to a given velocity field. The finite difference schemes are based on Summation by Parts (SBP) operators for spatial derivatives and a Simultaneous Approximation Term (SAT) technique for imposing boundary conditions. We present various numerical experiments that demonstrate both the stability as well as high order of accuracy of the schemes.

math.AP↗