Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithm Development”

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 253 records · Page 14

An Early Quantum Computing Proposal

The D-Wave 2X is the third generation of quantum processing created by D-Wave. NASA (with Google and USRA) and Lockheed Martin (with USC), both own D-Wave systems. Los Alamos National Laboratory (LANL) purchased a D-Wave 2X in November 2015. The D-Wave 2X processor contains (nominally) 1152 quantum bits (or qubits) and is designed to specifically perform quantum annealing, which is a well-known method for finding a global minimum of an optimization problem. This methodology is based on direct execution of a quantum evolution in experimental quantum hardware. While this can be a powerful method for solving particular kinds of problems, it also means that the D-Wave 2X processor is not a general computing processor and cannot be programmed to perform a wide variety of tasks. It is a highly specialized processor, well beyond what NNSA currently thinks of as an “advanced architecture.”A D-Wave is best described as a quantum optimizer. That is, it uses quantum superposition to find the lowest energy state of a system by repeated doses of power and settling stages. The D-Wave produces multiple solutions to any suitably formulated problem, one of which is the lowest energy state solution (global minimum). Mapping problems onto the D-Wave requires defining an objective function to be minimized and then encoding that function in the Hamiltonian of the D-Wave system. The quantum annealing method is then used to find the lowest energy configuration of the Hamiltonian using the current D-Wave Two, two-level, quantum processor. This is not always an easy thing to do, and the D-Wave Two has significant limitations that restrict problem sizes that can be run and algorithmic choices that can be made. Furthermore, as more people are exploring this technology, it has become clear that it is very difficult to come up with general approaches to optimization that can both utilize the D-Wave and that can do better than highly developed algorithms on conventional computers for specific applications. These are all fundamental challenges that must be overcome for the D-Wave, or similar, quantum computing technology to be broadly applicable.

97 MATHEMATICS AND COMPUTING↗

Innovative signal processing for Johnson Noise thermometry

This report summarizes the newly developed algorithm that subtracted the Electromagnetic Interference (EMI). The EMI performance is very important to this measurement because any interference in the form on pickup from external signal sources from such as fluorescent lighting ballasts, motors, etc. can skew the measurement. Two methods of removing EMI were developed and tested at various locations. This report also summarizes the testing performed at different facilities outside Oak Ridge National Laboratory using both EMI removal techniques. The first EMI removal technique reviewed in previous milestone reports and therefore this report will detail the second method.

97 MATHEMATICS AND COMPUTING↗

Dynamic Multi-Sensor Multi-Mission Optimal Planning Tool

Remote sensing systems have firmly established a role in providing immense value to commercial industry, scientific exploration, and national security. Continued maturation of sensing technology has reduced the cost of deploying highly-capable sensors while at the same time increased reliance on the information these sensors can provide. The demand for time on these sensors is unlikely to diminish. Coordination of next-generation sensor systems, larger constellations of satellites, unmanned aerial vehicles, ground telescopes, etc. is prohibitively complex for existing heuristics-based scheduling techniques. The project was a two-year collaboration spanning multiple Sandia centers and included a partnership with Texas A&M University. We have developed algorithms and software for collection scheduling, remote sensor field-of-view pointing models, and bandwidth-constrained prioritization of sensor data. Our approach followed best practices from the operations research and computational geometry communities. These models provide several advantages over state of the art techniques. In particular, our approach is more flexible compared to heuristics that tightly couple models and solution techniques. First, our mixed-integer linear models afford a rigorous analysis so that sensor planners can quantitatively describe a schedule relative to the best possible. Optimal or near-optimal schedules can be produced with commercial solvers in operational run-times. These models can be modified and extended to incorporate different scheduling and resource constraints and objective function definitions. Further, we have extended these models to proactively schedule sensors under weather and ad hoc collection uncertainty. This approach stands in contrast to existing deterministic schedulers which assume a single future weather or ad hoc collection scenario. The field-of-view pointing algorithm produces a mosaic with the fewest number of images required to fully cover a region of interest. The bandwidth-constrained algorithms find the highest priority information that can be transmitted. All of these are based on mixed-integer linear programs so that, in the future, collection scheduling, field-of-view, and bandwidth prioritization can be combined into a single problem. Experiments conducted using the developed models, commercial solvers, and benchmark datasets have demonstrated that proactively scheduling against uncertainty regularly and significantly outperforms deterministic schedulers.

