Search NASA⌕ Search

SEARCH · Search NASA

Results for “kernel method”

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 775 records · Page 43

Integro-differential equation for Bose-Einstein condensates

We use the assumption that the potential for the A-boson system can be written as a sum of pairwise acting forces to decompose the wave function into Faddeev components that fulfill a Faddeev type equation. Expanding these components in terms of potential harmonic (PH) polynomials and projecting on the potential basis for a specific pair of particles results in a two-variable integro-differential equations suitable for A-boson bound-state studies. The solution of the equation requires the evaluation of Jacobi polynomials P{sub K}{sup {alpha},{beta}}(x) and of the weight function W(z) which give severe numerical problems for very large A. However, using appropriate limits for A{yields}{infinity} we obtain a variant equation which depends only on the input two-body interaction, and the kernel in the integral part has a simple analytic form. This equation can be readily applied to a variety of bosonic systems such as microclusters of noble gasses. We employ it to obtain results for A(set-membership sign)(10-100) {sup 87}Rb atoms interacting via interatomic interactions and confined by an externally applied trapping potential V{sub trap}(r). Our results are in excellent agreement with those previously obtained using the potential harmonic expansion method (PHEM) and the diffusion Monte Carlo (DMC) method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Testbed of Parallel Kernels for Computer Science Research

For several decades, computer scientists have sought guidance on how to evolve architectures, languages, and programming models for optimal performance, efficiency, and productivity. Unfortunately, this guidance is most often taken from the existing software/hardware ecosystem. Architects attempt to provide micro-architectural solutions to improve performance on fixed binaries. Researchers tweak compilers to improve code generation for existing architectures and implementations, and they may invent new programming models for fixed processor and memory architectures and computational algorithms. In today's rapidly evolving world of on-chip parallelism, these isolated and iterative improvements to performance may miss superior solutions in the same way gradient descent optimization techniques may get stuck in local minima. In an initial study, we have developed an alternate approach that, rather than starting with an existing hardware/software solution laced with hidden assumptions, defines the computational problems of interest and invites architects, researchers and programmers to implement novel hardware/ software co-designed solutions. Our work builds on the previous ideas of computational dwarfs, motifs, and parallel patterns by selecting a representative set of essential problems for which we provide: An algorithmic description; scalable problem definition; illustrative reference implementations; verification schemes. For simplicity, we focus initially on the computational problems of interest to the scientific computing community but proclaim the methodology (and perhaps a subset of the problems) as applicable to other communities. We intend to broaden the coverage of this problem space through stronger community involvement. Previous work has established a broad categorization of numerical methods of interest to the scientific computing, in the spirit of the NAS Benchmarks, which pioneered the basic idea of a 'pencil and paper benchmark' in the 1990s. The initial result of the more modern study was the seven dwarfs, which was subsequently extended to 13 motifs. These motifs have already been useful in defining classes of applications for architecture-software studies. However, these broad-brush problem statements often miss the nuance seen in individual kernels. For example, the computational requirements of particle methods vary greatly between the naive (but more accurate) direct calculations and the particle-mesh and particle-tree codes. Thus we commenced our study with an enumeration of problems, but then proceeded by providing not only reference implementations for each problem, but more importantly a mathematical definition that allows one to escape iterative approaches to software/hardware optimization. To ensure long term value, we have augmented each of our reference implementations with both a scalable problem generator and a verification scheme. In a paper we have prepared that documents our efforts, we describe in detail this process of problem definition, scalable input creation, verification, and implementation of reference codes for the scientific computing domain. Table 1 enumerates and describes the level of support we've developed for each kernel. We group these important kernels using the Berkeley dwarfs/motifs taxonomy using a red box in the appropriate column. As kernels become progressively complex, they build upon other, simpler computational methods. We note this dependency via orange boxes. After enumeration of the important numerical problems, we created a domain-appropriate high-level definition of each problem. To ensure future endeavors are not tainted by existing implementations, we specified the problem definition to be independent of both computer architecture and existing programming languages, models, and data types. Then, to provide context as to how such kernels productively map to existing architectures, languages and programming models, we produced reference implementations for most of the kernel (see table). These sample codes should be viewed as 'hints,' designed to show how other designers have mapped a problem's operands and operators to existing hardware and software. Since we wanted such implementations to be illustrative, we tried to ensure they were the most straightforward implementation in the easiest to understand languages using familiar architectures. To that end, most of the linear algebra-oriented computations are written in MATLAB using array indexing to process matrices, rather than one-line library calls to compute the same kernel. This ensures that the kernel's computation is explicit and readable in the implementation and not hidden behind a library. For other problems, such as the Barnes-Hut n-Body solver, the implementations were written in pure C, without any supporting library computations. Along this line, we have also created a scalable problem generator to accompany each computation.

