Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational costs”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

A BOUT++ extension for full annular tokamak edge MHD and turbulence simulations

For tokamak edge plasma simulation, a plasma simulation framework BOUT++ employs a dual coordinate system to simulate moderate-n and high-n plasma instability with reasonable computational cost, where n is the toroidal mode number. This coordinate system however limits the computational domain to the toroidal wedge (full torus divided into N parts in the toroidal direction) for computational efficiency and the use of flute-ordering approximation in the field solver calculating the flow potential from the vorticity which may not be valid for low-n modes. Improving numerical treatment of low-n modes is however indispensable to address simulations of low-n current-driven edge localized mode (ELM), ELM control by resonant magnetic perturbations (RMPs), edge turbulence with RMPs and so on. In this work, BOUT++ is extended to simulate the interplay between $n=0$, low-n and high-n plasma components in a full annular tokamak edge domain through hybrid modeling of the flow potential and the vorticity. Low-n modes of flow potential are calculated in an orthogonal flux surface coordinate and high-n modes in the dual coordinate system separately in Fourier space. Finally, the proposed scheme can capture an interplay between $n=1$ global modes and high-n turbulence during pedestal collapse in a full annular torus domain with a circular cross section.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Toward a QUBO-Based Density Matrix Electronic Structure Method

Density matrix electronic structure theory is used in many quantum chemistry methods to “alleviate” the computational cost that arises from directly using wave functions. Although density matrix based methods are computationally more efficient than wave function based methods, significant computational effort is involved. Because the Schrödinger equation needs to be solved as an eigenvalue problem, the time-to-solution scales cubically with the system size in mean-field type approaches such as Hartree–Fock and density functional theory and is solved as many times in order to reach charge or field self-consistency. We hereby propose and study a method to compute the density matrix by using a quadratic unconstrained binary optimization (QUBO) solver. This method could be useful to solve the problem with quantum computers and, more specifically, quantum annealers. Our proposed approach is based on a direct construction of the density matrix using a QUBO eigensolver. We explore the main parameters of the algorithm focusing on precision and efficiency. We show that, while direct construction of the density matrix using a QUBO formulation is possible, the efficiency and precision have room for improvement. Moreover, calculations performed with quantum annealing on D-Wave’s new Advantage quantum computer are compared with results obtained with classical simulated annealing, further highlighting some problems of the proposed method. Finally, we also suggest alternative methods that could lead to a more efficient QUBO-based density matrix construction.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Multi-element flow-driven spectral chaos (ME-FSC) method for uncertainty quantification of dynamical systems

The flow-driven spectral chaos (FSC) is a recently developed method for tracking and quantifying uncertainties in the long-time response of stochastic dynamical systems using the spectral approach. The method uses a novel concept called enriched stochastic flow maps as a means to construct an evolving finite-dimensional random function space that is both accurate and computationally efficient in time. In this paper, we present a multi-element version of the FSC method (the ME-FSC method for short) to tackle (mainly) those dynamical systems that are inherently discontinuous over the probability space. In ME-FSC, the random domain is partitioned into several elements, and then the problem is solved separately on each random element using the FSC method. Subsequently, results are aggregated to compute the probability moments of interest using the law of total probability. To demonstrate the effectiveness of the ME-FSC method in dealing with discontinuities and long-time integration of stochastic dynamical systems, four representative numerical examples are presented in this paper, including the Van-der-Pol oscillator problem and the Kraichnan-Orszag three-mode problem. Results show that the ME-FSC method is capable of solving problems that have strong nonlinear dependencies over the probability space, both reliably and at low computational cost.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Towards Compact Neural Networks via End-to-End Training: A Bayesian Tensor Approach with Automatic Rank Determination

