Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “kernel”

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 631 records · Page 35

A comprehensive and fair comparison of two neural operators (with practical extensions) based on $\mathrm{FAIR}$ data

Neural operators can learn nonlinear mappings between function spaces and offer a new simulation paradigm for real-time prediction of complex dynamics for realistic diverse applications as well as for system identification in science and engineering. Herein, we investigate the performance of two neural operators, which have shown promising results so far, and we develop new practical extensions that will make them more accurate and robust and importantly more suitable for industrial-complexity applications. The first neural operator, DeepONet, was published in 2019 (Lu et al., 2019), and its original architecture was based on the universal approximation theorem of Chen & Chen (1995). The second one, named Fourier Neural Operator or FNO, was published in 2020, and it is based on parameterizing the integral kernel in the Fourier space. DeepONet is represented by a summation of products of neural networks (NNs), corresponding to the branch NN for the input function and the trunk NN for the output function; both NNs are general architectures, e.g., the branch NN can be replaced with a CNN or a ResNet. According to Kovachki et al. (2021), FNO in its continuous form can be viewed conceptually as a DeepONet with a specific architecture of the branch NN and a trunk NN represented by a trigonometric basis. In order to compare FNO with DeepONet computationally for realistic setups, we develop several extensions of FNO that can deal with complex geometric domains as well as mappings where the input and output function spaces are of different dimensions. We also develop an extended DeepONet with special features that provide inductive bias and accelerate training, and we present a faster implementation of DeepONet with cost comparable to the computational cost of FNO, which is based on the Fast Fourier Transform. Here we consider 16 different benchmarks to demonstrate the relative performance of the two neural operators, including instability wave analysis in hypersonic boundary layers, prediction of the vorticity field of a flapping airfoil, porous media simulations in complex-geometry domains, etc. We follow the guiding principles of FAIR (Findability, Accessibility, Interoperability, and Reusability) for scientific data management and stewardship. The performance of DeepONet and FNO is comparable for relatively simple settings, but for complex geometries the performance of FNO deteriorates greatly. We also compare theoretically the two neural operators and obtain similar error estimates for DeepONet and FNO under the same regularity assumptions.

42 ENGINEERING↗

An end-to-end deep learning method for solving nonlocal Allen–Cahn and Cahn–Hilliard phase-field models

Here, we propose an efficient end-to-end deep learning method for solving nonlocal Allen–Cahn (AC) and Cahn–Hilliard (CH) phase-field models. One motivation for this effort emanates from the fact that discretized partial differential equation-based AC or CH phase-field models result in diffuse interfaces between phases, with the only recourse for remediation is to severely refine the spatial grids in the vicinity of the true moving sharp interface whose width is determined by a grid-independent parameter that is substantially larger than the local grid size. In this work, we introduce non-mass conserving nonlocal AC or CH phase-field models with regular, logarithmic, or obstacle double-well potentials. Because of non-locality, some of these models feature totally sharp interfaces separating phases. The discretization of such models can lead to a transition between phases whose width is only a single grid cell wide. Another motivation is to use deep learning approaches to ameliorate the otherwise high cost of solving discretized nonlocal phase-field models. To this end, loss functions of the customized neural networks are defined using the residual of the fully discrete approximations of the AC or CH models, which results from applying a Fourier collocation method and a temporal semi-implicit approximation. To address the long-range interactions in the models, we tailor the architecture of the neural network by incorporating a nonlocal kernel as an input channel to the neural network model. We then provide the results of extensive computational experiments to illustrate the accuracy, predictive capabilities, and cost reductions of the proposed method.

42 ENGINEERING↗

A statistical model to predict ignition probability

Ignition capability is a critical design constraint for aeronautical gas turbines. However the current trend toward overall lean burn is detrimental to the engine ignition and relight and the ignition system must be adapted to ensure a fast and reliable light-round in all circumstances. As ignition is a stochastic phenomenon, the optimization of an ignition system requires to build ignition probability maps, which is difficult and costly with either experiment or numerical simulation as both require many tests. Here, this work proposes a model to predict the ignition probability map, knowing only flow statistics in non-reacting conditions, i.e., with only one test. The originality of the model is to construct statistics of the flame kernel trajectory, which are then combined with local flow indicators to evaluate the ignition probability at the considered sparking location. Application to a swirled burner operated in premixed, non-premixed and spray combustion modes illustrates the model concepts and demonstrates its ability to recover the experimental ignition map with good accuracy.

