Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Bayesian Inference”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 829 records · Page 46

The Influence of Shallow Subsurface Properties on Particle Motion in Acoustic-Seismic Coupling

Atmospheric acoustic waves transmit energy into the solid Earth through air-to-ground coupling. These waves are recorded by seismic sensors and provide insight into both atmospheric phenomena and subsurface properties. Interpreting these signals is often challenging because they are modulated by subsurface structure and the incidence angle of the acoustic wave. This study examines acoustic--seismic coupling generated by the 2012 Camp Minden Explosion, which was recorded by hundreds of seismoacoustic stations. We apply a novel technique to quantify the seismic particle motion, model coupled waves with a propagator matrix approach, and apply a Bayesian inversion to infer properties of the shallow subsurface. Our analysis reveals that prograde motion is widespread and focused in low shear-wave velocity regions, such as the Mississippi Embayment, and retrograde motion is more common in higher shear-velocity areas. Inversion results at some stations produce plausible subsurface models with strong waveform fits, while inversions at other sites are less successful. These results indicate prograde particle motion in air-to-ground coupled waves is more prevalent than previously recognized and may serve as a diagnostic for shallow velocity structure. Our comprehensive modeling and inversion framework provides a potential method to extract layered near-surface properties from acoustic-seismic coupling observations.

58 GEOSCIENCES↗

The Sixth Data Release of the Radial Velocity Experiment (Rave). II. Stellar Atmospheric Parameters, Chemical Abundances, and Distances

