Search NASA⌕ Search

SEARCH · Search NASA

Results for “Linear Algebra Abstractions”

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.

97 records · Page 6

Deploy threading in Nalu solver stack

The goal of the ExaWind project is to enable predictive simulations of wind farms composed of many MW-scale turbines situated in complex terrain. Predictive simulations will require computational fluid dynamics (CFD) simulations for which the mesh resolves the geometry of the turbines, and captures the rotation and large deflections of blades. Whereas such simulations for a single turbine are arguably petascale class, multi-turbine wind farm simulations will require exascale-class resources. The primary code in the ExaWind project is Nalu, which is an unstructured-grid solver for the acousticallyincompressible Navier-Stokes equations, and mass continuity is maintained through pressure projection. The model consists of the mass-continuity Poisson-type equation for pressure and a momentum equation for the velocity. For such modeling approaches, simulation times are dominated by linear-system setup and solution for the continuity and momentum systems. For the ExaWind challenge problem, the moving meshes greatly affect overall solver costs as re-initialization of matrices and re-computation of preconditioners is required at every time step In this Milestone, we examine the effect of threading on the solver stack performance against flat-MPI results obtained from previous milestones using Haswell performance data full-turbine simulations. Whereas the momentum equations are solved only with the Trilinos solvers, we investigate two algebraic-multigrid preconditioners for the continuity equations: Trilinos/Muelu and HYPRE/BoomerAMG. These two packages embody smoothed-aggregation and classical Ruge-Stiiben AMG methods, respectively. In our FY18 Q2 report, we described our efforts to improve setup and solve of the continuity equations under flat-MPI parallelism. While significant improvement was demonstrated in the solve phase, setup times remained larger than expected. Starting with the optimized settings described in the Q2 report, we explore here simulation performance where OpenMP threading is employed in the solver stack. For Trilinos, threading is acheived through the Kokkos abstraction where, whereas HYPRE/BoomerAMG employs straight OpenMP. We examined results for our mid-resolution baseline turbine simulation configuration (229M DOF). Simulations on 2048 Haswell cores explored the effect of decreasing the number of MPI ranks while increasing the number of threads. Both HYPRE and Trilinos exhibited similar overal solution times, and both showed dramatic increases in simulation time in the shift from MPI ranks to OpenMP threads. This increase is attributed to the large amount of work per MPI rank starting at the single-thread configuration. Decreasing MPI ranks, while increasing threads, may be increasing simulation time due to thread synchronization and start-up overhead contributing to the latency and serial time in the model. These result showed that an MPI+OpenMP parallel decomposition will be more effective as the amount per MPI rank computation per MPI rank decreases and the communication latency increases. This idea was demonstrated in a strong scaling study of our low-resolution baseline model (29M DOF) with the Trilinos-HYPRE configuration. While MPI-only results showed scaling improvement out to about 1536 cores, engaging threading carried scaling improvements out to 4128 cores — roughly 7000 DOF per core. This is an important result as improved strong scaling is needed for simulations to be executed over sufficiently long simulated durations (i.e., for many timesteps). In addition to threading work described above, the team examined solver-performance improvements by exploring communication-overhead in the HYPRE-GMRES implementation through a communicationoptimal- GMRE algorithm (CO-GMRES), and offloading compute-intensive solver actions to GPUs. To those ends, a HYPRE mini-app was allow us to easily test different solver approaches and HYPRE parameter settings without running the entire Nalu code. With GPU acceleration on the Summitdev supercomputer, a 20x speedup was achieved for the overall preconditioner and solver execution time for the mini-app. A study on Haswell processors showed that CO-GMRES provides benefits as one increases MPI ranks.

17 WIND ENERGY↗

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↗

Slip velocity boundary conditions for the lattice Boltzmann modeling of microchannel flows

Abstract Slip flows in ducts are important in numerous engineering applications, most notably in microchannel flows. Compared to the standard no‐slip Dirichlet condition, the case of slip formulates as a Robin‐type condition for the fluid tangential velocity. Such an increase in mathematical complexity is accompanied by a more challenging numerical transcription. The present work concerns with this topic, addressing the modeling of the slip velocity boundary condition in the lattice Boltzmann method (LBM) applied to steady slow viscous flows inside ducts of nontrivial shapes. As novelty, we extend the newly revised local second‐order boundary (LSOB) Dirichlet fluid flow method [ Philos. Trans. R. Soc. A 378, 20190404 (2020)] to implement the slip velocity condition within the two‐relaxation‐time (TRT) framework. The LSOB follows an in‐node philosophy where its operation principle seeks to explicitly reconstruct the unknown boundary populations in the form of a third‐order accurate Chapman–Enskog expansion, where the wall slip condition is built‐in as a normal Taylor‐type condition. The key point of this approach is that the required first‐ and second‐order momentum derivatives, rather than computed through nonlocal finite difference approximations, are locally determined through a simple local linear algebra procedure, whose formulation is particularly aided by the TRT symmetry argument. To express the obtained derivatives, two approaches are considered, called and , which operate with node and wall variables, respectively. These two formulations are developed to prescribe the physical slip condition over plane and curved walls, including the corners. Their consistency and accuracy characteristics are examined against alternative linkwise strategies to impose the wall slip velocity, such as the kinetic‐based diffusive bounce‐back scheme, the central linear interpolation slip scheme, and the multireflection slip scheme. The several slip schemes are tested over different 3D microchannel configurations, with walls not conforming with the LBM uniform mesh. Numerical tests confirm the advanced accuracy characteristics of the proposed LSOB slip boundary scheme, revealing the added challenge of the wall slip modeling, and that parabolic accuracy is a necessary requirement to reach second‐order accuracy within this problem class.