42 ENGINEERING↗

Co-optimized machine-learned manifold models for large eddy simulation of turbulent combustion

Many modeling approaches in large eddy simulation (LES) of turbulent combustion employ a projection of the thermochemical state onto a low-dimensional manifold within state space to reduce the number of transported variables and hence computational cost. Flamelet-generated manifolds (FGM) is an example of a well-established, physics-based approach, but increasingly, principal component analysis (PCA) is being used as a data-driven method for generating manifold models. For both approaches, the nonlinear relationship between the location on the predefined manifold and the outputs of interest, such as reaction rates, can be tabulated or encoded in a neural network. This work proposes a new approach for manifold modeling that extends these existing approaches. A modified neural network structure simultaneously encodes the definition of the manifold variables, the nonlinear mapping, and the subfilter closure for LES. This allows all three of these aspects of the model to be co-optimized, generating a model from any source of combustion thermochemical state data. The manifold parameterizing variables are constrained to be linear combinations of species, as in FGM and PCA-based models, to aid in interpretability and implementation. For LES, subfilter variances of the manifold variables are also included as inputs. Two types of a priori analysis are performed to evaluate the new approach. In the first, the model is trained on data from one-dimensional premixed flames. In this case, the approach recovers the behavior of flamelet-based manifold approaches, and in fact slightly improves performance by identifying an optimized progress variable. The approach is also applied to data from direct numerical simulations of spherical ignition kernels in isotropic turbulence. For any specified manifold dimensionality, the new approach provides substantially lower prediction errors than a PCA-based model developed from the same data set. Additionally, the LES formulation of the new approach can provide accurate predictions for filtered reaction rates across a variety of filter widths.

97 MATHEMATICS AND COMPUTING↗

Direct numerical simulation of a high-pressure hydrogen micromix combustor: Flame structure and stabilisation mechanism

A high-pressure hydrogen micromix combustor has been investigated using direct numerical simulation with detailed chemistry to examine the flame structure and stabilisation mechanism. The configuration of the combustor was based on the design by Schefer et al., using numerical periodicity to mimic a large square array. A precursor simulation of an opposed jet-in-crossflow was first conducted to generate appropriate partially-premixed inflow boundary conditions for the subsequent reacting simulation. The resulting flame can be described as an predominantly-lean inhomogeneously-premixed lifted jet flame. Five main zones were identified: a jet mixing region, a core flame, a peripheral flame, a recirculation zone, and combustion products. The core flame, situated over the jet mixing region, was found to burn as a thin reaction front, responsible for over 85% of the total fuel consumption. The peripheral flame shrouded the core flame, had low mean flow with high turbulence, and burned at very lean conditions (in the distributed burning regime). It was shown that turbulent premixed flame propagation was an order-of-magnitude too slow to stabilise the flame at these conditions. Stabilisation was identified to be due to ignition events resulting from turbulent mixing of fuel from the jet into mean recirculation of very lean hot products. Ignition events were found to correlate with shear-driven Kelvin-Helmholtz vortices, and increased in likelihood with streamwise distance. At the flame base, isolated events were observed, which developed into rapidly burning flame kernels that were blown downstream. Further downstream, near-simultaneous spatially-distributed ignition events were observed, which appeared more like ignition sheets. The paper concludes with a broader discussion that considers generalising from the conditions considered here.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Computational diagnostics and characterization of combustion recession in diesel sprays