97 MATHEMATICS AND COMPUTING↗

Computing black hole partition functions from quasinormal modes

We propose a method of computing one-loop determinants in black hole space-times (with emphasis on asymptotically anti-de Sitter black holes) that may be used for numerics when completely-analytic results are unattainable. The method utilizes the expression for one-loop determinants in terms of quasinormal frequencies determined by Denef, Hartnoll and Sachdev in [1]. A numerical evaluation must face the fact that the sum over the quasinormal modes, indexed by momentum and overtone numbers, is divergent. A necessary ingredient is then a regularization scheme to handle the divergent contributions of individual fixed-momentum sectors to the partition function. To this end, we formulate an effective two-dimensional problem in which a natural refinement of standard heat kernel techniques can be used to account for contributions to the partition function at fixed momentum. We test our method in a concrete case by reproducing the scalar one-loop determinant in the BTZ black hole background. Furthermore, we then discuss the application of such techniques to more complicated spacetimes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A pencil beam algorithm for helium ion beam therapy

Purpose: To develop a flexible pencil beam algorithm for helium ion beam therapy. Dose distributions were calculated using the newly developed pencil beam algorithm and validated using Monte Carlo (MC) methods. Methods: The algorithm was based on the established theory of fluence weighted elemental pencil beam (PB) kernels. Using a new real-time splitting approach, a minimization routine selects the optimal shape for each sub-beam. Dose depositions along the beam path were determined using a look-up table (LUT). Data for LUT generation were derived from MC simulations in water using GATE 6.1. For materials other than water, dose depositions were calculated by the algorithm using water-equivalent depth scaling. Lateral beam spreading caused by multiple scattering has been accounted for by implementing a non-local scattering formula developed by Gottschalk. A new nuclear correction was modelled using a Voigt function and implemented by a LUT approach. Validation simulations have been performed using a phantom filled with homogeneous materials or heterogeneous slabs of up to 3 cm. The beams were incident perpendicular to the phantoms surface with initial particle energies ranging from 50 to 250 MeV/A with a total number of 10{sup 7} ions per beam. For comparison a special evaluation software was developed calculating the gamma indices for dose distributions. Results: In homogeneous phantoms, maximum range deviations between PB and MC of less than 1.1% and differences in the width of the distal energy falloff of the Bragg-Peak from 80% to 20% of less than 0.1 mm were found. Heterogeneous phantoms using layered slabs satisfied a {gamma}-index criterion of 2%/2mm of the local value except for some single voxels. For more complex phantoms using laterally arranged bone-air slabs, the {gamma}-index criterion was exceeded in some areas giving a maximum {gamma}-index of 1.75 and 4.9% of the voxels showed {gamma}-index values larger than one. The calculation precision of the presented algorithm was considered to be sufficient for clinical practice. Although only data for helium beams was presented, the performance of the pencil beam algorithm for proton beams was comparable. Conclusions: The pencil beam algorithm developed for helium ions presents a suitable tool for dose calculations. Its calculation speed was evaluated to be similar to other published pencil beam algorithms. The flexible design allows easy customization of measured depth-dose distributions and use of varying beam profiles, thus making it a promising candidate for integration into future treatment planning systems. Current work in progress deals with RBE effects of helium ions to complete the model.

60 APPLIED LIFE SCIENCES↗

Solution of Two-Body Bound State Problems with Confining Potentials

