Search NASA⌕ Search

SEARCH · Search NASA

Results for “Discretization error”

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 1,513 records · Page 84

Practical Probabilistic Programming

Recent advances in probabilistic programming languages (PPLs) have provided the capability for exact inference: computing a closed-form probability distribution for a given probabilistic program. In particular, the new language Roulette uses a language oriented programming (LOP) approach, wherein analysts build new programming languages on top of a set of primitives provided by Roulette, which then translates these structures into a weighted model counting problem which can be solved by automated reasoning tools. However, because Roulette provides few convenience features, developing these new languages is challenging even for expert users. We developed a standard library of common probability functions for Roulette with the goal of improved usability. This included approximation of continuous probability density functions using discrete probability mass functions. We demonstrated this approach by modeling a cosmic ray striking a RAM controller. We found that Roulette provides a powerful interface for highly expressive probabilistic programs to be generated. In collaboration with the NNSA Advanced Simulation and Computing program, which resulted in development of a tool called Circulette, we were able to model complex circuits expressed in Verilog using probabilistic programs with an expressivity not previously possible. Our research question that motivated the development of a Roulette standard library was to determine whether non-experts could use a PPL to model relevant problems regarding radiation effects on microelectronics. This standard library improved the expressivity of Roulette by implementing common probability density functions, mathematical operators on distributions, and support for empirical distributions. While Roulette is a powerful modeling language, the untyped, LOP approach makes error messages difficult to understand and requires expert aid. We recommend further research on Roulette, especially with its error messages, to enable improved usability. At the same time, this project demonstrated that for users familiar with Roulette and the LOP approach, Roulette provides powerful new capabilities that can be integrated with other Sandia modeling capabilities.

97 MATHEMATICS AND COMPUTING↗

A new theory for multistep discretizations of stiff ordinary differential equations: Stability with large step sizes

A large set of variable coefficient linear systems of ordinary differential equations which possess two different time scales, a slow one and a fast one is considered. A small parameter epsilon characterizes the stiffness of these systems. A system of o.d.e.s. in this set is approximated by a general class of multistep discretizations which includes both one-leg and linear multistep methods. Sufficient conditions are determined under which each solution of a multistep method is uniformly bounded, with a bound which is independent of the stiffness of the system of o.d.e.s., when the step size resolves the slow time scale, but not the fast one. This property is called stability with large step sizes. The theory presented lets one compare properties of one-leg methods and linear multistep methods when they approximate variable coefficient systems of stiff o.d.e.s. In particular, it is shown that one-leg methods have better stability properties with large step sizes than their linear multistep counter parts. The theory also allows one to relate the concept of D-stability to the usual notions of stability and stability domains and to the propagation of errors for multistep methods which use large step sizes.

Majda, G.↗

Wing Shape Sensing from Measured Strain

A new two-step theory is investigated for predicting the deflection and slope of an entire structure using strain measurements at discrete locations. In the first step, a measured strain is fitted using a piecewise least-squares curve fitting method together with the cubic spline technique. These fitted strains are integrated twice to obtain deflection data along the fibers. In the second step, computed deflection along the fibers are combined with a finite element model of the structure in order to interpolate and extrapolate the deflection and slope of the entire structure through the use of the System Equivalent Reduction and Expansion Process. The theory is first validated on a computational model, a cantilevered rectangular plate wing. The theory is then applied to test data from a cantilevered swept-plate wing model. Computed results are compared with finite element results, results using another strainbased method, and photogrammetry data. For the computational model under an aeroelastic load, maximum deflection errors in the fore and aft, lateral, and vertical directions are -3.2%, 0.28%, and 0.09%, respectively; and maximum slope errors in roll and pitch directions are 0.28% and -3.2%, respectively. For the experimental model, deflection results at the tip are shown to be accurate to within 3.8% of the photogrammetry data and are accurate to within 2.2% in most cases. In general, excellent matching between target and computed values are accomplished in this study. Future refinement of this theory will allow it to monitor the deflection and health of an entire aircraft in real time, allowing for aerodynamic load computation, active flexible motion control, and active induced drag reduction.

shape sensing↗

Development of a Fast and Accurate PCRTM Radiative Transfer Model in the Solar Spectral Region

