Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical algorithms”

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 1,081 records · Page 60

Extended Lagrangian Born–Oppenheimer molecular dynamics using a Krylov subspace approximation

It is shown how the electronic equations of motion in extended Lagrangian Born–Oppenheimer molecular dynamics simulations can be integrated using low-rank approximations of the inverse Jacobian kernel. This kernel determines the metric tensor in the harmonic oscillator extension of the Lagrangian that drives the evolution of the electronic degrees of freedom. The proposed kernel approximation is derived from a pseudoinverse of a low-rank estimate of the Jacobian, which is expressed in terms of a generalized set of directional derivatives with directions that are given from a Krylov subspace approximation. The approach allows a tunable and adaptive approximation that can take advantage of efficient preconditioning techniques. The proposed kernel approximation for the integration of the electronic equations of motion makes it possible to apply extended Lagrangian first-principles molecular dynamics simulations to a broader range of problems, including reactive chemical systems with numerically sensitive and unsteady charge solutions. This can be achieved without requiring exact full calculations of the inverse Jacobian kernel in each time step or relying on iterative non-linear self-consistent field optimization of the electronic ground state prior to the force evaluations as in regular direct Born–Oppenheimer molecular dynamics. We note the low-rank approximation of the Jacobian is directly related to Broyden’s class of quasi-Newton algorithms and Jacobian-free Newton–Krylov methods and provides a complementary formulation for the solution of nonlinear systems of equations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Noise resilience of variational quantum compiling

Variational hybrid quantum-classical algorithms (VHQCAs) are near-term algorithms that leverage classical optimization to minimize a cost function, which is efficiently evaluated on a quantum computer. Recently VHQCAs have been proposed for quantum compiling, where a target unitary U is compiled into a short-depth gate sequence V. In this work, we report on a surprising form of noise resilience for these algorithms. Namely, we find one often learns the correct gate sequence V (i.e. the correct variational parameters) despite various sources of incoherent noise acting during the cost-evaluation circuit. Our main results are rigorous theorems stating that the optimal variational parameters are unaffected by a broad class of noise models, such as measurement noise, gate noise, and Pauli channel noise. Furthermore, our numerical implementations on IBM's noisy simulator demonstrate resilience when compiling the quantum Fourier transform, Toffoli gate, and W-state preparation. Hence, variational quantum compiling, due to its robustness, could be practically useful for noisy intermediate-scale quantum devices. Finally, we speculate that this noise resilience may be a general phenomenon that applies to other VHQCAs such as the variational quantum eigensolver.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Probabilistic partition of unity networks for high–dimensional regression problems

We explore the probabilistic partition of unity network (PPOU-Net) model in the context of high-dimensional regression problems and propose a general framework focusing on adaptive dimensionality reduction. With the proposed framework, the target function is approximated by a mixture of experts model on a low-dimensional manifold, where each cluster is associated with a fixed-degree polynomial. We present a training strategy that leverages the expectation maximization (EM) algorithm. During the training, we alternate between (i) applying gradient descent to update the DNN coefficients; and (ii) using closed-form formulae derived from the EM algorithm to update the mixture of experts model parameters. Under the probabilistic formulation, step (ii) admits the form of embarrassingly paralleliazable weighted least-squares solves. The PPOU-Nets consistently outperform the baseline fully-connected neural networks of comparable sizes in numerical experiments of various data dimensions. Here, we also explore the proposed model in applications of quantum computing, where the PPOU-Nets act as surrogate models for cost landscapes associated with variational quantum circuits.

97 MATHEMATICS AND COMPUTING↗

Quantification of silicon carbide grain structure in TRISO fuel by BSE image analysis

The grain structure of the silicon carbide (SiC) layer in tristructural-isotropic (TRISO) fuels has commonly been qualified in fuel specifications based on a qualitative comparison to visual standards to ensure undesirable microstructure are not produced. This approach is inherently dependent on subjective judgement and provides limited data for analysis or comparison. An alternative method to rapidly quantify (i.e., provide a numeric measure of) the grain structure of the SiC layer in TRISO fuels has been developed. This method relies on the identification of silicon carbide grain boundaries based on brightness variation in backscattered electron (BSE) images through the application of automated image processing algorithms. The speed with which the requisite BSE imaging and analysis may be completed enables the practical use of this method on an industrial scale as a part of qualifying TRISO fuel to meet a given specification on silicon carbide grain structure, which is an important parameter for TRISO fuel performance. The method is benchmarked by comparison to prior Electron-Backscattered Diffraction (EBSD) results for TRISO particles from the Advanced Gas Reactor (AGR) program.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Efficient Optimization of Energy Recovery From Geothermal Reservoirs With Recurrent Neural Network Predictive Models