The homogeneous Lippmann-Schwinger integral equation is solved in momentum space by using confining potentials. Since the confining potentials are unbounded at large distances, they lead to a singularity at small momentum. In order to remove the singularity of the kernel of the integral equation, a regularized form of the potentials is used. As an application of the method, the mass spectra of heavy quarkonia, mesons consisting from heavy quark and antiquark ({Upsilon}(bb-bar), {psi}(cc-bar)), are calculated for linear and quadratic confining potentials. The results are in good agreement with configuration space and experimental results.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A pencil beam dose calculation model for CyberKnife system

Purpose: CyberKnife system is initially equipped with fixed circular cones for stereotactic radiosurgery. Two dose calculation algorithms, Ray-Tracing and Monte Carlo, are available in the supplied treatment planning system. A multileaf collimator system was recently introduced in the latest generation of system, capable of arbitrarily shaped treatment field. The purpose of this study is to develop a model based dose calculation algorithm to better handle the lateral scatter in an irregularly shaped small field for the CyberKnife system. Methods: A pencil beam dose calculation algorithm widely used in linac based treatment planning system was modified. The kernel parameters and intensity profile were systematically determined by fitting to the commissioning data. The model was tuned using only a subset of measured data (4 out of 12 cones) and applied to all fixed circular cones for evaluation. The root mean square (RMS) of the difference between the measured and calculated tissue-phantom-ratios (TPRs) and off-center-ratio (OCR) was compared. Three cone size correction techniques were developed to better fit the OCRs at the penumbra region, which are further evaluated by the output factors (OFs). The pencil beam model was further validated against measurement data on the variable dodecagon-shaped Iris collimators and a half-beam blocked field. Comparison with Ray-Tracing and Monte Carlo methods was also performed on a lung SBRT case. Results: The RMS between the measured and calculated TPRs is 0.7% averaged for all cones, with the descending region at 0.5%. The RMSs of OCR at infield and outfield regions are both at 0.5%. The distance to agreement (DTA) at the OCR penumbra region is 0.2 mm. All three cone size correction models achieve the same improvement in OCR agreement, with the effective source shift model (SSM) preferred, due to their ability to predict more accurately the OF variations with the source to axis distance (SAD). In noncircular field validation, the pencil beam calculated results agreed well with the film measurement of both Iris collimators and the half-beam blocked field, fared much better than the Ray-Tracing calculation. Conclusions: The authors have developed a pencil beam dose calculation model for the CyberKnife system. The dose calculation accuracy is better than the standard linac based system because the model parameters were specifically tuned to the CyberKnife system and geometry correction factors. The model handles better the lateral scatter and has the potential to be used for the irregularly shaped fields. Comprehensive validations on MLC equipped system are necessary for its clinical implementation. It is reasonably fast enough to be used during plan optimization.

60 APPLIED LIFE SCIENCES↗

Application of activity pencil beam algorithm using measured distribution data of positron emitter nuclei for therapeutic SOBP proton beam

Purpose: Recently, much research on imaging the clinical proton-irradiated volume using positron emitter nuclei based on target nuclear fragment reaction has been carried out. The purpose of this study is to develop an activity pencil beam (APB) algorithm for a simulation system for proton-activated positron-emitting imaging in clinical proton therapy using spread-out Bragg peak (SOBP) beams.Methods: The target nuclei of activity distribution calculations are {sup 12}C nuclei, {sup 16}O nuclei, and {sup 40}Ca nuclei, which are the main elements in a human body. Depth activity distributions with SOBP beam irradiations were obtained from the material information of ridge filter (RF) and depth activity distributions of compounds of the three target nuclei measured by BOLPs-RGp (beam ON-LINE PET system mounted on a rotating gantry port) with mono-energetic Bragg peak (MONO) beam irradiations. The calculated data of depth activity distributions with SOBP beam irradiations were sorted in terms of kind of nucleus, energy of proton beam, SOBP width, and thickness of fine degrader (FD), which were verified. The calculated depth activity distributions with SOBP beam irradiations were compared with the measured ones. APB kernels were made from the calculated depth activity distributions with SOBP beam irradiations to construct a simulation system using the APB algorithm for SOBP beams.Results: The depth activity distributions were prepared using the material information of RF and the measured depth activity distributions with MONO beam irradiations for clinical therapy using SOBP beams. With the SOBP width widening, the distal fall-offs of depth activity distributions and the difference from the depth dose distributions were large. The shapes of the calculated depth activity distributions nearly agreed with those of the measured ones upon comparison between the two. The APB kernels of SOBP beams were prepared by making use of the data on depth activity distributions with SOBP beam irradiations that were made from the depth activity distributions with MONO beam irradiations and sorted in terms of energy, SOBP width, and thickness of FD. The data on APB kernels of SOBP beams were determined as installment data for the simulation system using the APB algorithm for SOBP beam irradiations.Conclusions: A method of obtaining the depth activity distributions and the APB algorithm for clinical use of SOBP beams have been developed. It is suggested that the simulation system for imaging the clinical irradiated volume with the APB algorithm can be used in clinical proton therapy using SOBP beams by preparing and investigating the data on APB kernels of SOBP beams.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Learning User Preferences for Sets of Objects

