Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear equations”

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 55 records · Page 3

Shock initiation of low density polymer bonded explosive LX-14: A study of two morphologies

A series of six shock initiation experiments have been carried out on low density LX-14 powder in order to simulate a shock insult on the heavily damage polymer bonded explosive, LX-14. Two distinct morphologies were studied (tap density molding powder and machined swarf), both at the same density of 0.942 g/cm 3 , or 50.1% theoretical maximum density. The purpose of these experiments was to provide data to help make an assessment of the effects that damage has on the material sensitivity to a planar shock. This was achieved primarily by providing shock sensitivity data in the form of a Pop plot, and also reactants equation of state data, which aids in the determination of input conditions for both the experiments performed in this work and also future experiments of this material type. The experiments were of a cut-back format, consisting of four sample heights on each shot and diagnosed with optical velocimetry. The experiments were carried out at the Technical Area 40 Chamber 9 gas gun facility at the Los Alamos National Laboratory, where the LX-14 targets were subjected to Al 6061 and Oxygen Free High Conductivity copper impactors launched to velocities up to 2.14 km/s. Time corrected reactive growth wave profiles are presented in this paper along with the derivation of the following Hugoniot parameters for this explosive, where the molding powder and machine swarf are represented by the following linear equations, respectively, U s = 1.64 (±0.64)u p + 2.25 (±0.49) and U s = 0.87 (±.0.60)u p + 4.08 (±0.49). The results show that the steady increase in shock sensitivity with increasing void fraction reaches an inflection point beyond which the shock sensitivity begins to decease. This inflection point lies between 65% and 50% of the theoretical maximum density of the LX-14. In both cases, the damaged LX-14 was not as sensitive as expected, with a relative shock sensitivity of the molding powder being less than the pressed LX-14, and the machined swarf having a shock sensitivity that is comparable to pressed LX-14.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Global bases for nonplanar loop integrands, generalized unitarity, and the double copy to all loop orders

We introduce a constructive method for defining a global loop-integrand basis for scattering amplitudes, encompassing both planar and nonplanar contributions. Our approach utilizes a graph-based framework to establish a well-defined, non-redundant basis of integrands. This basis, constructed from a chosen set of non-redundant graphs together with a selection of irreducible scalar products, provides clear insights into various physical properties of scattering amplitudes and proves useful in multiple contexts, such as on-shell Ward identities and manifesting gauge-choice independence. A key advantage of our integrand basis is its ability to streamline the generalized unitarity method. Specifically, we can directly read off the coefficients of basis elements without resorting to ansätze or solving linear equations. This novel approach allows us to lift generalized unitarity cuts — expressed as products of tree amplitudes — to loop-level integrands, facilitating the use of the tree-level double copy to generate complete gravitational integrands at any loop order. This method circumvents the difficulties in identifying complete higher-loop-order gauge-theory integrands that adhere to the color-kinematics duality. Additionally, our cut-based organization is well-suited for expansion in hard or soft limits, aiding in the exploration of ultraviolet or classical limits of scattering amplitudes.

Effective Field Theories↗

Conformal bootstrap deformations

We explore the space of extremal functionals in the conformal bootstrap. By recasting the bootstrap problem as a set of non-linear equations parameterized by the CFT data, we find an efficient algorithm for converging to the extremal solution corresponding to the boundary of allowed regions in the parameter space of CFTs. Furthermore, by deforming these solutions, we demonstrate that certain solutions corresponding to known theories are continuously connected. Employing these methods, we will explore the space of non-unitary CFTs in the context of modular as well as correlation function bootstrap. In two dimensions, we show that the extremal solution corresponding to the Ising model is connected to that of the Yang-Lee minimal model. By deforming this solution to three dimensions, we provide evidence that the CFT data obtained in this way is compatible with the E-expansion for a non-unitary theory

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data-Driven Distributed Algorithms for Estimating Eigenvalues and Eigenvectors of Interconnected Dynamical Systems