47 OTHER INSTRUMENTATION↗

A Surrogate-based Adaptive Sampling Approach for History Matching and Uncertainty Quantification

A critical procedure in reservoir simulations is history matching (or data assimilation in a broader sense), which calibrates model parameters such that the simulation results are consistent with field measurements, and hence improves the credibility of the predictions given by the simulations. Often there exist non-unique combinations of parameter values that all yield the simulation results matching the measurements. For such ill-posed history matching problems, Bayesian theorem provides a theoretical foundation to represent different solutions and to quantify the uncertainty with the posterior PDF. Lacking an analytical solution in most situations, the posterior PDF may be characterized with a sample of realizations, each representing a possible scenario. A novel sampling algorithm is presented here for the Bayesian solutions to history matching problems. We aim to deal with two commonly encountered issues: 1) as a result of the nonlinear input-output relationship in a reservoir model, the posterior distribution could be in a complex form, such as multimodal, which violates the Gaussian assumption required by most of the commonly used data assimilation approaches; 2) a typical sampling method requires intensive model evaluations and hence may cause unaffordable computational cost. In the developed algorithm, we use a Gaussian mixture model as the proposal distribution in the sampling process, which is simple but also flexible to approximate non-Gaussian distributions and is particularly efficient when the posterior is multimodal. Also, a Gaussian process is utilized as a surrogate model to speed up the sampling process. Furthermore, an iterative scheme of adaptive surrogate refinement and re-sampling ensures sampling accuracy while keeping the computational cost at a minimum level. The developed approach is demonstrated with an illustrative example and shows its capability in handling the above-mentioned issues. Multimodal posterior of the history matching problem is captured and are used to give a reliable production prediction with uncertainty quantification. The new algorithm reveals a great improvement in terms of computational efficiency comparing previously studied approaches for the sample problem.

Li, Weixuan↗

Reconstruction of atmospheric neutrinos in DUNE’s horizontal-drift far-detector module

This paper reports on the capabilities in reconstructing and identifying atmospheric neutrino interactions in one of the Deep Underground Neutrino Experiment’s (DUNE) far detector modules, a liquid argon time projection chamber (LArTPC) with horizontal drift (FD-HD) of ionization electrons. The reconstruction is based upon the workflow developed for DUNE’s long-baseline oscillation analysis, with some necessary machine-learning models’ retraining and the addition of features relevant only to atmospheric neutrinos such as the neutrino direction reconstruction. Where relevant, the impact of the detection of the charged particles of the hadronic system is emphasized, and comparisons are carried out between the case when lepton-only information is considered in the reconstruction (as is the case for many neutrino oscillation experiments), versus when all particles identified in the LArTPC were included. Three neutrino direction reconstruction methods have been developed and studied for the atmospheric analyses: using lepton-only information, using all reconstructed particles, and using only correlations from reconstructed hits. The results indicate that incorporating more than just lepton information significantly improves the resolution of both neutrino direction and energy reconstruction. The angle reconstruction algorithms developed in this work result in no strong dependence on particle direction for reconstruction efficiencies or neutrino flavor identification. This comprehensive review of the reconstruction of atmospheric neutrinos in DUNE’s FD-HD LArTPC is the first step towards developing a first neutrino oscillation sensitivity analysis, which will ready DUNE for its first measurements.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Correction of quantification errors in pelvic and spinal lesions caused by ignoring higher photon attenuation of bone in [{sup 18}F]NaF PET/MR

