Search NASA⌕ Search

SEARCH · Search NASA

Results for “Scaling and squaring 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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Exploiting Kronecker structure in exponential integrators: Fast approximation of the action of φ $-$functions of matrices via quadrature

Here, in this article, we propose an algorithm for approximating the action of φ $-$ functions of matrices against vectors, which is a key operation in exponential time integrators. In particular, we consider matrices with Kronecker sum structure, which arise from problems admitting a tensor product representation. The method is based on quadrature approximations of the integral form of the φ $-$ functions combined with a scaling and modified squaring method. Owing to the Kronecker sum representation, only actions of 1D matrix exponentials are needed at each quadrature node and assembly of the full matrix can be avoided. Additionally, we derive a priori bounds for the quadrature error, which show that, as expected by classical theory, the rate of convergence of our method is supergeometric. Guided by our analysis, we construct a fast and robust method for estimating the optimal scaling factor and number of quadrature nodes that minimizes the total cost for a prescribed error tolerance. We investigate the performance of our algorithm by solving several linear and semilinear time-dependent problems in 2D and 3D. The results show that our method is accurate and orders of magnitude faster than the current state-of-the-art.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Stochastic and mixed density functional theory within the projector augmented wave formalism for simulation of warm dense matter

Stochastic density functional theory (DFT) and mixed stochastic-deterministic DFT are burgeoning approaches for the calculation of the equation of state and transport properties in materials under extreme conditions. In the intermediate warm dense matter regime, a state between correlated condensed matter and kinetic plasma, electrons can range from being highly localized around nuclei to delocalized over the whole simulation cell. The plane-wave basis pseudopotential approach is thus the typical tool of choice for modeling such systems at the DFT level. Unfortunately, stochastic DFT methods scale as the square of the maximum plane-wave energy in this basis. To reduce the effect of this scaling and improve the overall description of the electrons within the pseudopotential approximation, we present stochastic and mixed DFT approaches developed and implemented within the projector augmented wave formalism. In conclusion, we compare results between the different DFT approaches for both single-point and molecular dynamics trajectories and present calculations of self-diffusion coefficients of solid density carbon from 1 to 50 eV.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Calculating the divided differences of the exponential function by addition and removal of inputs

We introduce a method for calculating the divided differences of the exponential function by means of addition and removal of items from the input list to the function. Our technique exploits a new identity related to divided differences recently derived by F. Zivcovich. We show that upon adding an item to or removing an item from the input list of an already evaluated exponential, the re-evaluation of the divided differences can be done with only O(sn) floating point operations and O(sn) bytes of memory, where [z 0 ,...,z n ] are the inputs and s ∝ max i,j |z i – z j |. We demonstrate our algorithm’s ability to deal with input lists that are orders-of-magnitude longer than the maximal capacities of the current state-of-the-art. Here, we discuss in detail one practical application of our method: the efficient calculation of weights in the off-diagonal series expansion quantum Monte Carlo algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Large-Scale Inference of Multivariate Regression for Heavy-Tailed and Asymmetric Data

Large-scale multivariate regression is a fundamental statistical tool with a wide range of applications. Here, this study considers the problem of simultaneously testing a large number of general linear hypotheses, encompassing covariate-effect analysis, analysis of variance, and model comparisons. The challenge that accompanies a large number of tests is the ubiquitous presence of heavy-tailed and/or highly skewed measurement noise, which is the main reason for the failure of conventional least squares-based methods. For large-scale multivariate regression, we develop a set of robust inference methods to explore data features such as heavy tailedness and skewness, which are not visible to least squares methods. The new testing procedure is based on the data-adaptive Huber regression and a new covariance estimator of regression estimates. Under mild conditions, we show that our methods produce consistent estimates of the false discovery proportion. Extensive numerical experiments and an empirical study on quantitative linguistics demonstrate the advantage of the proposed method over many state-of-the-art methods when the data are generated from heavy-tailed and/or skewed distributions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Open-Shell Tensor Hypercontraction

