Anne Gelb’s research while affiliated with Dartmouth College and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (20)


Recovery of f(x)=exsin(5x)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$f(x) = e^x\sin {(5x)}$$\end{document}. (left) Fourier reconstruction fN\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{f}}_N$$\end{document} in (3.6); (center-left) Spectral reprojection fm,Nλ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{f}}_{m,N}^{\lambda }$$\end{document} in Algorithm 1; (center-right) fBSR\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{f}}_{BSR}$$\end{document} in Algorithm 2; and (right) fGBSR\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{f}}_{GBSR}$$\end{document} in Algorithm 3
(Top-left) Fourier reconstruction fN\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{f}}_N$$\end{document} in (3.6) for N=48\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N = 48$$\end{document}; (top-middle) Spectral reprojection fm,Nλ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{f}}_{m,N}^{\lambda }$$\end{document} computed via Algorithm 1 for λ=4\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda =4$$\end{document} and m=9\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$m = 9$$\end{document}; (top right) pointwise log errors for λ=4\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda =4$$\end{document} and λ=2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda =2$$\end{document} for noiseless data. (Bottom) Same experiments with SNR =10\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$= 10$$\end{document}
Log error plots for varying SNR: (left) l2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$l_2$$\end{document} error in [-1,1]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$[-1,1]$$\end{document}, (middle-left) at x=-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$x=-1$$\end{document}; (middle-right) at x=-0.8\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$x=-0.8$$\end{document}; and (right) l2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$l_2$$\end{document} error in [-.5,.5]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$[-.5,.5]$$\end{document} for fN\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{f}}_N$$\end{document}, fm,Nλ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{f}}_{m,N}^\lambda $$\end{document}fBSR\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{f}}_{BSR}$$\end{document}, and fGBSR\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{f}}_{GBSR}$$\end{document}
Pointwise log likelihood and prior term plots for SNR = 2 (left), 10 (middle-left), 20 (middle-right) and 40 (right)
Log hyperparameter values for varying SNR

+2

A Bayesian Framework for Spectral Reprojection
  • Article
  • Full-text available

January 2025

·

21 Reads

·

1 Citation

Journal of Scientific Computing

·

Anne Gelb

Fourier partial sum approximations yield exponential accuracy for smooth and periodic functions, but produce the infamous Gibbs phenomenon for non-periodic ones. Spectral reprojection resolves the Gibbs phenomenon by projecting the Fourier partial sum onto a Gibbs complementary basis, often prescribed as the Gegenbauer polynomials. Noise in the Fourier data and the Runge phenomenon both degrade the quality of the Gegenbauer reconstruction solution, however. Motivated by its theoretical convergence properties, this paper proposes a new Bayesian framework for spectral reprojection, which allows a greater understanding of the impact of noise on the reprojection method from a statistical point of view. We are also able to improve the robustness with respect to the Gegenbauer polynomials parameters. Finally, the framework provides a mechanism to quantify the uncertainty of the solution estimate.

Download

Entropy stable conservative flux form neural networks

November 2024

·

15 Reads

We propose an entropy-stable conservative flux form neural network (CFN) that integrates classical numerical conservation laws into a data-driven framework using the entropy-stable, second-order, and non-oscillatory Kurganov-Tadmor (KT) scheme. The proposed entropy-stable CFN uses slope limiting as a denoising mechanism, ensuring accurate predictions in both noisy and sparse observation environments, as well as in both smooth and discontinuous regions. Numerical experiments demonstrate that the entropy-stable CFN achieves both stability and conservation while maintaining accuracy over extended time domains. Furthermore, it successfully predicts shock propagation speeds in long-term simulations, {\it without} oracle knowledge of later-time profiles in the training data.




A Bayesian framework for spectral reprojection

June 2024

·

8 Reads

