Search NASA⌕ Search

SEARCH · Search NASA

Results for “tensor times same vector”

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.

72 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Scalable learning of potentials to predict time-dependent Hartree–Fock dynamics

We propose a framework to learn the time-dependent Hartree–Fock (TDHF) inter-electronic potential of a molecule from its electron density dynamics. Although the entire TDHF Hamiltonian, including the inter-electronic potential, can be computed from first principles, we use this problem as a testbed to develop strategies that can be applied to learn a priori unknown terms that arise in other methods/approaches to quantum dynamics, e.g., emerging problems such as learning exchange–correlation potentials for time-dependent density functional theory. We develop, train, and test three models of the TDHF inter-electronic potential, each parameterized by a four-index tensor of size up to 60 × 60 × 60 × 60. Two of the models preserve Hermitian symmetry, while one model preserves an eight-fold permutation symmetry that implies Hermitian symmetry. Across seven different molecular systems, we find that accounting for the deeper eight-fold symmetry leads to the best-performing model across three metrics: training efficiency, test set predictive power, and direct comparison of true and learned inter-electronic potentials. All three models, when trained on ensembles of field-free trajectories, generate accurate electron dynamics predictions even in a field-on regime that lies outside the training set. To enable our models to scale to large molecular systems, we derive expressions for Jacobian-vector products that enable iterative, matrix-free training.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Constraints on quasinormal modes and bounds for critical points from pole-skipping

We consider a holographic thermal state and perturb it by a scalar operator whose associated real-time Green’s function has only gapped poles. These gapped poles correspond to the non-hydrodynamic quasinormal modes of a massive scalar perturbation around a Schwarzschild black brane. Relations between pole-skipping points, critical points and quasinormal modes in general emerge when the mass of the scalar and hence the dual operator dimension is varied. First, this novel analysis reveals a relation between the location of a mode in the infinite tower of quasinormal modes and the number of pole-skipping points constraining its dispersion relation at imaginary momenta. Second, for the first time, we consider the radii of convergence of the derivative expansions about the gapped quasinormal modes. These convergence radii turn out to be bounded from above by the set of all pole-skipping points. Furthermore, a transition between two distinct classes of critical points occurs at a particular value for the conformal dimension, implying close relations between critical points and pole-skipping points in one of those two classes. We show numerically that all of our results are also true for gapped modes of vector and tensor operators.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Planck 2015 results: XVII. Constraints on primordial non-Gaussianity

We report that the Planck full mission cosmic microwave background (CMB) temperature and E-mode polarization maps are analysed to obtain constraints on primordial non-Gaussianity (NG). Using three classes of optimal bispectrum estimators – separable template-fitting (KSW), binned, and modal – we obtain consistent values for the primordial local, equilateral, and orthogonal bispectrum amplitudes, quoting as our final result from temperature alone ƒ local NL = 2.5 ± 5.7, ƒ equil NL = -16 ± 70, , and ƒ ortho NL = -34 ± 32 (68% CL, statistical). Combining temperature and polarization data we obtain ƒ local NL = 0.8 ± 5.0, ƒ equil NL = -4 ± 43, and ƒ ortho NL = -26 ± 21 (68% CL, statistical). The results are based on comprehensive cross-validation of these estimators on Gaussian and non-Gaussian simulations, are stable across component separation techniques, pass an extensive suite of tests, and are consistent with estimators based on measuring the Minkowski functionals of the CMB. The effect of time-domain de-glitching systematics on the bispectrum is negligible. In spite of these test outcomes we conservatively label the results including polarization data as preliminary, owing to a known mismatch of the noise model in simulations and the data. Beyond estimates of individual shape amplitudes, we present model-independent, three-dimensional reconstructions of the Planck CMB bispectrum and derive constraints on early universe scenarios that generate primordial NG, including general single-field models of inflation, axion inflation, initial state modifications, models producing parity-violating tensor bispectra, and directionally dependent vector models. We present a wide survey of scale-dependent feature and resonance models, accounting for the “look elsewhere” effect in estimating the statistical significance of features. We also look for isocurvature NG, and find no signal, but we obtain constraints that improve significantly with the inclusion of polarization. The primordial trispectrum amplitude in the local model is constrained to be g local NL = (-0.9 ± 7.7 ) X 10 4 (68% CL statistical), and we perform an analysis of trispectrum shapes beyond the local case. The global picture that emerges is one of consistency with the premises of the ΛCDM cosmology, namely that the structure we observe today was sourced by adiabatic, passive, Gaussian, and primordial seed perturbations.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