A fast and accurate principal component-based radiative transfer model in the solar spectral region (PCRTMSOLAR) has been developed. The algorithm is capable of simulating reflected solar spectra in both clear sky and cloudy atmospheric conditions. Multiple scattering of the solar beam by the multilayer clouds and aerosols are calculated using a discrete ordinate radiative transfer scheme. The PCRTM-SOLAR model can be trained to simulate top-of-atmosphere radiance or reflectance spectra with spectral resolution ranging from 1 cm(exp −1) resolution to a few nanometers. Broadband radiances or reflectance can also be calculated if desired. The current version of the PCRTM-SOLAR covers a spectral range from 300 to 2500 nm. The model is valid for solar zenith angles ranging from 0 to 80 deg, the instrument view zenith angles ranging from 0 to 70 deg, and the relative azimuthal angles ranging from 0 to 360 deg. Depending on the number of spectral channels, the speed of the current version of PCRTM-SOLAR is a few hundred to over one thousand times faster than the medium speed correlated-k option MODTRAN5. The absolute RMS error in channel radiance is smaller than 10(exp −3) mW∕cm)exp 2)∕sr∕cm(exp −1) and the relative error is typically less than 0.2%.

Liu, Xu↗

Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition

This report demonstrates satisfactory data compression of SOLPS-ITER simulation output ranging from 2D fields, 1D profiles, and 0D scalar variables with a novel matrix decomposition approach. The singular value decomposition (SVD) scales poorly for large matrix sizes and is unsuited to the application on high dimensional data common to fusion plasma physics simulation. In this work, we employ the columns-submatrix-rows (CUR) matrix factorization technique in order to compute a low-rank approximation up to two orders of magnitude faster than the SVD, but within a nominal L2-norm relative error of ε = 10 –2 . In addition, the CUR approach maintains the original format of the data, in its extracted columns and rows, allowing for interpretable data storage at the original resolution of the simulation. We utilize an iterative algorithm to compute the CUR decomposition of simulation output by maximizing the volume, or linearly independent information content, of a low-rank submatrix contained within the data. Experiments over $\textit{n} × \textit{n}$ randomized test matrices with embedded rank-deficient features show that this maximum volume implementation of CUR matrix approximation has reduced asymptotic computational complexity on the order of n compared to the SVD, which scales approximately as $n^3$. These results show that the CUR technique can be used to effectively select time step snapshots (columns) of over 140 SOLPS-ITER output variables and the associated discretized coordinate timeseries (rows) allowing for reconstruction of the complete simulation dynamics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Degenerate variational integrators for magnetic field line flow and guiding center trajectories

Symplectic integrators offer many benefits for numerically approximating solutions to Hamiltonian differential equations, including bounded energy error and the preservation of invariant sets. Two important Hamiltonian systems encountered in plasma physics—the flow of magnetic field lines and the guiding center motion of magnetized charged particles—resist symplectic integration by conventional means because the dynamics are most naturally formulated in non-canonical coordinates. New algorithms were recently developed using the variational integration formalism; however, those integrators were found to admit parasitic mode instabilities due to their multistep character. This work eliminates the multistep character, and therefore the parasitic mode instabilities via an adaptation of the variational integration formalism that we deem “degenerate variational integration.” Both the magnetic field line and guiding center Lagrangians are degenerate in the sense that the resultant Euler-Lagrange equations are systems of first-order ordinary differential equations. We show that retaining the same degree of degeneracy when constructing discrete Lagrangians yields one-step variational integrators preserving a non-canonical symplectic structure. Lastly, numerical examples demonstrate the benefits of the new algorithms, including superior stability relative to the existing variational integrators for these systems and superior qualitative behavior relative to non-conservative algorithms.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Physics-Informed and Data-Driven Prediction of Residual Stress in Three-Dimensional Machining