While low-temperature combustion (LTC) strategies have been found to mitigate nitrogen oxides and particulate matter emissions in diesel engines, studies have also associated LTC with an increase in unburnt hydrocarbons. With more recent studies on diesel after end-of-injection (AEOI), combustion recession is identified as a phenomenon where at near nozzle region, high-temperature ignition (HTI) combustion can propagate back to the nozzle tip consuming the unburnt hydrocarbons AEOI. Current literature has suggested that combustion recession is controlled by auto-ignition. However, high-fidelity simulations and detailed analysis of such a mechanism are missing. In this study, comprehensive Large Eddy Simulations of a reacting spray at “Spray A” conditions are performed, where detailed analysis of combustion recession concerning flame morphology and propagation modes are included. In particular, this study demonstrated for the first time that while combustion recession is mainly auto-ignition dominated (consistent with the literature), a cool flame was found to deflagrate towards the richer regions of the mixture, promoting mixing and increasing the mixture temperature. This leads to HTI kernels, which then grow and develop as deflagrative waves, therefore sustaining the combustion recession process. The study also detailed the extinction mechanism of combustion: the entrainment wave will overlean the near-nozzle mixtures, rendering it unable to support HTI, which leads to the extinction of the upstream flame AEOI in lower reactivity mixtures. Combustion recession is also observed to be contingent on the chemical and diffusion processes, even at low scalar dissipation rates. Finally, a new criterion for combustion recession based on chemical explosive mode is proposed and validated with previous combustion recession index to quantify the extent of HTI in near-nozzle mixtures AEOI. The newly developed metric combined with a previous experimentally-based metric can provide simple but valuable measurements of the degree and propensity of the upstream flame AEOI.

CEMA↗

In situ multi-tier auto-ignition detection applied to dual-fuel combustion simulations

Here we use an anomaly detection methodology that is centered on analyzing fourth-order joint moments (co-kurtosis), particularly focusing on its application in auto-ignition of combustion problems with large numbers of species. Unsupervised anomaly detection is challenging to generalize across problem types and domains. A recent technique, centered on analyzing information in the fourth-order joint moment co-kurtosis, has shown promise, especially for high-dimensional scientific data. In this work we present developments to the co-kurtosis based anomaly detection method needed to make it effective and scalable for large-scale distributed scientific data, such as those generated by massively parallel simulations. An in situ co-kurtosis algorithm is employed as the anomaly detection method for identifying ignition kernels in simulations of turbulent combustion. Here, we extend an existing methodology which identifies regions of the domain where anomalies are present, and add another tier of anomaly detection where the individual samples contributing to the anomaly are identified. We apply this algorithm on-the-fly to a variety of turbulent reacting flow problems and compare it to the widely used (but significantly more expensive) chemical explosive mode analysis (CEMA). We demonstrate the ability of the method to detect and identify the onset of low and high temperature ignition which can be used for computational steering, as chemical and combustion anomalies occur intermittently at spatio-temporal locations unknown a priori. Finally, we apply our lightweight in situ algorithm to an exascale high-fidelity simulation with a total of 2.4 Trillion degrees of freedom, performed using an adaptive mesh refinement solver. Furthermore, through a scalability analysis, we show that the relative computational cost of this in-situ anomaly detection algorithm compared to an iteration of the reacting flow solver is negligible.

97 MATHEMATICS AND COMPUTING↗

Machine learning-enabled prediction of chemical durability of A 2 B 2 O 7 pyrochlore and fluorite

Pyrochlore-structure type and its derivative in a general formula A 2 B 2 O 7 (A = rare earth elements and actinides; B = Ti, Sn, Zr, Hf, Pb, Si, etc.) display excellent structural flexibility and rich crystal chemistry as promising nuclear waste form materials capable of immobilizing actinides and fission products. It is essential to understand these materials’ chemical durability and element release of radionuclides in order to evaluate their performance in near-field environment. However, it is a formidable grand technological challenge to experimentally perform durability testing across hundreds of thousands of possibilities resulting from their extreme compositional complexities due to cation substitutions at both A and B-sites. In this work, we demonstrate a machine learning approach to determine the key materials parameters and structural characteristics governing the leaching behaviors from a small set of selected compositions as model systems, enabling a science-based prediction of their chemical durability that can be extended to a wide range of chemical compositions. The combination of four key structural characteristics and materials parameters, including ionic radius size difference , ionic potential difference , electronegativity difference , and lattice parameter , creates features an optimized prediction of the chemical durability. Two machine learning models, linear regression and Kernel ridge regression models, are trained on the randomly-split training dataset derived from the experimentally-determined elemental release rates, and subsequently tested on the testing dataset. The predicted leaching rates from both machine learning models show an excellent agreement with the experimental data, demonstrating the feasibility of rapidly evaluating the material properties of new compositions. These results highlight the immense potential of synergizing informatics through machine learning-based models and well-controlled experiments of selected model systems to accelerate materials design and discovery with optimized compositions and performance of promising materials for effective nuclear waste management.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Effect of loading path on grain misorientation and geometrically necessary dislocation density in polycrystalline aluminum under reciprocating shear