An Incremental Tensor Train Decomposition Algorithm

We present a new algorithm for incrementally updating the tensor train decomposition of a stream of tensor data. This new algorithm, called the tensor train incremental core expansion (TT-ICE) improves upon the current state-of-the-art algorithms for compressing in tensor train format by developing a new adaptive approach that incurs significantly slower rank growth and guarantees compression accuracy. This capability is achieved by limiting the number of new vectors appended to the TT-cores of an existing accumulation tensor after each data increment. These vectors represent directions orthogonal to the span of existing cores and are limited to those needed to represent a newly arrived tensor to a target accuracy. We provide two versions of the algorithm: TT-ICE and TT-ICE accelerated with heuristics (TT-ICE*). Here, we provide a proof of correctness for TT-ICE and empirically demonstrate the performance of the algorithms in compressing large-scale video and scientific simulation datasets. Compared to existing approaches that also use rank adaptation, TT-ICE* achieves 57× higher compression and up to 95% reduction in computational time.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Regional Moment Tensor Inversion Using Rotational Observations

There are benefits from the addition of rotational motions to translational displacements for moment tensor (MT) inversions. The rotational radiation pattern is orthogonal to the shear radiation pattern, thus incorporating rotations is equivalent to gaining another observation point on the focal sphere. We demonstrated this by simulating curl and displacement wavefields for a regional distance station. Thus, one 6-C station (3-Component translational + 3-Component rotational) gathers the same information on radiation pattern as two 3-C stations at 90° azimuth from one another along the focal plane axis, which is sometimes difficult to obtain when restricted to surface sensors. We added rotational Green's functions to a regional MT inversion scheme (long-period, time-domain, and linear inversion) by computing spatial gradients from f-κ reflectivity synthetics. For rotational data, we used Array Derived Rotations (ADR) from Piñon Flats Observatory Array and Golay array deployed during IRIS Community Wavefield Demonstration Experiment. The hope is to ultimately use compact and field deployable broadband rotational seismometers instead of ADRs. Rotational motions were predicted from well-constrained deviatoric MT solutions of nine earthquakes recorded by the arrays and other seismic networks. Additionally, we formed three station sparse datasets with (3-C and 6-C) and without rotational ground motions (3-C only) for eight earthquakes testing the benefits of including rotational waveforms in MT inversions when they are equally weighted with translational waveforms. Adding rotational motions improved the double-couple components and reduced compensated-linear-vector-dipole and isotropic components in full-MT solutions using sparse datasets with poor coverage.

58 GEOSCIENCES↗
DOE OSTI2025

Beyond-classical computation in quantum simulation

Quantum computers hold the promise of solving certain problems that lie beyond the reach of conventional computers. However, establishing this capability, especially for impactful and meaningful problems, remains a central challenge. Here, we show that superconducting quantum annealing processors can rapidly generate samples in close agreement with solutions of the Schrödinger equation. We demonstrate area-law scaling of entanglement in the model quench dynamics of two-, three-, and infinite-dimensional spin glasses, supporting the observed stretched-exponential scaling of effort for matrix-product-state approaches. We show that several leading approximate methods based on tensor networks and neural networks cannot achieve the same accuracy as the quantum annealer within a reasonable time frame. Thus, quantum annealers can answer questions of practical importance that may remain out of reach for classical computation.

