Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational costs”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Variational quantum algorithms

Applications such as simulating complicated quantum systems or solving large-scale linear algebra problems are very challenging for classical computers, owing to the extremely high computational cost. Quantum computers promise a solution, although fault-tolerant quantum computers will probably not be available in the near future. Current quantum devices have serious constraints, including limited numbers of qubits and noise processes that limit circuit depth. Variational quantum algorithms (VQAs), which use a classical optimizer to train a parameterized quantum circuit, have emerged as a leading strategy to address these constraints. VQAs have now been proposed for essentially all applications that researchers have envisaged for quantum computers, and they appear to be the best hope for obtaining quantum advantage. Nevertheless, challenges remain, including the trainability, accuracy and efficiency of VQAs. Here we overview the field of VQAs, discuss strategies to overcome their challenges and finally, we highlight the exciting prospects for using them to obtain quantum advantage.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Source-to-Source Automatic Differentiation of OpenMP Parallel Loops

This article presents our work toward correct and efficient automatic differentiation of OpenMP parallel worksharing loops in forward and reverse mode. Automatic differentiation is a method to obtain gradients of numerical programs, which are crucial in optimization, uncertainty quantification, and machine learning. The computational cost to compute gradients is a common bottleneck in practice. For applications that are parallelized for multicore CPUs or GPUs using OpenMP, one also wishes to compute the gradients in parallel. Here, we propose a framework to reason about the correctness of the generated derivative code, from which we justify our OpenMP extension to the differentiation model. We implement this model in the automatic differentiation tool Tapenade and present test cases that are differentiated following our extended differentiation procedure. Performance of the generated derivative programs in forward and reverse mode is better than sequential, although our reverse mode often scales worse than the input programs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Performance Analysis of the Expected Track Length Estimator

This work investigates whether performance of the MCNP code is improved by the implementation of the expected track length estimator. The expected track length estimator is known to decrease variance when compared to the track length estimator in many classes of Monte Carlo particle transport simulations. However, the computational cost of computing an exponent for every particle collision within a tallied cell has previously been considered prohibitively expensive. Therefore, the goal of this work is to determine whether the variance improvements seen by the expected track length estimator in most cases makes up for the increase in transport time when implemented in the MCNP code.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1979

Reduction of computer usage costs in predicting unsteady aerodynamic loadings caused by control surface motions: Computer program description

A digital computer program was developed to calculate unsteady loadings caused by motions of lifting surfaces with leading edge and trailing edge controls based on the subsonic kernel function approach. The pressure singularities at hinge line and side edges were extracted analytically as a preliminary step to solving the integral equation of collocation. The program calculates generalized aerodynamic forces for user supplied deflection modes. Optional intermediate output includes pressure at an array of points, and sectional generalized forces. From one to six controls on the half span can be accomodated.

Petrarca, J. R.↗
DOE OSTI2023

Cost-constrained adaptive simulations of transient spray combustion in a gas turbine combustor

Predictive high-fidelity simulations of turbulent spray combustion must capture the combined effects of complex chemistry, multiphase evaporating flow and spray-flame interactions to achieve physical accuracy. Finite-rate chemistry (FRC) combined with a realistic chemical mechanism is a combustion model well-suited for this purpose, but has a high computational cost due to the large number and stiffness of transported chemical species. In contrast, flamelet-based models achieve lower cost by transporting a small number of quantities of reduced stiffness, but assumptions regarding local flame topology, boundary conditions and inter-phase coupling limit their physical accuracy. Recently, the Pareto-efficient combustion (PEC) framework was developed to dynamically assign combustion models based on local cost and accuracy metrics in gas-phase reacting flows. In this work, we extend this PEC framework to spray combustion through the rigorous analysis of the multiphase coupling terms in the governing equations. The derivation shows that spray evaporation causes errors in the prediction of species mass fractions for flamelet-based models due to the sensitivity of the local thermo-chemical state to changes in composition caused by fuel vaporization across combustion regimes present in practical spray combustion devices. Sub-model assignment is formulated as a multiple-choice knapsack problem, where computational cost is directly controlled through the fraction of the domain assigned to the FRC sub-model. The extended PEC formulation is applied to the simulation of a realistic rich-quench-lean gas turbine combustor at steady-state conditions, as well as transient operation resulting in lean blow-out (LBO). Analysis of transient simulations during LBO demonstrates the extended PEC formulation’s capacity to dynamically adapt to changing conditions within the combustor. Transient combustor dynamics are shown to approach convergence with limited increases in computational cost, while retaining substantial computational cost reduction compared to monolithic FRC simulations. Through PEC simulations with increasing fractions of the domain assigned to FRC, monolithic flamelet simulations are shown to over-predict flame stability during LBO. Finally, the extended PEC formulation is thus shown to overcome deficiencies of monolithic models by controlling modeling error for multiphase combustion modeling.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2020

