Multigrid reduction preconditioning framework for coupled processes in porous and fractured media
Not Available
02 PETROLEUM↗
SEARCH · Engineering Papers
Results for “algebraic methods”
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.
Strongly nonlinear wave propagation in elasto-plastic metamaterials: Low-order dynamic modeling
Nonlinear elastic metamaterials are known to support a variety of dynamic phenomena that enhance our capacity to manipulate elastic waves. Since these properties stem from complex, subwavelength geometry, full-scale dynamic simulations are often prohibitively expensive at scales of interest. Prior studies have therefore utilized low-order effective medium models, such as discrete mass-spring lattices, to capture essential properties in the long-wavelength limit. While models of this type have been successfully implemented for a wide variety of nonlinear elastic systems, they have predominantly considered dynamics depending only on the instantaneous kinematics of the lattice, neglecting history-dependent effects, such as wear and plasticity. Here, to address this limitation, the present study develops a lattice-based modeling framework for nonlinear elastic metamaterials undergoing plastic deformation. Due to the history- and rate-dependent nature of plasticity, the framework generally yields a system of differential-algebraic equations whose computational cost is significantly greater than an elastic system of comparable size. We demonstrate the method using several models inspired by classical lattice dynamics and continuum plasticity theory and explore means to obtain empirical plasticity models for general geometries, thereby gaining insight into the influence of microstructural plasticity on effective material performance, which can be used to improve the design of nonlinear mechanical metamaterials.
Dynamic simulation↗
Enhancing Lattice Kinetic Schemes for Fluid Dynamics with Lattice-Equivariant Neural Networks
A new class of equivariant neural networks is presented, hereby dubbed lattice-equivariant neural networks (LENNs), designed to satisfy local symmetries of a lattice structure. The approach develops within a recently introduced framework aimed at learning neural network-based surrogate models’ lattice Boltzmann collision operators. Whenever neural networks are employed to model physical systems, respecting symmetries and equivariance properties has been shown to be key for accuracy, numerical stability, and performance. Here, hinging on ideas from group representation theory, trainable layers are defined whose algebraic structure is equivariant with respect to the symmetries of the lattice cell. In this work, the presented method naturally allows for efficient implementations, in terms of both memory usage and computational costs, supporting scalable training/testing for lattices in two spatial dimensions and higher (in which the size of symmetry group grows). The approach is validated and tested considering 2D and 3D flowing dynamics, both in laminar and turbulent regimes. It is compared with group-averaged-based symmetric networks and with plain, nonsymmetric, networks, showing how the presented approach unlocks the (a posteriori) accuracy and training stability of the former models and the train/inference speed of the latter networks. (LENNs are about one order of magnitude faster than group-averaged networks in 3D.) The work in this paper opens toward practical use of machine learning-augmented lattice Boltzmann CFD in real-world simulations.
97 MATHEMATICS AND COMPUTING↗
thornado+FLASH-X: A Hybrid Discontinuous Galerkin–Implicit-explicit and Finite-volume Framework for Neutrino-radiation Hydrodynamics in Core-collapse Supernovae
We present neutrino-transport algorithms implemented in the toolkit for high-order neutrino-radiation hydrodynamics (thornado) and their coupling to self-gravitating hydrodynamics within the adaptive mesh refinement–based multiphysics simulation framework FLASH-X. thornado, developed primarily for simulations of core-collapse supernovae (CCSNe), employs a spectral, six-species two-moment formulation with algebraic closure and special-relativistic observer corrections accurate to $\mathcal{O}(v/c)$, and uses discontinuous Galerkin (DG) methods for phase-space discretization combined with implicit-explicit time stepping. A key development is a nonlinear neutrino–matter coupling algorithm based on nested fixed-point iteration with Anderson acceleration, enabling fully implicit treatment of collisional processes, including energy-coupling interactions such as neutrino–electron scattering and pair production. Coupling to finite-volume (FV) hydrodynamics is achieved through a hybrid DG-FV representation of the fluid variables and operator-split evolution within FLASH-X. The implementation is verified using basic transport tests with idealized opacities and relaxation and deleptonization problems with tabulated microphysics. Spherically symmetric CCSN simulations demonstrate accuracy and robustness of the coupled scheme, including close agreement with the CCSN simulation code Chimera. An axisymmetric CCSN simulation further demonstrates the viability of DG-based neutrino transport for multidimensional supernova modeling within FLASH-X. thornado’s neutrino-transport solver is GPU-enabled using OpenMP offloading or OpenACC, and all CCSN applications included in this work use the GPU implementation. Together, these results establish a foundation for future enhancements in physics fidelity, numerical algorithms, and computational performance, for increasingly realistic large-scale CCSN simulations.
Endeve, Eirik [Oak Ridge National Laboratory (ORNL↗
“Best” Iterative Coupled-Cluster Triples Model? More Evidence for 3CC
To follow up on the unexpectedly good performance of several coupled-cluster models with approximate inclusion of 3-body clusters we performed a more complete assessment of the 3CC method for accurate computational thermochemistry in the standard HEAT framework. New spin-integrated implementation of the 3CC method applicable to closed- and open-shell systems utilizes a new automated toolchain for derivation, optimization, and evaluation of operator algebra in many-body electronic structure. We found that with a double-ζ basis set the 3CC correlation energies and their atomization energy contributions are almost always more accurate (with respect to the CCSDTQ reference) than the CCSDT model as well as the standard CCSD(T) model. The mean absolute errors in cc-pVDZ {3CC, CCSDT, and CCSD(T)} electronic (per valence electron) and atomization energies relative to the CCSDTQ reference for the HEAT data set, were {24, 70, 122} μE h /e and {0.46, 2.00, 2.58} kJ/mol, respectively. The mean absolute errors in the complete-basis-set limit {3CC, CCSDT, and CCSD(T)} atomization energies relative to the HEAT model reference, were {0.52, 2.00, and 1.07} kJ/mol, The significant and systematic reduction of the error by the 3CC method and its lower cost than CCSDT suggests it as a viable candidate for post- CCSD(T) thermochemistry applications, as well as the preferred alternative to CCSDT in general.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Simulation-driven optimization of high-order meshes in ALE hydrodynamics
Here we propose tools for high-order mesh optimization and demonstrate their benefits in the context of multi-material Arbitrary Lagrangian-Eulerian (ALE) compressible shock hydrodynamic applications. The mesh optimization process is driven by information provided by the simulation which uses the optimized mesh, such as shock positions, material regions, known error estimates, etc. These simulation features are usually represented discretely, for instance, as finite element functions on the Lagrangian mesh. The discrete nature of the input is critical for the practical applicability of the algorithms we propose and distinguishes this work from approaches that strictly require analytical information. Our methods are based on node movement through a high-order extension of the Target-Matrix Optimization Paradigm (TMOP). The proposed formulation is fully algebraic and relies only on local Jacobian matrices, so it is applicable to all types of mesh elements, in 2D and 3D, and any order of the mesh. We discuss the notions of constructing adaptive target matrices and obtaining their derivatives, reconstructing discrete data in intermediate meshes, node limiting that enables improvement of global mesh quality while preserving space-dependent local mesh features, and appropriate normalization of the objective function. The adaptivity methods are combined with automatic ALE triggers that can provide robustness of the mesh evolution and avoid excessive remap procedures. The benefits of the new high-order TMOP technology are illustrated on several simulations performed in the high-order ALE application BLAST.
97 MATHEMATICS AND COMPUTING↗
Energetically consistent model reduction for metriplectic systems
The metriplectic formalism is useful for describing complete dynamical systems which conserve energy and produce entropy. This creates challenges for model reduction, as the elimination of high-frequency information will generally not preserve the metriplectic structure which governs long-term stability of the system. Based on proper orthogonal decomposition, a provably convergent metriplectic reduced-order model is formulated which is guaranteed to maintain the algebraic structure necessary for energy conservation and entropy formation. Further, numerical results on benchmark problems show that the proposed method is remarkably stable, leading to improved accuracy over long time scales at a moderate increase in cost over naive methods.
42 ENGINEERING↗
Semantic embedding for quantum algorithms
The study of classical algorithms is supported by an immense understructure, founded in logic, type, and category theory, that allows an algorithmist to reason about the sequential manipulation of data irrespective of a computation’s realizing dynamics. As quantum computing matures, a similar need has developed for an assurance of the correctness of high-level quantum algorithmic reasoning. Parallel to this need, many quantum algorithms have been unified and improved using quantum signal processing (QSP) and quantum singular value transformation (QSVT), which characterize the ability, by alternating circuit ansätze, to transform the singular values of sub-blocks of unitary matrices by polynomial functions. However, while the algebraic manipulation of polynomials is simple (e.g., compositions and products), the QSP/QSVT circuits realizing analogous manipulations of their embedded polynomials are non-obvious. This work constructs and characterizes the runtime and expressivity of QSP/QSVT protocols where circuit manipulation maps naturally to the algebraic manipulation of functional transforms (termed semantic embedding). In this way, QSP/QSVT can be treated and combined modularly, purely in terms of the functional transforms they embed, with key guarantees on the computability and modularity of the realizing circuits. We also identify existing quantum algorithms whose use of semantic embedding is implicit, spanning from distributed search to proofs of soundness in quantum cryptography. The methods used, based in category theory, establish a theory of semantically embeddable quantum algorithms, and provide a new role for QSP/QSVT in reducing sophisticated algorithmic problems to simpler algebraic ones.
Physics↗
Monotonic multi-state quantum f -divergences
We use the Tomita–Takesaki modular theory and the Kubo–Ando operator mean to write down a large class of multi-state quantum f-divergences and prove that they satisfy the data processing inequality. For two states, this class includes the (α, z)-Rényi divergences, the f-divergences of Petz, and the Rényi Belavkin-Staszewski relative entropy as special cases. The method used is the interpolation theory of non-commutative Lωp spaces, and the result applies to general von Neumann algebras, including the local algebra of quantum field theory. We conjecture that these multi-state Rényi divergences have operational interpretations in terms of the optimal error probabilities in asymmetric multi-state quantum state discrimination.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
Linear stability analysis via simulated annealing and accelerated relaxation
Simulated annealing (SA) is a kind of relaxation method for finding equilibria of Hamiltonian systems. A set of evolution equations is solved with SA, which is derived from the original Hamiltonian system so that the energy of the system changes monotonically while preserving Casimir invariants inherent to noncanonical Hamiltonian systems. The energy extremum reached by SA is an equilibrium. Since SA searches for an energy extremum, it can also be used for stability analysis when initiated from a state where a perturbation is added to an equilibrium. The procedure of the stability analysis is explained, and some examples are shown. Because the time evolution is computationally time consuming, efficient relaxation is necessary for SA to be practically useful. An acceleration method is developed by introducing time dependence in the symmetric kernel used in the double bracket, which is part of the SA formulation described here. An explicit formulation for low-beta reduced magnetohydrodynamics (MHD) in cylindrical geometry is presented. In conclusion, since SA for low-beta reduced MHD has two advection fields that relax, it is important to balance the orders of magnitude of these advection fields.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
Accelerated basis adaptation in homogeneous chaos spaces
Polynomial chaos expansions (PCE) provide an efficient approach to uncertainty quantification (UQ) and have been adapted to diverse applications across the spectrum of science and engineering. For situations involving large stochastic parameterizations, the curse of dimensionality renders PCE-based methods computationally prohibitive. A basis adaptation approach for PCE was proposed by Tipireddy and Ghanem (2014) which transforms the input random variables through an isometry such that sufficient probabilistic characterization of specific quantities of interest (QoI) is concentrated in an algebraic manifold embedded in the linear span of the dominant transformed variables. While quite versatile, that original version of the PCE basis adaptation exhibited slow convergence for a number of problems of practical significance. In the present paper, we propose two novel methods to accelerate the convergence of the original basis adaptation approach, thus expanding its reach while also providing insight into its performance. In the first method, information gained from a pilot PCE representation is used to correct the mean and Gaussian coefficients in the adapted space. By taking advantages of probabilistic information in higher dimensional adaptation gleaned from an initial adaptation, the second method updates the rotation matrix used to identify the dominant transformed variables. In this manner, the new rotation matrix concentrates even more probabilistic information in its first few dimensions. These two method can be combined to achieve even better performance, the combined method is referred to as sequentially optimized adaptation method. Here, the methods are demonstrated on an analytical test function and a model of a space structure with several sub-components and a non-smooth quantity of interest representing the maximum acceleration over time. Both methods achieve accelerated convergence of the basis adaptation approach with negligible additional costs.
Accelerated convergence↗
Performance and power modeling and prediction using MuMMI and 10 machine learning methods
Energy-efficient scientific applications require insight into how high performance computing system features impact the applications' power and performance. This insight can result from the development of performance and power models. Here, in this article, we use the modeling and prediction tool MuMMI (Multiple Metrics Modeling Infrastructure) and 10 machine learning methods to model and predict performance and power consumption and compare their prediction error rates. We use an algorithm-based fault-tolerant linear algebra code and a multilevel checkpointing fault-tolerant heat distribution code to conduct our modeling and prediction study on the Cray XC40 Theta and IBM BG/Q Mira at Argonne National Laboratory and the Intel Haswell cluster Shepard at Sandia National Laboratories. Our experimental results show that the prediction error rates in performance and power using MuMMI are less than 10% for most cases. By utilizing the models for runtime, node power, CPU power, and memory power, we identify the most significant performance counters for potential application optimizations, and we predict theoretical outcomes of the optimizations. Based on two collected datasets, we analyze and compare the prediction accuracy in performance and power consumption using MuMMI and 10 machine learning methods.
97 MATHEMATICS AND COMPUTING↗
Revealing topology in metals using experimental protocols inspired by K-theory
Topological metals are conducting materials with gapless band structures and nontrivial edge-localized resonances. Their discovery has proven elusive because traditional topological classification methods require band gaps to define topological robustness. Inspired by recent theoretical developments that leverage techniques from the field of C*-algebras to identify topological metals, here, we directly observe topological phenomena in gapless acoustic crystals and realize a general experimental technique to demonstrate their topology. Specifically, we not only observe robust boundary-localized states in a topological acoustic metal, but also re-interpret a composite operator—mathematically derived from the K-theory of the problem—as a new Hamiltonian whose physical implementation allows us to directly observe a topological spectral flow and measure the topological invariants. Our observations and experimental protocols may offer insights for discovering topological behaviour across a wide array of artificial and natural materials that lack bulk band gaps.
36 MATERIALS SCIENCE↗
Interpretation of autoencoder-learned collective variables using Morse–Smale complex and sublevelset persistent homology: An application on molecular trajectories
Dimensionality reduction often serves as the first step toward a minimalist understanding of physical systems as well as the accelerated simulations of them. In particular, neural network-based nonlinear dimensionality reduction methods, such as autoencoders, have shown promising outcomes in uncovering collective variables (CVs). However, the physical meaning of these CVs remains largely elusive. In this work, we constructed a framework that (1) determines the optimal number of CVs needed to capture the essential molecular motions using an ensemble of hierarchical autoencoders and (2) provides topology-based interpretations to the autoencoder-learned CVs with Morse–Smale complex and sublevelset persistent homology. Furthermore, this approach was exemplified using a series of n-alkanes and can be regarded as a general, explainable nonlinear dimensionality reduction method.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Quantum Time-Space Tradeoffs for Matrix Problems
We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems—including matrix-vector product, matrix inversion, matrix multiplication and powering—existing classical time-space tradeoffs, several of which are tight for every space bound, also apply to quantum algorithms with at most a constant factor loss. For example, for almost all fixed matrices 𝐴, including the discrete Fourier transform matrix, we prove that quantum circuits with at most 𝑇 input queries and 𝑆 qubits of memory require 𝑇 = Ω(𝑛 2 /𝑆) to compute matrix-vector product 𝐴𝑥 for 𝑥 ∈{0,1 𝑛 . We similarly prove that matrix multiplication for 𝑛 ×𝑛 binary matrices requires 𝑇 = Ω(𝑛 3 /$\sqrt{𝑆}$). Because many of our lower bounds are matched by deterministic algorithms with the same time and space complexity, our results show that quantum computers cannot provide any asymptotic advantage for these problems with any space bound. We obtain matching lower bounds for the stronger notion of quantum cumulative memory complexity—the sum of the space per layer of a circuit. We also consider Boolean (i.e., AND-OR) matrix multiplication and matrix-vector products, improving the previous quantum time-space tradeoff lower bounds for 𝑛 × 𝑛 Boolean matrix multiplication to 𝑇 = Ω(𝑛 2.5 /𝑆 1/4 ) from 𝑇 = Ω(𝑛 2.5 /𝑆 1/2 ). Our improved lower bound for Boolean matrix multiplication is based on a new coloring argument that extracts more from the strong direct product theorem that was the basis for prior work. To obtain our tight lower bounds for linear algebra problems, we require much stronger bounds than strong direct product theorems. We obtain these bounds by adding a new bucketing method to the quantum recording-query technique of Zhandry that lets us apply classical arguments to upper bound the success probability of quantum circuits.
lower bounds↗
Fast matrix algebra for Bayesian model calibration
In Bayesian model calibration, evaluation of the likelihood function usually involves finding the inverse and determinant of a covariance matrix. When Markov Chain Monte Carlo (MCMC) methods are used to sample from the posterior, hundreds of thousands of likelihood evaluations may be required. In this paper, we demonstrate that the structure of the covariance matrix can be exploited, leading to substantial time savings in practice. Here, we also derive two simple equations for approximating the inverse of the covariance matrix in this setting, which can be computed in near-quadratic time. The practical implications of these strategies are demonstrated using a simple numerical case study and the "quack" R package. For a covariance matrix with 1000 rows, application of these strategies for a million likelihood evaluations leads to a speedup of roughly 4000 compared to the naive implementation
97 MATHEMATICS AND COMPUTING↗
Toward Establishing Uniqueness of Experimentally Determined Transference Numbers
The passage of current through a battery results in the development of concentration gradients in the electrolytic phase. For a fully characterized binary electrolyte, where the conductivity, salt diffusion coefficient, cation transference number, and the thermodynamic factor are known, concentration and potential gradients in the electrolytic phase can be modeled using Newman’s concentrated solution theory. We report two methods for measuring the transference number: the standard method based on electrochemical measurements ( t + , echem 0 ) and electrophoretic NMR ( t + , eNMR 0 ). The electrochemical approach requires combining measurements from multiple experiments; the equations used to determine the cation transference number and the thermodynamic factor are coupled, nonlinear algebraic equations. In the electrophoretic-NMR-based approach, however, the equations used to determine the cation transference number and the thermodynamic factor are decoupled. We find for a liquid electrolyte comprised of a lithium salt dissolved in tetraglyme, the values of the transference numbers obtained by these two methods are distinct. For example, at 30 °C, t + , echem 0 = −1.02 ± 1.11 and t + , eNMR 0 = 0.25 ± 0.04. The corresponding thermodynamic factors are also different. While the magnitude of the predicted concentration gradients based on the two sets of parameters are different, the predicted current-voltage relationships are similar.
Hickson, Darby T. (ORCID:0000000251339755)↗
An algebraic formula for two loop renormalization of scalar quantum field theory
We find a general formula for the two-loop renormalization counterterms of a scalar quantum field theory with interactions containing up to two derivatives, extending ’t Hooft’s one-loop result. The method can also be used for theories with higher derivative interactions, as long as the terms in the Lagrangian have at most one derivative acting on each field. We show that diagrams with factorizable topologies do not contribute to the renormalization group equations. The results in this paper will be combined with the geometric method in a subsequent paper to obtain the counterterms and renormalization group equations for the scalar sector of effective field theories (EFT) to two-loop order.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