Fourier partial sum approximations yield exponential accuracy for smooth and periodic functions, but produce the infamous Gibbs phenomenon for non-periodic ones. Spectral reprojection resolves the Gibbs phenomenon by projecting the Fourier partial sum onto a Gibbs complementary basis, often prescribed as the Gegenbauer polynomials. Noise in the Fourier data and the Runge phenomenon both degrade the quality of the Gegenbauer reconstruction solution, however. Motivated by its theoretical convergence properties, this paper proposes a new Bayesian framework for spectral reprojection, which allows a greater understanding of the impact of noise on the reprojection method from a statistical point of view. We are also able to improve the robustness with respect to the Gegenbauer polynomials parameters. Finally, the framework provides a mechanism to quantify the uncertainty of the solution estimate.




A Structurally Informed Data Assimilation Approach for Nonlinear Partial Differential Equations

September 2023

·

24 Reads

Ensemble transform Kalman filtering (ETKF) data assimilation is often used to combine available observations with numerical simulations to obtain statistically accurate and reliable state representations in dynamical systems. However, it is well known that the commonly used Gaussian distribution assumption introduces biases for state variables that admit discontinuous profiles, which are prevalent in nonlinear partial differential equations. This investigation designs a new structurally informed non-Gaussian prior that exploits statistical information from the simulated state variables. In particular, we construct a new weighting matrix based on the second moment of the gradient information of the state variable to replace the prior covariance matrix used for model/data compromise in the ETKF data assimilation framework. We further adapt our weighting matrix to include information in discontinuity regions via a clustering technique. Our numerical experiments demonstrate that this new approach yields more accurate estimates than those obtained using ETKF on shallow water equations, even when ETKF is enhanced with inflation and localization techniques.


A Bayesian Formulation for Estimating the Composition of Earth's Crust

July 2023

·

79 Reads

·

3 Citations

Due to the inaccessibility of Earth's deep interior, geologists have long attempted to estimate the composition of the continental crust from its seismic properties. Despite numerous sources of error including nonuniqueness in the mapping between composition and seismic properties, the corresponding uncertainties have typically been estimated qualitatively at best. We propose a Bayesian approach that uses mineralogical modeling to combine prior knowledge about the composition of the crust with seismic data to give a posterior distribution of the predicted composition at any location, combined with a Monte Carlo simulation to estimate the average composition of the Earth's crust. Our approach yields an estimated composition of 59.5% silica in the upper crust (90% credible interval 58.9 %–60.1%), 57.9% in the middle crust (90% credible interval 57.2%–58.6%), and 53.6% in the lower crust (90% credible interval 53.0%–54.2%). Our estimate exhibits less compositional stratification over depth and a more intermediate composition in the upper and middle crust than previous estimates. Testing our approach on a simulated crust reveals the importance of prior assumptions in estimating the composition of the crust from its seismic properties, and suggests that future work should focus on quantifying those assumptions.



Citations (9)


... By contrast, methods that incorporate spatial derivatives such as gradients and Laplacians are designed to embed explicit spatial structural information for dynamical system discovery [29]. Methods that incorporate ideas from classical numerical conservation laws into neural network frameworks have been more recently developed to predict the long term behavior of hyperbolic conservation laws [3,5,39]. For example, the conservative flux form neural network (CFN) introduced in [5] learns the dynamics of unknown hyperbolic conservation laws by leveraging a finite volume structure. ...

Reference:

Entropy stable conservative flux form neural networks
Learning the Dynamics for Unknown Hyperbolic Conservation Laws Using Deep Neural Networks
  • Citing Article
  • March 2024

SIAM Journal on Scientific Computing

... SAR data can be collected at various elevation and azimuth angles, and here we refer to these distinct data collections over the same scene as multiple measurement vectors (MMVs). The joint sparsity assumption, that is, the assumption that the sparse domain of the underlying signal is similar across all collected measurements of that same signal, has been exploited to produce high quality SAR signal recovery in noisy environments [31,43]. ...

Leveraging joint sparsity in 3D synthetic aperture radar imaging
  • Citing Article
  • January 2023

Applied Mathematics for Modern Challenges