Multi-Model and Multi-Scale Global Sensitivity Analysis for Identifying Controlling Processes of Complex Systems

An environmental model consists of multiple process level sub-models, and each sub-model represents a process that is key to the operation of the simulated system. Global sensitivity analysis methods have been widely used to identify important processes for system model development and improvement. The existing methods of global sensitivity analysis only consider parametric uncertainty, and are not capable of handling model uncertainty caused by multiple process models that arise from competing hypotheses about one or more processes. To address this problem, this project develops a new method to probe model output sensitivity to competing process models by integrating model averaging methods with variance-based global sensitivity analysis to address uncertainty in process models and parameters. The new method yields three process sensitivity indices. The first one is called first-order process sensitivity index, and it is derived as a single summary measure of relative process importance. Evaluating the index is computationally expensive, because it relies in a Monte Carlo scheme that requires thousands and even millions of model executions. To reduce computational cost, this project develops a computationally efficient, quasi Monte Carlo method, and this method is presented in Chapter 2 of this report with and a numerical example for demonstration. The numerical example shows that the results of the quasi Monte Carlo method are substantially close to those of the full Monte Carlo method, but the computational cost of the quasi Monte Carlo method is only 0.7% of that of the full Monte Carlo method. The second index is called total-effect process sensitivity index, and it measures interactions between different processes. Therefore, this sensitivity index includes the first-order process sensitivity index, and can be used to identify influential processes. On the other hand, the total-effect process sensitivity index can also be used to screen non-influential processes. This is demonstrated by two numerical examples using the Sobol-G* functions and groundwater flow models that consider recharge process, geological process, and snowmelt process. The numerical examples shows that the total-effect process sensitivity index is more informative than the first-order process sensitivity. The derivation of the process sensitivity index and the numerical examples are discussed in Chapter 3. Chapter 4 presents two computationally efficient methods for screening non-influential processes to exclude them from further investigation. The two methods are the multi-model difference-based sensitivity (MMDS) analysis method, which can be implemented using the Latin Hypercube Sampling. The second one is the implementation of MMDS method using a binning method. The numerical example for the Sobol-G* function indicates the two methods are capable of identifying non-influential models, and the numerical examples for the groundwater flow and reactive transport show that the two methods are effective for groundwater problems. However, it should be noted that the two methods are numerical approximations, and they can only be used for screening non-influential processes, not for ranking importance of system processes. All the sensitivity analysis methods are implemented by developing python codes, and the codes are in a software called SAMMPY: a python package for process sensitivity analysis under multiple models. The SAMMPY design and structure are discussed in Chapter 5, and the package is released to the public for free download.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Enhanced Data Efficiency Using Deep Neural Networks and Gaussian Processes for Aerodynamic Design Optimization

Adjoint-based optimization methods are attractive for aerodynamic shape design primarily due to their computational costs being independent of the dimensionality of the input space and their ability to generate high-fidelity gradients that can then be used in a gradient-based optimizer. This makes them very well suited for high-fidelity simulation based aerodynamic shape optimization of highly parametrized geometries such as aircraft wings. However, the development of adjoint-based solvers involve careful mathematical treatment and their implementation require detailed software development. Furthermore, they can become prohibitively expensive when multiple optimization problems are being solved, each requiring multiple restarts to circumvent local optima. In this work, we propose a machine learning enabled, surrogate-based framework that replaces the expensive adjoint solver, without compromising on predicting predictive accuracy. Specifically, we first train a deep neural network (DNN) from training data generated from evaluating the high-fidelity simulation model on a model-agnostic design of experiments on the geometry shape parameters. The optimum shape may then be computed by using a gradient-based optimizer coupled with the trained DNN. Subsequently, we also perform a gradient-free Bayesian optimization, where the trained DNN is used as the prior mean. We observe that the latter framework (DNN-BO) improves upon the DNN-only based optimization strategy for the same computational cost. Overall, this framework predicts the true optimum with very high accuracy, while requiring far fewer high-fidelity function calls compared to the adjoint-based method. Furthermore, we show that multiple optimization problems can be solved with the same machine learning model with high accuracy, to amortize the offline costs associated with constructing our models. Our methodology finds applications in the early stages of aerospace design. (C) 2021 Published by Elsevier Masson SAS.