Purpose: MR-based attenuation correction (MRAC) in routine clinical whole-body positron emission tomography and magnetic resonance imaging (PET/MRI) is based on tissue type segmentation. Due to lack of MR signal in cortical bone and the varying signal of spongeous bone, standard whole-body segmentation-based MRAC ignores the higher attenuation of bone compared to the one of soft tissue (MRAC{sub nobone}). The authors aim to quantify and reduce the bias introduced by MRAC{sub nobone} in the standard uptake value (SUV) of spinal and pelvic lesions in 20 PET/MRI examinations with [{sup 18}F]NaF. Methods: The authors reconstructed 20 PET/MR [{sup 18}F]NaF patient data sets acquired with a Philips Ingenuity TF PET/MRI. The PET raw data were reconstructed with two different attenuation images. First, the authors used the vendor-provided MRAC algorithm that ignores the higher attenuation of bone to reconstruct PET{sub nobone}. Second, the authors used a threshold-based algorithm developed in their group to automatically segment bone structures in the [{sup 18}F]NaF PET images. Subsequently, an attenuation coefficient of 0.11 cm{sup −1} was assigned to the segmented bone regions in the MRI-based attenuation image (MRAC{sub bone}) which was used to reconstruct PET{sub bone}. The automatic bone segmentation algorithm was validated in six PET/CT [{sup 18}F]NaF examinations. Relative SUV{sub mean} and SUV{sub max} differences between PET{sub bone} and PET{sub nobone} of 8 pelvic and 41 spinal lesions, and of other regions such as lung, liver, and bladder, were calculated. By varying the assigned bone attenuation coefficient from 0.11 to 0.13 cm{sup −1}, the authors investigated its influence on the reconstructed SUVs of the lesions. Results: The comparison of [{sup 18}F]NaF-based and CT-based bone segmentation in the six PET/CT patients showed a Dice similarity of 0.7 with a true positive rate of 0.72 and a false discovery rate of 0.33. The [{sup 18}F]NaF-based bone segmentation worked well in the pelvis and spine. However, it showed artifacts in the skull and in the extremities. The analysis of the 20 [{sup 18}F]NaF PET/MRI examinations revealed relative SUV{sub max} differences between PET{sub nobone} and PET{sub bone} of (−8.8% ± 2.7%, p = 0.01) and (−8.1% ± 1.9%, p = 2.4 × 10{sup −8}) in pelvic and spinal lesions, respectively. A maximum SUV{sub max} underestimation of −13.7% was found in lesion in the third cervical spine. The averaged SUV{sub mean} differences in volumes of interests in lung, liver, and bladder were below 3%. The average SUV{sub max} differences in pelvic and spinal lesions increased from −9% to −18% and −8% to −17%, respectively, when increasing the assigned bone attenuation coefficient from 0.11 to 0.13 cm{sup −1}. Conclusions: The developed automatic [{sup 18}F]NaF PET-based bone segmentation allows to include higher bone attenuation in whole-body MRAC and thus improves quantification accuracy for pelvic and spinal lesions in [{sup 18}F]NaF PET/MRI examinations. In nonbone structures (e.g., lung, liver, and bladder), MRAC{sub nobone} yields clinically acceptable accuracy.

60 APPLIED LIFE SCIENCES↗

Testing of a 3-D Sonar for Future Deployment to Image Solids on the Floor of Hanford, HLW Conditioning Tanks - 15646

Florida International University (FIU) has tested the capability of 2-D and 3-D sonar systems to image solids settled on the floor of tanks, on the bottom of streams and small rivers, and in 55 gallon drums. FIU developed and successfully tested the Solid-Liquid Interface Monitor (SLIM) for mapping the interface between supernatant and settled solids in several test tanks. SLIM is comprised of: a sonar, a mechanical system for deploying the system into large high-level radioactive waste (HLW) tanks, and imaging programs and algorithms developed at and by FIU faculty and staff. Early testing had the objective to demonstrate the ability of SLIM to image and quantify the height and volume of settled solids on the floor of 1-million-gallon, HLW tanks at Hanford. Testing showed that SLIM: (1) functions accurately in liquid radioactive HLW tank conditions [i.e., caustic (pH>14), warm (up to 45 degrees Centigrade), and highly radioactive]; (2) provides accurate imaging of solids surfaces (1-2% relative error in the height of interfaces); and (3) provides an excellent volume estimation of the solids, thereby allowing engineers to fill tanks closer to the maximum allowed level and optimize solids retrieval; and (4) enables better placement of pumps inside tanks during retrieval to minimize the potential for plugging. The New Hanford technology need is for rapid imaging (even during vigorous mixing) of solids on the floor of conditioning (mixing) tanks. Results of recent successful testing show imaging times under 1 minute, solids volume estimates with <5% error and effective filtering and visualization. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Wind direction estimation using SCADA data with consensus-based optimization