... Over the past decades, seismological observations have been used to infer the physical properties of the crust and upper mantle (e.g., Owens et al. 1984;Tilmann et al. 2003;Yao et al. 2006;Shen et al. 2016;Gong et al. 2023) based on the lab-derived correlations between seismic velocity and rock compositions (Christensen 1996;Behn and Kelemen 2003). In this context, simulating seismic velocities by varying the rock's composition can provide quantitative constraints on the Tibetan lower crustal composition and relevant dynamic processes (Connolly and Kerrick 2002;Hacker et al. 2015;Sammon et al. 2022;Pease et al. 2023). Thus, in this study, we simulate the seismic velocities (i.e., Vp and Vs) of three rock types (i.e., felsic granulite, eclogite, and mafic granulite) that are presumed to constitute the continental lower crust under specific pressure and temperature conditions. ...

A Bayesian Formulation for Estimating the Composition of Earth's Crust

... Therefore, it is crucial to model and analyze sea ice dynamics, which also facilitates developing the next-generation global climate models (GCMs) [28,25]. There has been a rapid growth in research on modeling sea ice, including contributions from applied and computational mathematics (see, for example, some recent work [28,3,62,27,8,55,9,13,51,63]). ...

Improving Numerical Accuracy for the Viscous-Plastic Formulation of Sea Ice
  • Citing Article
  • January 2022

SSRN Electronic Journal

... Qi and his colleagues established a regularized iterative optimization model, based on the pixel-wise spatially variant PSF map, and thus achieving superior performance [21]. Moreover, compressed sensing (CS) has further been successfully exploited for image reconstructions from sparse data in 2D and 3D photoacoustic embodiments [22][23][24][25][26]. Among them, dictionary learning can more fully exploit the redundancy and sparsity of signals. ...

Sparsity-Based Recovery of Three-Dimensional Photoacoustic Images from Compressed Single-Shot Optical Detection

... A surf operator approximates the second-order Gaussian function through a box filter to improve the calculation speed. The image pyramids of different sizes can be generated in the image depending only on the filter size, and the convolution acceleration of the image is achieved using integral images [12,13], and thus, the determinant of Hessian matrix is obtained as follows: ...

Sparsity-based photoacoustic image reconstruction with a linear array transducer and direct measurement of the forward model (Erratum)
  • Citing Article
  • August 2019

Journal of Biomedical Optics

... To address this challenge, researchers have employed both iterative reconstruction (IR) and deep-learning-based methods to improve image quality. For 3D PAI reconstruction, iterative methods often suffer from extremely high memory consumption and long computation time [15][16][17][18][19][20][21]. Even relatively advanced iterative methods [22] needs hours to reconstruct a volume (e.g., a 25.6 mm × 25.6 mm×25.6 mm region at 0.1 mm resolution) of the PA data acquired by a hemispherical array system. ...

Sparsity-based photoacoustic image reconstruction with a linear array transducer and direct measurement of the forward model
  • Citing Article
  • December 2018

Journal of Biomedical Optics

... This concept is based on the knowledge that most natural images are sparse (i.e., only a few nonzero values exist) when transformed into a specific domain. Researchers have successfully applied sparsity-based optimization in a variety of imaging fields ranging from compressed ultrafast photography [5] to holographic video [6] to biomedical imaging [7]. Although the sparsity-based optimization has advantages in image reconstruction, the primary drawback to this approach is that it is iterative and time consuming. ...

Computational photoacoustic imaging with sparsity-based optimization of the initial pressure distribution
  • Citing Conference Paper
  • February 2018

... The main polynomial methodology for synthesis application may be the spectral reprojection approach [57], in which Fourier coefficients are reprojected onto other basis functions conformed by polynomials. For instance, the Gegenbauer polynomials [58-60] and general polynomials using inverse methods [61,62] are successful in removing the Gibbs phenomenon. In the same direction, Chebyshev polynomials produce a strongly nonuniform distribution of points with good performance for interpolation [63,64]. ...

Finite Fourier Frame Approximation Using the Inverse Polynomial Reconstruction Method

Journal of Scientific Computing