Post-training model compression can reduce the inference costs of deep neural networks, but uncompressed training still consumes enormous hardware resources and energy. To enable low-energy training on edge devices, it is highly desirable to directly train a compact neural network from scratch with a low memory cost. Low-rank tensor decomposition is an effective approach to reduce the memory and computing costs of large neural networks. However, directly training low-rank tensorized neural networks is a very challenging task because it is hard to determine a proper tensor rank a priori, and the tensor rank controls both model complexity and accuracy. Here, this paper presents a novel end-to-end framework for low-rank tensorized training. We first develop a Bayesian model that supports various low-rank tensor formats (e.g., CANDECOMP/PARAFAC, Tucker, tensor-train, and tensor-train matrix) and reduces neural network parameters with automatic rank determination during training. Then we develop a customized Bayesian solver to train large-scale tensorized neural networks. Our training methods shows orders-of-magnitude parameter reduction and little accuracy loss (or even better accuracy) in the experiments. On a very large deep learning recommendation system with over 4.2 ×10 9 model parameters, our method can reduce the parameter number to 1.6 ×10 5 automatically in the training process (i.e., by 2.6 ×10 4 times) while achieving almost the same accuracy. Code is available at https://github.com/colehawkins/bayesian-tensor-rank-determination.

compact neural networks↗
DOE OSTI2022

Deep Generative Modeling of Periodic Variable Stars Using Physical Parameters

The ability to generate physically plausible ensembles of variable sources is critical to the optimization of time domain survey cadences and the training of classification models on data sets with few to no labels. Traditional data augmentation techniques expand training sets by reenvisioning observed exemplars, seeking to simulate observations of specific training sources under different (exogenous) conditions. Unlike fully theory-driven models, these approaches do not typically allow principled interpolation nor extrapolation. Moreover, the principal drawback of theory-driven models lies in the prohibitive computational cost of simulating source observables from ab initio parameters. In this work, we propose a computationally tractable machine learning approach to generate realistic light curves of periodic variables capable of integrating physical parameters and variability classes as inputs. Our deep generative model, inspired by the transparent latent space generative adversarial networks, uses a variational autoencoder (VAE) architecture with temporal convolutional network layers, trained using the OGLE-III optical light curves and physical characteristics (e.g., effective temperature and absolute magnitude) from Gaia DR2. A test using the temperature–shape relationship of RR Lyrae demonstrates the efficacy of our generative “physics-enhanced latent space VAE” (PELS-VAE) model. Such deep generative models, serving as nonlinear nonparametric emulators, present a novel tool for astronomers to create synthetic time series over arbitrary cadences.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS2014

Uncertainty Quantification and Certification Prediction of Low-Boom Supersonic Aircraft Configurations

The primary objective of this work was to develop and demonstrate a process for accurate and efficient uncertainty quantification and certification prediction of low-boom, supersonic, transport aircraft. High-fidelity computational fluid dynamics models of multiple low-boom configurations were investigated including the Lockheed Martin SEEB-ALR body of revolution, the NASA 69 Delta Wing, and the Lockheed Martin 1021-01 configuration. A nonintrusive polynomial chaos surrogate modeling approach was used for reduced computational cost of propagating mixed, inherent (aleatory) and model-form (epistemic) uncertainty from both the computation fluid dynamics model and the near-field to ground level propagation model. A methodology has also been introduced to quantify the plausibility of a design to pass a certification under uncertainty. Results of this study include the analysis of each of the three configurations of interest under inviscid and fully turbulent flow assumptions. A comparison of the uncertainty outputs and sensitivity analyses between the configurations is also given. The results of this study illustrate the flexibility and robustness of the developed framework as a tool for uncertainty quantification and certification prediction of low-boom, supersonic aircraft.

West, Thomas K., IV↗
DOE OSTI2023

Building a DFT+U machine learning interatomic potential for uranium dioxide