Most work on preference learning has focused on pairwise preferences or rankings over individual items. In this paper, we present a method for learning preferences over sets of items. Our learning method takes as input a collection of positive examples--that is, one or more sets that have been identified by a user as desirable. Kernel density estimation is used to estimate the value function for individual items, and the desired set diversity is estimated from the average set diversity observed in the collection. Since this is a new learning problem, we introduce a new evaluation methodology and evaluate the learning method on two data collections: synthetic blocks-world data and a new real-world music data collection that we have gathered.

preferences↗

Motion tomography via occupation kernels

The goal of motion tomography is to recover a description of a vector flow field using measurements along the trajectory of a sensing unit. In this paper, we develop a predictor corrector algorithm designed to recover vector flow fields from trajectory data with the use of occupation kernels developed by Rosenfeld et al. [9,10]. Specifically, we use the occupation kernels as an adaptive basis; that is, the trajectories defining our occupation kernels are iteratively updated to improve the estimation in the next stage. Initial estimates are established, then under mild assumptions, such as relatively straight trajectories, convergence is proven using the Contraction Mapping Theorem. We then compare the developed method with the established method by Chang et al. [5] by defining a set of error metrics. Here, we found that for simulated data, where a ground truth is available, our method offers a marked improvement over [5]. For a real-world example, where ground truth is not available, our results are similar results to the established method.

97 MATHEMATICS AND COMPUTING↗

A higher order panel method for general analysis and design applications in subsonic flow

A higher-order panel method is described for numerical solution of boundary-value problems relating to steady inviscid irrotational incompressible subsonic fluid flow in a domain. Both Neumann and Dirichlet boundary conditions are treated; two types of auxiliary conditions are used to remove the degrees of freedom that arise from specifying only the derivative of the perturbation velocity potential. Four general network types and two expansions of the induced potential kernel are employed in the numerical solution. Some results are presented which illustrate the modeling options and numerical characteristics of the method.

Johnson, F. T.↗

Predicting regional and pan-Arctic sea ice anomalies with kernel analog forecasting

Predicting Arctic sea ice extent is a notoriously difficult forecasting problem, even for lead times as short as one month. Motivated by Arctic intraannual variability phenomena such as reemergence of sea surface temperature and sea ice anomalies, we use a prediction approach for sea ice anomalies based on analog forecasting. Traditional analog forecasting relies on identifying a single analog in a historical record, usually by minimizing Euclidean distance, and forming a forecast from the analog’s historical trajectory. An ensemble of analogs is used to make forecasts, where the ensemble weights are determined by a dynamics-adapted similarity kernel, which takes into account the nonlinear geometry on the underlying data manifold. We apply this method for forecasting pan-Arctic and regional sea ice area and volume anomalies from multi-century climate model data, and in many cases find improvement over the benchmark damped persistence forecast. Examples of success include the 3–6 month lead time prediction of Arctic sea ice area, the winter sea ice area prediction of some marginal ice zone seas, and the 3–12 month lead time prediction of sea ice volume anomalies in many central Arctic basins. Finally, we discuss possible connections between KAF success and sea ice reemergence, and find KAF to be successful in regions and seasons exhibiting high interannual variability.

54 ENVIRONMENTAL SCIENCES↗

Targeting GPUs with OpenMP directives on Summit: A simple and effective Fortran experience