Efficient and reliable prediction of machining-induced residual stress (RS) is a key requirement for truly integrated computational materials engineering (ICME). Currently available process modeling approaches, including empirical, analytical, and numerical methodologies lack predictive power and require substantial calibration and validation data. Moreover, most model-based approaches consider only two-dimensional (2D) (i.e., orthogonal), cutting processes. Meanwhile, industrial processes such as milling, turning, and drilling are inherently three-dimensional (3D). The present work attempts to bridge the gap between 2D and 3D through careful consideration of the process physics, including geometric, kinematic, and size-effect constraints to realize robust prediction of how RS develops in 3D machining. Using a novel in-situ experimental technique and digital image correlation (DIC) to determine equivalent Hertzian contact widths, contact pressures, and friction coefficients, the proposed methodology leverages a discretized conversion algorithm that includes multi-pass shakedown effects. This paper presents a semi-analytical model to predict machining-induced RS in 3D turning operations, which are used representatively for 3D processes more generally. Rather than follow a ‘brute force’ 3D FEM approach or conduct countless experiments to train a purely data-driven machine learning algorithm, the proposed approach builds on previous 2D modeling work. Through careful consideration of the process physics, including complex geometry/kinematic considerations of 3D turning, the authors demonstrated an experimentally calibrated approach, as well as validation based on published RS data. Model predictions and previously published measurement data of RS depth profiles for turning of Inconel 718 were compared for a range of process parameters. Correlation between the proposed 3D model and validation data was found to be within the margin of experimental error for most conditions. The proposed model appears to capture the overall behavior of 3D RS depth profiles with acceptable accuracy, particularly the key metrics of near-surface stress, peak stress magnitude and location, as well as overall stress profile depth. This report presents a physics-informed, data-driven approach for efficient calibration of a 2D model for machining-induced RS through DIC analysis of in-situ characterized subsurface displacement fields.

42 ENGINEERING↗

Wing Shape Sensing from Measured Strain

A new two-step theory is investigated for predicting the deflection and slope of an entire structure using strain measurements at discrete locations. In the first step, a measured strain is fitted using a piecewise least-squares curve fitting method together with the cubic spline technique. These fitted strains are integrated twice to obtain deflection data along the fibers. In the second step, computed deflection along the fibers are combined with a finite element model of the structure in order to interpolate and extrapolate the deflection and slope of the entire structure through the use of the System Equivalent Reduction and Expansion Process. The theory is first validated on a computational model, a cantilevered rectangular plate wing. The theory is then applied to test data from a cantilevered swept-plate wing model. Computed results are compared with finite element results, results using another strain-based method, and photogrammetry data. For the computational model under an aeroelastic load, maximum deflection errors in the fore and aft, lateral, and vertical directions are -3.2 percent, 0.28 percent, and 0.09 percent, respectively; and maximum slope errors in roll and pitch directions are 0.28 percent and -3.2 percent, respectively. For the experimental model, deflection results at the tip are shown to be accurate to within 3.8 percent of the photogrammetry data and are accurate to within 2.2 percent in most cases. In general, excellent matching between target and computed values are accomplished in this study. Future refinement of this theory will allow it to monitor the deflection and health of an entire aircraft in real time, allowing for aerodynamic load computation, active flexible motion control, and active induced drag reduction..

system equivalent reduction and expansion process↗

Fermion-bag inspired Hamiltonian lattice field theory for fermionic quantum criticality

Motivated by the fermion-bag approach, in this work we construct a new class of Hamiltonian lattice field theories that can help us to study fermionic quantum critical points, particularly those with four-fermion interactions. Although these theories are constructed in discrete time with a finite temporal lattice spacing ϵ, when ϵ → 0, conventional continuous-time Hamiltonian lattice field theories are recovered. The fermion-bag algorithms run relatively faster when ϵ = 1 as compared to ϵ → 0 but still allow us to compute universal quantities near the quantum critical point even at such a large value of ϵ. As an example of this new approach, here we study the $N_f$ = 1 Gross-Neveu chiral-Ising universality class in 2 + 1 dimensions by calculating the critical scaling of the staggered mass order parameter. We show that we are able to study lattice sizes up to 100 2 sites when ϵ = 1, while with comparable resources we can reach lattice sizes of only up to 64 2 when ϵ → 0. The critical exponents obtained in both these studies match within errors.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Flow Reconstruction in A Transonic Turbine Cascade Using Physics-Informed Neural Networks (PINNS)

This paper investigates the application of Physics-Informed Neural Networks (PINNs) for the analysis of turbine blades in a transonic cascade. The 2-D flow field in a transonic turbine cascade is reconstructed in three ways: the traditional forward approach (PINN not trained on experimental data), by training the PINN using discrete sets of experimentally measured pressure at midspan, and in the inverse sense where no inlet or outlet pressure boundary conditions are applied. Comparisons between the PINN solutions to measured data are made. This is repeated for three different turbine blades with distinct loading characteristics. Good agreement is shown between a CFD calculation of the CMC7 blade, and the PINN model trained with all data. The PINN is trained utilizing all available data, half the available data, data from only the leading edge region, and data from only the trailing edge region. The forward problem results deviate the most from experimental data but show promise. Solutions from the assisted training cases show that the PINN can reconstruct the flow field with acceptable accuracy when trained on measurements along the entire blade. In the inverse case, it is shown that to simultaneously achieve acceptable errors for inlet Mach number and outlet isentropic Mach number, the PINN must be trained on the static pressure data along the entire blade.