Here, the paper presents data-driven algorithms to estimate in a distributed manner the eigenvalues, right and left eigenvectors of an unknown linear (or linearized) interconnected dynamic system. In particular, the proposed algorithms do not require the identification of the system model in advance before performing the estimation. As a first step, we consider interconnected dynamical system with distinct eigenvalues. The proposed strategy first estimates the eigenvalues using the well-known Prony method. The right and left eigenvectors are then estimated by solving distributively a set of linear equations. One important feature of the proposed algorithms is that the topology of communication network used to perform the distributed estimation can be chosen arbitrarily, given that it is connected, and is also independent of the structure or sparsity of the system (state) matrix. The proposed distributed algorithms are demonstrated via a numerical example.

97 MATHEMATICS AND COMPUTING↗

Transport error estimation using residual Monte Carlo

The residual Monte Carlo (RMC) method is also known in the literature as sequential Monte Carlo and reduced-source Monte Carlo. Given a Monte Carlo method for solving a linear equation and an approximate solution to that system, the residual method enables use of essentially the same Monte Carlo algorithm to directly compute the additive error or “defect” associated with the approximate solution. As the size of the defect decreases relative to the size of the solution, the residual Monte Carlo method becomes increasingly efficient relative to the standard Monte Carlo (SMC) method. Here we present a new RMC algorithm for evaluating the space-angle error in S n radiation transport solutions, and provide computational examples demonstrating that it can be far more efficient than SMC for this purpose. Herein we also describe a particular pitfall that must be avoided if RMC is to be efficient, and explain why the performance of RMC can significantly differ between different transport problems and different quantities of interest for the same problem.

97 MATHEMATICS AND COMPUTING↗

Optimizing the hypre solver for manycore and GPU architectures

The solution of large-scale combustion problems with codes such as Uintah on modern computer architectures requires the use of multithreading and GPUs to achieve performance. Uintah uses a low-Mach number approximation that requires iteratively solving a large system of linear equations. The Hypre iterative solver has solved such systems in a scalable way for Uintah, but the use of OpenMP with Hypre leads to at least slowdown due to OpenMP overheads. The proposed solution uses the MPI Endpoints within Hypre, where each team of threads acts as a different MPI rank. This approach minimizes OpenMP synchronization overhead and performs as fast or (up to 1.44) faster than Hypre's MPI-only version, and allows the rest of Uintah to be optimized using OpenMP. The profiling of the GPU version of Hypre shows the bottleneck to be the launch overhead of thousands of micro-kernels. The GPU performance was improved by fusing these micro-kernels and was further optimized by using Cuda-aware MPI, resulting in an overall speedup of 1.16—1.44 compared to the baseline GPU implementation. The above optimization strategies were published in the International Conference on Computational Science 2020 [1]. This work extends the previously published research by carrying out the second phase of communication-centered optimizations in Hypre to improve its scalability on large-scale supercomputers. Additionally, this includes an efficient non-blocking inter-thread communication scheme, communication-reducing patch assignment, and expression of logical communication parallelism to a new version of the MPICH library that utilizes the underlying network parallelism [2]. The above optimizations avoid communication bottlenecks previously observed during strong scaling and improve performance by up to 2 on 256 nodes of Intel Knight's Landing processor.

97 MATHEMATICS AND COMPUTING↗

Extended Lagrangian Born–Oppenheimer molecular dynamics for orbital-free density-functional theory and polarizable charge equilibration models