Improving the long-term energy production performance of geothermal reservoirs can be accomplished by optimizing field development and management plans. Reliable prediction models, however, are needed to evaluate and optimize the performance of the underlying reservoirs under various operation and development strategies. In traditional frameworks, physics-based simulation models are used to predict the energy production performance of geothermal reservoirs. However, detailed simulation models are not trivial to construct, require a reliable description of the reservoir conditions and properties, and entail high computational complexity. Data-driven predictive models can offer an efficient alternative for use in optimization workflows. This paper presents an optimization framework for net power generation in geothermal reservoirs using a variant of the recurrent neural network (RNN) as a data-driven predictive model. The RNN architecture is developed and trained to replace the simulation model for computationally efficient prediction of the objective function and its gradients with respect to the well control variables. The net power generation performance of the field is optimized by automatically adjusting the mass flow rate of production and injection wells over 12 years, using a gradient-based local search algorithm. Two field-scale examples are presented to investigate the performance of the developed data-driven prediction and optimization framework. Furthermore, the prediction and optimization results from the RNN model are evaluated through comparison with the results obtained by using a numerical simulation model of a real geothermal reservoir.

15 GEOTHERMAL ENERGY↗

Machine-learning-aided cognitive reconfiguration for flexible-bandwidth HPC and data center networks [Invited]