We use OpenMP to target hardware accelerators (GPUs) on Summit, a newly deployed supercomputer at the Oak Ridge Leadership Computing Facility (OLCF), demonstrating simplified access to GPU devices for users of our astrophysics code GenASiS and useful speedup on a sample fluid dynamics problem. We modify our workhorse class for data storage to include members and methods that significantly streamline the persistent allocation of and association to GPU memory. Users offload computational kernels with OpenMP target directives that are rather similar to constructs already familiar from multi-core parallelization. In this initial example we ask, “With a given number of Summit nodes, how fast can we compute with and without GPUs?”, and find total wall time speedups of ~ 12X. We also find reasonable weak scaling up to 8000 GPUs (1334 Summit nodes). We make available the source code from this work at https://github.com/GenASiS/GenASiS_Basics.

97 MATHEMATICS AND COMPUTING↗

Emulation With Uncertainty Quantification of Regional Sea‐Level Change Caused by the Antarctic Ice Sheet

Abstract Projecting regional sea‐level change under various climate‐change scenarios typically involves running forward simulations of the Earth's gravitational, rotational and deformational (GRD) response to ice‐mass change, which requires substantial computational cost if applied to probabilistic frameworks requiring thousands to millions of samples. Here we build emulators of regional sea‐level change at 27 coastal locations, due to the GRD effects associated with future Antarctic Ice Sheet mass change over the 21st century. The emulators are evaluated against a numerical sea‐level model applied to an ensemble of ice‐sheet model simulations of the Antarctic Ice Sheet through 2100. We build a physics‐based emulator using a recent sensitivity kernel approach and compare it to machine learning based emulators (neural network and conditional variational autoencoder methods). In order to quantify uncertainty, we derive well‐calibrated prediction intervals for regional sea‐level change via split‐conformal inference and linear regression, and show that Monte Carlo dropout does not yield well‐calibrated uncertainties in this instance. We also demonstrate substantial gains in computational efficiency using both the physics‐based emulator and neural networks in comparison to the numerical model for the complete regional sea‐level solution. Overall, we find the physics‐based emulator modestly outperforms the machine learning emulators for this problem.

58 GEOSCIENCES↗

Multi-Scale Initial Conditions For Cosmological Simulations

We discuss a new algorithm to generate multi-scale initial conditions with multiple levels of refinements for cosmological 'zoom-in' simulations. The method uses an adaptive convolution of Gaussian white noise with a real-space transfer function kernel together with an adaptive multi-grid Poisson solver to generate displacements and velocities following first- (1LPT) or second-order Lagrangian perturbation theory (2LPT). The new algorithm achieves rms relative errors of the order of 10{sup -4} for displacements and velocities in the refinement region and thus improves in terms of errors by about two orders of magnitude over previous approaches. In addition, errors are localized at coarse-fine boundaries and do not suffer from Fourier-space-induced interference ringing. An optional hybrid multi-grid and Fast Fourier Transform (FFT) based scheme is introduced which has identical Fourier-space behaviour as traditional approaches. Using a suite of re-simulations of a galaxy cluster halo our real-space-based approach is found to reproduce correlation functions, density profiles, key halo properties and subhalo abundances with per cent level accuracy. Finally, we generalize our approach for two-component baryon and dark-matter simulations and demonstrate that the power spectrum evolution is in excellent agreement with linear perturbation theory. For initial baryon density fields, it is suggested to use the local Lagrangian approximation in order to generate a density field for mesh-based codes that is consistent with the Lagrangian perturbation theory instead of the current practice of using the Eulerian linearly scaled densities.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Algorithmic and GPU enhancements for molecular dynamics in Cabana and LAMMPS

The focus of this milestone was to implement and test new algorithms and optimizations for improved GPU performance by molecular dynamics (MD) and related particle codes. The work was done in the CoPA Cabana library, the CabanaMD mini-app which uses Cabana to implement and benchmark prototypical MD models, and the LAMMPS MD code which is used by the ECP EXAALT project as well as for materials modeling generally. Efforts included (a) implementation of new or optimized algorithms for fundamental MD kernels like neighbor-list building and FFTs which are also widely used in other particle methods, (b) performance testing of data structure layouts for both simple pairwise and computationally intense neural network potentials, (c) optimizations aimed at improving GPU performance for models with small atom counts, and (d) optimizations specific to the SNAP interatomic potential due to its importance for the EXAALT project.

