Unit
Scientific Computing and Uncertainty Quantification - CADMOS Chair
LaboratoryRelated publications (798)
A multigrid method for PDE-constrained optimization with uncertain inputs
We present a multigrid algorithm to solve efficiently the large saddle-point systems of equations that typically arise in PDE-constrained optimization under uncertainty. The algorithm is based on a collective smoother that at each iteration sweeps over the ...
2023Information Spectrum Converse for Minimum Entropy Couplings and Functional Representations
Given two jointly distributed random variables (X,Y), a functional representation of X is a random variable Z independent of Y, and a deterministic function g(⋅,⋅) such that X=g(Y,Z). The problem of finding a minimum entropy functional representation is kn ...
2023Peak Value-at-Risk Estimation for Stochastic Differential Equations using Occupation Measures
This paper proposes an algorithm to upper-bound maximal quantile statistics of a state function over the course of a Stochastic Differential Equation (SDE) system execution. This chance-peak problem is posed as a nonconvex program aiming to maximize the Va ...
New York2023LDP and CLT for SPDEs with transport noise
In this work we consider solutions to stochastic partial differential equations with transport noise, which are known to converge, in a suitable scaling limit, to solution of the corresponding deterministic PDE with an additional viscosity term. Large devi ...
SPRINGER2023Detecting whether a stochastic process is finitely expressed in a basis
Victor Panaretos, Neda Mohammadi Jouzdani
Is it possible to detect if the sample paths of a stochastic process almost surely admit a finite expansion with respect to some/any basis? The determination is to be made on the basis of a finite collection of discretely/noisily observed sample paths. We ...
ACADEMIC PRESS INC ELSEVIER SCIENCE2023The multivariate Serre conjecture ring
It is well-known that for any integral domain R, the Serre conjecture ring R(X), i.e., the localization of the univariate polynomial ring R[X] at monic polynomials, is a Bezout domain of Krull dimension
San Diego2023Singular quadratic eigenvalue problems: linearization and weak condition numbers
Daniel Kressner, Ivana Sain Glibic
The numerical solution of singular eigenvalue problems is complicated by the fact that small perturbations of the coefficients may have an arbitrarily bad effect on eigenvalue accuracy. However, it has been known for a long time that such perturbations are ...
SPRINGER2023CONVERGENCE AND NONCONVERGENCE OF SCALED SELF-INTERACTING RANDOM WALKS TO BROWNIAN MOTION PERTURBED AT EXTREMA
We use generalized Ray-Knight theorems, introduced by B. Toth in 1996, together with techniques developed for excited random walks as main tools for establishing positive and negative results concerning convergence of some classes of diffusively scaled sel ...
Cleveland2023A NEW PROOF OF THE ERDOS-KAC CENTRAL LIMIT THEOREM
Thomas Mountford, Michael Cranston
In this paper we use the Riemann zeta distribution to give a new proof of the Erdos-Kac Central Limit Theorem. That is, if zeta(s) = Sigma(n >= 1) (1)(s)(n) , s > 1, then we consider the random variable X-s with P(X-s = n) = (1) (zeta) ( ...
Providence2023THE WEYL LAW OF TRANSMISSION EIGENVALUES AND THE COMPLETENESS OF GENERALIZED TRANSMISSION EIGENFUNCTIONS WITHOUT COMPLEMENTING CONDITIONS
Hoài-Minh Nguyên, Jean Louis-Alexandre Fornerod
The transmission eigenvalue problem is a system of two second-order elliptic equations of two unknowns equipped with the Cauchy data on the boundary. In this work, we establish the Weyl law for the eigenvalues and the completeness of the generalized eigenf ...
Philadelphia2023