Silva, Goncalo↗

From large to small $$ \mathcal{N} $$ = (4, 4) superconformal surface defects in holographic 6d SCFTs

Abstract Two-dimensional (2d)$$ \mathcal{N} $$ N = (4, 4) Lie superalgebras can be either “small” or “large”, meaning their R-symmetry is either$$ \mathfrak{so} $$ so (4) or$$ \mathfrak{so} $$ so (4) ⊕$$ \mathfrak{so} $$ so (4), respectively. Both cases admit a superconformal extension and fit into the one-parameter family$$ \mathfrak{d} $$ d (2,1;γ) ⊕$$ \mathfrak{d} $$ d (2,1;γ), with parameterγ∈ (−∞,∞). The large algebra corresponds to generic values ofγ, while the small case corresponds to a degeneration limit withγ→ −∞. In 11d supergravity, we study known solutions with superisometry algebra$$ \mathfrak{d} $$ d (2,1;γ) ⊕$$ \mathfrak{d} $$ d (2,1;γ) that are asymptotically locally AdS 7 ×𝕊 4 . These solutions are holographically dual to the 6d maximally superconformal field theory with 2d superconformal defects invariant under$$ \mathfrak{d} $$ d (2,1;γ) ⊕$$ \mathfrak{d} $$ d (2,1;γ). We show that a limit of these solutions, in whichγ→ −∞, reproduces another known class of solutions, holographically dual tosmall$$ \mathcal{N} $$ N = (4, 4) superconformal defects. We then use this limit to generate new small$$ \mathcal{N} $$ N = (4, 4) solutions with finite Ricci scalar, in contrast to the known small$$ \mathcal{N} $$ N = (4, 4) solutions. We then use holography to compute the entanglement entropy of a spherical region centered on these small$$ \mathcal{N} $$ N = (4, 4) defects, which provides a linear combination of defect Weyl anomaly coefficients that characterizes the number of defect-localized degrees of freedom. We also comment on the generalization of our results to include$$ \mathcal{N} $$ N = (0,4) surface defects through orbifolding.

Physics↗

Hierarchical Model Reduction Driven by Machine Learning for Parametric Advection-Diffusion-Reaction Problems in the Presence of Noisy Data

Abstract We propose a new approach to generate a reliable reduced model for a parametric elliptic problem, in the presence of noisy data. The reference model reduction procedure is the directional HiPOD method, which combines Hierarchical Model reduction with a standard Proper Orthogonal Decomposition, according to an offline/online paradigm. In this paper we show that directional HiPOD looses in terms of accuracy when problem data are affected by noise. This is due to the interpolation driving the online phase, since it replicates, by definition, the noise trend. To overcome this limit, we replace interpolation with Machine Learning fitting models which better discriminate relevant physical features in the data from irrelevant unstructured noise. The numerical assessment, although preliminary, confirms the potentialities of the new approach.

97 MATHEMATICS AND COMPUTING↗

Impact of various DIII-D diagnostics on the accuracy of neural network surrogates for kinetic EFIT reconstructions

Abstract Kinetic equilibrium reconstructions make use of profile information such as particle density and temperature measurements in addition to magnetics data to compute a self-consistent equilibrium. They are used in a multitude of physics-based modeling. This work develops a multi-layer perceptron (MLP) neural network (NN) model as a surrogate for kinetic Equilibrium Fitting (EFITs) and trains on the 2019 DIII-D discharge campaign database of kinetic equilibrium reconstructions. We investigate the impact of including various diagnostic data and machine actuator controls as input into the NN. When giving various categories of data as input into NN models that have been trained using those same categories of data, the predictions on multiple equilibrium reconstruction solutions (poloidal magnetic flux, global scalars, pressure profile, current profile) are highly accurate. When comparing different models with different diagnostics as input, the magnetics-only model outputs accurate kinetic profiles and the inclusion of additional data does not significantly impact the accuracy. When the NN is tasked with inferring only a single target such as the EFIT pressure profile or EFIT current profile, we see a large increase in the accuracy of the prediction of the kinetic profiles as more data is included. These results indicate that certain MLP NN configurations can be reasonably robust to different burning-plasma-relevant diagnostics depending on the accuracy requirements for equilibrium reconstruction tasks.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