Despite uranium dioxide (UO 2 ) being a widely used nuclear fuel, fuel performance models rely extensively on empirical correlations of material behavior, leveraging the historical operating experience of UO 2 . Mechanistic models that consider an atomistic understanding of the processes governing fuel performance (such as fission gas release and creep) will enable a better description of fuel behavior under non-prototypical conditions such as in new reactor concepts or for modified UO 2 fuel compositions. To this end, molecular dynamics simulation is a powerful tool for rapidly predicting physical properties of proposed fuel candidates. However, the reliability of these simulations depends largely on the accuracy of the atomic forces. Traditionally, these forces are computed using either a classical force field (FF) or density functional theory (DFT). While DFT is relatively accurate, the computational cost is burdensome, especially for f-electron elements, such as actinides. By contrast, classical FFs are computationally efficient but are less accurate. For these reasons, we report a new accurate machine learning interatomic potential (MLIP) for UO 2 that provides high-fidelity reproduction of DFT forces at a similar low cost to classical FFs. We employ an active learning approach that autonomously augments the DFT training data set to iteratively refine the MLIP. To further improve the quality of our predictions, we utilize transfer learning to retrain our MLIP to higher-accuracy DFT+U data. We validate our MLIPs by comparing predicted physical properties (e.g., thermal expansion and elastic properties) with those from existing classical FFs and DFT/DFT+U calculations, as well as with experimental data when available.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2020

Fast Computational Algorithms for Partial Differential Equations and Uncertainty Quantifications

This project concerned the construction, testing and analysis of computational algorithms for solving parameterized and stochastic partial differential equations. The study and understanding of equations of this type is of fundamental importance in numerous engineering and scientific applications. Examples include simulation of plasma dynamics in models of electric propulsion and nuclear fusion, simulation of multiphase flows, such as the flow of water, gas and oil in reservoirs, and structural analysis of the dependence of structures on materials. Parametrization is used in such settings when properties of the models such as viscosity of fluids or electric resistivity of materials are not precisely understood and instead are treated as random variables. The resulting solutions are themselves random, and having such solutions will enable engineers to use probabilistic methods to assess the likelihood of events, for example, whether a pollutant in a liquid will exceed a limit, and to use such analyses to develop ways to ensure positive outcomes. Construction of accurate (high resolution) computational solutions is expensive, requiring significant computer time and computational resources, and there is need to reduce computational cost to make simulation useful and effective. The aim of the project was to construct algorithms to efficiently compute surrogate solutions to parameterized problems to allow for efficient and accurate simulation. The technical approach used focused on two related strategies, based on rank-reduction methods and reduced-order models. These methods construct surrogate solutions of parameter-dependent models by projection or interpolation into low-dimensional approximation spaces. Cost savings are achieved if the low-dimensional spaces can be identified and constructed efficiently and if the resulting low-dimensional algebraic systems can be solved cheaply. Accomplishments include: Theoretical and empirical demonstration of the effectiveness of fast multigrid solution strategies for computing low-rank representations of parameter-dependent solutions to discrete partial differential equations, including the first proof establishing so-called textbook convergence properties for low-rank methods. Development of efficient solution algorithms for solving nonlinear parameter-dependent partial differential equations used in models of fluid dynamics. Developent of efficient algorithms for low-rank representation of solutions of time-dependent simulations of fluid dynamics using multi-dimensional tensor representations of solutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Windowed multipole representation of R -matrix cross sections

Nuclear cross sections are basic inputs to any nuclear computation. Campaigns of experiments are fitted with the parametric R-matrix model of quantum nuclear interactions, and the resulting cross sections are documented—both pointwise and as resonance parameters (with uncertainties)—in standard evaluated nuclear data libraries (ENDF, JEFF, BROND, JENDL, CENDL, TENDL): these constitute our common knowledge of fundamental low-energy nuclear cross sections. In the past decade, a collaborative effort has been deployed to establish a new nuclear cross-section library format—the Windowed Multipole Library—with the goal of considerably reducing the computational cost of cross-section calculations in nuclear transport simulations. This work lays the theoretical foundations underpinning these efforts. From general R-matrix scattering theory, we derive the windowed multipole representation of nuclear cross sections. Though physically and mathematically equivalent to R-matrix cross sections, the windowed multipole representation is particularly well suited for subsequent temperature treatment of angle-integrated cross sections, in particular Doppler broadening, which is the averaging of cross sections over the thermal motion of the target atoms. Doppler broadening is of critical importance in neutron transport applications, as it ensures the stability of many nuclear reactors (negative thermal reactivity). Yet, Doppler broadening of nuclear cross sections has been a considerable bottleneck for nuclear transport computations, often requiring memory-costly pretabulations. We show that the windowed multipole representation can perform accurate Doppler broadening analytically (up to the first reaction threshold), from which we derive cross-section temperature derivatives to any order—all computable on the fly (without precalculations stored in memory). Furthermore, we here establish a way of converting the R-matrix resonance parameters uncertainty (covariance matrices) into windowed multipole parameters uncertainty. We show that generating stochastic nuclear cross sections by sampling from the resulting windowed multipole covariance matrix can reproduce the cross-section uncertainty in the original nuclear data file. The windowed multipole representation is therefore a novel nuclear physics formalism able to generate Doppler broadened stochastic nuclear cross sections on the fly, unlocking breakthrough computational gains for nuclear computations. Through this foundational paper, we hope to make the windowed multipole representation accessible, reproducible, and usable for the nuclear physics community, as well as provide the theoretical basis for future research on expanding its capabilities.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Automated Hybrid Variance Reduction on Advanced Architectures in the Shift Monte Carlo Code