This paper proposes a machine-learning (ML)-aided cognitive approach for effective bandwidth reconfiguration in optically interconnected datacenter/high-performance computing (HPC) systems. The proposed approach relies on a Hyper-X-like architecture augmented with flexible-bandwidth photonic interconnections at large scales using a hierarchical intra/inter-POD photonic switching layout. We first formulate the problem of the connectivity graph and routing scheme optimization as a mixed-integer linear programming model. A two-phase heuristic algorithm and a joint optimization approach are devised to solve the problem with low time complexity. Then, we propose an ML-based end-to-end performance estimator design to assist the network control plane with intelligent decision making for bandwidth reconfiguration. Numerical simulations using traffic distribution profiles extracted from HPC applications traces as well as random traffic matrices verify the accuracy performance of the ML design estimator ( < <#comment/> 9 % <#comment/> error) and demonstrate up to 5 × <#comment/> throughput gain from the proposed approach compared with the baseline Hyper-X network using fixed all-to-all intra/inter-portable data center interconnects.

Chen, Xiaoliang (ORCID:0000000278056237)↗

Quantifying vertical wind shear effects in shallow cumulus clouds over Amazonia

Abstract. This study analyses and quantifies the effects of vertical wind shear (VWS) on the properties of shallow cumulus cloud fields over Central Amazonia. We perform idealised simulations with high resolution (50 m horizontally and 20 m vertically) using the Dutch Atmospheric Large-Eddy Simulation (DALES) model, changing the initial conditions and large-scale forcing of VWS. The resulting cloud field is analysed by applying a cloud tracking algorithm to generate Lagrangian datasets of the life cycle of individual clouds as well as their time-varying core and margin dimensions. The reference run has no wind speed or directional shear and represents a typical day in the local dry season. Numerical experiments with moderate and high wind speed shear are simulated by adding linear increases in the wind speed of 1.2 and 2.4 m s−1 km−1, respectively. Three additional runs are made by adding 90∘ of wind rotation between the surface and the top of the domain (5 km) on top of the three wind speed shear conditions. We find that clouds developing in a sheared environment have horizontal equivalent diameter increased by up to 100 m on average, but the cloud depth is reduced. Our quantification shows that VWS tends to increase the size of the cloud cores but reduces their relative area, volume, and mass fractions compared to the overall cloud dimensions. The addition of 2.4 m s−1 km−1 of VWS decreases the relative core area by about 0.03 (about 10 % of the overall average) and its volume and mass ratios by about 0.05 (10 %–25 % in relative terms). Relevant for the cloud transport properties is that the updraught speed and the liquid water content are lower within the cores, and consequently so is the upward mass flux. All quantifications of mean cloud properties point to the inhibition of convective strength by VWS, therefore hampering the shallow-to-deep transition. However, open questions still remain given that the individually deepest clouds were simulated under high environmental shear, even though they occur in small numbers. This could indicate other indirect effects of VWS that have opposite effects on cloud development if found to be significant in the future.

54 ENVIRONMENTAL SCIENCES↗

Distributed Data-Driven Power Iteration for Strongly Connected Networks

Here, this paper presents data-driven power iteration to distributively estimate the dominant eigenvalues of an unknown linear time-invariant system. The proposed strategy only requires a single trajectory data or measurements. Furthermore, in order to perform the distributed estimation, the communication network topology can be chosen to be any strongly connected directed graphs. The proposed data-driven power iteration is demonstrated using several numerical examples and is then applied to estimate the generalized algebraic connectivity of cooperative systems and to control the epidemic spreading.

Gusrialdi, Azwirman↗

Superspin renormalization and slow relaxation in random spin systems

We develop an excited-state real-space renormalization group (RSRG-X) formalism to describe the dynamics of conserved densities in randomly interacting spin-12 systems. Our formalism is suitable for systems with U(1) and Z2 symmetries, and we apply it to chains of randomly positioned spins with dipolar XX+YY interactions, as arise in Rydberg quantum simulators and other platforms. The formalism generates a sequence of effective Hamiltonians that provide approximate descriptions for dynamics on successively smaller energy scales. These effective Hamiltonians involve “superspins”: two-level collective degrees of freedom constructed from (anti)aligned microscopic spins. Conserved densities can then be understood as relaxing via coherent collective spin flips. For the well-studied simpler case of randomly interacting nearest-neighbor XX+YY chains, the superspins reduce to single spins. Our formalism also leads to a numerical method capable of simulating the dynamics up to an otherwise inaccessible combination of large system size and late time. Focusing on disorder-averaged infinite-temperature autocorrelation functions, in particular the spin survival probability Sp¯(t), we demonstrate quantitative agreement between our algorithm and exact diagonalization (ED) at low but nonzero frequencies. Such agreement holds for chains with nearest-neighbor, next-nearest-neighbor, and long-range dipolar interactions. Our results indicate decay of Sp¯(t) slower than any power law and feature no significant deviation from the ∼1/ln2(t) asymptote expected from the infinite-randomness fixed-point of the nearest-neighbor model. We also apply the RSRG-X formalism to two-dimensional long-range systems of moderate size and find slow late-time decay of Sp¯(t).

Zhao, Yi J↗

A Study on Particle Trajectory Error in Finite-Element Particle-in-Cell Algorithms

Particle-in-cell (PIC) algorithms are widely used for the simulation of kinetic plasmas. PIC algorithms account for the interaction between charged particles in a plasma and the electromagnetic field in ambient space, including self-field interactions. The objective of this article is to study the error in charged particle trajectories present in finite-element (FE)-based PIC algorithms on unstructured meshes. We study how the trajectory error behaves according to the FE mesh resolution and the matrix solver employed in the FE algorithm. The study is performed by considering a trajectory established by a parabolic electric potential and an axial magnetic force acting on the charged particle. Under a proper choice combination of electric and magnetic field parameters, the 2-D particle trajectories comprise closed orbits. Numerical errors cause small perturbations on the trajectories, with cumulative effects. As a result, the resulting orbital trajectories exhibit distortions including spurious apsidal precession. These distortions provide a clear imprint of the numerical error. Here, we also study the numerical error in a quantitative fashion by computing the distance norm between the trajectories obtained by the exact fields and numerical fields.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Measuring representative volume elements from high-resolution grain-scale strain fields

Most crystalline materials present a highly heterogeneous response at the microscale, which can be affected by both internal factors (such as microstructural parameters) and external factors (such as loading). Relating microscale inhomogeneities to the macroscale response of a material requires the use of homogenisation techniques, usually based on the concept of a representative volume element (RVE)—the smallest volume of material that represents the global average response. Here, in this work, we present a new and robust experimental method of measuring the size of a strain-based RVE from high-resolution grain-scale strain fields obtained using digital image correlation (DIC). The proposed method is based on the statistical (stereological) nature of the RVE, which has been widely adopted in numerical studies, and involves dividing a strain field into randomly selected regions of varying sizes and statistically analysing the distributions of average strains within them. To validate the new method, we generate a large number of synthetic strain fields from a fractional Gaussian noise algorithm. The proposed stereological method is shown to be capable of producing reliable RVE measurements from a very large range of possible microscale strain fields while at the same time being robust in that it can produce RVE measurement results even in cases where other existing methods may be unable to do so. The proposed method has a low field-of-view requirement, only needing a field-of-view about 1.2 times as large as the RVE to produce reliable measurements. In addition, the stereological method offers significant flexibility since its statistical nature allows for control over how strict the RVE measurement should be in each case.

36 MATERIALS SCIENCE↗

Preserving Tracer Correlations in Moment-Based Atmospheric Transport Models

A linear non-diffusive algorithm for advective transport is developed that greatly improves the detail at which aerosols and clouds can be represented in atmospheric models. Linear advection schemes preserve tracer correlations but the most basic linear scheme is rarely used by atmospheric modelers on account of its excessive numerical diffusion. Higher-order schemes are in widespread use, but these present new problems as nonlinear adjustments are required to avoid occurrences of negative concentrations, spurious oscillations, and other non-physical effects. Generally successful at reducing numerical diffusion during the advection of individual tracers, for example, particle number or mass, the higher-order schemes fail to preserve even the simplest of correlations between interrelated tracers. As a result, important attributes of aerosol and cloud populations including radial moments of particle size distributions, molecular precursors related through chemical equilibria, aerosol mixing state, and distribution of cloud phase are poorly represented. We introduce a new transport scheme, minVAR, that is both non-diffusive and preservative of tracer correlations, thereby combining the best features of the basic and higher-order schemes while enabling new features such as the tracking of sub-grid information at arbitrarily fine scales with high computational efficiency.

54 ENVIRONMENTAL SCIENCES↗

A multilayer multi-configurational approach to efficiently simulate large-scale circuit-based quantum computers on classical machines

Here, a multilayer multi-configurational theory framework is adapted to simulate circuit-based quantum computers. Quantum addition of superpositions of an exponential number of summands is performed in polynomial time with high accuracy. We demonstrate numerically accurate calculations including up to one million qubits for entangling benchmarks. Simulation cost can be assessed by entropy-based entanglement measures. For the considered systems, we show that the entanglement only grows weakly with the system size. The present simulations demonstrate how quantum algorithms in low-entropy regimes can be used efficiently on classically simulated quantum computers.

97 MATHEMATICS AND COMPUTING↗

A divergence-free constrained magnetic field interpolation method for scattered data

An interpolation method to evaluate magnetic fields, given its unstructured and scattered magnetic data, is presented. The method is based on the reconstruction of the global magnetic field using a superposition of orthogonal functions. The coefficients of the expansion are obtained by minimizing a cost function defined as the L2 norm of the difference between the ground truth and the reconstructed magnetic field evaluated on the training data. The divergence-free condition is incorporated as a constraint in the cost function, allowing the method to achieve arbitrarily small errors in the magnetic field divergence. An exponential decay of the approximation error is observed and compared with the less favorable algebraic decay of local splines. Compared to local methods involving computationally expensive search algorithms, the proposed method exhibits a significant reduction of the computational complexity of the field evaluation, while maintaining a small error in the divergence even in the presence of magnetic islands and stochasticity. Finally, applications to the computation of Poincaré sections using data obtained from numerical solutions of the magnetohydrodynamic equations in toroidal geometry are presented and compared with local methods currently in use.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Representation Learning via Quantum Neural Tangent Kernels

Variational quantum circuits are used in quantum machine learning and variational quantum simulation tasks. Designing good variational circuits or predicting how well they perform for given learning or optimization tasks is still unclear. Here we discuss these problems, analyzing variational quantum circuits using the theory of neural tangent kernels. We define quantum neural tangent kernels, and derive dynamical equations for their associated loss function in optimization and learning tasks. We analytically solve the dynamics in the frozen limit, or lazy training regime, where variational angles change slowly and a linear perturbation is good enough. We extend the analysis to a dynamical setting, including quadratic corrections in the variational angles. We then consider a hybrid quantum classical architecture and define a large-width limit for hybrid kernels, showing that a hybrid quantum classical neural network can be approximately Gaussian. The results presented here show limits for which analytical understandings of the training dynamics for variational quantum circuits, used for quantum machine learning and optimization problems, are possible. These analytical results are supported by numerical simulations of quantum machine-learning experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Accurate contrast determination for X-ray speckle visibility spectroscopy

X-ray speckle visibility spectroscopy using X-ray free-electron lasers has long been proposed as a probe of fast dynamics in noncrystalline materials. In this paper, numerical modeling is presented to show how the data interpretation of visibility spectroscopy can be impacted by the nonidealities of real-life X-ray detectors. Using simulated detector data, this work provides a detailed analysis of the systematic errors of several contrast extraction algorithms in the context of low-count-rate X-ray speckle visibility spectroscopy and their origins are discussed. Here, it was found that the finite detector charge cloud and pixel size lead to an unavoidable `degeneracy' in photon position determination, and that the contrasts extracted using different algorithms can all be corrected by a simple linear model. The results suggest that experimental calibration of the correction coefficient at the count rate of interest is possible and essential. This allows computationally lightweight algorithms to be implemented for on-the-fly analysis.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Efficient graph representation framework for chemical molecule similarity tasks

Graph data has emerged in numerous scientific domains and machine learning techniques have been widely used for analysis and learning of diverse data for prediction and decision. Machine learning techniques can readily address complex problems by leveraging their structural information. But graphs cannot be directly used for existing machine learning algorithms unless encoded as vectors. The problem of efficient representation of graphs is a substantial challenge in graph machine learning. In this paper, we propose a novel two-stage framework for the representation of chemical molecule graphs based on the strengths of Graph Isomorphism Networks (GINs) and Siamese autoencoders. In the first stage, the GIN model is constructed and trained using the structural information of chemical molecule graphs. Node attributes, edge attributes, and edge indices are used as input data, while graph attributes are used as labels. The GIN model effectively captures the structural characteristics of graphs and can accurately predict graph attributes, i.e., molecular properties. It also generates Graph Embeddings, represented as vectors that encode the structural information of graphs. In the second stage, Graph Embedding vectors are further optimized for downstream similarity tasks while preserving the graph structural information. The Siamese autoencoder is constructed and trained, which reduces the dimensionality of the Graph Embedding vectors, while maximizing the preservation of structural information in the original high-dimensional vectors. The resulting low-dimensional Graph Embeddings can be effectively utilized for tasks such as approximate nearest neighbor search. The experimental results demonstrate the effectiveness of our proposed framework in accurately predicting graph similarity.

Ma, Jiaji↗

Inference for Nonparanormal Partial Correlation via Regularized Rank-Based Nodewise Regression

Abstract Partial correlation is a common tool in studying conditional dependence for Gaussian distributed data. However, partial correlation being zero may not be equivalent to conditional independence under non-Gaussian distributions. In this paper, we propose a statistical inference procedure for partial correlations under the high-dimensional nonparanormal (NPN) model where the observed data are normally distributed after certain monotone transformations. The NPN partial correlation is the partial correlation of the normal transformed data under the NPN model, which is a more general measure of conditional dependence. We estimate the NPN partial correlations by regularized nodewise regression based on the empirical ranks of the original data. A multiple testing procedure is proposed to identify the nonzero NPN partial correlations. The proposed method can be carried out by a simple coordinate descent algorithm for lasso optimization. It is easy-to-implement and computationally more efficient compared to the existing methods for estimating NPN graphical models. Theoretical results are developed to show the asymptotic normality of the proposed estimator and to justify the proposed multiple testing procedure. Numerical simulations and a case study on brain imaging data demonstrate the utility of the proposed procedure and evaluate its performance compared to the existing methods. Data used in preparation of this article were obtained from the Alzheimer's Disease Neuroimaging Initiative (ADNI) database.

97 MATHEMATICS AND COMPUTING↗