The extension of least-squares tensor hypercontracted second- and third-order Møller–Plesset perturbation theory (LS-THC-MP2 and LS-THC-MP3) to open-shell systems is an important development due to the scaling reduction afforded by THC and the ubiquity of molecular ions, radicals, and other open-shell reactive species. The complexity of wavefunction-based quantum-chemical methods such as Møller–Plesset and coupled cluster theory is reflected in the steep scaling of the computational costs with the molecular size. The least-squares tensor hypercontraction (LS-THC) method is an efficient, single-step factorization for the two-electron integral tensor but can also be used to factorize the double excitation amplitudes, leading to significant scaling reduction. Herein we extend this promising method to open-shell variants of LS-THC-MP2 and -MP3 by using diagrammatic techniques and explicit spin summation. The accuracy of the resulting methods for open-shell species is benchmarked on standard test systems such as regular alkanes as well as realistic systems involving bond breaking, radical stabilization, and other effects. We find that open-shell LS-THC-MPn methods exhibit errors highly comparable to those produced by closed-shell LS-THC-MPn and are highly insensitive to particular chemical interactions, geometries, or even moderate spin contamination.

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

A micromorphic filter for determining stress and deformation measures from direct numerical simulations of lower length scale behavior

A micromorphic filter is presented for the extraction of stress and deformation measures from underlying direct numerical simulation (DNS) of microstructural mechanical response. The filter is consistent with the micromorphic continuum theory of Eringen and Suhubi (1964), and allows the interrogation of a DNS to generate higher order constitutive models. The filter adopts aspects of the overlap coupling techniques for atomistic-continuum scale-bridging in order to update the nodal degrees of freedom of the finite-element-based filter. Here, two methods for the extraction of quantities of interest from the underlying DNS are presented. The first is a least squares fitting technique which is appropriate for finite-element-style macro-scale domains, and the second is a variationally based approach which generalizes the method to any macro-scale domain which has a variational form. No restrictions on the form of the micro-scale simulation are inherent to the approach, provided that the required quantities (stress, position, etc.) can be provided. The filter is applied to a simple homogeneous medium undergoing homogeneous deformation to demonstrate the recovery of a classical continuum response, what we call the null case. We then apply the framework to the same homogeneous medium with a central and edge penny-shaped crack to show micromorphic effects. We demonstrate that varying the size of the filter causes the micromorphic behaviors to arise and then dissipate as the filter becomes smaller than the crack's length scale. Additionally we show the effect of filter size on a chiral element network along with a plate perforated with evenly spaced and perturbed holes through the thickness. The micromorphic effects are shown to be present for the chiral elements under any loading but become most pronounced when a single element is located within each averaging domain. Micromorphic effects become pronounced for the plate upon the onset of localization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Green’s functions on a renormalized lattice: An improved method for the integer quantum Hall transition

Highlights: • Speed up of numerical calculations by exact renormalization group steps. • Practical approach to handle delicate scaling analysis. • Absence of evidence to prefer marginal corrections over power-law corrections. We introduce a performance-optimized method to simulate localization problems on bipartite tight-binding lattices. It combines an exact renormalization group step to reduce the sparseness of the original problem with the recursive Green’s function method. We apply this framework to investigate the critical behavior of the integer quantum Hall transition of a tight-binding Hamiltonian defined on a simple square lattice. In addition, we employ an improved scaling analysis that includes two irrelevant exponents to characterize the shift of the critical energy as well as the corrections to the dimensionless Lyapunov exponent. We compare our findings with the results of a conventional implementation of the recursive Green’s function method, and we put them into broader perspective in view of recent development in this field.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Rodeo Algorithm for Quantum Computing

