Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear solver”

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 703 records · Page 39

Quantifying the Impact of Single Bit Flips on Floating Point Arithmetic

In high-end computing, the collective surface area, smaller fabrication sizes, and increasing density of components have led to an increase in the number of observed bit flips. If mechanisms are not in place to detect them, such flips produce silent errors, i.e. the code returns a result that deviates from the desired solution by more than the allowed tolerance and the discrepancy cannot be distinguished from the standard numerical error associated with the algorithm. These phenomena are believed to occur more frequently in DRAM, but logic gates, arithmetic units, and other circuits are also susceptible to bit flips. Previous work has focused on algorithmic techniques for detecting and correcting bit flips in specific data structures, however, they suffer from lack of generality and often times cannot be implemented in heterogeneous computing environment. Our work takes a novel approach to this problem. We focus on quantifying the impact of a single bit flip on specific floating-point operations. We analyze the error induced by flipping specific bits in the most widely used IEEE floating-point representation in an architecture-agnostic manner, i.e., without requiring proprietary information such as bit flip rates and the vendor-specific circuit designs. We initially study dot products of vectors and demonstrate that not all bit flips create a large error and, more importantly, expected value of the relative magnitude of the error is very sensitive on the bit pattern of the binary representation of the exponent, which strongly depends on scaling. Our results are derived analytically and then verified experimentally with Monte Carlo sampling of random vectors. Furthermore, we consider the natural resilience properties of solvers based on the fixed point iteration and we demonstrate how the resilience of the Jacobi method for linear equations can be significantly improved by rescaling the associated matrix.

Elliott, James J.↗

The rheology and microstructure of dense suspensions of elastic capsules.

We use a recently developed hybrid numerical technique [MacMeccan et al. (2009)] that combines a lattice-Boltzmann (LB) fluid solver with a finite element (FE) solid-phase solver to study suspensions of elastic capsules. The LB method recovers the Navier-Stokes hydrodynamics, while the linear FE method models the deformation of fluid-filled elastic capsules for moderate levels of deformation. The simulation results focus on accurately describing the suspension rheology, including the particle pressure, and relating these changes to changes in the microstructure. Simulations are performed with hundreds of particles in unbounded shear allowing an accurate description of the bulk suspension rheology and microstructure. In contrast to rigid spherical particles, elastic capsules are capable of producing normal stresses in the dilute limit. For dense suspensions, the first normal stress difference is of particular interest. The first normal stress difference, which is negative for dense rigid spherical suspensions, undergoes a sign change at moderate levels of deformation of the suspended capsules.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

ExaWind: Predictive Wind Energy Simulations

This presentation describes the ExaWind project and the team's progress in creating a suite of performance-portable codes designed for predictive simulations of wind farms on next-generation exascale-class supercomputers. Such simulations will require the resolution of scales spanning many orders of magnitude, from blade boundary layers to wind farm flow structures. In the U.S., the first exascale systems will be GPU accelerated, and different GPU manufacturers have been chosen for the different systems. At the heart of the ExaWind software is a hybrid-solver approach based on the codes Nalu-Wind and AMR-Wind, which are computational fluid dynamics solvers for the incompressible Navier-Stokes equations. Nalu-Wind is an unstructured-grid code used to resolve wind turbine geometry and blade boundary layers, whereas AMR-Wind is a structured-grid background solver for atmospheric turbulent flow and turbine wake propagation. The models are coupled with overset meshes and global linear systems are approximated through a loose-coupling algorithm. Results will include validation-quality high-fidelity simulations and strong/weak scaling results from the Summit supercomputer.