Machine Learning↗

On the regularity of the covariance matrix of a discretized scalar field on the sphere

We present a comprehensive study of the regularity of the covariance matrix of a discretized field on the sphere. In a particular situation, the rank of the matrix depends on the number of pixels, the number of spherical harmonics, the symmetries of the pixelization scheme and the presence of a mask. Taking into account the above mentioned components, we provide analytical expressions that constrain the rank of the matrix. They are obtained by expanding the determinant of the covariance matrix as a sum of determinants of matrices made up of spherical harmonics. We investigate these constraints for five different pixelizations that have been used in the context of Cosmic Microwave Background (CMB) data analysis: Cube, Icosahedron, Igloo, GLESP and HEALPix, finding that, at least in the considered cases, the HEALPix pixelization tends to provide a covariance matrix with a rank closer to the maximum expected theoretical value than the other pixelizations. The effect of the propagation of numerical errors in the regularity of the covariance matrix is also studied for different computational precisions, as well as the effect of adding a certain level of noise in order to regularize the matrix. In addition, we investigate the application of the previous results to a particular example that requires the inversion of the covariance matrix: the estimation of the CMB temperature power spectrum through the Quadratic Maximum Likelihood algorithm. Finally, some general considerations in order to achieve a regular covariance matrix are also presented.

79 ASTRONOMY AND ASTROPHYSICS↗

Projecting the Thermal Response in a HTGR-Type System during Conduction Cooldown Using Graph-Laplacian Based Machine Learning

Accurate prediction of an off-normal event in a nuclear reactor is dependent upon the availability of sensory data, reactor core physical condition, and understanding of the underlying phenomenon. This work presents a method to project the data from some discrete sensory locations to the overall reactor domain during conduction cooldown scenarios similar to High Temperature Gas-cooled Reactors (HTGRs). The existing models for conductive cooldown in a heterogeneous multi-body system, such as an assembly of prismatic blocks or pebble beds relies on knowledge of the thermal contact conductance, requiring significant knowledge of local thermal contacts and heat transport possibilities across those contacts. With a priori knowledge of bulk geometry features and some discrete sensors, a machine learning approach was devised. The presented work uses an experimental facility to mimic conduction cooldown with an assembly of 68 cylindrical rods initially heated to 1200 K. High-fidelity temperature data were collected using an infrared (IR) camera to provide training data to the model and validate the predicted temperature data. The machine learning approach used here first converts the macroscopic bulk geometry information into Graph-Laplacian, and then uses the eigenvectors of the Graph-Laplacian to develop Kernel functions. Support vector regression (SVR) was implemented on the obtained Kernels and used to predict the thermal response in a packed rod assembly during a conduction cooldown experiment. The usage of SVR modeling differs from most models today because of its representation of thermal coupling between rods in the core. When trained with thermographic data, the average normalized error is less than 2% over 400 s, during which temperatures of the assembly have dropped by more than 500 K. The rod temperature prediction performance was significantly better for rods in the interior of the assembly compared to those near the exterior, likely due to the model simplification of the surroundings.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Breaking Computational Barriers: Real-time Analysis and Optimization with Large-scale Nonlinear Models via Model Reduction