Monte Carlo transport methods are the most accurate schemes for solving problems with complex energy and spatial features, but they come with a high computational cost. Although hybrid methods have enabled the use of Monte Carlo transport for a large class of problems, they still require significant computing resources. Modern multicore CPUs with large numbers of compute cores and graphical processing units (GPUs) provide opportunities to optimize the memory and run-time costs of hybrid Monte Carlo methods. This paper documents the development and analysis of three Monte Carlo transport algorithms that support hybrid transport using the consistent adjoint-driven importance sampling (CADIS) and forward-weighted CADIS methods in the Shift Monte Carlo code: history-based transport using static and dynamic threading on multicore CPUs and event-based transport enabling weight window tracking on GPUs. The results are shown for two challenging hybrid problems on the Frontier supercomputer at the Oak Ridge Leadership Computing Facility. The results show that all three methods yield good performance and enable solutions of difficult fixed-source transport problems in less than 2 min on 20 nodes of Frontier. Dynamic threading was observed to give up to 20% better scaling behavior than static threading. Moreover, the AMD Instinct 250X GPU was found to give 9 to 11 times greater throughput per graphics compute die than the best CPU performance. In conclusion, additional opportunities for optimization of hybrid transport on GPUs are discussed.

Denovo↗
DOE OSTI2025

A High-Efficiency Delayed Update Algorithm for Evaluating Slater Determinants in Quantum Monte Carlo

For quantum Monte Carlo simulations of molecular systems or supercells with thousands of electrons, matrix operations related to Slater determinants lead the computational cost. McDaniel et al. [J. Chem. Phys. 2017, 147, 174107] proposed a delayed update algorithm to increase computational efficiency by using matrix–matrix multiplication when updating the inverse matrices of Slater determinants. However, preparing intermediate matrices for applying the Sherman–Morrison–Woodbury formula remained a bottleneck. Here, in this work, we introduce an improved algorithm for CPUs and GPUs that (1) reduces this bottleneck by iteratively updating the intermediate matrices and (2) is efficient at any acceptance ratio, with no cost for rejected moves on CPUs and minimal cost on GPUs. We show the full scheme of integrating the delayed update algorithm into a single-electron move. The high efficiency of our algorithm is demonstrated on CPUs and GPUs for a 512 atom/6144 valence electron calculation, with 12× and 2× overall speed-up compared to traditional rank-1 update schemes in diffusion quantum Monte Carlo, respectively.