Abstract. Wind turbines in a wind farm typically operate individually to maximize their own performance and do not take into account information from nearby turbines. To enable cooperation to achieve farm-level objectives, turbines will need to use information from nearby turbines to optimize performance, ensure resiliency when other sensors fail, and adapt to changing local conditions. A key element of achieving a more efficient wind farm is to develop algorithms that ensure reliable, robust, real-time, and efficient operation of wind turbines in a wind farm using local sensor information that is already being collected, such as supervisory control and data acquisition (SCADA) data, local meteorological stations, and nearby radars/sodars/lidars. This article presents a framework for developing a cooperative wind farm that incorporates information from nearby turbines in real time to better align turbines in a wind farm. SCADA data from multiple turbines can be used to make better estimates of the local inflow conditions at each individual turbine. By incorporating measurements from multiple nearby turbines, a more reliable estimate of the wind direction can be obtained at an individual turbine. The consensus-based approach presented in this paper uses information from nearby turbines to estimate wind direction in an iterative way rather than aggregating all the data in a wind farm at once. Results indicate that this estimate of the wind direction can be used to improve the turbine's knowledge of the wind direction. This estimated wind direction signal has implications for potentially decreasing dynamic yaw misalignment, decreasing the amount of time a turbine spends yawing due to a more reliable input to the yaw controller, increasing resiliency to faulty wind-vane measurements, and increasing the potential for wind farm control strategies such as wake steering.

17 WIND ENERGY↗

First Deep Learning based Event Reconstruction for Low-Energy Excess Searches with MicroBooNE

This paper describes algorithms developed to isolate and accurately reconstruct two-track νµ-like events that are contained within the MicroBooNE detector. This reconstruction has applications to searches for neutrino oscillations and measurements of cross sections using events that are charged-current quasi-elastic-like, among other applications. The algorithms we discuss will be applicable to all detectors running in Fermilab’s SBN program, and any future LArTPC experiment with beam energies ~ 1 GeV.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Description and Performance of Track and Primary-Vertex Reconstruction with the CMS Tracker

A description is provided of the software algorithms developed for the CMS tracker both for reconstructing charged-particle trajectories in proton-proton interactions and for using the resulting tracks to estimate the positions of the LHC luminous region and individual primary-interaction vertices. Despite the very hostile environment at the LHC, the performance obtained with these algorithms is found to be excellent. For tbar t events under typical 2011 pileup conditions, the average track-reconstruction efficiency for promptly-produced charged particles with transverse momenta of p(T) > 0.9GeV is 94% for pseudorapidities of |η| < 0.9 and 85% for 0.9 < |η| < 2.5. The inefficiency is caused mainly by hadrons that undergo nuclear interactions in the tracker material. For isolated muons, the corresponding efficiencies are essentially 100%. For isolated muons of p(T) = 100GeV emitted at |η| < 1.4, the resolutions are approximately 2.8% in p(T), and respectively, 10μm and 30μm in the transverse and longitudinal impact parameters. The position resolution achieved for reconstructed primary vertices that correspond to interesting pp collisions is 10–12μm in each of the three spatial dimensions. The tracking and vertexing software is fast and flexible, and easily adaptable to other functions, such as fast tracking for the trigger, or dedicated tracking for electrons that takes into account bremsstrahlung.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Temporal regularization of ultrasound-based liver motion estimation for image-guided radiation therapy