Model reduction for dynamical systems is a promising approach for reducing the computational cost of large-scale physics-based simulations to enable high-fidelity models to be used in many- query (e.g., Bayesian inference) and near-real-time (e.g., fast-turnaround simulation) contexts. While model reduction works well for specialized problems such as linear time-invariant systems, it is much more difficult to obtain accurate, stable, and efficient reduced-order models (ROMs) for systems with general nonlinearities. This report describes several advances that enable nonlinear reduced-order models (ROMs) to be deployed in a variety of time-critical settings. First, we present an error bound for the Gauss-Newton with Approximated Tensors (GNAT) nonlinear model reduction technique. This bound allows the state-space error for the GNAT method to be quantified when applied with the backward Euler time-integration scheme. Second, we present a methodology for preserving classical Lagrangian structure in nonlinear model reduction. This technique guarantees that important properties--such as energy conservation and symplectic time-evolution maps--are preserved when performing model reduction for models described by a Lagrangian formalism (e.g., molecular dynamics, structural dynamics). Third, we present a novel technique for decreasing the temporal complexity --defined as the number of Newton-like iterations performed over the course of the simulation--by exploiting time-domain data. Fourth, we describe a novel method for refining projection-based reduced-order models a posteriori using a goal-oriented framework similar to mesh-adaptive h -refinement in finite elements. The technique allows the ROM to generate arbitrarily accurate solutions, thereby providing the ROM with a 'failsafe' mechanism in the event of insufficient training data. Finally, we present the reduced-order model error surrogate (ROMES) method for statistically quantifying reduced- order-model errors. This enables ROMs to be rigorously incorporated in uncertainty-quantification settings, as the error model can be treated as a source of epistemic uncertainty. This work was completed as part of a Truman Fellowship appointment. We note that much additional work was performed as part of the Fellowship. One salient project is the development of the Trilinos-based model-reduction software module Razor , which is currently bundled with the Albany PDE code and currently allows nonlinear reduced-order models to be constructed for any application supported in Albany. Other important projects include the following: 1. ROMES-equipped ROMs for Bayesian inference: K. Carlberg, M. Drohmann, F. Lu (Lawrence Berkeley National Laboratory), M. Morzfeld (Lawrence Berkeley National Laboratory). 2. ROM-enabled Krylov-subspace recycling: K. Carlberg, V. Forstall (University of Maryland), P. Tsuji, R. Tuminaro. 3. A pseudo balanced POD method using only dual snapshots: K. Carlberg, M. Sarovar. 4. An analysis of discrete v. continuous optimality in nonlinear model reduction: K. Carlberg, M. Barone, H. Antil (George Mason University). Journal articles for these projects are in progress at the time of this writing.

97 MATHEMATICS AND COMPUTING↗

Towards Predictive Reacting Flow LES

Grid dependency and the interaction of numerical errors with those from physical models can negatively impact the predictive capabilities of the traditional large eddy simulation (LES) approach. This paper attempts to address these issues for the simulation of turbulent reacting flows, where the canonical problem of a temporally evolving reacting jet is used as a test case. The impact of implicit and explicit filtering of the governing system of equations, and the impact of removing grid dependency from physical models through application of a constant filter width, is assessed. Four different grid resolutions are employed in the study. Differences are experienced in mean velocity and temperature profiles with grid resolution refinement when using the traditional implicit filtering approach, demonstrating the grid dependency of the obtained solutions. These differences are substantially mitigated by fixing the filter width used in physical models to a constant value, as the grid resolution is refined. Explicit filtering utilizing discrete filters reduces these differences even further, but to a smaller degree. This latter improvement comes at a very substantial computational cost. Higher Reynolds number cases need to be studied, where the LES resolution is far from that of a DNS, in order for a more conclusive assessment of the benefit of the explicit filtering approach to be made. However, even if explicit filtering is found to have a large positive impact on the predictive capabilities of reacting flow LES, its computational cost is likely to prevent it from being routinely applied to large, complex geometries, at least for the case where discrete filters are used.

Cocks, Peter A.↗

A spatially adaptive high-order meshless method for fluid–structure interactions

We present a scheme implementing an a posteriori refinement strategy in the context of a high-order meshless method for problems involving point singularities and fluid–solid interfaces. The generalized moving least squares (GMLS) discretization used in this work has been previously demonstrated to provide high-order compatible discretization of the Stokes and Darcy problems, offering a high-fidelity simulation tool for problems with moving boundaries. The meshless nature of the discretization is particularly attractive for adaptive h -refinement, especially when resolving the near-field aspects of variables and point singularities governing lubrication effects in fluid–structure interactions. We demonstrate that the resulting spatially adaptive GMLS method is able to achieve optimal convergence in the presence of singularities for both the div-grad and Stokes problems. Furthermore, we present a series of simulations for flows of colloid suspensions, in which the refinement strategy efficiently achieved highly accurate solutions, particularly for colloids with complex geometries.

42 ENGINEERING↗

Moving nonrelativistic QCD for heavy-to-light form factors on the lattice