36 MATERIALS SCIENCE↗

Improved Weld Residual Stress Modeling System in BlackBear

This report presents enhancements to the MOOSE-based BlackBear application aimed at improving its capability to simulate welding and other thermo-mechanical manufacturing processes. Two primary avenues of improvement are pursued. First, to enhance user accessibility, we introduce a centralized default block restriction mechanism that ensures coverage checks are performed within user-specified default blocks. This default setting is applied consistently to all block-describable objects, such as variables, kernels, and more. In addition, we develop a modular action for moving heat source simulations, which integrates path file parsing, subdomain modification, and heat source kernel enforcement into a single, streamlined configuration. Second, to improve solver robustness, we implement an alternative method for assigning initial conditions to the updated active domain during the simulation, thereby enhancing convergence behavior. To validate the framework, we design and conduct several benchmark simulations, including heat conduction with progressive material addition, linear elasticity with time-dependent material deposition, and viscoplasticity model with isotropic hardening under similar conditions. Finally, we demonstrate the effectiveness of the proposed framework through large-scale thermo-mechanical welding simulations in both two and three dimensions.

42 ENGINEERING↗

Stability, accuracy, and efficiency of some underintegrated methods in finite element computations

In an attempt to increase computational efficiency in the numerical solution of highly nonlinear problems in solid and fluid mechanics, underintegrated finite element methods have been employed by many analysts. Underintegration refers to the use of a rule of an order lower than that required to integrate polynomial integrands exactly. The main drawback of this technique is related to the production of rank-deficient stiffness matrices, or equivalently an expanded kernel of the governing linear momentum operators. Such a development can introduce numerical instabilities. In order to overcome this difficulty, artificial stiffness or viscosity methods, or other stabilization methods have been proposed. One approach involves the elimination of spurious modes in a postprocessing operation. The present study is concerned with this a posteriori elimination method, taking into account the results which can be expected from it, and some of its possible extensions.

Jacquotte, O.-P.↗

Accelerating population balance-Monte Carlo simulation for coagulation dynamics from the Markov jump model, stochastic algorithm and GPU parallel computing

This paper proposes a comprehensive framework for accelerating population balance-Monte Carlo (PBMC) simulation of particle coagulation dynamics. By combining Markov jump model, weighted majorant kernel and GPU (graphics processing unit) parallel computing, a significant gain in computational efficiency is achieved. The Markov jump model constructs a coagulation-rule matrix of differentially-weighted simulation particles, so as to capture the time evolution of particle size distribution with low statistical noise over the full size range and as far as possible to reduce the number of time loopings. Here three coagulation rules are highlighted and it is found that constructing appropriate coagulation rule provides a route to attain the compromise between accuracy and cost of PBMC methods. Further, in order to avoid double looping over all simulation particles when considering the two-particle events (typically, particle coagulation), the weighted majorant kernel is introduced to estimate the maximum coagulation rates being used for acceptance–rejection processes by single-looping over all particles, and meanwhile the mean time-step of coagulation event is estimated by summing the coagulation kernels of rejected and accepted particle pairs. The computational load of these fast differentially-weighted PBMC simulations (based on the Markov jump model) is reduced greatly to be proportional to the number of simulation particles in a zero-dimensional system (single cell). Finally, for a spatially inhomogeneous multi-dimensional (multi-cell) simulation, the proposed fast PBMC is performed in each cell, and multiple cells are parallel processed by multi-cores on a GPU that can implement the massively threaded data-parallel tasks to obtain remarkable speedup ratio (comparing with CPU computation, the speedup ratio of GPU parallel computing is as high as 200 in a case of 100 cells with 10 000 simulation particles per cell). These accelerating approaches of PBMC are demonstrated in a physically realistic Brownian coagulation case. The computational accuracy is validated with benchmark solution of discrete-sectional method. The simulation results show that the comprehensive approach can attain very favorable improvement in cost without sacrificing computational accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