We present a stochastic quantum computing algorithm that can prepare any eigenvector of a quantum Hamiltonian within a selected energy interval $\ [E-\epsilon, E+\epsilon]$. In order to reduce the spectral weight of all other eigenvectors by a suppression factor δ, the required computational effort scales as $\ O[|\log \delta|/(p \epsilon)]$, where p s the squared overlap of the initial state with the target eigenvector. The method, which we call the rodeo algorithm, uses auxiliary qubits to control the time evolution of the Hamiltonian minus some tunable parameter E . In this manner, we converge to the target eigenvector with exponential accuracy in the number of measurements. In addition to preparing eigenvectors, the method can also compute the full spectrum of the Hamiltonian. We illustrate the performance with several examples. For energy eigenvalue determination with error $\epsilon$, the computational scaling is $\ O[(\log \epsilon)^2/(p \epsilon)]$. For eigenstate preparation, the computational scaling is $\ O(\log \Delta/p)$, where $\Delta$ is the magnitude of the orthogonal component of the residual vector. The speed for eigenstate preparation is exponentially faster than that for phase estimation or adiabatic evolution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

An improved Method for Determining Transient Fuel Dilution of Oil in an Internal-Combustion Engine Using Laser-Induced Florescence and Multivariate Least Square Calibration

An optical diagnostic, based on laser-induced fluorescence (LIF), has been developed for on-engine measurements of real-time fuel dilution of engine oil or fuel in oil (FIO). Fuel dilution of oil is broadly relevant to advancing engine technology including durability, calibration, and catalyst-system management, and believed to promote destructive stochastic pre-ignition (SPI) during high-load engine operations. While standard (e.g., ASTM D3524-90) methods are not capable of real-time transient measurements, the LIF technique resolves transient dilution on the minutes time scale. We have expanded on our original FIO instrument development by introducing an improved analysis based on multivariate least square chemometrics analysis. The measurement uses a fuel dye (180–1300 parts per million, by mass) and monitors for its presence in the oil using 532 nm excitation and LIF. While the original FIO instrument utilized a two-color ratio method for analysis, the improved chemometric analysis uses the fully resolved LIF dye spectra to provide better predictive FIO accuracy (>92%) over a wide FIO range (1.5–14%) typical of engine application. We also investigate the effect of oil temperature on the LIF signal. Limited engine applications for demonstrating and validating the improved FIO instrument are shown, and the related data used to quantify practical detection limit and sensitivity. The improved analysis is insensitive to laser power fluctuation and change in detector integration time, providing an excellent FIO sensitivity (1–2%) and detection limit (0.01 %FIO) over a wide range of loads and injection timings, illustrating this updated approach to be a promising tool for advancing engine technology.

42 ENGINEERING↗
DOE OSTI2025

Machine learning force field model for kinetic Monte Carlo simulations of itinerant Ising magnets

Here, we present a scalable machine learning (ML) framework for large-scale kinetic Monte Carlo (kMC) simulations of itinerant electron Ising systems. As the effective interactions between Ising spins in such itinerant magnets are mediated by conducting electrons, the calculation of energy change due to a local spin update requires solving an electronic structure problem. Such repeated electronic structure calculations could be overwhelmingly prohibitive for large systems. Assuming the locality principle, a convolutional neural network (CNN) model is developed to directly predict the effective local field and the corresponding energy change associated with a given spin update based on Ising configuration in a finite neighborhood. As the kernel size of the CNN is fixed at a constant, the model can be directly scalable to kMC simulations of large lattices. Our approach is reminiscent of the ML force field models widely used in first-principles molecular dynamics simulations. Applying our ML framework to a square-lattice double-exchange Ising model, we uncover unusual coarsening of ferromagnetic domains at low temperatures. Our work highlights the potential of ML methods for large-scale modeling of similar itinerant systems with discrete dynamical variables.

machine learning↗
DOE OSTI2023

A combined ensemble-volume average homogenization method for lattice structures with defects under dynamic and static loading