We report extended Lagrangian Born–Oppenheimer molecular dynamics (XL-BOMD) is formulated for orbital-free Hohenberg–Kohn density-functional theory and for charge equilibration and polarizable force-field models that can be derived from the same orbital-free framework. The purpose is to introduce the most recent features of orbital-based XL-BOMD to molecular dynamics simulations based on charge equilibration and polarizable force-field models. These features include a metric tensor generalization of the extended harmonic potential, preconditioners, and the ability to use only a single Coulomb summation to determine the fully equilibrated charges and the interatomic forces in each time step for the shadow Born–Oppenheimer potential energy surface. The orbital-free formulation has a charge-dependent, short-range energy term that is separate from long-range Coulomb interactions. This enables local parameterizations of the short-range energy term, while the long-range electrostatic interactions can be treated separately. The theory is illustrated for molecular dynamics simulations of an atomistic system described by a charge equilibration model with periodic boundary conditions. The system of linear equations that determines the equilibrated charges and the forces is diagonal, and only a single Ewald summation is needed in each time step. The simulations exhibit the same features in accuracy, convergence, and stability as are expected from orbital-based XL-BOMD.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Interpretation of multiple solutions in fully iterative GF2 and GW schemes using local analysis of two-particle density matrices

Due to the presence of non-linear equations, iterative Green’s function methods can result in multiple different solutions even for simple molecular systems. In contrast to the wave-function methods, a detailed and careful analysis of such molecular solutions was not performed before. In this work, we use two-particle density matrices to investigate local spin and charge correlators that quantify the charge resonance and covalent characters of these solutions. When applied within the unrestricted orbital set, spin correlators elucidate the broken symmetry of the solutions, containing necessary information for building effective magnetic Hamiltonians. Based on GW and GF2 calculations of simple molecules and transition metal complexes, we construct Heisenberg Hamiltonians, four-spin-four-center corrections, and biquadratic spin–spin interactions. These Hamiltonian parameterizations are compared to previous wave-function calculations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Coordinate parameterisation and spectral method optimisation for Beltrami field solver in stellarator geometry

The numerical solution of the stepped pressure equilibrium (Hudson et al 2012 Phys. Plasmas 19 112502) requires a fast and robust solver to obtain the Beltrami field in three-dimensional geometry such as stellarators. The spectral method implemented in the stepped pressure equilibrium code (SPEC) is efficient when the domain is a hollow torus, but ill-conditioning of the discretised linear equations occurs in the (solid) toroid due to the artificially singular coordinate parameterisation near the axis. Here, we propose an improved choice for the reference axis to prevent coordinates surfaces from overlapping. Then, we examine the parity and asymptotics of the magnetic vector potential near the axis and suggest the use of recombined and rescaled Zernike radial basis functions. The maximum relative error in the magnetic field of the Wendelstein 7-X geometry is shown to reach 10 –9 at high resolution in a series of convergence tests and benchmarks against the boundary integral equation solver for Taylor states. The new method is also reported to significantly improve the accuracy of multi-volume SPEC calculations. A comparison between free-boundary SPEC and the analytical Dommaschk potential is presented with higher-than-usual Fourier resolution. It is illustrated that we are able to resolve low amplitude current sheets when an interface is placed where there is no flux surface in the analytic solution. This was previously concealed because of insufficient numerical resolution.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

3-regular three-XORSAT planted solutions benchmark of classical and quantum heuristic optimizers

With current semiconductor technology reaching its physical limits, special-purpose hardware has emerged as an option to tackle specific computing-intensive challenges. Optimization in the form of solving quadratic unconstrained binary optimization problems, or equivalently Ising spin glasses, has been the focus of several new dedicated hardware platforms. These platforms come in many different flavors, from highly-efficient hardware implementations on digital-logic of established algorithms to proposals of analog hardware implementing new algorithms. In this work, we use a mapping of a specific class of linear equations whose solutions can be found efficiently, to a hard constraint satisfaction problem (three-regular three-XORSAT, or an Ising spin glass) with a 'golf-course' shaped energy landscape, to benchmark several of these different approaches. We perform a scaling and prefactor analysis of the performance of Fujitsu's digital annealer unit (DAU), the D-Wave advantage quantum annealer, a virtual MemComputing machine, Toshiba's simulated bifurcation machine (SBM), the SATonGPU algorithm from Bernaschi et al, and our implementation of parallel tempering. We identify the SATonGPU and DAU as currently having the smallest scaling exponent for this benchmark, with SATonGPU having a small scaling advantage and in addition having by far the smallest prefactor thanks to its use of massive parallelism. Furthermore, our work provides an objective assessment and a snapshot of the promise and limitations of dedicated optimization hardware relative to a particular class of optimization problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Impact of property covariance on cluster weak lensing scaling relations