Solid phase processing (SPP) is a promising alloy fabrication technique to produce fine and homogeneous grain structures for high-performance alloys. However, there is very limited modeling capability to understand and predict the grain refinement during SPP. In this work, the crystal plasticity theory was used to study elastic-plastic deformation in polycrystalline aluminums under large shear deformation. Two approaches, kernel averaged misorientation (KAM) and grain reference orientation deviation (GROD), were used to assess the grain misorientations. The geometrically necessary dislocation (GND) density was computed with the plastic strain rate. The deformation simulations were carried out under two loading conditions to investigate the effect of loading paths on the evolutions of grain misorientation and GND density. The results show that the regions with high misorientation and GND density first appear near grain boundaries. These regions then extend toward interior grains. The loading path affects dislocation system activation and dislocation recovery, hence dislocation evolution and misorientation. In conclusion, both two- and three-dimensional simulations showed that the spatial and temporal evolutions of GROD, KAM, and GND density in are closely correlated, which indicates they all can be used as criteria of grain refinement or recrystallization.

36 MATERIALS SCIENCE↗

Random field optimization

Herein we present a new modeling paradigm for optimization that we call random field optimization. Random fields are a powerful modeling abstraction that aims to capture the behavior of random variables that live on infinite-dimensional spaces (e.g., space and time) such as stochastic processes (e.g., time series, Gaussian processes, and Markov processes), random matrices, and random spatial fields. This paradigm involves sophisticated mathematical objects (e.g., stochastic differential equations and space-time kernel functions) and has been widely used in neuroscience, geoscience, physics, civil engineering, and computer graphics. Despite of this, however, random fields have seen limited use in optimization; specifically, existing optimization paradigms that involve uncertainty (e.g., stochastic programming and robust optimization) mostly focus on the use of finite random variables. This trend is rapidly changing with the advent of statistical optimization (e.g., Bayesian optimization) and multi-scale optimization (e.g., integration of molecular sciences and process engineering). Our work extends a recently-proposed abstraction for infinite-dimensional optimization problems by capturing more general uncertainty representations. Moreover, we discuss solution paradigms for this new class of problems based on finite transformations and sampling, and identify open questions and challenges.

97 MATHEMATICS AND COMPUTING↗

Understanding collective human movement dynamics during large-scale events using big geosocial data analytics

Conventional approaches for modeling human mobility pattern often focus on human activity and movement dynamics in their regular daily lives and cannot capture changes in human movement dynamics in response to large-scale events. With the rapid advancement of information and communication technologies, many researchers have adopted alternative data sources (e.g., cell phone records, GPS trajectory data) from private data vendors to study human movement dynamics in response to large-scale natural or societal events. Big geosocial data such as georeferenced tweets are publicly available and dynamically evolving as real-world events are happening, making it more likely to capture the real-time sentiments and responses of populations. However, precisely-geolocated geosocial data is scarce and biased toward urban population centers. In this research, we developed a big geosocial data analytical framework for extracting human movement dynamics in response to large-scale events from publicly available georeferenced tweets. The framework includes a two-stage data collection module that collects data in a more targeted fashion in order to mitigate the data scarcity issue of georeferenced tweets; in addition, a variable bandwidth kernel density estimation(VB-KDE) approach was adopted to fuse georeference information at different spatial scales, further augmenting the signals of human movement dynamics contained in georeferenced tweets. To correct for the sampling bias of georeferenced tweets, we adjusted the number of tweets for different spatial units (e.g., county, state) by population. To demonstrate the performance of the proposed analytic framework, we chose an astronomical event that occurred nationwide across the United States, i.e., the 2017 Great American Eclipse, as an example event and studied the human movement dynamics in response to this event. Finally, this analytic framework can easily be applied to other types of large-scale events such as hurricanes or earthquakes.

54 ENVIRONMENTAL SCIENCES↗

GPU-accelerated DNS of compressible turbulent flows