Purpose: Ultrasound-based motion estimation is an expanding subfield of image-guided radiation therapy. Although ultrasound can detect tissue motion that is a fraction of a millimeter, its accuracy is variable. For controlling linear accelerator tracking and gating, ultrasound motion estimates must remain highly accurate throughout the imaging sequence. This study presents a temporal regularization method for correlation-based template matching which aims to improve the accuracy of motion estimates. Methods: Liver ultrasound sequences (15–23 Hz imaging rate, 2.5–5.5 min length) from ten healthy volunteers under free breathing were used. Anatomical features (blood vessels) in each sequence were manually annotated for comparison with normalized cross-correlation based template matching. Five sequences from a Siemens Acuson™ scanner were used for algorithm development (training set). Results from incremental tracking (IT) were compared with a temporal regularization method, which included a highly specific similarity metric and state observer, known as the α–β filter/similarity threshold (ABST). A further five sequences from an Elekta Clarity™ system were used for validation, without alteration of the tracking algorithm (validation set). Results: Overall, the ABST method produced marked improvements in vessel tracking accuracy. For the training set, the mean and 95th percentile (95%) errors (defined as the difference from manual annotations) were 1.6 and 1.4 mm, respectively (compared to 6.2 and 9.1 mm, respectively, for IT). For each sequence, the use of the state observer leads to improvement in the 95% error. For the validation set, the mean and 95% errors for the ABST method were 0.8 and 1.5 mm, respectively. Conclusions: Ultrasound-based motion estimation has potential to monitor liver translation over long time periods with high accuracy. Nonrigid motion (strain) and the quality of the ultrasound data are likely to have an impact on tracking performance. A future study will investigate spatial uniformity of motion and its effect on the motion estimation errors.

61 RADIATION PROTECTION AND DOSIMETRY↗

Argonne's Laboratory Computing Resource Center 2009 annual report.

Now in its seventh year of operation, the Laboratory Computing Resource Center (LCRC) continues to be an integral component of science and engineering research at Argonne, supporting a diverse portfolio of projects for the U.S. Department of Energy and other sponsors. The LCRC's ongoing mission is to enable and promote computational science and engineering across the Laboratory, primarily by operating computing facilities and supporting high-performance computing application use and development. This report describes scientific activities carried out with LCRC resources in 2009 and the broad impact on programs across the Laboratory. The LCRC computing facility, Jazz, is available to the entire Laboratory community. In addition, the LCRC staff provides training in high-performance computing and guidance on application usage, code porting, and algorithm development. All Argonne personnel and collaborators are encouraged to take advantage of this computing resource and to provide input into the vision and plans for computing and computational analysis at Argonne. The LCRC Allocations Committee makes decisions on individual project allocations for Jazz. Committee members are appointed by the Associate Laboratory Directors and span a range of computational disciplines. The 350-node LCRC cluster, Jazz, began production service in April 2003 and has been a research work horse ever since. Hosting a wealth of software tools and applications and achieving high availability year after year, researchers can count on Jazz to achieve project milestones and enable breakthroughs. Over the years, many projects have achieved results that would have been unobtainable without such a computing resource. In fiscal year 2009, there were 49 active projects representing a wide cross-section of Laboratory research and almost all research divisions.

99 GENERAL AND MISCELLANEOUS↗

Imaging of Calibrated Defects in Additively Manufactured Materials: Pulsed Thermal Tomography Nondestructive Examination of Additively Manufactured Reactor Materials and Components