49 EE - Wind and Water Power Program - Wind (EE-4W↗

COMPARISON OF SIMULATION CODES FOR MICROWAVE INSTABILITY IN BUNCHED BEAMS

In accelerator design, there is often a need to evaluate the threshold to the (longitudinal) microwave instability for a bunched beam in an electron storage ring. Several computational tools are available that allow them, once given the wakefield representing a ring, to numerically find the threshold current and to simulate the development of the instability. In this work, they present results of coputer simulations using two codes recently developed at the SLAC National Accelerator Laboratory: a Vlasov-Fokker-Planck (VFP) solver based on an algorithm by Warnock and Ellison, and a program that find the threshold from the linearized Vlasov equation. They apply the programs to find the instability threshold for three models of ring impedances: that of a Q = 1 resonator, of shielded coherent synchrotron radiation (CSR), and of a resistive wall. The first example is wel-bheaved, but the other two are singular wakes that need special care. Note that similar numerical studies of the threshold of a Q = 1 resonantor wake have been performed by Oide and Yokova, and others. They compare the results of the two programs and discuss their respective capabilities and limitations. In this report they assume the slippage factor {eta} is always positive. They work in Gaussian units.

43 PARTICLE ACCELERATORS↗

A data-driven approach to real-time vertical position estimation for NSTX-U vertical stability control

In this paper, a database of 77 996 plasma equilibrium reconstructions from 727 discharges during the initial operation of the NSTX-U spherical tokamak is analyzed to develop a statistically robust model of the plasma vertical position for real-time control. A variety of regression models are developed and tested, ranging in complexity from linear models to deep neural networks, and including input signals ranging from the four pairs of flux loops used historically on NSTX-U up to the full set of 389 real-time signals available to the plasma control system. A linear model based on 140 real-time magnetics signals is found to offer excellent accuracy, with a coefficient of determination R 2 = 0.906. The robustness of this model to limited training data, new operating scenarios, and signal errors is tested, and a procedure is demonstrated to tune the model parameters to optimize its robustness. A time-dependent plasma equilibrium solver, TokaMaker, is used to simulate vertical stability control in NSTX-U, demonstrating that it should be possible to iteratively tune the parameters of a linear vertical position model to stabilize both positive and negative triangularity plasmas in future experiments.

magnetic diagnostics↗

Invertible Neural Networks for Aerodynamic Design of Wind Turbine Blades

The state-of-the-practice methods for aerodynamic design of wind turbine blads use linearized blade element momentum theory (BEM) to optimize the twist and chord profiles from a pre-selected set of 2D airfoil shapes. In this work, we apply invertible neural network (INN) tools to enable the rapid inverse aerodynamic design of wind turbine blades including component airfoils. The INN is trained on data obtained through the use of robust automated mesh generation and the HAMSTR computational fluid dynamics solver with advanced turbulence and transition models validated for turbine applications. Our design technique is a significant improvement over the state-of-the-practice linearized blade element momentum (BEM) techniques in capturing 3D nonlinear aerodynamic effects that are critical for optimal design of the rotors. This is made possible by developing sparse, invertible neural networks (INNs) for inverse design and optimization that realize a 100x cost reduction compared to adjoint-based computational fluid dynamics (CFD) approaches, while enabling increased robustness of the final design. We demonstrate the INN tool for design of a section of the NREL 5-MW blade. All generated shapes satisfy the desired aerodynamic characteristics, demonstrating the success of the INN approach for inverse design of wind turbine blades.

aerodynamic design↗

Hybrid Finite Element--Spectral Method for the Fractional Laplacian: Approximation Theory and Efficient Solver

Here, a numerical scheme is presented for approximating fractional order Poisson problems in two and three dimensions. The scheme is based on reformulating the original problem posed over $\Omega$ on the extruded domain $\mathcal{C}=\Omega\times[0,\infty)$ following. The resulting degenerate elliptic integer order PDE is then approximated using a hybrid FEM-spectral scheme. Finite elements are used in the direction parallel to the problem domain $\Omega$, and an appropriate spectral method is used in the extruded direction. The spectral part of the scheme requires that we approximate the true eigenvalues of the integer order Laplacian over $\Omega$. We derive an a priori error estimate which takes account of the error arising from using an approximation in place of the true eigenvalues. We further present a strategy for choosing approximations of the eigenvalues based on Weyl's law and finite element discretizations of the eigenvalue problem. The system of linear algebraic equations arising from the hybrid FEM-spectral scheme is decomposed into blocks which can be solved effectively using standard iterative solvers such as multigrid and conjugate gradient. Numerical examples in two and three dimensions suggest that the approach is quasi-optimal in terms of complexity.

97 MATHEMATICS AND COMPUTING↗

Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory

We present two efficient iterative algorithms for solving the linear response eigen- value problem arising from the time dependent density functional theory. Although the matrix to be diagonalized is nonsymmetric, it has a special structure that can be exploited to save both memory and floating point operations. In particular, the nonsymmetric eigenvalue problem can be transformed into a product eigenvalue problem that is self-adjoint with respect to a K-inner product. This product eigenvalue problem can be solved efficiently by a modified Davidson algorithm and a modified locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm that make use of the K-inner product. The solution of the product eigenvalue problem yields one component of the eigenvector associated with the original eigenvalue problem. However, the other component of the eigenvector can be easily recovered in a postprocessing procedure. Therefore, the algorithms we present here are more efficient than existing algorithms that try to approximate both components of the eigenvectors simultaneously. The efficiency of the new algorithms is demonstrated by numerical examples.

97 MATHEMATICS AND COMPUTING↗

BAM: bias assignment method to generate mock catalogues

Combining the statistics of dark matter tracers from a high-resolution cosmological N-body simulation and the dark matter density field calculated from down-sampled initial conditions using efficient structure formation solvers, we extract the halo-bias relation on a mesh of a 3$h^{-1}$ Mpc cell side resolution as a function of properties of the dark matter density field (e.g. local density, cosmic web type), automatically including stochastic, deterministic, local and non-local components. We use this information to sample the halo density field, accounting for ignored dependencies through an iterative process. By construction, our approach reaches ~1% accuracy in the majority of the k-range up to the Nyquist frequency without systematic deviations for power spectra (about $k ~ 1h$ Mpc -1 ) using either particle mesh or Lagrangian perturbation theory based solvers. When using phase-space mapping to compensate the low resolution of the approximate gravity solvers, our method reproduces the bispectra of the reference within 10% precision studying configurations tracing the quasi-non-linear regime. BAM has the potential to become a standard technique to produce mock halo and galaxy catalogues for future galaxy surveys and cosmological studies being highly accurate, efficient and parameter free.

79 ASTRONOMY AND ASTROPHYSICS↗

CanTrilBat and Cantera_apps v1.0 beta

This application can determine the performance and chemical behavior of batteries in 1D when they are cycled. With CanTrilBat, we are developing predictive phenomenological models for battery systems to predict operating performance and rate limiting steps in the performance of battery models. Particular attention is paid to primary and secondary chemistry mechanisms, such as the thermal runaway mechanisms experienced in secondary lithium ion batteries or self-discharge reaction mechanism that all batteries experience to one extent or another. The first application of this model has been for modeling the performance of thermal batteries. However, an implementation for secondary ion batteries is next. CanTrilBat applications solves transient problems involving batteries. It is a 1-D application that represents 3-D physical systems that can be reduced using the porous flow approximation for the anode, cathode, and separator. A control volume formulation is used to track conserved quantities. An operator-split approach is used to calculate the chemistry, diffusion and electronic transport that occurs within cathode and anode particles, allowing for the reduction in code complexity. All jacobian operations in CanTrilBat utilize numerical jacobians. A home grown predictor corrector scheme is used for time step control, and a home grown newton solver is used to relax the equations at each time step. Trilinos is used to solve for the resulting linear systems equation A block text input format is used to initialize options for the CanTriBat program. Within this block are the names of several XML input files, which specify the chemistry mechanism. These XML input files are read by low level Cantera routines, and serve to initialize the electrode and electrolyte chemistry mechanisms and transport properties. A GUI implementation has been contracted out to a university professor, but has not been implemented yet. It?s expected that CanTriBat will have the capability to do adaptive grid refinement in later versions. Grids will be halved based on an complicated set of heuristic criteria, based on how well the mesh captures changes to the first and second derivatives of selected solution components. Primary emphasis is given towards converged profiles for IV performance.

Moffat, HarryK.↗

CanTrilBat and Cantera_apps v1.0 beta

This application can determine the performance and chemical behavior of batteries in 1D when they are cycled. With CanTrilBat, we are developing predictive phenomenological models for battery systems to predict operating performance and rate limiting steps in the performance of battery models. Particular attention is paid to primary and secondary chemistry mechanisms, such as the thermal runaway mechanisms experienced in secondary lithium ion batteries or self-discharge reaction mechanism that all batteries experience to one extent or another. The first application of this model has been for modeling the performance of thermal batteries. However, an implementation for secondary ion batteries is next. CanTrilBat applications solves transient problems involving batteries. It is a 1-D application that represents 3-D physical systems that can be reduced using the porous flow approximation for the anode, cathode, and separator. A control volume formulation is used to track conserved quantities. An operator-split approach is used to calculate the chemistry, diffusion and electronic transport that occurs within cathode and anode particles, allowing for the reduction in code complexity. All jacobian operations in CanTrilBat utilize numerical jacobians. A home grown predictor corrector scheme is used for time step control, and a home grown newton solver is used to relax the equations at each time step. Trilinos is used to solve for the resulting linear systems equation A block text input format is used to initialize options for the CanTriBat program. Within this block are the names of several XML input files, which specify the chemistry mechanism. These XML input files are read by low level Cantera routines, and serve to initialize the electrode and electrolyte chemistry mechanisms and transport properties. A GUI implementation has been contracted out to a university professor, but has not been implemented yet. It?s expected that CanTriBat will have the capability to do adaptive grid refinement in later versions. Grids will be halved based on an complicated set of heuristic criteria, based on how well the mesh captures changes to the first and second derivatives of selected solution components. Primary emphasis is given towards converged profiles for IV performance.

Moffat, Harry K.↗

Addressing Over-Solving in Multiphysics Codes with Nested Solvers

Examples of multiphysics problems in the field of nuclear engineering are numerous. For light water reactors the coupling of neutronics with thermal-hydraulics is the most predominant. Often this coupling is modeled by combining existing codes in a Picard Iteration scheme, that is, by solving one physics then using that answer to solve the other and iterating until both answers stabilize. However, simply solving to a high precision on every Picard (multiphysics) iteration is much less efficient than progressively solving to higher precisions. This unneeded work is known as over-solving. Over-solving in single-physics solvers has been studied previously for the Newton method and Chebyshev iteration. Both of these methods solve an inner linear problem that determines the next update step for the outer loop. If the inner problem is solved to a high precision in every outer iteration, the result will be substantially more computational expense (over-solving) and a higher probability of reaching the 'wrong' solution. Methods for reducing over-solving in partitioned multiphysics codes have only been developed recently. This work introduces further improvements, including an investigation of over-solving methods on both the multiphysics and single-physics levels.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Fully 3D Multiple Beam Dynamics Processes Simulation for the Tevatron

We present validation and results from a simulation of the Fermilab Tevatron including multiple beam dynamics effects. The essential features of the simulation include a fully 3D strong-strong beam-beam particle-in-cell Poisson solver, interactions among multiple bunches and both head-on and long-range beam-beam collisions, coupled linear optics and helical trajectory consistent with beam orbit measurements, chromaticity and resistive wall impedance. We validate individual physical processes against measured data where possible, and analytic calculations elsewhere. Finally, we present simulations of the effects of increasing beam intensity with single and multiple bunches.

43 PARTICLE ACCELERATORS↗

Comparison of spherical harmonics method and discrete ordinates method for radiative transfer in a turbulent jet flame

Here, in this study, we systematically compared the accuracy and computational cost of two popular solution methods for the radiative transfer equation (RTE): the spherical harmonics method (P N ) and the discrete ordinates method (DOM). We first investigated convergence characteristics of different orders of P N and DOM in a series of 1D homogeneous configurations with varying optical thicknesses. Both solvers perform better for optically thicker cases. The accuracy of P N methods increases with its order, , but the gain in accuracy reduces with the increase in , i.e., improvement of P 7 over P 5 is less than that of P 3 over P 1 . This decreasing trend becomes more prominent as the optical thickness decreases. On the other hand, DOM’s accuracy increases almost linearly with the increase in the number of ordinates (or polar angles in this study) in all cases. While comparing the directional profile of radiative intensity, both solvers perform better when the radiative intensity is more isotropic. These solvers were then connected with a full spectrum k-distribution (FSK) spectral model and used to perform radiation-coupled simulations of a turbulent jet flame in an axi-symmetric cylindrical domain. Results obtained from P 1 to P 7 approximations for P N , and 2 x 4, 4 x 4, 4 x 8, 8 x 8 finite angles for DOM are compared with that from an optically thin model, and a reference solution from line-by-line (LBL) photon Monte Carlo (PMC) method. The choice of radiation solver shows a noticeable impact on the temperature distribution of the flame. The P N solvers lead to slightly higher radiant fractions and the DOM solvers lead to slightly lower radiant fractions than the PMC benchmark solution. Finally, the computational costs of each of these solvers are also reported and an intermittent evaluation / time blending scheme to improve the computational efficiency of radiation solvers in radiation-coupled simulations are also demonstrated.

42 ENGINEERING↗

A graphics processing unit accelerated sparse direct solver and preconditioner with block low rank compression

We present the GPU implementation efforts and challenges of the sparse solver package STRUMPACK. The code is made publicly available on github with a permissive BSD license. STRUMPACK implements an approximate multifrontal solver, a sparse LU factorization which makes use of compression methods to accelerate time to solution and reduce memory usage. Multiple compression schemes based on rank-structured and hierarchical matrix approximations are supported, including hierarchically semi-separable, hierarchically off-diagonal butterfly, and block low rank. Here, in this paper, we present the GPU implementation of the block low rank (BLR) compression method within a multifrontal solver. Our GPU implementation relies on highly optimized vendor libraries such as cuBLAS and cuSOLVER for NVIDIA GPUs, rocBLAS and rocSOLVER for AMD GPUs and the Intel oneAPI Math Kernel Library (oneMKL) for Intel GPUs. Additionally, we rely on external open source libraries such as SLATE (Software for Linear Algebra Targeting Exascale), MAGMA (Matrix Algebra on GPU and Multi-core Architectures), and KBLAS (KAUST BLAS). SLATE is used as a GPU-capable ScaLAPACK replacement. From MAGMA we use variable sized batched dense linear algebra operations such as GEMM, TRSM and LU with partial pivoting. KBLAS provides efficient (batched) low rank matrix compression for NVIDIA GPUs using an adaptive randomized sampling scheme. The resulting sparse solver and preconditioner runs on NVIDIA, AMD and Intel GPUs. Interfaces are available from PETSc, Trilinos and MFEM, or the solver can be used directly in user code. We report results for a range of benchmark applications, using the Perlmutter system from NERSC, Frontier from ORNL, and Aurora from ALCF. For a high frequency wave equation on a regular mesh, using 32 Perlmutter compute nodes, the factorization phase of the exact GPU solver is about 6.5× faster compared to the CPU-only solver. The BLR-enabled GPU solver is about 13.8× faster than the CPU exact solver. For a collection of SuiteSparse matrices, the STRUMPACK exact factorization on a single GPU is on average 1.9× faster than NVIDIA’s cuDSS solver.

97 MATHEMATICS AND COMPUTING↗

Cross-verification of neoclassical transport solutions from XGCa against NEO

Radial neoclassical transport from the global gyrokinetic code XGC has been cross-verified against the local drift-kinetic neoclassical code NEO in NEO's local regime using a Grad-Shafranov equilibrium with a circular boundary. XGC shows excellent agreement with NEO, except for a difference of approximately 10% in the ion heat flux. Close investigation reveals that this difference is due to the simplification in NEO to use the same Coulomb logarithm ln Λ to represent all particle species, while XGC uses different formulas for collisions between different species. When XGC uses NEO's Coulomb logarithm, excellent agreement in the ion heat flux is recovered. Here, the present work not only crossverifies the equation solvers in two codes, but also verifies that the gyrokinetic and the drift-kinetic equations agree and that the linearized and nonlinear Coulomb collision operators agree in the mild gradient, local regime.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Observation of synergy between lower hybrid waves at two frequencies in EAST

Synergistic effects between two frequencies of lower hybrid (LH) waves—operating at 2.45 and 4.6 GHz—were observed in experiment on EAST for the first time. At low density (ne,lin≈2.0×1019 m−3), simultaneous injection of a 65/35 mix of 2.45/4.6 GHz power achieved an lower hybrid current drive efficiency that was 25% higher than what should be expected from the linear combination of the two sources. The experiment was interpreted with time-dependent simulations, using the equilibrium and transport solver TRANSP, coupled with the ray-tracing code GENRAY and the Fokker–Planck solver CQL3D. For each discharge, profiles of current and hard x-rays from simulation and measurement agree within uncertainties. An examination of the electron distribution function indicates that the LH synergy is supported by the increased width of the LH resonance plateau in the simultaneous injection case compared to independent injection.

Choi, W. (ORCID:0000000268912300)↗

Exploring the growth index γ L : Insights from different CMB dataset combinations and approaches

In this study we investigate the growth index γ L , which characterizes the growth of linear matter perturbations, while analysing different cosmological datasets. We compare the approaches implemented by two different patches of the cosmological solver : and __. In our analysis we uncover a deviation of the growth index from its expected Λ CDM value of 0.55 when utilizing the Planck dataset, both in the case and in the __ case, but in opposite directions. This deviation is accompanied by a change in the direction of correlations with derived cosmological parameters. However, the incorporation of cosmic microwave background lensing data helps reconcile γ L with its Λ -cold dark matter value in both cases. Conversely, the alternative ground-based telescopes Atacama Cosmology Telescope and South Pole Telescope consistently yield growth index values in agreement with γ L = 0.55 . We conclude that the presence of the A lens problem in the Planck dataset contributes to the observed deviations, underscoring the importance of additional datasets in resolving these discrepancies. Published by the American Physical Society 2024

Astronomy & Astrophysics↗