We present part 2 of the sixth and final Data Release (DR6) of the Radial Velocity Experiment (Rave), a magnitude-limited (9<I<12) spectroscopic survey of Galactic stars randomly selected in Earth’s southern hemisphere. The Rave medium-resolution spectra (R ∼ 7500) cover the Ca triplet region (8410–8795 Å) and span the complete time frame from the start of Rave observations on 2003 April 12 to their completion on 2013 April 4. In the second of two publications, we present the data products derived from 518,387 observations of 451,783 unique stars using a suite of advanced reduction pipelines focusing on stellar atmospheric parameters, in particular purely spectroscopically derived stellar atmospheric parameters (T{sub eff}, logg, and the overall metallicity), enhanced stellar atmospheric parameters inferred via a Bayesian pipeline using Gaia DR2 astrometric priors, and asteroseismically calibrated stellar atmospheric parameters for giant stars based on asteroseismic observations for 699 K2 stars. In addition, we provide abundances of the elements Fe, Al, and Ni, as well as an overall [α/Fe] ratio obtained using a new pipeline based on the GAUGUIN optimization method that is able to deal with variable signal-to-noise ratios. The Rave DR6 catalogs are cross-matched with relevant astrometric and photometric catalogs, and are complemented by orbital parameters and effective temperatures based on the infrared flux method. The data can be accessed via the Rave website (http://rave-survey.org) or the Vizier database.

79 ASTRONOMY AND ASTROPHYSICS↗

Tight Bound on the Neutron Star Radius with Quasiperiodic Oscillations in Short Gamma-Ray Bursts

Abstract Quasiperiodic oscillations (QPOs) have been recently discovered in the short gamma-ray bursts (GRBs) 910711 and 931101B. Their frequencies are consistent with those of the quasiradial and quadrupolar oscillations of binary neutron star (BNS) merger remnants, as obtained in numerical relativity simulations. These simulations reveal quasi-universal relations between the remnant oscillation frequencies and the tidal coupling constant of the binaries. Under the assumption that the observed QPOs are due to these postmerger oscillations, we use the frequency–tide relations in a Bayesian framework to infer the source redshift, as well as the chirp mass and the binary tidal deformability of the BNS progenitors for GRBs 910711 and 931101B. We further use this inference to estimate bounds on the mass–radius relation for neutron stars. By combining the estimates from the two GRBs, we find a 68% credible range R 1.4 = 12.4 8 − 0.40 + 0.41 km for the radius of a neutron star with mass M = 1.4 M ⊙ , which is one of the tightest bounds to date.

Guedes, Victor↗

DESI Spectroscopy of HETDEX Emission-line Candidates. I. Line Discrimination Validation

The Hobby–Eberly Dark Energy Experiment (HETDEX) is an untargeted spectroscopic galaxy survey that uses Lyα-emitting galaxies (LAEs) as tracers of 1.9 < z < 3.5 large-scale structure. Most detections consist of a single emission line, whose identity is inferred via a Bayesian analysis of ancillary data. To determine the accuracy of these line identifications, HETDEX detections were observed with the Dark Energy Spectroscopic Instrument (DESI). In two DESI pointings, high-confidence spectroscopic redshifts are obtained for 1157 sources, including 982 LAEs. The DESI spectra are used to evaluate the accuracy of the HETDEX object classifications and tune the methodology to achieve the HETDEX science requirement of ≲2% contamination of the LAE sample by low-redshift emission-line galaxies, while still assigning 96% of the true Lyα emission sample with the correct spectroscopic redshift. We compare emission-line measurements between the two experiments assuming a simple Gaussian line fitting model. Fitted values for the central wavelength of the emission line, the measured line flux, and line widths are consistent between the surveys within uncertainties. Derived spectroscopic redshifts, from the two classification pipelines, when both agree as an LAE classification, are consistent to within $\langle$Δz/(1 + z)$\rangle$ = 6.9 × 10 −5 with an rms scatter of 3.3 × 10 −4 . Data are available at https://data.desi.lbl.gov/desi/public/dr1/vac/dr1/hetdex.

79 ASTRONOMY AND ASTROPHYSICS↗

Monte Carlo Control Loops for Cosmic Shear Cosmology with DES Year 1

Weak lensing by large-scale structure is a powerful probe of cosmology and of the dark universe. This cosmic shear technique relies on the accurate measurement of the shapes and redshifts of background galaxies and requires precise control of systematic errors. The Monte Carlo Control Loops (MCCL) is a forward modelling method designed to tackle this problem. It relies on the Ultra Fast Image Generator (UFig) to produce simulated images tuned to match the target data statistically, followed by calibrations and tolerance loops. We present the first end-to-end application of this method, on the Dark Energy Survey (DES) Year 1 wide field imaging data. We simultaneously measure the shear power spectrum $C_{\ell}$ and the redshift distribution $n(z)$ of the background galaxy sample. The method includes maps of the systematic sources, Point Spread Function (PSF), an Approximate Bayesian Computation (ABC) inference of the simulation model parameters, a shear calibration scheme, and the fast estimation of the covariance matrix. We find a close statistical agreement between the simulations and the DES Y1 data using an array of diagnostics. In a non-tomographic setting, we derive a set of $C_\ell$ and $n(z)$ curves that encode the cosmic shear measurement, as well as the systematic uncertainty. Following a blinding scheme, we measure the combination of $\Omega_m$, $\sigma_8$, and intrinsic alignment amplitude $A_{\rm{IA}}$, defined as $S_8D_{\rm{IA}} = \sigma_8(\Omega_m/0.3)^{0.5}D_{\rm{IA}}$, where $D_{\rm{IA}}=1-0.11(A_{\rm{IA}}-1)$. We find $S_8D_{\rm{IA}}=0.895^{+0.054}_{-0.039}$, where systematics are at the level of roughly 60\% of the statistical errors. We discuss these results in the context of earlier cosmic shear analyses of the DES Y1 data. Our findings indicate that this method and its fast runtime offer good prospects for cosmic shear measurements with future wide-field surveys.

79 ASTRONOMY AND ASTROPHYSICS↗

Hierarchical Inference of the Lensing Convergence from Photometric Catalogs with Bayesian Graph Neural Networks

Abstract We present a Bayesian graph neural network (BGNN) that can estimate the weak lensing convergence ( κ ) from photometric measurements of galaxies along a given line of sight (LOS). The method is of particular interest in strong gravitational time-delay cosmography (TDC), where characterizing the “external convergence” ( κ ext ) from the lens environment and LOS is necessary for precise Hubble constant ( H 0 ) inference. Starting from a large-scale simulation with a κ resolution of ∼1′, we introduce fluctuations on galaxy–galaxy lensing scales of ∼1″ and extract random sight lines to train our BGNN. We then evaluate the model on test sets with varying degrees of overlap with the training distribution. For each test set of 1000 sight lines, the BGNN infers the individual κ posteriors, which we combine in a hierarchical Bayesian model to yield constraints on the hyperparameters governing the population. For a test field well sampled by the training set, the BGNN recovers the population mean of κ precisely and without bias (within the 2 σ credible interval), resulting in a contribution to the H 0 error budget well under 1%. In the tails of the training set with sparse samples, the BGNN, which can ingest all available information about each sight line, extracts a stronger κ signal compared to a simplified version of the traditional method based on matching galaxy number counts, which is limited by sample variance. Our hierarchical inference pipeline using BGNNs promises to improve the κ ext characterization for precision TDC. The code is available as a public Python package, Node to Joy ⏬ .

79 ASTRONOMY AND ASTROPHYSICS↗

Bayesian multiple-instance motif discovery with BAMBI: inference of recombinase and transcription factor binding sites

Finding conserved motifs in genomic sequences represents one of essential bioinformatic problems. However, achieving high discovery performance without imposing substantial auxiliary constraints on possible motif features remains a key algorithmic challenge. This work describes BAMBI—a sequential Monte Carlo motifidentification algorithm, which is based on a position weight matrix model that does not require additional constraints and is able to estimate such motif properties as length, logo, number of instances and their locations solely on the basis of primary nucleotide sequence data. Furthermore, should biologically meaningful information about motif attributes be available, BAMBI takes advantage of this knowledge to further refine the discovery results. In practical applications, we show that the proposed approach can be used to find sites of such diverse DNA-binding molecules as the cAMP receptor protein (CRP) and Din-family site-specific serine recombinases. Results obtained by BAMBI in these and other settings demonstrate better statistical performance than any of the four widely-used profile-based motif discovery methods: MEME, BioProspector with BioOptimizer, SeSiMCMC and Motif Sampler as measured by the nucleotide-level correlation coefficient. Additionally, in the case of Din-family recombinase target site discovery, the BAMBI-inferred motif is found to be the only one functionally accurate from the underlying biochemical mechanism standpoint. C++and Matlab code is available at http://www.ee.columbia.edu/guido/ BAMBI or http://genomics.lbl.gov/BAMBI/.

59 BASIC BIOLOGICAL SCIENCES↗

Inferring Structural Parameters of Low-Surface-Brightness-Galaxies with Uncertainty Quantification using Bayesian Neural Networks

Measuring the structural parameters (size, total brightness, light concentration, etc.) of galaxies is a significant first step towards a quantitative description of different galaxy populations. In this work, we demonstrate that a Bayesian Neural Network (BNN) can be used for the inference, with uncertainty quantification, of such morphological parameters from simulated low-surface-brightness galaxy images. Compared to traditional profile-fitting methods, we show that the uncertainties obtained using BNNs are comparable in magnitude, well-calibrated, and the point estimates of the parameters are closer to the true values. Our method is also significantly faster, which is very important with the advent of the era of large galaxy surveys and big data in astrophysics.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Exploring the Impact of Nuclear Data Uncertainties in Ultra-high Resolution Gamma Spectroscopy for Isotopic Analysis Using Approximate Bayesian Computation

High purity germanium (HPGe) currently provides the highest readily available resolution gamma detection for a broad range of radiation measurements, but microcalorimetry is a developing option that has considerably higher resolution even than HPGe. Superior microcalorimetry resolution offers the potential to better distinguish closely spaced X-rays and gamma-rays, a common challenge for the low energy spectral region near 100 keV from special nuclear materials, and the higher signal-to-background ratio also confers an advantage in detection limit. As microcalorimetry continues to develop, it is timely to assess the impact of uncertainties in detector and item response functions and in basic nuclear data, such as branching ratios and half-lives, used to interpret spectra in terms of the contributory radioactive isotopes. We illustrate that a new inference option known as approximate Bayesian computation (ABC) is effective and convenient both for isotopic inference and for uncertainty quantification for microcalorimetry. The ABC approach opens a pathway to new and more powerful implementations for practical applications than currently available.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Scalable Bayesian Nonparametric Clustering and Classification

We develop a scalable multi-step Monte Carlo algorithm for inference under a large class of nonparametric Bayesian models for clustering and classification. Each step is “embarrassingly parallel” and can be implemented using the same Markov chain Monte Carlo sampler. The simplicity and generality of our approach makes inference for a wide range of Bayesian nonparametric mixture models applicable to large datasets. Specifically, we apply the approach to inference under a product partition model with regression on covariates. We show results for inference with two motivating data sets: a large set of electronic health records (EHR) and a bank telemarketing dataset. We find interesting clusters and competitive classification performance relative to other widely used competing classifiers. Supplementary materials for this article are available online.

97 MATHEMATICS AND COMPUTING↗

Multimodal parameter spaces of a complex multi-channel neuron model

One of the most common types of models that helps us to understand neuron behavior is based on the Hodgkin–Huxley ion channel formulation (HH model). A major challenge with inferring parameters in HH models is non-uniqueness: many different sets of ion channel parameter values produce similar outputs for the same input stimulus. Such phenomena result in an objective function that exhibits multiple modes (i.e., multiple local minima). This non-uniqueness of local optimality poses challenges for parameter estimation with many algorithmic optimization techniques. HH models additionally have severe non-linearities resulting in further challenges for inferring parameters in an algorithmic fashion. To address these challenges with a tractable method in high-dimensional parameter spaces, we propose using a particular Markov chain Monte Carlo (MCMC) algorithm, which has the advantage of inferring parameters in a Bayesian framework. The Bayesian approach is designed to be suitable for multimodal solutions to inverse problems. We introduce and demonstrate the method using a three-channel HH model. We then focus on the inference of nine parameters in an eight-channel HH model, which we analyze in detail. We explore how the MCMC algorithm can uncover complex relationships between inferred parameters using five injected current levels. The MCMC method provides as a result a nine-dimensional posterior distribution, which we analyze visually with solution maps or landscapes of the possible parameter sets. The visualized solution maps show new complex structures of the multimodal posteriors, and they allow for selection of locally and globally optimal value sets, and they visually expose parameter sensitivities and regions of higher model robustness. We envision these solution maps as enabling experimentalists to improve the design of future experiments, increase scientific productivity and improve on model structure and ideation when the MCMC algorithm is applied to experimental data.

97 MATHEMATICS AND COMPUTING↗

A Bayesian approach to the long-baseline neutrino oscillation sensitivity of DUNE

The sensitivity of the Deep Underground Neutrino Experiment (DUNE) to neutrino oscillation is evaluated using a Bayesian Markov Chain Monte Carlo (MCMC) approach. This analysis uses the same underlying sensitivity inputs as previous DUNE studies [Eur. Phys. J. C 80, 978 (2020)], and therefore does not present updated DUNE sensitivities, but instead explores the additional inferences accessible using a Bayesian approach. We present four-dimensional posterior probability distributions of the oscillation parameters, highlighting the breadth of correlation in the parameter space of interest, especially between $\sin^2 θ_{23}$ and $\sin^2 θ_{13}$. We exploit the flexibility of the Bayesian framework to incorporate parameter constraints post hoc and assess the impact of applying a reactor short-baseline $θ_{13}$ constraint. A significant increase in the sensitivity to the $θ_{23}$ octant is found when including the constraint. Posterior distributions of derived quantities can be easily constructed from MCMC results. This work presents the first study of DUNE's sensitivity to the Jarlskog invariant, $J$, a quantity that provides a parametrisation-independent measure of charge-parity violation in the leptonic sector.

Abbaslu, Saeed [IPM, Tehran] (ORCID:00000003356771↗

Coupled flow accumulation and atmospheric blocking govern flood duration

Abstract We present a physically based Bayesian network model for inference and prediction of flood duration that allows for a deeper understanding of the nexus of antecedent flow regime, atmospheric blocking, and moisture transport/release mechanisms. Distinct scaling factors at the land surface and regional atmospheric levels are unraveled using this Bayesian network model. Land surface scaling explains the variability in flood duration as a function of cumulative exceedance index, a new measure that represents the evolution of the flood in the basin. Dynamic atmospheric scaling explains the cumulative exceedance index using the interaction between atmospheric blocking system and the synergistic model of wind divergence and atmospheric water vapor. Our findings underline that the synergy between a large persistent low-pressure blocking system and a higher rate of divergent wind often triggers a long-duration flood, even in the presence of moderate moisture supply in the atmosphere. This condition in turn causes an extremely long-duration flood if the basin-wide cumulative flow prior to the flood event was already high. Thus, this new land-atmospheric interaction framework integrates regional flood duration scaling and dynamic atmospheric scaling to enable the coupling of ‘horizontal’ (for example, streamflow accumulation inside the basin) and ‘vertical’ flow of information (for example, interrelated land and ocean-atmosphere interactions), providing an improved understanding of the critical forcing of regional hydroclimatic systems. This Bayesian model approach is applied to the Missouri River Basin, which has the largest system of reservoirs in the United States. Our predictive model can aid in decision support systems for the protection of national infrastructure against long-duration flood events.

Najibi, Nasser (ORCID:0000000205157192)↗

Inference of Unresolved Point Sources at High Galactic Latitudes Using Probabilistic Catalogs

The detection of point sources in images is a fundamental operation in astrophysics, and is crucial for constraining population models of the underlying point sources or characterizing the background emission. Standard techniques fall short in the crowded-field limit, losing sensitivity to faint sources and failing to track their covariance with close neighbors. We construct a Bayesian framework to perform inference of faint or overlapping point sources. The method involves probabilistic cataloging, where samples are taken from the posterior probability distribution of catalogs consistent with an observed photon count map. In order to validate our method, we sample random catalogs of the gamma-ray sky in the direction of the North Galactic Pole (NGP) by binning the data in energy and point-spread function classes. Using three energy bins spanning 0.3–1, 1–3, and 3–10 GeV, we identify 270{sub −10}{sup +30} point sources inside a 40{sup ∘}×40{sup ∘} region around the NGP above our point-source inclusion limit of 3×10{sup −11} cm{sup −2} s{sup −1} sr{sup −1} GeV{sup −1} at the 1–3 GeV energy bin. Modeling the flux distribution as a power law, we infer the slope to be −1.92{sub −0.05}{sup +0.07} and estimate the contribution of point sources to the total emission as 18{sub −2}{sup +2}%. These uncertainties in the flux distribution are fully marginalized over the number as well as the spatial and spectral properties of the unresolved point sources. This marginalization allows a robust test of whether the apparently isotropic emission in an image is due to unresolved point sources or of truly diffuse origin.

79 ASTRONOMY AND ASTROPHYSICS↗

Inferring Atmospheric Release Characteristics in a Large Computer Experiment using Bayesian Adaptive Splines

An atmospheric release of hazardous material, whether accidental or intentional, can be catastrophic for those in the path of the plume. Predicting the path of a plume based on characteristics of the release (location, amount and duration) and meteorological conditions is an active research area highly relevant for emergency and long-term response to these releases. As a result, researchers have developed particle dispersion simulators to provide plume path predictions that incorporate release characteristics and meteorological conditions. However, since release characteristics and meteorological conditions are often unknown, the inverse problem is of great interest, that is, based on all the observations of the plume so far, what can be inferred about the release characteristics? This is the question we seek to answer using plume observations from a controlled release at the Diablo Canyon Nuclear Power Plant in Central California. With access to a large number of evaluations of a computationally expensive particle dispersion simulator that includes continuous and categorical inputs and spatio-temporal output, building a fast statistical surrogate model (or emulator) presents many statistical challenges, but is an essential tool for inverse modeling and sensitivity analysis. We achieve accurate emulation using Bayesian adaptive splines to model weights on empirical orthogonal functions. Here, we use this emulator as well as appropriately identifiable simulator discrepancy and observational error models to calibrate the simulator, thus finding a posterior distribution of characteristics of the release. Since the release was controlled, these characteristics are known, making it possible to compare our findings to the truth.

54 ENVIRONMENTAL SCIENCES↗

Active Subspace Methods for Data-Intensive Inverse Problems (Final Report)

Fostered by advances in computing, simulation and data science have emerged as the third and fourth paradigms enabling scientific discovery. Many mathematical challenges arise when integrating these paradigms to produce new knowledge. One of the most important challenges is the inverse or calibration problem: find the inputs of a simulation such that its outputs agree with a given set of measurements. As both the cost of the complex simulations and the volume of measurement data sets increase, intuition-driven trial-and-error methods for calibration quickly become untenable; modern scientists need more computationally efficient and mathematically rigorous methods. When measurements and simulated predictions contain uncertainty, the Bayesian perspective on statistical inference provides a popular mathematical framework for developing computational methods to solve inverse problems. Markov chain Monte Carlo (MCMC) methods are a mainstay of this framework; they characterize a probability distribution on the space of model inputs that is conditioned on the given measurements. However, despite recent advances, MCMC methods remain impractical for expensive simulations with more than a handful of inputs. At its heart, MCMC searches the space of inputs for corresponding outputs that match measurements, and so it is afflicted with the curse of dimensionality. Additionally, MCMC methods become less efficient as the volume of the measurement data increases, particularly if the measurements are redundant. To make MCMC—and Bayesian methods, in general—amenable to today’s computer models with millions of inputs and terabytes of measurement data, one must devise methods to reduce the dimension of both the simulation inputs and the measurements. For many models used in practice, the outputs vary primarily on a low-dimensional manifold of the nominally high-dimensional input space. Recently developed active subspace methods discover this low-dimensional manifold and exploit it to enable analyses typically suited for low-dimensional settings (e.g., statistical inversion of complex systems). We hypothesize that active subspace methods can provide the necessary dimension reduction, enabling existing Bayesian methods to find solutions for a large class of otherwise intractable statistical inverse problems. We will test the hypothesis with a series of mathematical analyses and computational experiments that will proceed along three research veins: (i) integrating active subspace methods into methods for statistical inversion, (ii) addressing current challenges in active subspace methods, and (iii) incorporating methods for nonlinear dimensionality reduction into active subspace methods. We will apply the methods we develop to real inverse problems in chemical kinetics and turbulent flame modeling. Our team combines expertise in methods for inverse problems, dimension reduction, and reduced order modeling. With a history of active collaboration and thoughtful engagement, we bring enthusiasm and fresh perspectives to a well studied subject. We are excited by the potential opportunity to work together to extend and apply active subspace methods to data-intensive inverse problems.

97 MATHEMATICS AND COMPUTING↗

Active Subspace Methods for Data-Intensive Inverse Problems

Fostered by advances in computing, simulation and data science have emerged as the third and fourth paradigms enabling scientific discovery. Many mathematical challenges arise when integrating these paradigms to produce new knowledge. One of the most important challenges is the inverse or calibration problem: find the inputs of a simulation such that its outputs agree with a given set of measurements. As both the cost of the complex simulations and the volume of measurement data sets increase, intuition-driven trial-and-error methods for calibration quickly become untenable; modern scientists need more computationally efficient and mathematically rigorous methods. When measurements and simulated predictions contain uncertainty, the Bayesian perspective on statistical inference provides a popular mathematical framework for developing computational methods to solve inverse problems. Markov chain Monte Carlo (MCMC) methods are a mainstay of this framework; they characterize a probability distribution on the space of model inputs that is conditioned on the given measurements. However, despite recent advances, MCMC methods remain impractical for expensive simulations with more than a handful of inputs. At its heart, MCMC searches the space of inputs for corresponding outputs that match measurements, and so it is afflicted with the curse of dimensionality. Additionally, MCMC methods become less efficient as the volume of the measurement data increases, particularly if the measurements are redundant. To make MCMC—and Bayesian methods, in general—amenable to today’s computer models with millions of inputs and terabytes of measurement data, one must devise methods to reduce the dimension of both the simulation inputs and the measurements. For many models used in practice, the outputs vary primarily on a low-dimensional manifold of the nominally high-dimensional input space. Recently developed active subspace methods discover this low-dimensional manifold and exploit it to enable analyses typically suited for low-dimensional settings (e.g., statistical inversion of complex systems). We hypothesize that active subspace methods can provide the necessary dimension reduction, enabling existing Bayesian methods to find solutions for a large class of otherwise intractable statistical inverse problems. We will test the hypothesis with a series of mathematical analyses and computational experiments that will proceed along three research veins: (i) integrating active subspace methods into methods for statistical inversion, (ii) addressing current challenges in active subspace methods, and (iii) incorporating methods for nonlinear dimensionality reduction into active subspace methods. We will apply the methods we develop to real inverse problems in chemical kinetics and turbulent flame modeling. Our team combines expertise in methods for inverse problems, dimension reduction, and reduced order modeling. With a history of active collaboration and thoughtful engagement, we bring enthusiasm and fresh perspectives to a well studied subject. We are excited by the potential opportunity to work together to extend and apply active subspace methods to data-intensive inverse problems.

97 MATHEMATICS AND COMPUTING↗