We formulate nonrelativistic quantum chromodynamics (NRQCD) on a lattice which is boosted relative to the usual discretization frame. Moving NRQCD allows us to treat the momentum for the heavy quark arising from the frame choice exactly. We derive moving NRQCD through O(1/m{sup 2},v{sub rel}{sup 4}), as accurate as the NRQCD action in present use, both in the continuum and on the lattice with O(a{sup 4}) improvements. We have carried out extensive tests of the formalism through calculations of two-point correlators for both heavy-heavy (bottomonium) and heavy-light (B{sub s}) mesons in 2+1 flavor lattice QCD and obtained nonperturbative determinations of energy shift and external momentum renormalization. Comparison to perturbation theory at O({alpha}{sub s}) is also made. The results demonstrate the effectiveness of moving NRQCD. In particular we show that the decay constants of heavy-light and heavy-heavy mesons can be calculated with small systematic errors up to much larger momenta than with standard NRQCD.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Individually optimized uniform contrast enhancement in CT angiography for the diagnosis of pulmonary thromboembolic disease—A simulation study

Purpose: To improve the diagnostic quality of CT pulmonary angiography (CTPA) by individually optimizing a biphasic contrast injection function to achieve targeted uniform contrast enhancement. To compare the results against a previously reported discrete Fourier transform (DFT) approach. Methods: This simulation study used the CTPA datasets of 27 consecutive patients with pulmonary thromboembolic disease (PE). An optimization approach was developed consisting of (1) computation of the impulse enhancement function (IEF) based on a test bolus scan, and (2) optimization of a biphasic contrast injection function using the IEF in order to achieve targeted uniform enhancement. The injection rates and durations of a biphasic contrast injection function are optimized by minimizing the difference between the resulting contrast enhancement curve and the targeted uniform enhancement curve, while conforming to the clinical constraints of injection rate and total contrast volume. The total contrast volume was limited first to the clinical standard of 65 ml, and then to the same amount used in the DFT approach for comparison. The optimization approach and the DFT approach were compared in terms of the root mean square error (RMSE) and total contrast volume used. Results: When the total contrast volume was limited to 65 ml, the optimization approach produced significantly better contrast enhancement (closer to the targeted uniform contrast enhancement) than the DFT approach (RMSE 17 HU vs 56 HU,p < 0.00001). On average, the optimization approach used 63 ml contrast, while the DFT approach used 50 ml with four patients exceeding 65 ml. When equivalent total contrast volume was used for individual patient, the optimization approach still generated significantly better contrast enhancement (RMSE 44 HU vs 56 HU, p < 0.01). Constraints for the injection function could be easily accommodated into the optimization process when searching for the optimal biphasic injection function. Conclusions: The optimization approach generated individually optimized biphasic injection functions yielding significantly better contrast enhancement compared to the DFT approach. This new approach has the potential to improve the diagnostic quality of CTPA for PE.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

SU-E-T-614: Plan Averaging for Multi-Criteria Navigation of Step-And-Shoot IMRT

Purpose: Step-and-shoot IMRT is fundamentally discrete in nature, while multi-criteria optimization (MCO) is fundamentally continuous: the MCO planning consists of continuous sliding across the Pareto surface (the set of plans which represent the tradeoffs between organ-at-risk doses and target doses). In order to achieve close to real-time dose display during this sliding, it is desired that averaged plans share many of the same apertures as the pre-computed plans, since dose computation for apertures generated on-the-fly would be expensive. We propose a method to ensure that neighboring plans on a Pareto surface share many apertures. Methods: Our baseline step-and-shoot sequencing method is that of K. Engel (a method which minimizes the number of segments while guaranteeing the minimum number of monitor units), which we customize to sequence a set of Pareto optimal plans simultaneously. We also add an error tolerance to study the relationship between the number of shared apertures, the total number of apertures needed, and the quality of the fluence map re-creation. Results: We run tests for a 2D Pareto surface trading off rectum and bladder dose versus target coverage for a clinical prostate case. We find that if we enforce exact fluence map recreation, we are not able to achieve much sharing of apertures across plans. The total number of apertures for all seven beams and 4 plans without sharing is 217. With sharing and a 2% error tolerance, this number is reduced to 158 (73%). Conclusion: With the proposed method, total number of apertures can be decreased by 42% (averaging) with no increment of total MU, when an error tolerance of 5% is allowed. With this large amount of sharing, dose computations for averaged plans which occur during Pareto navigation will be much faster, leading to a real-time what-you-see-is-what-you-get Pareto navigation experience. Minghao Guo and Hao Gao were partially supported by the NSFC (#11405105), the 973 Program (#2015CB856000) and the Shanghai Pujiang Talent Program (#14PJ1404500)

62 RADIOLOGY AND NUCLEAR MEDICINE↗