ABSTRACT We present an investigation into a hitherto unexplored systematic that affects the accuracy of galaxy cluster mass estimates with weak gravitational lensing. Specifically, we study the covariance between the weak lensing signal, ΔΣ, and the ‘true’ cluster galaxy number count, Ngal, as measured within a spherical volume that is void of projection effects. By quantifying the impact of this covariance on mass calibration, this work reveals a significant source of systematic uncertainty. Using the MDPL2 simulation with galaxies traced by the SAGE semi-analytic model, we measure the intrinsic property covariance between these observables within the three-dimensional vicinity of the cluster, spanning a range of dynamical mass and redshift values relevant for optical cluster surveys. Our results reveal a negative covariance at small radial scales (R ≲ R200c) and a null covariance at large scales (R ≳ R200c) across most mass and redshift bins. We also find that this covariance results in a $2{\!-\!}3~{{\ \rm per\ cent}}$ bias in the halo mass estimates in most bins. Furthermore, by modelling Ngal and ΔΣ as multi-(log)-linear equations of secondary halo properties, we provide a quantitative explanation for the physical origin of the negative covariance at small scales. Specifically, we demonstrate that the Ngal–ΔΣ covariance can be explained by the secondary properties of haloes that probe their formation history. We attribute the difference between our results and the positive bias seen in other works with (mock)-cluster finders to projection effects. These findings highlight the importance of accounting for the covariance between observables in cluster mass estimation, which is crucial for obtaining accurate constraints on cosmological parameters.

Astronomy & Astrophysics↗

Alternative approach to quantum imaginary time evolution

There is increasing interest in quantum algorithms (QAs) that are based on the imaginary time evolution (ITE), a successful classical numerical approach to obtain ground states. However, most of the proposals so far require heavy postprocessing computational steps on a classical computer, such as solving linear equations. Here we provide an alternative approach to implement ITE. A key feature in our approach is the use of an orthogonal basis set: the propagated state is efficiently expressed in terms of orthogonal basis states at every step of the evolution. We argue that the number of basis states needed at those steps to achieve an accurate solution can be kept on the order of n , the number of qubits, by controlling the precision (number of significant digits) and the imaginary time increment. The number of quantum gates per imaginary time step is estimated to be polynomial in n . Additionally, while in many QAs the locality of the Hamiltonian is a key assumption, in our algorithm this restriction is not required. This characteristic of our algorithm renders it useful for studying highly nonlocal systems, such as the occupation-representation nuclear shell model. Here, we illustrate our algorithm through numerical implementation on an IBM quantum simulator.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Assessing the Feasibility of Bordered Block Diagonal Reordering in Power System Matrices using Fully Convolutional Network

In electromagnetic transient (EMT) simulations for power systems and inverter-based resources (IBRs), the arrangement of states within the system's linear equations, represented by matrix A in Ax=b, is critical. The state ordering in matrix A can highlight distinct characteristics of the system's graph, and identifying an optimal state ordering is crucial for efficient computation. The choice of state ordering, however, is dependent on the solver used, as each solver may perform optimally with different matrix patterns. With a wide array of matrix reordering algorithms available, selecting the most suitable one becomes challenging without insights into the matrix's ideal configuration. To address this, the paper proposes a fully convolutional network (FCN) to evaluate the reordering potential of the A matrix into a bordered block diagonal (BBD) pattern, which is commonly observed in power system and IBR modeling. The FCN's assessment aims to streamline the solver's operation, which in turn could substantially reduce the computational time required to find a solution.