Additive manufacturing (AM, or 3D printing) for commercial nuclear energy applications is an emerging method for cost-efficient manufacturing aimed at replacing aging nuclear reactor parts and reducing costs for new construction. Known material flaws in AM include low-density regions consisting of non-sintered powder, which have to be detected to ensure the safety of long-term performance nuclear reactor components. Currently, limited options are available for nondestructive evaluation (NDE), either during or post manufacturing. As a solution to NDE of AM, we are developing pulsed thermal imaging which is non-contact, one-sided, and scalable to arbitrary size and shape of the AM parts. Pulsed thermography (PT) system utilizes a high intensity flash lamp to rapidly heat surface of sample, and a high sensitivity fast-frame megapixel infrared (IR) camera to capture data of surface temperature variations. The acquired data cube consists of a stack of surface temperature images taken at different times. Information about material internal defects is extracted by analyzing the data cube. This report provides results of preliminary performance evaluation of pulsed thermal imaging capability in detection of imprinted flaws in AM metallic structures. The flaws were introduced into AM parts as imprinted hemispherical low density regions, consisting of trapped un-sintered metallic powder. Specimens for developed for this study consisted of AM stainless steel 316 and Inconel 718 plates. The diameters of imprinted defects varied from 1mm to 8mm, and their depths below the plate flat surface varied between 1mm and 6mm. Pulsed thermal tomography (PTT) processes the measured data cube to obtain 3D reconstructions of material effusivity using a unique inversion algorithm developed at Argonne. PTT has been previously used in imaging of similar size flat bottom hole (FBH) simulated defects in stainless steel 316 and Inconel 718 specimens. In the study involving AM specimens, PTT imaging results have shown that 1mm-diameter defects located 1mm and 2mm below the surface of specimens were detectable. Larger size defects were detectable at greater depth. We also explored an alternative approach to detection of material flaws in PT data cube, which is using neural learning-based approach to blind source separation. Detection of small material defects requires finding features in the data cube which have signal contrast levels approaching sensitivity limit of IR camera. In this study, an optimized Neural Learning based Blind Source Separation (NLBSS) algorithm, including Principal Component Analysis (PCA), and Independent Component Analysis (ICA) is demonstrated to automatically extract principal temporal and spatial features of thermography frames to enhance flaw detection. By using the NLBSS algorithm, material internal defects can be automatically detected. Furthermore, this processing approach compensates for experimental thermal imaging artifacts, such as noise and uneven heating. By merging artificial intelligence with phtotothermics, the NDE system detects internal calibrated defects of various sizes and depths in AM nuclear-grade metallic alloys.

36 MATERIALS SCIENCE↗

Mapping nanocrystal orientations via scanning Laue diffraction microscopy for multi-peak Bragg coherent diffraction imaging

The recent commissioning of a movable monochromator at the 34-ID-C endstation of the Advanced Photon Source has vastly simplified the collection of Bragg coherent diffraction imaging (BCDI) data from multiple Bragg peaks of sub-micrometre scale samples. Laue patterns arising from the scattering of a polychromatic beam by arbitrarily oriented nanocrystals permit their crystal orientations to be computed, which are then used for locating and collecting several non-co-linear Bragg reflections. The volumetric six-component strain tensor is then constructed by combining the projected displacement fields that are imaged using each of the measured reflections via iterative phase retrieval algorithms. Complications arise when the sample is heterogeneous in composition and/or when multiple grains of a given lattice structure are simultaneously illuminated by the polychromatic beam. Here, a workflow is established for orienting and mapping nanocrystals on a substrate of a different material using scanning Laue diffraction microscopy. The capabilities of the developed algorithms and procedures with both synthetic and experimental data are demonstrated. The robustness is verified by comparing experimental texture maps obtained with Laue diffraction microscopy at the beamline with maps obtained from electron back-scattering diffraction measurements on the same patch of gold nanocrystals. Such tools provide reliable indexing for both isolated and densely distributed nanocrystals, which are challenging to image in three dimensions with other techniques.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Vertex-finding and reconstruction of contained two-track neutrino events in the MicroBooNE detector

In this work, we describe algorithms developed to isolate and accurately reconstruct two-track events that are contained within the MicroBooNE detector. This method is optimized to reconstruct two tracks of lengths longer than 5cm. This code has applications to searches for neutrino oscillations and measurements of cross sections using quasi-elastic-like charged current events. The algorithms we discuss will be applicable to all detectors running in Fermilab's Short Baseline Neutrino program (SBN), and to any future liquid argon time projection chamber (LArTPC) experiment with beam energies ~ 1 GeV. The algorithms are publicly available on a GITHUB repository. This reconstruction offers a complementary and independent alternative to the Pandora reconstruction package currently in use in LArTPC experiments, and provides similar reconstruction performance for two-track events.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

TU-C-17A-01: A Data-Based Development for Pratical Pareto Optimality Assessment and Identification