Luo, Ye [Argonne National Laboratory (ANL), Argonn↗
DOE OSTI2020

Structural evolution of two-dimensional silicates using a “bond-switching” algorithm

Silicates are the most abundant materials in the earth's crust. In recent years, two-dimensional (2D) versions of them grown on metal supports (known as bilayer silicates) have allowed their study in detail down to the atomic scale. These structures are self-containing. Furthermore, they are not covalently bound to the metal support but interact with it through van der Waals forces. Like their three-dimensional counterparts, the 2D-silicates can form both crystalline and vitreous structures. Furthermore, the interconversion between vitreous to crystalline structures has been experimentally observed at the nanoscale. While theoretical work has been carried out to try to understand these transformations, a limitation for ab initio methods, and even molecular dynamics methods, is the computational cost of studying large systems and long timescales. In this work, we present a simple and computationally inexpensive approach, that can be used to represent the evolution of bilayer silicates using a bond-switching algorithm. This approach allows reaching equilibrium ring size distributions as a function of a parameter that can be related to the ratio between temperature and the energy required for the bond-switching event. The ring size distributions are compared to experimental data available in the literature.

77 NANOSCIENCE AND NANOTECHNOLOGY↗
DOE OSTI2024

Accelerate microstructure evolution simulation using graph neural networks with adaptive spatiotemporal resolution

Abstract Surrogate models driven by sizeable datasets and scientific machine-learning methods have emerged as an attractive microstructure simulation tool with the potential to deliver predictive microstructure evolution dynamics with huge savings in computational costs. Taking 2D and 3D grain growth simulations as an example, we present a completely overhauled computational framework based on graph neural networks with not only excellent agreement to both the ground truth phase-field methods and theoretical predictions, but enhanced accuracy and efficiency compared to previous works based on convolutional neural networks. These improvements can be attributed to the graph representation, both improved predictive power and a more flexible data structure amenable to adaptive mesh refinement. As the simulated microstructures coarsen, our method can adaptively adopt remeshed grids and larger timesteps to achieve further speedup. The data-to-model pipeline with training procedures together with the source codes are provided.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Testing convolutional neural network based deep learning systems: a statistical metamorphic approach

Machine learning technology spans many areas and today plays a significant role in addressing a wide range of problems in critical domains,i.e., healthcare, autonomous driving, finance, manufacturing, cybersecurity,etc. Metamorphic testing (MT) is considered a simple but very powerful approach in testing such computationally complex systems for which either an oracle is not available or is available but difficult to apply. Conventional metamorphic testing techniques have certain limitations in verifying deep learning-based models (i.e., convolutional neural networks (CNNs)) that have a stochastic nature (because of randomly initializing the network weights) in their training. In this article, we attempt to address this problem by using a statistical metamorphic testing (SMT) technique that does not require software testers to worry about fixing the random seeds (to get deterministic results) to verify the metamorphic relations (MRs). We propose seven MRs combined with different statistical methods to statistically verify whether the program under test adheres to the relation(s) specified in the MR(s). We further use mutation testing techniques to show the usefulness of the proposed approach in the healthcare space and test two CNN-based deep learning models (used for pneumonia detection among patients). The empirical results show that our proposed approach uncovers 85.71% of the implementation faults in the classifiers under test (CUT). Furthermore, we also propose an MRs minimization algorithm for the CUT, thus saving computational costs and organizational testing resources.

Computer Science↗
DOE OSTI2023

A parallel p ‐adaptive discontinuous Galerkin method for the Euler equations with dynamic load‐balancing on tetrahedral grids

Abstract A novel p ‐adaptive discontinuous Galerkin (DG) method has been developed to solve the Euler equations on three‐dimensional tetrahedral grids. Hierarchical orthogonal basis functions are adopted for the DG spatial discretization while a third order TVD Runge‐Kutta method is used for the time integration. A vertex‐based limiter is applied to the numerical solution in order to eliminate oscillations in the high order method. An error indicator constructed from the solution of order and is used to adapt degrees of freedom in each computational element, which remarkably reduces the computational cost while still maintaining an accurate solution. The developed method is implemented with under the Charm++ parallel computing framework. Charm++ is a parallel computing framework that includes various load‐balancing strategies. Implementing the numerical solver under Charm++ system provides us with access to a suite of dynamic load balancing strategies. This can be efficiently used to alleviate the load imbalances created by p ‐adaptation. A number of numerical experiments are performed to demonstrate both the numerical accuracy and parallel performance of the developed p ‐adaptive DG method. It is observed that the unbalanced load distribution caused by the parallel p ‐adaptive DG method can be alleviated by the dynamic load balancing from Charm++ system. Due to this, high performance gain can be achieved. For the testcases studied in the current work, the parallel performance gain ranged from 1.5× to 3.7×. Therefore, the developed p ‐adaptive DG method can significantly reduce the total simulation time in comparison to the standard DG method without p ‐adaptation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Investigation of Main Bearing Fatigue Estimate Sensitivity to Synthetic Turbulence Models Using a Novel Drivetrain Model Implemented in OpenFAST

ABSTRACT A coupled medium‐fidelity drivetrain model is developed and implemented in OpenFAST for a 10‐MW land‐based reference turbine. The implementation is verified against a fully coupled multibody wind turbine model, including a detailed drivetrain. The new model can simultaneously and accurately estimate main bearing loads and represent elastic bending of the drivetrain. It has low computational cost and is useful for early design phases, sensitivity analyses and complex systems like wind farms (where computational expense must be expended elsewhere). Here, the model is implemented for a monopile offshore wind turbine and used to investigate the sensitivity of main bearing basic rating life to different synthetic turbulence models. Large‐eddy simulations (LES) targeting stable, neutral, and unstable atmospheric conditions at below‐, near‐ and above‐rated wind speeds are used as a reference. The turbulence models recommended by the International Electrotechnical Commission, the Mann spectral tensor model, and the Kaimal spectral model with exponential coherence are fitted to the LES data. Additionally, a constrained turbulence generator, PyConTurb (short for Python Constrained Turbulence ), based on LES data, is applied in the aero‐hydro‐servo‐elastic simulations. Taking PyConTurb as the baseline, the Kaimal model significantly underestimates fatigue of the downwind main bearing, with between 10% and 40% less damage. The Mann model also underestimates the downwind main bearing fatigue by up to 30%. The upwind main bearing damage is driven by mean loads, and differences between models are less significant, although the trends are similar. Reasons for these discrepancies are investigated and attributed to differences in spatial and temporal variations among the turbulence models.

17 WIND ENERGY↗
DOE OSTI2021

Multi-fidelity electrochemical modeling of thermally activated battery cells

Thermally activated batteries undergo a series of coupled physical changes during activation that influence battery performance. These processes include energetic material burning, heat transfer, electrolyte phase change, capillary-driven two-phase porous flow, ion transport, electrochemical reactions, and electrical transport. Several of these processes are strongly coupled and have a significant effect on battery performance, but others have minimal impact or may be suitably represented by reduced-order models. Additionally, assessing the relative importance of these phenomena must be based on comparisons to a high-fidelity model including all known processes. In this work, we first present and demonstrate a high-fidelity, multi-physics model of electrochemical performance. This novel multi-physics model enables predictions of how competing physical processes affect battery performance and provides unique insights into the difficult-to-measure processes that happen during battery activation. We introduce four categories of model fidelity that include different physical simplifications, assumptions, and reduced-order models to decouple or remove costly elements of the simulation. Using this approach, we show an order-of-magnitude reduction in computational cost while preserving all design-relevant quantities of interest within 5 percent. The validity of this approach and these model reductions is demonstrated by comparison between results from the full fidelity model and the different reduced models.

25 ENERGY STORAGE↗
DOE OSTI2025

Machine learning of 27Al NMR electric field gradient tensors for crystalline structures from DFT

NMR crystallography has emerged as a promising technique for the determination and refinement of atomic coordinates in crystal structures. The crystal structure of compounds containing quadrupolar nuclei, such as 27Al, can be improved by directly comparing solid-state NMR measurements to DFT computations of the electric field gradient (EFG) tensor. The non-negligible computational cost of these first-principles calculations limits the applicability of this method to all but the most well-defined structures. We developed a fast, low-cost machine learning model to predict EFG parameters based on local structural motifs and elemental parameters. We computed 8081 EFG tensors from 1681 27Al crystalline solids using DFT and benchmarked them against 105 experimentally measured 27Al sites. Surprisingly, simple local geometric features dominate the predictive performance of the resulting random-forest model, yielding an R2 value of 0.98 and an RMSE of 0.61 MHz for CQ, the quadrupolar coupling constant. This model accuracy should enable pre-refining future structural assignments before finally validating with first-principles calculations. Such a catalogue of 27Al NMR tensors can serve as a tool for researchers assigning complex NMR spectra influenced by the nuclear electric quadrupole interaction.

Sun, He↗