King, Andrew D. [D-Wave Quantum Inc., Burnaby, BC ↗
DOE OSTI2025

Numerically exact configuration interaction at quadrillion-determinant scale

The combinatorial growth of configuration interaction (CI) has long limited this formally exact quantum chemistry method to only the smallest molecules. Here, we report a numerically exact CI calculation exceeding one quadrillion (10 15 ) determinants, made possible by a lossless categorical compression strategy within the small-tensor-product distributed active space (STP-DAS) framework. This approach overcomes the traditional memory bottlenecks of CI by a numerically exact compression of the wavefunction representation and reformulating the most computationally demanding matrix–vector operations. Using this method, we performed a fully relativistic CI calculation of the ground state of HBrTe with over 10 15 complex-valued determinants in just 34.5 h on 1000 computing nodes—the largest CI calculation ever reported. We further achieved fast computation for systems with hundreds of billions of determinants on only a few compute nodes. Extensive benchmarks confirm that the method retains full numerical exactness while cutting memory and computational cost by orders of magnitude. Compared to previous state-of-the-art CI calculations, this work achieves a 1000 times increase in CI space, a 10 6 -fold increase in floating-point operations performed, and a 10 6 -fold improvement in computational speed.

Computational chemistry↗
DOE OSTI2025

Accelerating GNNs on GPU Sparse Tensor Cores through N:M Sparsity-Oriented Graph Reordering

Recent advancements in GPU hardware support have introduced the capability to leverage N:M sparse patterns for substantial performance gains. Graphs in Graph Neural Networks (GNNs) are typically sparse, but the sparsity is often irregular, not conforming to such sparse patterns. In this paper, we propose a novel graph reordering algorithm, the first of its kind, to reshape irregular graph data into the N:M structured sparse pattern at the tile level, allowing linear-algebra-based graph operations in GNNs to benefit from the N:M sparse hardware. The optimization is lossless, maintaining the accuracy of GNN. It can remove 98-100\% violations of the N:M sparse patterns at the vector level, and increase the proportion of conforming graphs in SuiteSparse collection from 5-9\% to 88.7-93.5\%. On A100 GPUs, the optimization accelerates Sparse Matrix Matrix (SpMM) by up to 43X (2.3X -- 7.5X on average) and speeds up the key graph operations in GNNs on real graphs by as much as 8.6X (3.5X on average).

artificial intelligence, graph neural networks↗
DOE OSTI2026

Scalable Quantum Monte Carlo Method for Polariton Chemistry via Mixed Block Sparsity and Tensor Hypercontraction Method

We present a reduced-scaling auxiliary-field quantum Monte Carlo (AFQMC) framework designed for large molecular systems and ensembles, with or without coupling to optical cavities. Our approach leverages the natural block sparsity of the Cholesky decomposition (CD) of electron repulsion integrals in molecular ensembles and employs tensor hypercontraction (THC) to efficiently compress low-rank Cholesky blocks. By representing the Cholesky vectors in a mixed format, keeping high-rank blocks in block-sparse form and compressing low-rank blocks with THC, we reduce the scaling of exchange-energy evaluation from quartic to robust cubic in the number of molecular orbitals N, while lowering memory from cubic toward quadratic. Benchmark analyses on one-, two-, and three-dimensional molecular ensembles (up to ∼1,200 orbitals) show that (a) the number of nonzeros in Cholesky tensors grows linearly with system size across dimensions; (b) the average numerical rank increases sublinearly and does not saturate at these sizes; and (c) rank heterogeneity─some blocks nearly full rank and many low rank, naturally motivates the proposed mixed block sparsity and THC scheme for efficient calculation of exchange energy. In conclusion, we demonstrate that the mixed scheme yields cubic wall-time scaling with favorable prefactors and preserves AFQMC accuracy.

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

Love symmetry in higher-dimensional rotating black hole spacetimes

We develop a method for constructing a 1-parameter family of globally-defined Love symmetry generators in rotating black hole spacetimes of general dimension. The key ingredient is to focus on the vicinity of the (physical) outer horizon, matching only the radial derivative and the outer horizon pole pieces of the Klein-Gordon operator in the black hole spacetime to the SL(2, ℝ) Casimir operator. After revisiting the 4D Kerr and 5D Myers-Perry cases, the procedure is illustrated on generalized Lense-Thirring spacetimes which describe a wide variety of slowly rotating black hole metrics in any number of dimensions. Such spacetimes are known to admit an extended tower of Killing tensor and Killing vector symmetries and, as demonstrated in this paper, allow for separability of the massive scalar wave equation in Myers-Perry-like coordinates. Interestingly, separability also occurs in the horizon-penetrating Painlevé–Gullstrand coordinates associated with the freely infalling observer who registers flat space around her all the way to singularity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Separability in consistent truncations

The separability of the Hamilton-Jacobi equation has a well-known connection to the existence of Killing vectors and rank-two Killing tensors. This paper combines this connection with the detailed knowledge of the compactification metrics of consistent truncations on spheres. The fact that both the inverse metric of such compactifications, as well as the rank-two Killing tensors can be written in terms of bilinears of Killing vectors on the underlying “round metric,” enables us to perform a detailed analyses of the separability of the Hamilton-Jacobi equation for consistent truncations. We introduce the idea of a separating isometry and show that when a consistent truncation, without reduction gauge vectors, has such an isometry, then the Hamilton-Jacobi equation is always separable. When gauge vectors are present, the gauge group is required to be an abelian subgroup of the separating isometry to not impede separability. We classify the separating isometries for consistent truncations on spheres, S n , for n = 2, …, 7, and exhibit all the corresponding Killing tensors. These results may be of practical use in both identifying when supergravity solutions belong to consistent truncations and generating separable solutions amenable to scalar probe calculations. Finally, while our primary focus is the Hamilton-Jacobi equation, we also make some remarks about separability of the wave equation.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

WUS256: An Adjoint Waveform Tomography Model of the Crust and Upper Mantle of the Western United States for Improved Waveform Simulations

Abstract We report a new model (WUS256) of radially anisotropic seismic wavespeeds of the crust and upper mantle of the western United States (WUS) obtained from adjoint waveform tomography for the purpose of improving synthetic waveform fits to observed data. WUS256 is based on inversion of over 94,000 waveforms from 72 earthquakes recorded by nearly 3,400 stations. We started with the SPiRaL global model (Simmons et al., 2021, https://doi.org/10.1093/gji/ggab277 ) and waveforms in the period band of 50–120 s. We followed a conservative multiscale inversion approach with eight stages and 256 total inversion iterations which enabled monotonic misfit reduction to 20‐s minimum‐period waves. WUS256 relied on time‐frequency (TF) phase misfits and a trust region limited memory Broyden–Fletcher–Goldfarb–Shanno (L‐BFGS) optimization. Hessian‐vector products were used to qualitatively assess model resolution. Results indicate that WUS256 has good coverage of the continental regions to depths of about 150 km and is able to resolve features on lateral scales of about 200 km. We quantify waveform fits by the reduction in TF and normalized amplitude difference misfits between WUS256 and the SPiRaL starting model. WUS256 significantly improves waveform fits with misfit reduction 64% for both inversion and validation data sets compared to the SPiRaL starting model and shows even better fits compared to other models. Waveform fits illustrate that WUS256 reproduces body‐waves, fundamental mode surface waves as well as late arriving dispersed and/or scattered short period surface waves. The improvement in waveform fit indicates that WUS256 can be used to reproduce path effects on regional complete waveforms and moment tensor inversions.

58 GEOSCIENCES↗
DOE OSTI2025

Ground state energy and magnetization curve of a frustrated magnetic system from real-time evolution on a digital quantum processor

Models of interacting many-body quantum systems that may realize new exotic phases of matter, notably quantum spin liquids, are challenging to study using even state-of-the-art classical methods such as tensor network simulations. Quantum computing provides a promising route for overcoming these difficulties to find ground states, dynamics, and more. In this paper, we argue that recently developed hybrid quantum-classical algorithms based on real-time evolution are promising methods for solving a particularly important model in the search for spin liquids, the antiferromagnetic Heisenberg model on the two-dimensional kagome lattice. We show how to construct efficient quantum circuits to implement time evolution for the model and to evaluate key observables on the quantum computer, and we argue that the method has favorable scaling with increasing system size. We then restrict to a 12-spin star plaquette from the kagome lattice and a related 8-spin system, and we give an empirical demonstration on these small systems that the hybrid algorithms can efficiently find the ground state energy and the magnetization curve. For these demonstrations, we use four levels of approximation: exact state vectors, exact state vectors with statistical noise from sampling, noisy classical emulators, and (for the 8-spin system only) real quantum hardware, specifically the Quantinuum H1-1 processor; for the noisy simulations and hardware demonstration, we also employ error mitigation strategies based on the symmetries of the Hamiltonian. Our results strongly suggest that these hybrid algorithms present a promising direction for studying quantum spin liquids and more generally for resolving important unsolved problems in condensed matter theory and beyond.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Stress Dependency of Brittle Creep in Granite: Insights into Source Mechanisms and Parameters

Creep in rocks refers to the gradual deformation of rock material over time under the influence of constant stress. Characterizing these deformations is of great importance for engineering design, geotechnical assessment, mining operations, geological studies, and understanding natural hazards. While laboratory experiments and a variety of numerical approaches have offered explanations for microcrack interaction and damage accumulation under the three stages of creep (primary, secondary and tertiary) in conventional creep experiments, the micromechanisms of the fractures produced in brittle creep and its dependency on the applied stress have not been explored in detail. The present study focused on investigating the fracturing mechanisms that occur during creep-induced fracturing at different stress levels and estimation of the source parameters and energy budget components. A series of uniaxial compression creep experiments have been conducted at different stress level ratios (70%, 75%, 80% and 85%), to the unconfined compressive strength (UCS) of double-flawed Barre granite specimen. Creep measurements were complemented with the Acoustic Emission (AE) measurements. The creep-induced fractures were classified into double-couple (DC), compensated linear vector dipole (CLVD) and isotropic (ISO) components using the AE moment tensor decomposition technique. The results show that non-double-couple sources dominated during creep at all the specified stress levels; however, their proportions decreased as the stress level was increased. The source parameters estimation indicated a significant increase in the magnitude of the events and the radiated seismic energy with increasing levels of stress and a slight increase in the evaluated source radius and stress drop with increasing stress levels. Furthermore, this study contributes to the existing knowledge of creep-induced fracturing by providing insights into the fracturing mechanisms and the radiated seismic energy produced, which can be helpful for the development of improved models and strategies for rock engineering and geoscience applications.

58 GEOSCIENCES↗
DOE OSTI2022

A machine learning approach to determine the elastic properties of printed fiber-reinforced polymers

This work focuses on the simultaneous determination of the elastic constants and the fiber orientation state for a short fiber-reinforced polymer composite by performing a minimum of experimental tests. Here we introduce a methodology that enables the inverse determination of fiber orientation state and the in-situ polymer properties by performing tensile tests at the composite coupon level. We demonstrate the approach for the extrusion deposition additive manufacturing (EDAM) process to illustrate one application of the methodology, but the development is such that it can be applied to short fiber-reinforced polymer (SFRP) systems processed via other methods. Currently, developing composites additive manufacturing digital twins require extensive material characterization. In particular, the mechanical characterization of the orthotropic elastic properties of a composite involves extensive sample preparation and testing, therefore the elasticity tensor is generally populated using a micromechanics model. This, however, requires measuring the fiber orientation state in addition to knowing the constituent material properties. Experimentally measuring the fiber orientation state can be tedious and time consuming. Further, optical methods are limited to resolving the orientation of cylindrical fibers or cluster of non-cylindrical fibers, and computed tomography (CT) methods scan regions of volume that are much smaller than a full printed bead. Therefore, we propose a methodology, accelerated by machine learning, to identify the anisotropic mechanical properties and fiber orientation state at the same time. Early results show that inference of the fiber orientation and composite properties is possible with as few as three tensile tests. Our results show that a combination of the choice of the micromechanics model and reliable set of experiments can yield the nine elastic constants, as well as, the fiber orientation state.

36 MATERIALS SCIENCE↗
DOE OSTI2015

Generalized and efficient algorithm for computing multipole energies and gradients based on Cartesian tensors

Accurate representation of intermolecular forces has been the central task of classical atomic simulations, known as molecular mechanics. Recent advancements in molecular mechanics models have put forward the explicit representation of permanent and/or induced electric multipole (EMP) moments. The formulas developed so far to calculate EMP interactions tend to have complicated expressions, especially in Cartesian coordinates, which can only be applied to a specific kernel potential function. For example, one needs to develop a new formula each time a new kernel function is encountered. The complication of these formalisms arises from an intriguing and yet obscured mathematical relation between the kernel functions and the gradient operators. Here, I uncover this relation via rigorous derivation and find that the formula to calculate EMP interactions is basically invariant to the potential kernel functions as long as they are of the form f(r), i.e., any Green’s function that depends on inter-particle distance. I provide an algorithm for efficient evaluation of EMP interaction energies, forces, and torques for any kernel f(r) up to any arbitrary rank of EMP moments in Cartesian coordinates. The working equations of this algorithm are essentially the same for any kernel f(r). Recently, a few recursive algorithms were proposed to calculate EMP interactions. Depending on the kernel functions, the algorithm here is about 4–16 times faster than these algorithms in terms of the required number of floating point operations and is much more memory efficient. I show that it is even faster than a theoretically ideal recursion scheme, i.e., one that requires 1 floating point multiplication and 1 addition per recursion step. This algorithm has a compact vector-based expression that is optimal for computer programming. The Cartesian nature of this algorithm makes it fit easily into modern molecular simulation packages as compared with spherical coordinate-based algorithms. A software library based on this algorithm has been implemented in C++11 and has been released.

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

Birefringence tests of gravity with multimessenger binaries

Extensions to General Relativity (GR) allow the polarization of gravitational waves (GW) from astrophysical sources to suffer from amplitude and velocity birefringence, which respectively induce changes in the ellipticity and orientation of the polarization tensor. Here, we introduce a multi-messenger approach to test this polarization behavior of GWs during their cosmological propagation using binary sources, for which the initial polarization is determined by the inclination and orientation angles of the orbital angular momentum vector with respect to the line of sight. In particular, we use spatially resolved radio imaging of the jet from a binary neutron star (BNS) merger to constrain the orientation angle and hence the emitted polarization orientation of the GW signal at the site of the merger, and compare to that observed on Earth by GW detectors. For GW170817, using past measurements of the inclination angle, we constrain the deviation from GR due to amplitude birefringence to κ A = $-0.12^{+0.60}_ {-0.61}$, while the velocity birefringence parameter κ V remains unconstrained. The inability to constrain κ V is due to the low amplitude of GW170817 in the Virgo detector, and measurements of the polarization orientation require information from a combination of multiple detectors with different alignments. For this reason, we also mock future BNS mergers with resolved afterglow proper motion and project that κ V could be constrained to a precision of 5 rad (corresponding to an angular shift of the GW polarization of δ φV ≈ 0.2 rad for a BNS at 100 Mpc) by a future network of third-generation ground-based GW detectors such as Cosmic Explorer and the radio High Sensitivity Array. Crucially, this velocity birefringence effect cannot be constrained with dark binary mergers as it requires polarization information at the emission time, which can be provided only by electromagnetic emission.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2017

Initial CEED API (CEED-MS10)

Key components of CEED software development involve fast finite element operator storage and evaluation, architecture optimizations, performant algorithms for all orders, global kernels for finite element operators, efficient use of the memory sub-system, optimal data locality and motion, enhanced scalability and parallelism, and fast tensor contractions. As ultimate goals of the project, CEED is exploring and identifying the best algorithms for the full range of discretizations and applying algorithmic and software development to support ECP applications’ needs. In this milestone, we initiated the development and implementation of a common CEED API consisting of two main components: low-level and high-level APIs. We accomplished the goal of having the low-level component ready for the release of CEED v1.0 in the next quarter, see CEED-MS13. In this report we also provide a highlight from CEED’s integration with the MARBL app and the corresponding Laghos miniapp. A main theme in this work has been the systematic transition of advanced algorithms, developed and tested in Laghos, to the large-scale multi-physics settings of the MARBL code. The low-level CEED API provides a set of FE kernels and components for writing new low-level kernels. Examples include: vector and sparse linear algebra, element matrix assembly over a batch of elements, partial assembly and action for efficient high-order operators like mass, diffusion, advection, etc. The main goal of the low-level API is to establish the basis for the high-level API. Also, identifying such low-level kernels and providing a reference implementation for them serves as the basis for collaboration with vendors and STs. Another goal for the low-level API is to make it easy for applications with their own discretization infrastructure, who do not want to switch directly to using the high-level CEED API, to still evaluate and use the core operations provided by the low-level API. One of the challenges with high-order methods is that a global sparse matrix is no longer a good representation of a high-order linear operator, both with respect to the FLOPs needed for its evaluation, as well as the memory transfer needed for a matvec. Thus, another important question we tried to address while developing the low-level API is: is it possible to abstract out in a natural and efficient way the different implementations and data structures that arise when dealing with various computational device types: CPUs, GPUs, etc. Fully answering this question is beyond the scope of this particular milestone, since that requires longer time as we develop and expand the devices we support. The future high-level API will be the frontend provided by CEED consisting of high-level abstractions such as meshes, finite element spaces and solutions, bilinear forms, solvers, etc. At this high-level, an important aspect of the API will be to provide a uniform abstraction layer for writing code in a portable manner. To achieve that, we plan to utilize the MPI programming model combined with a device abstraction layer (DAL) for finite element computations that we will develop. The DAL will serve as the bridge between the low- and the high-level APIs, allowing a variety of programming models to be used for the low-level kernel implementations. The software artifacts delivered as part of this milestone include an initial CEED API software implementation (libCEED) provided through the CEED website, http://ceed.exascaleproject.org and the CEED GitHub organization, http://github.com/ceed. In addition to details and results from the above R&D efforts, in this document we are also reporting on other project-wide activities performed in Q1 of FY18, including: the Nek5000 v17.0 MFEM v3.3.2 and PETSc v3.8 releases, collaborations with ECP/ST and SciDAC projects, the inaugural Nek5000 hackathon and various outreach activities.

97 MATHEMATICS AND COMPUTING↗