In the study of lattices structures, both experiments and numerical simulations are often conducted with small samples. Using combined ensemble and volume averaging, this work introduces a method to extract a macroscopic constitutive response of a lattice material from numerical simulations performed in periodic domains. The domain size needed to obtain statistically accurate results is investigated. Similar to molecular dynamics, the concept of the virial stress is introduced after homogenized equations are derived using the ensemble averaging method. Under static conditions, the virial stress is shown to agree with the volume averaged solid stress. Using the homogenization method, constitutive relations for this stress can be obtained from systems with uniform strains. Application of such obtained constitutive relations to more general cases results in an error proportional to the square of the ratio between the lattice length scale and the macroscopic length scale. Taking advantage of this property, numerical simulations are performed in systems with a uniform gradient of the average velocity. The volume average method is then used to accelerate convergence when studying lattices with defects. To avoid the artificial numerical time scale from the size of a representative volume element divided by the wave speed, a numerical scheme is developed to enforce a spatially uniform velocity gradient within the computational domain while allowing fluctuations of the velocity or displacement to develop naturally. To account for probability distribution of lattice defects, the stress is calculated as the ensemble-volume averaged value. For dynamic systems, energy dissipation properties are also studied.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Quantum state preparation with resolution refinement

We introduce a method called resolution refinement that allows one to bootstrap eigenstate preparation on a quantum computer. We first prepare an eigenstate of a low-resolution Hamiltonian using any method of choice. The eigenstate is then lifted to higher resolution and adiabatically evolved to produce the corresponding eigenstate of a higher-fidelity Hamiltonian. We give examples of resolution refinement applied to both single-particle basis states as well as a spatial lattice grid. For basis refinement, we compute few-body ground states of the Busch model for interacting particles in a harmonic trap in one dimension. For lattice refinement, we compute Hartree-Fock nuclear states for a central Woods-Saxon potential in three dimensions, and we compute bound states and continuum states in a multi-species Hubbard model of fermions in one dimension. In all cases, the method is efficient and requires an adiabatic evolution time that scales with the inverse of the energy gap times the square root of the system size. We show that this very favorable scaling arises from the fact that resolution refinement does not make large changes to the structure or energies of the low-energy eigenstates.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Accelerated steady-state electrostatic particle-in-cell simulation of Langmuir probes

First-principles particle-in-cell (PIC) simulation is a powerful tool for understanding plasma behavior, but this power often comes at great computational expense. Artificially reducing the ion/electron mass ratio is a time-honored practice to reduce simulation costs. Usually, this is a severe approximation. However, for steady-state collisionless, electrostatic (Vlasov–Poisson) systems, the solution with reduced mass ratio can be scaled to the solution for the real mass ratio, with no approximation. This “scaled mass” method, which works with already-existing PIC codes, can reduce the computation time for a large class of electrostatic PIC simulations by the square root of the mass ratio. The particle distributions of the resulting steady state must be trivially rescaled to yield the true distributions, but the self-consistent electrostatic field is independent of the mass ratio. This method is equivalent to “numerical timestepping,” an approach that evolves electron and ion populations with different time steps. Numerical timestepping can be viewed as a special case of the speed-limited PIC (SLPIC) method, which is not restricted to steady-state phenomena. Although the scaled-mass approach is simplest, numerical timestepping and SLPIC more easily generalize to include other effects, such as collisions. The equivalence of these new approaches is demonstrated by applying them to simulate a cylindrical Langmuir probe in electron–argon plasma, speeding up simulation by two orders of magnitude. Methods such as SLPIC can therefore play an invaluable role in interpreting probe measurements by including geometric effects, collisions, secondary emission, and non-Maxwellian distributions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Creation of the VADER Code in SCALE [Abstract]