Here, this paper explores strategies to transform an existing CPU-based high-performance computational fluid dynamics solver, HyPar, for compressible flow simulations on emerging exascale heterogeneous (CPU+GPU) computing platforms. The scientific motivation for developing a GPU-enhanced version of HyPar is to simulate canonical turbulent flows at the highest resolution possible on such platforms. We show that optimizing memory operations and thread blocks results in 200x speedup of computationally intensive kernels compared with a CPU core. Using multiple GPUs and CUDA-aware MPI communication, we demonstrate both strong and weak scaling of our GPU-based HyPar implementation on the NVIDIA Volta V100 GPUs. We simulate the decay of homogeneous isotropic turbulence in a triply periodic box on grids with up to 1024 3 points (5.3 billion degrees of freedom) and on up to 1,024 GPUs. We compare the wall times for CPU-only and CPU+GPU simulations. The results presented in the paper are obtained on the Summit and Lassen supercomputers at Oak Ridge and Lawrence Livermore National Laboratories, respectively.

97 MATHEMATICS AND COMPUTING↗

General field evaluation in high-order meshes on GPUs

Robust and scalable function evaluation at any arbitrary point in the finite/spectral element mesh is required for querying the partial differential equation solution at points of interest, comparison of solution between different meshes, and Lagrangian particle tracking. This is a challenging problem, particularly for high-order unstructured meshes partitioned in parallel with MPI, as it requires identifying the element that overlaps a given point and computing the corresponding reference space coordinates. Here, we present a robust and efficient technique for general field evaluation in large-scale high-order meshes with quadrilaterals and hexahedra. In the proposed method, a combination of globally partitioned and processor-local maps are used to first determine a list of candidate MPI ranks, and then locally candidate elements that could contain a given point. Next, element-wise bounding boxes further reduce the list of candidate elements. Finally, Newton’s method with trust region is used to determine the overlapping element and corresponding reference space coordinates. Since GPU-based architectures have become popular for accelerating computational analyses using meshes with tensor-product elements, specialized kernels have been developed to utilize the proposed methodology on GPUs. The method is also extended to enable general field evaluation on surface meshes. The paper concludes by demonstrating the use of the proposed method in various applications ranging from mesh-to-mesh transfer during r-adaptivity to Lagrangian particle tracking.

97 MATHEMATICS AND COMPUTING↗

Model predictive control of mixing controlled compression ignition operation for low reactivity fuels

Using gasoline or other low reactivity fuels with a pilot injection or port fuel injection in a compression ignition engine has shown great potential in reducing NOx emissions while keeping high thermal efficiency compared to diesel. However, excessive combustion noise is caused by a high maximum pressure rise rate in the cylinder due to the higher fractions of premixed charge of the low-reactivity fuel. This noise can result in structural damage to engine components and as such, combustion noise limits the range of the operating parameters and makes the control of such engines challenging. In this study, a simulation environment was built up in MATLAB/Simulink leveraging a physics-based zero-dimension combustion model to capture the in-cylinder pressure time traces as well as metrics relevant to thermal efficiency and combustion noise. Here, in order to also facilitate the control of emissions, machine learning models were investigated to capture NOx emissions. A kernel-based extreme learning machine (K-ELM) performed best and had a coefficient of correlation (R-squared) of 0.998. The combustion and NOx emission models are valid for not only conventional gasoline fuel but also oxygenated alternative fuel blends at three different pilot injection strategies. In order to track key combustion metrics while keeping noise and emissions within constraints, a model predictive control (MPC) was applied for a compression ignition engine operating with a range of potential fuels and fuel injection strategies. The MPC is validated under different scenarios, including a load step change, fuel type change, and injection strategy change, with proportional–integral (PI) control as the baseline. The simulation results show that MPC reduces about 26% of ringing intensity in the transient process and 17% at the steady state for E30. Generally, MPC can optimize the overall performance through modifying the main injection timing, pilot fuel mass, and exhaust gas recirculation (EGR) fraction.

42 ENGINEERING↗

GPU-acceleration of the ELPA2 distributed eigensolver for dense symmetric and hermitian eigenproblems