Xia, Qianxue↗

Benchmarking Optimizers for Qumode State Preparation with Variational Quantum Algorithms

Quantum state preparation involves preparing a target state from an initial system, a process integral to applications such as quantum machine learning and solving systems of linear equations. Recently, there has been a growing interest in qumodes due to advancements in the field and their potential applications. However there is a notable gap in the literature specifically addressing this area. This paper aims to bridge this gap by providing performance benchmarks of various optimizers used in state preparation with Variational Quantum Algorithms. We conducted extensive testing across multiple scenarios, including different target states, both ideal and sampling simulations, and varying numbers of basis gate layers. Our evaluations offer insights into the complexity of learning each type of target state and demonstrate that some optimizers perform better than others in this context. Notably, the Powell optimizer was found to be exceptionally robust against sampling errors, making it a preferred choice in scenarios prone to such inaccuracies. Additionally, the Simultaneous Perturbation Stochastic Approximation optimizer was distinguished for its efficiency and ability to handle increased parameter dimensionality effectively.

Kan, Shuwen [Fordham University]↗

Finite-frequency modeling of regional tropospheric infrasound using realistic atmospheres and terrain

Infrasonic waves have been observed to propagate to regional (greater than 15 km) distances through the troposphere. Infrasound propagation in the geometric acoustics approximation has shown that realistic terrain can scatter acoustic energy from tropospheric ducts; however, ray methods cannot intrinsically capture finite-frequency behavior such as diffraction. A two-dimensional finite-difference time-domain (FDTD) method has been developed to solve linearized equations for infrasound propagation with realistic terrain. Acoustic wave propagation over 100 km with both flat terrain and a Gaussian hill was first simulated in order to compare finite-frequency propagation with ray predictions. The effects of realistic terrain and atmospheres on infrasound signals from a 2012 surface explosion at the Utah Testing and Training Range are then investigated. Propagation through the troposphere is suggested by array processing results, but eigenrays are not predicted due to weak to nonexistent ducting conditions. FDTD modeling suggests that the inclusion of terrain and finite frequency effects helps explain much of the observed signal in a realistic scenario. Furthermore, these results suggest that geometric acoustics may underestimate propagation through the troposphere, and that recorded waveforms at regional distances may be noticeably affected by terrain.

58 GEOSCIENCES↗

HyKKT

HyKKT (pronounced as "hiked") is a package for solving systems of linear equations of Karush-Kuhn-Tucker (KKT) form, which typically arise in optimization problems, such as optimal power flow analysis. HyKKT uses Cholesky instead of LDL^T factorization and solves the general KKT system to a desired numerical precision via block reduction and conjugate gradient on the Schur complement. Such implementation is more suitable for implementation on graphic processing units (GPUs).

Regev, Shaked↗

OpenMxP-Opensource Mixed Precision Computing

This is an opensource library for benchmarking the system's GPU mixed precision capabilities. The software calculates solution of the system of linear equation in 64bit accuracy using mixed precision techniques and iterative refinement. Original benchmark designed is done by ICL, and it is name HPL-MxP (HPL-AI)

Lu, Hao↗

Tardigrade, Version 1.1x

Tardigrade is a collection of functions, libraries, and stand-alone code which enables the simulation of materials using the higher-order micromorphic framework. The tools present are the interface to INL's MOOSE code which is used as the underlying FEA solver, several constitutive equations (linear elasticity, a pressure-sensitive elasto-plastic model, crystal plasticity, and additional models for geo-materials) useful for demonstration purposes and the simulation of some materials, the micromorphic filter which converts DNS information to micromorphic stress-deformation quantities, and the overlap coupling framework which enables multi-scale simulations of a coupled higher-order macroscale and a classically defined microscale.

Miller, Nathan↗