Renganathan, S. Ashwin↗
DOE OSTI2024

Improving the precision of forces in real-space pseudopotential density functional theory

The high-order finite difference real-space pseudopotential density functional theory (DFT) approach is a valuable method for large-scale, massively parallel DFT calculations. A significant challenge in the approach is the oscillating “egg-box” error introduced by aliasing associated with a coarse grid spacing. To address this issue while minimizing computational cost, we developed a finite difference interpolation (FDI) scheme [Roller et al., J. Chem. Theory Comput. 19, 3889 (2023)] as a means of exploiting the high resolution of the pseudopotential to reduce egg-box effects systematically. Here, we show an implementation of this method in the PARSEC code and examine the practical utility of the combination of FDI with additional methods for improving force precision and/or reducing its computational cost, including orbital-based forces, compensating charges (namely, adding and subtracting a judiciously chosen charge density such that the total density is unaltered), and a modified spatial domain in which the real-space grid is defined. Using selected small molecules, as well as metallic Li, as test cases, we show that a combination of all four aspects leads to a significant reduction in computational cost while retaining a high level of precision that supports accurate structures and vibrational spectra, as well as stable and accurate molecular dynamics runs.

Chemistry↗
DOE OSTI2020

Improved pore network models to simulate single-phase flow in porous media by coupling with lattice Boltzmann method

In this paper, different pore network models to simulate single-phase flow in porous media are built and their accuracy is evaluated. In addition to the conventional pore network model (CPNM) which consists of regular pore bodies and throat bonds, three improved pore network models (IPNMs) are developed allowing to better describing the real pore and throat geometry. The first improved pore network model (IPNM1) replaces the regular throat bond with a throat bond showing the real throat cross section. The second improvement (IPNM2) uses a series of sub-throat bonds with varying cross sections to better describe the real throat geometry, which is firstly proposed in this paper. The third model (IPNM3) extracts the real pore-throat-pore geometry without simplification. The conductance of fluid flow through these more realistic throat bonds is calculated by the lattice Boltzmann method (LBM). The accuracy and computational efficiency of the different pore network models are evaluated taking the LBM simulation over the whole porous medium as reference solution. The global permeability and detailed pressure distributions in the pores for the different pore network models are validated. The results show that the accuracy of the pore network model increases from CPNM to IPNM3, but at the expense of increasing computational cost. This study suggests that IPNM3 can replace a whole-domain LBM simulation with similar accuracy but much lower computational cost. As a first-order approximation the newly proposed IPNM2 is suggested as good compromise between accuracy and computational cost.

42 ENGINEERING↗
NASA NTRS2005

Three-Dimensional Aeroelastic and Aerothermoelastic Behavior in Hypersonic Flow

The aeroelastic and aerothermoelastic behavior of three-dimensional configurations in hypersonic flow regime are studied. The aeroelastic behavior of a low aspect ratio wing, representative of a fin or control surface on a generic hypersonic vehicle, is examined using third order piston theory, Euler and Navier-Stokes aerodynamics. The sensitivity of the aeroelastic behavior generated using Euler and Navier-Stokes aerodynamics to parameters governing temporal accuracy is also examined. Also, a refined aerothermoelastic model, which incorporates the heat transfer between the fluid and structure using CFD generated aerodynamic heating, is used to examine the aerothermoelastic behavior of the low aspect ratio wing in the hypersonic regime. Finally, the hypersonic aeroelastic behavior of a generic hypersonic vehicle with a lifting-body type fuselage and canted fins is studied using piston theory and Euler aerodynamics for the range of 2.5 less than or equal to M less than or equal to 28, at altitudes ranging from 10,000 feet to 80,000 feet. This analysis includes a study on optimal mesh selection for use with Euler aerodynamics. In addition to the aeroelastic and aerothermoelastic results presented, three time domain flutter identification techniques are compared, namely the moving block approach, the least squares curve fitting method, and a system identification technique using an Auto-Regressive model of the aeroelastic system. In general, the three methods agree well. The system identification technique, however, provided quick damping and frequency estimations with minimal response record length, and therefore o ers significant reductions in computational cost. In the present case, the computational cost was reduced by 75%. The aeroelastic and aerothermoelastic results presented illustrate the applicability of the CFL3D code for the hypersonic flight regime.