The VADER (Validation Analysis Data Evaluation Resource) is a new module in SCALE 6.3 that has been derived from the legacy USLSTATS program. VADER is a tool that allows the determination of bias and bias uncertainty for criticality safety computational methods. The older USLSTATS program, written in Java, existed outside of SCALE and provided tools to calculate only the confidence band with administrative margin (sometimes called USL-1) and the single-sided uniform width closed interval (USL-2). For normality testing it only offered a crude chi- squared normality test that had no user-configurable options and presented a simple pass/no-pass functionality.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Distributed-Memory Parallel JointNMF

Joint Nonnegative Matrix Factorization (JointNMF) is a hybrid method for mining information from datasets that contain both feature and connection information. We propose distributed-memory parallelizations of three algorithms for solving the JointNMF problem based on Alternating Nonnegative Least Squares, Projected Gradient Descent, and Projected Gauss-Newton. We extend well-known communication-avoiding algorithms using a single processor grid case to our coupled case on two processor grids. We demonstrate the scalability of the algorithms on up to 960 cores (40 nodes) with 60% parallel efficiency. The more sophisticated Alternating Nonnegative Least Squares (ANLS) and Gauss-Newton variants outperform the first-order gradient descent method in reducing the objective on large-scale problems. We perform a topic modelling task on a large corpus of academic papers that consists of over 37 million paper abstracts and nearly a billion citation relationships, demonstrating the utility and scalability of the methods.

Eswar, Srinivas↗
DOE OSTI2021

Randomized Algorithms for Scientific Computing (RASC)

Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Scaling Turbulent Combustion Fields in Explosions

We considered the topic of explosions from spherical high-explosive (HE) charges. We studied how the turbulent combustion fields scale. On the basis of theories of dimensional analysis by Bridgman and similarity theories of Sedov and Barenblatt, we found that all fields scaled with the explosion length scale r0. This included the blast wave, the mean and root mean squared (RMS) profiles of thermodynamic variables, combustion variables, velocities, vorticity, and turbulent Reynolds stresses. This was a consequence of the formulation of the problem and our numerical method, which both satisfied the similarity conditions of Sedov. We performed numerical simulations of 1 g charges and 1 kg charges; the solutions were identical (within roundoff error) when plotted in scaled variables. We also explored scaling laws related to three-phase pyrotechnic explosions. We show that although the scaling formally broke down, the fireball still essentially scaled with the explosion length scale r0. However, the discrete Lagrange particles (DLP) (phase 2) and the heterogeneous continuum model (HCM) of the DLP wakes (phase 3) did not scale with r0, and mean and RMS profiles could differ by a factor of 10 in some regions. This was because the DLP particles and wakes introduced an additional scale that broke the similarity conditions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Limiter-aware adaptive excitation control for hydropower generators with legacy voltage regulation systems

Hydropower units often rely on legacy excitation systems with fixed automatic voltage regulator (AVR) settings, but parameter drift, changing operating conditions, and evolving grid-service demands can degrade terminal-voltage regulation over time. This problem should be addressed because poor voltage regulation affects reactive-power support, system stability, and reliable plant operation, and replacing installed AVR and limiter logic is costly and disruptive in practice. To address this issue, this paper proposes a retrofit-friendly enhancement for hydropower generator excitation systems that combines adaptive tuning of the AVR middle lead–lag branch with a small proportional-integral correction for removing steady bias and slow drift. The adaptive laws are normalized, projection-bounded, and equipped with leakage, while adaptation is enabled only in the middle branch. Thus, the intent of the underexcitation and overexcitation limiters, as well as legacy current and rate limits, remains unchanged. Stability is analyzed under incremental performance assumptions, yielding boundedness and asymptotic tracking in the absence of saturation. The method is evaluated using real operational data from a utility-scale hydropower unit at Rocky Reach Dam, Unit C-8. Compared with the fixed AVR baseline, the proposed method reduces terminal-voltage mean squared error by about 70%, removes long periods of steady-state bias, and improves transient tracking while coexisting with limiter actions. These results show that substantial voltage-control improvement can be achieved on existing hydropower units with minimal integration effort and without replacing the installed AVR structure.

ESST5B model↗