The solution of eigenproblems is often a key computational bottleneck that limits the tractable system size of numerical algorithms, among them electronic structure theory in chemistry and in condensed matter physics. Large eigenproblems can easily exceed the capacity of a single compute node, thus must be solved on distributed-memory parallel computers. We here present GPU-oriented optimizations of the ELPA two-stage tridiagonalization eigensolver (ELPA2). On top of cuBLAS-based GPU offloading, we add a CUDA kernel to speed up the back-transformation of eigenvectors, which can be the computationally most expensive part of the two-stage tridiagonalization algorithm. Furthermore, we benchmark the performance of this GPU-accelerated eigensolver on two hybrid CPU–GPU architectures, namely a compute cluster based on Intel Xeon Gold CPUs and NVIDIA Volta GPUs, and the Summit supercomputer based on IBM POWER9 CPUs and NVIDIA Volta GPUs. Consistent with previous benchmarks on CPU-only architectures, the GPU-accelerated two-stage solver exhibits a parallel performance superior to the one-stage counterpart. Finally, we demonstrate the performance of the GPU-accelerated eigensolver developed in this work for routine semi-local KS-DFT calculations comprising thousands of atoms.

97 MATHEMATICS AND COMPUTING↗

Implementing a neural network interatomic model with performance portability for emerging exascale architectures

The two main thrusts of computational science are increasingly accurate predictions and faster calculations; to this end, the zeitgeist in molecular dynamics (MD) simulations is pursuing machine learned and data driven interatomic models, e.g. neural network potentials, and novel hardware architectures, e.g. GPUs. Current implementations of neural network potentials are orders of magnitude slower than traditional interatomic models and while looming exascale computing offers the ability to run large, accurate simulations with these models, achieving portable performance for MD with new and varied exascale hardware requires rethinking traditional algorithms, using novel data structures, and library solutions. We re-implement a neural network interatomic model in CabanaMD, an MD proxy application, built on libraries developed for performance portability. Our implementation shows significantly improved thread scaling in this complex kernel as compared to a current LAMMPS implementation, across both strong and weak scaling. Our single-source solution enables simulations up to 20 million atoms on a single CPU node and 4 million atoms with improved performance on a single GPU. Furthermore, we also explore parallelism and data layout choices (using flexible data structures called AoSoAs) and their effect on performance, seeing up to ~50% and ~5% improvements in performance on a GPU by choosing the right level of parallelism and data layout respectively.

97 MATHEMATICS AND COMPUTING↗

DFT-FE 1.0: A massively parallel hybrid CPU-GPU density functional theory code using finite-element discretization

In this work, we present DFT-FE 1.0, building on DFT-FE 0.6 [Comput. Phys. Commun. 246, 106853 (2020)], to conduct fast and accurate large-scale density functional theory (DFT) calculations (reaching ~ 100,000 electrons) on both many-core CPU and hybrid CPU-GPU computing architectures. This work involves improvements in the real-space formulation—via an improved treatment of the electrostatic interactions that substantially enhances the computational efficiency—as well high-performance computing aspects, including the GPU acceleration of all the key compute kernels in DFT-FE. We demonstrate the accuracy by comparing the ground-state energies, ionic forces and cell stresses on a wide-range of benchmark systems against those obtained from widely used DFT codes. Further, we demonstrate the numerical efficiency of our implementation, which yields ~ 20× CPU-GPU speed-up by using GPU acceleration on hybrid CPU-GPU nodes. Notably, owing to the parallel-scaling of the GPU implementation, we obtain wall-times of 80–140 seconds for full ground-state calculations, with stringent accuracy, on benchmark systems containing ~ 6, 000 – 15,000 electrons.

pseudopotential↗

Efficacy of the symmetry-adapted basis for ab initio nucleon-nucleus interactions for light- and intermediate-mass nuclei

We study the efficacy of a new ab initio framework that combines the symmetry-adapted (SA) no-core shell-model approach with the resonating group method (RGM) for unified descriptions of nuclear structure and reactions. We obtain ab initio neutron-nucleus interactions for 4 He, 16 O, and 20 Ne targets, starting with realistic nucleon-nucleon potentials. We discuss the effect of increasing model space sizes and symmetry-based selections on the SA-RGM norm and direct potential kernels, as well as on phase shifts, which are the input to calculations of cross sections. We demonstrate the efficacy of the SA basis and its scalability with particle numbers and model space dimensions, with a view toward ab initio descriptions of nucleon scattering and capture reactions up through the medium-mass region.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