McNamara, Jack J.↗
NASA NTRSDate not supplied

A Reynolds-Averaged Navier-Stokes Perspective for the High Lift Common Research Model Using the LAVA Framework

An in-depth assessment of the High Lift-Common Research Model (HL-CRM) aerodynamic performance is made using a Reynolds-Averaged Navier-Stokes (RANS) methodology. Results presented here were produced in support of the 4th AIAA High Lift Prediction Workshop(HLPW-4), with additional simulation results and analysis used to support findings from the workshop. Mesh resolution, RANS closure models, and tunnel effects were among the sources of simulation sensitivity addressed, all in the pursuit of evaluating best-practice simulation methods for complex high-lift configurations. In general, free-air simulations using RANS yield accurate predictions of integrated loads in the pre-stall regime for the HL-CRM, while strong sensitivity to simulation method is observed near CLmax. Additionally, a study assessing changes in aerodynamic performance due to flap deflection angle indicated strong sensitivity to turbulence model closure and mesh resolution, particularly at the highest deflection setting. Several available corrections for the Spalart-Allmaras (SA) turbulence model were tested and generally introduced more error relative to the experiment in comparison to the baseline SA closure model. The Standard Menter Baseline Two-Equation (k-ωBSL) turbulence model was also explored, which arguably yielded results highly consistent with experiment, but at a substantially higher computational cost. Therefore, as a compromise between computational cost and accuracy, the baseline SA closure model was selected for additional HL-CRM studies that assess alternative solution methods. These strategies include “warm start” approaches, which initialize the simulation from a previously converged solution at a nearby angle of attack, unsteady calculations, and simulations that model the experimental wind tunnel. Results from these studies would reinforce the shortcomings of RANS in predicting aircraft performance at high-lift conditions, namely at high-αand highly loaded flap conditions, while also answering questions about appropriate modeling techniques to minimize the errors associated with RANS where possible

TTT↗
NASA NTRS1989

Thermodynamic cost of computation, algorithmic complexity and the information metric

Algorithmic complexity is discussed as a computational counterpart to the second law of thermodynamics. It is shown that algorithmic complexity, which is a measure of randomness, sets limits on the thermodynamic cost of computations and casts a new light on the limitations of Maxwell's demon. Algorithmic complexity can also be used to define distance between binary strings.

Zurek, W. H.↗
DOE OSTI2026

Improving ideal MHD equilibrium accuracy with physics-informed neural networks

We present a novel approach to compute three-dimensional magnetohydrodynamic equilibria with isotropic pressure profiles and nested surfaces by parametrizing Fourier modes with artificial neural networks (NNs). The full nonlinear global force residual of single equilibria across the volume in real space is then minimized with first order optimizers and compared to equilibria computed by conventional solvers. Already, we observe competitive computational cost to arrive at the same minimum residuals computable with existing codes. With increased computational cost, lower minima of the residual are computable with the NNs than with any other tested solver, establishing a new lower bound for the force residual. We use minimally complex NNs, and we expect significant improvements for solving not only single equilibria with NNs, but also for creating NN models valid over continuous distributions of equilibria.

ideal magnetohydrodynamics↗
DOE OSTI2026

Scaling kinetic Monte-Carlo simulations of grain growth with combined convolutional and graph neural networks