Purpose: To develop an efficient Pareto optimality assessment scheme to support plan comparison and practical determination of best-achievable practical treatment plan goals. Methods: Pareto efficiency reflects the tradeoffs among competing target coverage and normal tissue sparing in multi-criterion optimization (MCO) based treatment planning. Assessing and understanding Pareto optimality provides insightful guidance for future planning. However, current MCO-driven Pareto estimation makes relaxed assumptions about the Pareto structure and insufficiently account for practical limitations in beam complexity, leading to performance upper bounds that may be unachievable. This work proposed an alternative data-driven approach that implicitly incorporates the practical limitations, and identifies the Pareto frontier subset by eliminating dominated plans incrementally using the Edgeworth Pareto hull (EPH). The exactness of this elimination process also permits the development of a hierarchical procedure for speedup when the plan cohort size is large, by partitioning the cohort and performing elimination in each subset before a final aggregated elimination. The developed algorithm was first tested on 2D and 3D where accuracy can be reliably assessed. As a specific application, the algorithm was applied to compare systematic plan quality for lower head-and-neck, amongst 4 competing treatment modalities. Results: The algorithm agrees exactly with brute-force pairwise comparison and visual inspection in low dimensions. The hierarchical algorithm shows sqrt(k) folds speedup with k being the number of data points in the plan cohort, demonstrating good efficiency enhancement for heavy testing tasks. Application to plan performance comparison showed superiority of tomotherapy plans for the lower head-and-neck, and revealed a potential nonconvex Pareto frontier structure. Conclusion: An accurate and efficient scheme to identify Pareto frontier from a plan cohort has been developed. This implementation would guide generating good yet practically achievable plan quality goals for further planning. The observation of a systematic performance bias and a nonconvex Pareto frontier warrants further investigation.

60 APPLIED LIFE SCIENCES↗

Accelerated Cartesian expansion (ACE) based framework for the rapid evaluation of diffusion, lossy wave, and Klein-Gordon potentials

Diffusion, lossy wave, and Klein–Gordon equations find numerous applications in practical problems across a range of diverse disciplines. The temporal dependence of all three Green’s functions are characterized by an infinite tail. This implies that the cost complexity of the spatio-temporal convolutions, associated with evaluating the potentials, scales as O(N s 2 N t 2 ), where N s and N t are the number of spatial and temporal degrees of freedom, respectively. In this paper, we discuss two new methods to rapidly evaluate these spatio-temporal convolutions by exploiting their block-Toeplitz nature within the framework of accelerated Cartesian expansions (ACE). The first scheme identifies a convolution relation in time amongst ACE harmonics and the fast Fourier transform (FFT) is used for efficient evaluation of these convolutions. The second method exploits the rank deficiency of the ACE translation operators with respect to time and develops a recursive numerical compression scheme for the efficient representation and evaluation of temporal convolutions. It is shown that the cost of both methods scales as O(N s N t log 2 N t ). Furthermore, several numerical results are presented for the diffusion equation to validate the accuracy and efficacy of the fast algorithms developed here.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Batched Sparse Linear Algebra (Final Report for Subcontract B648960)

This report finalizes design specifications for developing batched kernels for small tensor operations for unassembled matrix-free iterative solvers, batched solvers for partially assembled operators, and batched solvers with support for various sparse formats. The outcome of the project milestones is a set of interfaces to Batched Sparse LA solvers running on hardware accelerators for use in ECP Libraries and Applications. It is part of the development of sparse batched kernels, solvers/preconditioners as well as creating interoperability in xSDK libraries with sparse and dense batched functions to benefit ECP applications. The participants included representatives from ECP libraries (not limited to the xSDK project), applications, and vendors (AMD, Intel, and NVIDIA). Batched sparse linear algebra solvers form the new frontier for algorithmic development and performance engineering. Many applications (ECP and non-ECP alike) require simultaneous solutions of small linear systems of equations that are structurally sparse. To move towards high hardware utilization, it is important to provide these applications with appropriate interfaces to efficient batched sparse solvers running on modern hardware accelerators. We present interface designs in use by HPC software libraries supporting batched sparse linear algebra and the development of sparse batched kernel codes for solvers and preconditioners. We also address the potential interoperability opportunities to keep the software portable between the major hardware accelerators from AMD, Intel, and NVIDIA. The presented interface specifications includes batched band, sparse iterative, and sparse direct solvers. This report summarizes progress in Kokkos Kernels and the xSDK libraries MAGMA, Ginkgo, hypre, SUNDIALS, and SuperLU_dist.

97 MATHEMATICS AND COMPUTING↗