Graph neural networks (GNN) have emerged as a promising machine learning method for microstructure simulations such as grain growth. However, accurate modeling of realistic grain boundary networks requires large simulation cells, which GNN has difficulty scaling up to. To alleviate the computational costs and memory footprint of GNN, we suggest a hybrid architecture combining a convolutional neural network (CNN) based bijective autoencoder to compress the spatial dimensions, and a GNN that evolves the microstructure in the latent space of reduced spatial sizes. Our results demonstrate that the new design significantly reduces computational costs with using fewer message passing layer (from 12 down to 3) compared with GNN alone. The reduction in computational cost becomes more pronounced as the spatial size increases, indicating strong computational scalability. For the largest mesh evaluated (160 3 ), our method reduces memory usage and runtime in inference by 117× and 115×, respectively, compared with GNN-only baseline. More importantly, it shows higher accuracy and stronger spatiotemporal capability than the GNN-only baseline, especially in long-term testing. Such combination of scalability and accuracy is essential for simulating realistic material microstructures over extended time scales. The improvements can be attributed to the bijective autoencoder’s ability to compress information losslessly from spatial domain into a high dimensional feature space, thereby producing more expressive latent features for the GNN to learn from, while also contributing its own spatiotemporal modeling capability. Training data are generated from stochastic grain growth simulations, providing realistic variability for learning robust microstructure evolution. Comprehensive system validation confirms that the model is accurate, robust, and scalable.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Introducing the embedded random phase approximation: H 2 dissociative adsorption on Cu(111) as an exemplar

The random phase approximation (RPA) as a means of treating electron correlation recently has been shown to outperform standard density functional theory (DFT) approximations in a variety of cases. However, the computational cost of the RPA is substantially more than DFT, especially when aiming to study extended surfaces. Properly accounting for sufficient surface ensemble size, Brillouin zone sampling, and vacuum separation of periodic images in standard periodic-planewave-based DFT code raises the cost to achieve converged results. Here, we show that sub-system embedding schemes enable use of the RPA for modeling heterogeneous reactions at reduced computational cost. Further, we explore two different embedded RPA (emb-RPA) approaches, periodic emb-RPA and cluster emb-RPA. We use the (experimentally and theoretically) well-studied H 2 dissociative adsorption on Cu(111) as our exemplar, and first perform full periodic RPA calculations as a benchmark. The full RPA results match well the semi-empirical barrier fit to experimental observables and others derived from high-level computations, e.g., from recent embedded n-electron valence second order perturbation theory [Zhao et al., J. Chem. Theory Comput. 16(11), 7078–7088 (2020)] and quantum Monte Carlo [Doblhoff-Dier et al., J. Chem. Theory Comput. 13(7), 3208–3219 (2017)] simulations. Among the two emb-RPA approaches tested, the cluster emb-RPA accurately reproduces the energy profile (maximum error of 50 meV along the reaction pathway) while reducing the computational cost by approximately two orders of magnitude. We therefore expect that the embedded cluster approach will enable wider RPA implementation in heterogeneous catalysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS2012

Progress Toward Affordable High Fidelity Combustion Simulations Using Filtered Density Functions for Hypersonic Flows in Complex Geometries

Significant progress has been made in the development of subgrid scale (SGS) closures based on a filtered density function (FDF) for large eddy simulations (LES) of turbulent reacting flows. The FDF is the counterpart of the probability density function (PDF) method, which has proven effective in Reynolds averaged simulations (RAS). However, while systematic progress is being made advancing the FDF models for relatively simple flows and lab-scale flames, the application of these methods in complex geometries and high speed, wall-bounded flows with shocks remains a challenge. The key difficulties are the significant computational cost associated with solving the FDF transport equation and numerically stiff finite rate chemistry. For LES/FDF methods to make a more significant impact in practical applications a pragmatic approach must be taken that significantly reduces the computational cost while maintaining high modeling fidelity. An example of one such ongoing effort is at the NASA Langley Research Center, where the first generation FDF models, namely the scalar filtered mass density function (SFMDF) are being implemented into VULCAN, a production-quality RAS and LES solver widely used for design of high speed propulsion flowpaths. This effort leverages internal and external collaborations to reduce the overall computational cost of high fidelity simulations in VULCAN by: implementing high order methods that allow reduction in the total number of computational cells without loss in accuracy; implementing first generation of high fidelity scalar PDF/FDF models applicable to high-speed compressible flows; coupling RAS/PDF and LES/FDF into a hybrid framework to efficiently and accurately model the effects of combustion in the vicinity of the walls; developing efficient Lagrangian particle tracking algorithms to support robust solutions of the FDF equations for high speed flows; and utilizing finite rate chemistry parametrization, such as flamelet models, to reduce the number of transported reactive species and remove numerical stiffness. This paper briefly introduces the SFMDF model (highlighting key benefits and challenges), and discusses particle tracking for flows with shocks, the hybrid coupled RAS/PDF and LES/FDF model, flamelet generated manifolds (FGM) model, and the Irregularly Portioned Lagrangian Monte Carlo Finite Difference (IPLMCFD) methodology for scalable simulation of high-speed reacting compressible flows.

Drozda, Tomasz G.↗
DOE OSTI2025

Status of Multiple Channel Fuel Performance Capabilities Within the SAS4A/SASSYS-1 Safety Analysis Software

SAS4A/SASSYS-1 (SAS) is a fast-running simulation tool used to perform deterministic analysis of anticipated events as well as design basis and beyond design basis accidents for advanced liquid-metal-cooled nuclear reactors. It is a critical element of safety analysis capabilities for the U.S. Department of Energy and is utilized within industry to perform the transient safety analyses required to support the licensing of Liquid Metal-cooled Fast Reactors (LMFRs). Although SAS is exceptionally fast for most transient scenarios, fuel performance calculations, along with the associated pre-transient characterization of the fuel pin, may be required for transient scenarios where fuel pin failure is hypothesized. Both the pre-transient characterization and the transient fuel performance calculation are necessary to properly quantify margins to potential fuel failure and assess the time spent potentially exceeding such margins during events. While safety analysis calculations with fuel performance models provide a more detailed characterization of the reactor during a transient, the pre-transient characterization can be time-consuming and computationally expensive. Often, large numbers of fuel pins have been exposed to similar pre-transient irradiation conditions. Similarly, the same pre-transient fuel characterization may be applicable to numerous transient conditions. This provides an opportunity to optimize the SAS computational framework such that pre-transient fuel characterization can be shared across multiple channels (fuel pins) and across multiple simulations, thus dramatically reducing overall computational costs. This report summarizes progress toward enhancing the SAS computational framework to support shared, multiple channel fuel performance characterizations intended to significantly reduce computational costs. Preliminary testing has shown that the computational time saved by using the pre-transient sharing capability is approximately equal to the time it takes to perform the pre-transient characterization.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2020

Multilevel and multifidelity uncertainty quantification for cardiovascular hemodynamics

Standard approaches for uncertainty quantification in cardiovascular modeling pose challenges due to the large number of uncertain inputs and the significant computational cost of realistic three-dimensional simulations. Here, we propose an efficient uncertainty quantification framework utilizing a multilevel multifidelity Monte Carlo (MLMF) estimator to improve the accuracy of hemodynamic quantities of interest while maintaining reasonable computational cost. This is achieved by leveraging three cardiovascular model fidelities, each with varying spatial resolution to rigorously quantify the variability in hemodynamic outputs. We employ two low-fidelity models (zero- and one-dimensional) to construct several different estimators. Our goal is to investigate and compare the efficiency of estimators built from combinations of these two low-fidelity model alternatives and our high-fidelity three-dimensional models. We demonstrate this framework on healthy and diseased models of aortic and coronary anatomy, including uncertainties in material property and boundary condition parameters. Our goal is to demonstrate that for this application it is possible to accelerate the convergence of the estimators by utilizing a MLMF paradigm. Therefore, we compare our approach to single fidelity Monte Carlo estimators and to a multilevel Monte Carlo approach based only on three-dimensional simulations, but leveraging multiple spatial resolutions. We demonstrate significant, on the order of 10 to 100 times, reduction in total computational cost with the MLMF estimators. We also examine the differing properties of the MLMF estimators in healthy versus diseased models, as well as global versus local quantities of interest. As expected, global quantities such as outlet pressure and flow show larger reductions than local quantities, such as those relating to wall shear stress, as the latter rely more heavily on the highest fidelity model evaluations. Similarly, healthy models show larger reductions than diseased models. In all cases, our workflow coupling Dakota’s MLMF estimators with the SimVascular cardiovascular modeling framework makes uncertainty quantification feasible for constrained computational budgets.

59 BASIC BIOLOGICAL SCIENCES↗