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 793 records · Page 44

'Exploration of finite ion orbit effects in the ion cyclotron range of frequencies

The rf-SciDAC collaboration is developing computer simulations to predict the damping of radio frequency (rf) waves in fusion plasmas. Here we extend self-consistent quasi-linear calculations of ion cyclotron resonant heating to include the finite drift of ions from magnetic flux surfaces and rf induced spatial transport. The all-orders spectral wave solver AORSA is iteratively coupled with a particle based update of the plasma distribution function.

43 PARTICLE ACCELERATORS↗

Exploration of finite ion orbit effects in the ion cyclotron range of frequencies

The rf-SciDAC collaboration is developing computer simulations to predict the damping of radio frequency (rf) waves in fusion plasmas. Here we extend self-consistent quasi-linear calculations of ion cyclotron resonant heating to include the finite drift of ions from magnetic flux surfaces and rf induced spatial transport. The all-orders spectral wave solver AORSA is iteratively coupled with a particle based update of the plasma distribution function.

ABSORPTION↗

Unconditionally convergent nonlinear solver for hyperbolic conservation laws with S-shaped flux functions

This paper addresses the convergence properties of implicit numerical solution algorithms for nonlinear hyperbolic transport problems. It is shown that the Newton-Raphson (NR) method converges for any time step size, if the flux function is convex, concave, or linear, which is, in general, the case for CFD problems. In some problems, e.g., multiphase flow in porous media, the nonlinear flux function is S-shaped (not uniformly convex or concave); as a result, a standard NR iteration can diverge for large time steps, even if an implicit discretization scheme is used to solve the nonlinear system of equations. In practice, when such convergence difficulties are encountered, the current time step is cut, previous iterations are discarded, a smaller time step size is tried, and the NR process is repeated. The criteria for time step cutting and selection are usually based on heuristics that limit the allowable change in the solution over a time step and/or NR iteration. Here, we propose a simple modification to the NR iteration scheme for conservation laws with S-shaped flux functions that converges for any time step size. The new scheme allows one to choose the time step size based on accuracy consideration only without worrying about the convergence behavior of the nonlinear solver. The proposed method can be implemented in an existing simulator, e.g., for CO{sub 2} sequestration or reservoir flow modeling, quite easily. The numerical analysis is confirmed with simulation studies using various test cases of nonlinear multiphase transport in porous media. The analysis and numerical experiments demonstrate that the modified scheme allows for the use of arbitrarily large time steps for this class of problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Energy transport analysis of NSTX plasmas with the TGLF turbulent and NEO neoclassical transport models

This work presents a study of plasma transport at low aspect ratio on the National Spherical Torus Experiment tokamak, where the turbulent and neoclassical energy fluxes calculated by the quasilinear Trapped Gyro Landau Fluid (TGLF) model and the multi species drift-kinetic Neoclassical solver (NEO) are validated against experimental data. The turbulent energy transport of two plasma discharges, one in the L-mode confinement regime and another in the H-mode regime, is dominated by electrostatic drift-wave instabilities, while the ion heat transport has a significant neoclassical contribution. The data analysis workflow is described in detail to understand how the variations of mapping and fitting of experimental data affect the power balance solution and subsequent flux-matching plasma profile predictions with the TGYRO solver. On average, the predicted plasma profiles are consistent with experimental data. However, the solutions are sensitive to various input parameters, including boundary conditions, and the electron-ion coupling. Linear gyrokinetic stability analysis demonstrates close agreement of the real frequencies of unstable modes between TGLF and CGYRO gyrokinetic simulations, but higher growth rates are predicted by TGLF, especially for the H-mode case. Estimates of the low-k modes' contributions to the total flux are consistent with linear stability analysis and the E × B suppression of turbulence in TGLF simulations with the SAT1 saturation model, while the SAT2 saturation model over-predicts the low-k modes' contribution in the H-mode case. Moreover, the results with SAT1 model are consistent with power balance analysis, which indicates only neoclassical ion energy fluxes inside ρ < 0.4 in the L-mode case and $\rho \unicode{x2A7D} 0.7$ in the H-mode case. The presence of multi-scale turbulence and ion-scale driven zonal flow mixing effects are also observed in TGLF scans of the electron turbulent heat flux over a range of temperature gradients and the electron-ion temperature ratio, which could explain the strong model sensitivity to variations of input parameters.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Differentiable programming for online training of a neural artificial viscosity function within a staggered grid Lagrangian hydrodynamics scheme

Lagrangian methods to solve the inviscid Euler equations produce numerical oscillations near shock waves. A common approach to reducing these oscillations is to add artificial viscosity (AV) to the discrete equations. The AV term acts as a dissipative mechanism that attenuates oscillations by smearing the shock across a finite number of computational cells. However, AV introduces several control parameters that are not determined by the underlying physical model, and hence, in practice are tuned to the characteristics of a given problem. We seek to improve the standard quadratic-linear AV form by replacing it with a learned neural function that reduces oscillations relative to exact solutions of the Euler equations, resulting in a hybrid numerical-neural hydrodynamic solver. Because AV is an artificial construct that exists solely to improve the numerical properties of a hydrodynamic code, there is no offline ‘viscosity data’ against which a neural network can be trained before inserting into a numerical simulation, thus requiring online training. We achieve this via differentiable programming, i.e. end-to-end backpropagation or adjoint solution through both the neural and differential equation code, using automatic differentiation of the hybrid code in the Julia programming language to calculate the necessary loss function gradients. A novel offline pre-training step accelerates training by initializing the neural network to the default numerical AV scheme, which can be learned rapidly by space-filling sampling over the AV input space. We find that online training over early time steps of simulation is sufficient to learn a neural AV function that reduces numerical oscillations in long-term hydrodynamic shock simulations. These results offer an early proof-of-principle that online differentiable training of hybrid numerical schemes with novel neural network components can improve certain performance aspects existing in purely numerical schemes.

97 MATHEMATICS AND COMPUTING↗

Accelerating the Gauss-Seidel Power Flow Solver on a High Performance Reconfigurable Computer

The computationally intensive power flow problem determines the voltage magnitude and phase angle at each bus in a power system for hundreds of thousands of buses under balanced three-phase steady-state conditions. We report an FPGA acceleration of the Gauss-Seidel based power flow solver employed in the transmission module of the GridLAB-D power distribution simulator and analysis tool. The prototype hardware is implemented on an SGI Altix-RASC system equipped with a Xilinx Virtex II 6000 FPGA. Due to capacity limitations of the FPGA, only the bus voltage calculations of the power network are implemented on hardware while the branch current calculations are implemented in software. For a 200,000 bus system, the bus voltage calculation on the FPGA achieves a 48x speed-up with PQ buses and a 62 times for PV over an equivalent sequential software implementation. The average overall speed up of the FPGA-CPU implementation with 100 iterations of the Gauss-Seidel power solver is 2.6x over a software implementation, with the branch calculations on the CPU accounting for 85% of the total execution time. The FPGA-CPU implementation also shows linear scaling with increase in the size of the input power network.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Replicated Computational Results (RCR) Report for “Adaptive Precision Block-Jacobi for High Performance Preconditioning in the Ginkgo Linear Algebra Software”

The article by Flegar et al. titled “Adaptive Precision Block-Jacobi for High Performance Preconditioning in the Ginkgo Linear Algebra Software” presents a novel, practical implementation of an adaptive precision block-Jacobi preconditioner. Performance results using state-of-the-art GPU architectures for the block-Jacobi preconditioner generation and application demonstrate the practical usability of the method, compared to a traditional full-precision block-Jacobi preconditioner. A production-ready implementation is provided in the Ginkgo numerical linear algebra library. In this report, the Ginkgo library is reinstalled and performance results are generated to perform a comparison to the original results when using Ginkgo’s Conjugate Gradient solver with either the full or the adaptive precision block-Jacobi preconditioner for a suite of test problems on an NVIDIA GPU accelerator. After completing this process, the published results are deemed reproducible.

97 MATHEMATICS AND COMPUTING↗

Hybrid Optimization Parallel Search PACKage

HOPSPACK is open source software for solving optimization problems without derivatives. Application problems may have a fully nonlinear objective function, bound constraints, and linear and nonlinear constraints. Problem variables may be continuous, integer-valued, or a mixture of both. The software provides a framework that supports any derivative-free type of solver algorithm. Through the framework, solvers request parallel function evaluation, which may use MPI (multiple machines) or multithreading (multiple processors/cores on one machine). The framework provides a Cache and Pending Cache of saved evaluations that reduces execution time and facilitates restarts. Solvers can dynamically create other algorithms to solve subproblems, a useful technique for handling multiple start points and integer-valued variables. HOPSPACK ships with the Generating Set Search (GSS) algorithm, developed at Sandia as part of the APPSPACK open source software project.

Kolda, Tamara↗

Architecture-Aware Algorithms for Scalable Performance and Resilience on Heterogeneous Architectures. Final Report

With the coming end of Moore's law, it has become essential to develop new algorithms and techniques that can provide the performance needed by demanding computational science applications, especially those that are part of the DOE science mission. This work was part of a multi-institution, multi-investigator project that explored several approaches to develop algorithms that would be effective at the extreme scales and with the complex processor architectures that are expected at the end of this decade. The work by this group developed new performance models that have already helped guide the development of highly scalable versions of an algebraic multigrid solver, new programming approaches designed to support numerical algorithms on heterogeneous architectures, and a new, more scalable version of conjugate gradient, an important algorithm in the solution of very large linear systems of equations.

97 MATHEMATICS AND COMPUTING↗

FEOTS v0.0.0: a new offline code for the fast equilibration of tracers in the ocean

Abstract. In this paper we introduce a new software framework for the offline calculation of tracer transport in the ocean. The Fast Equilibration of Ocean Tracers Software (FEOTS) is an end-to-end set of tools to efficiently calculate tracer distributions on a global or regional sub-domain using transport operators diagnosed from a comprehensive ocean model. To the best of our knowledge, this is the first application of a transport matrix model to an eddying ocean state. While a Newton–Krylov-based equilibration capability is still under development and not presented here, we demonstrate in this paper the transient modeling capabilities of FEOTS in an application focused on the Argentine Basin, where intense eddy activity and the Zapiola Anticyclone lead to strong mixing of water masses. The demonstration illustrates progress in developing offline passive tracer simulation capabilities, while highlighting the challenges of the impulse response functions approach in capturing tracer transports by a non-linear advection scheme. Our future work will focus on improving the computational efficiency of the code to reduce time-to-solution, using different basis functions to better represent non-linear advection operators, applying FEOTS to a parent model with unstructured grids (Ocean Model for Prediction Across Scales, MPAS-Ocean), and fully implementing a Newton–Krylov steady-state solver.

54 ENVIRONMENTAL SCIENCES↗

Hybrid Optimization Parallel Search PACKage

HOPSPACK is open source software for solving optimization problems without derivatives. Application problems may have a fully nonlinear objective function, bound constraints, and linear and nonlinear constraints. Problem variables may be continuous, integer-valued, or a mixture of both. The software provides a framework that supports any derivative-free type of solver algorithm. Through the framework, solvers request parallel function evaluation, which may use MPI (multiple machines) or multithreading (multiple processors/cores on one machine). The framework provides a Cache and Pending Cache of saved evaluations that reduces execution time and facilitates restarts. Solvers can dynamically create other algorithms to solve subproblems, a useful technique for handling multiple start points and integer-valued variables. HOPSPACK ships with the Generating Set Search (GSS) algorithm, developed at Sandia as part of the APPSPACK open source software project.

Source record↗

The value of continuity: Refined isogeometric analysis and fast direct solvers

Here, we propose the use of highly continuous finite element spaces interconnected with low continuity hyperplanes to maximize the performance of direct solvers. Starting from a highly continuous Isogeometric Analysis (IGA) discretization, we introduce C0-separators to reduce the interconnection between degrees of freedom in the mesh. By doing so, both the solution time and best approximation errors are simultaneously improved. We call the resulting method “refined Isogeometric Analysis (rIGA)”. To illustrate the impact of the continuity reduction, we analyze the number of Floating Point Operations (FLOPs), computational times, and memory required to solve the linear system obtained by discretizing the Laplace problem with structured meshes and uniform polynomial orders. Theoretical estimates demonstrate that an optimal continuity reduction may decrease the total computational time by a factor between p 2 and p 3 , with pp being the polynomial order of the discretization. Numerical results indicate that our proposed refined isogeometric analysis delivers a speed-up factor proportional to p 2 . In a 2D mesh with four million elements and p=5, the linear system resulting from rIGA is solved 22 times faster than the one from highly continuous IGA. In a 3D mesh with one million elements and p=3, the linear system is solved 15 times faster for the refined than the maximum continuity isogeometric analysis.

97 MATHEMATICS AND COMPUTING↗

Gyrokinetic simulations of mesoscale energetic particle-driven Alfvenic turbulent transport embedded in microturbulence

Energetic particle (EP) transport from local high-n toroidal Alfven eigenmodes (TAEs) and energetic particle modes (EPMs) is simulated with a gyrokinetic code. Linear and nonlinear simulations have identified a parameter range where the longwave TAE and EPM are unstable alongside the well-known ion-temperature-gradient (ITG) and trapped-electron-mode (TEM) instabilities. A new eigenvalue solver in GYRO facilitates this mode identification. States of nonlinearly saturated local TAE/EPM turbulent intensity are identified, showing a 'soft' transport threshold for enhanced energetic particle transport against the TAE/EPM drive from the EP pressure gradient. The very long-wavelength (mesoscale) TAE/EPM transport is saturated partially by nonlinear interaction with microturbulent ITG/TEM-driven zonal flows. Fixed-gradient-length, nonlinearly saturated states are accessible over a relatively narrow range of EP pressure gradient. Within this range, and in the local limit employed, TAE/EPM-driven transport more closely resembles drift-wave microturbulent transport than 'stiff' ideal MHD transport with a clamped critical total pressure gradient. At a higher, critical EP pressure gradient, fixed-gradient nonlinear saturation fails: EP transport increases without limit and background transport decreases. Presumably saturation is then obtained by relaxation of the EP pressure gradient to near this critical EP pressure gradient. If the background plasma gradients driving the ITG/TEM turbulence and zonal flows are weakened, the critical gradient collapses to the TAE/EPM linear stability threshold. Even at the critical EP pressure gradient there is no evidence that TAE/EPM instability significantly increases transport in the background plasma channels.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An Adaptive Newton-Based Free-Boundary Grad–Shafranov Solver

Equilibria in magnetic confinement devices result from force balancing between the Lorentz force and the plasma pressure gradient. In an axisymmetric configuration like a tokamak, such an equilibrium is described by an elliptic equation for the poloidal magnetic flux, commonly known as the Grad–Shafranov equation. It is challenging to develop a scalable and accurate free-boundary Grad–Shafranov solver, since it is a fully nonlinear optimization problem that simultaneously solves for the magnetic field coil current outside the plasma to control the plasma shape. In this work, we develop a Newton-based free-boundary Grad–Shafranov solver using adaptive finite elements and preconditioning strategies. The free-boundary interaction leads to the evaluation of a domain-dependent nonlinear form of which its contribution to the Jacobian matrix is achieved through shape calculus. The optimization problem aims to minimize the distance between the plasma boundary and specified control points while satisfying two nontrivial constraints, which correspond to the nonlinear finite element discretization of the Grad–Shafranov equation and a constraint on the total plasma current involving a nonlocal coupling term. The linear system is solved by a block factorization, and AMG is called for subblock elliptic operators. The unique contributions of this work include the treatment of a global constraint, preconditioning strategies, nonlocal reformulation, and the implementation of adaptive finite elements. Furthermore, it is found that the resulting Newton solver is robust, successfully reducing the nonlinear residual to 1e-6 and lower in a small handful of iterations while addressing the challenging case to find a Taylor state equilibrium where conventional Picard-based solvers fail to converge.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

On the use of LES-based turbulent thermal-stress models for rod bundle simulations

An alternative methodology is proposed here to overcome the excessive cost of large eddy simulations (LES) of full-length heated rod bundle calculations, while improving the inaccurate results typically obtained with Reynolds-averaged Navier-Stokes equations (RANS). While the cost of the full-length LES is generally too high, LES of a small section of a single rod is usually affordable. The idea presented here consists of using the information granted by the small LES calculation to determine the appropriate turbulence viscosity or turbulent thermal diffusivity that can be used to solve only for the temperature field in a pseudo-RANS approach. The study has been performed with single-rod simulations with a P/D of 1.12 and 1.24, considering rod lengths that are representative of reactor applications, for the cases of uniform heat flux and a more realistic cosine-like axial heat distribution. Here, the spectral element code Nek5000 has been used for all LES, RANS, and pseudo-RANS simulations. The recently proposed Nek5000 steady-state solver has been used for solving the temperature field in the pseudo-RANS approach and has proved significantly faster than transient schemes. Prediction of thermal quantities is compared with classical linear and nonlinear RANS models. LES for the full-length rods has also been performed and is used as a reference. Results of the proposed method show significant improvements with respect to those obtained with RANS.

42 ENGINEERING↗

Benchmarking Correlation-Consistent Basis Sets for Frequency-Dependent Polarizabilities with Multiresolution Analysis

This paper presents the first converged frequency-dependent HF polarizability results for general molecules, on a set of 89 closed-shell atoms and molecules. The solver employs multiresolution analysis (MRA) in a multiwavelet basis to compute both ground and response states to a guaranteed precision, which are validated against independent numerical grid calculations on atoms and linear molecules. The MRA ground-state energies and response properties are used to evaluate results in correlation-consistent basis sets up to 5Z augmented with either single or double diffuse functions and core-polarization functions. Systematic trends are revealed through consideration of chemical composition as well as the use of machine learning to cluster convergence trends, the latter suggesting the possibility of learning and correcting basis-set error.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

skyline

skyline is a header-only C++ library for the direct solution of linear algebraic equations that are stored in skyline format. It is intended for medium-sized sparse problems with moderate bandwidth. This solution approach has historically been used for pressure network solvers and in some finite element codes. It was developed to replace legacy solver code included in the EnergyPlus building energy modeling software package, but is not limited to use by EnergyPlus.

DeGraw, Jason↗

Denoising Poisson phaseless measurements via orthogonal dictionary learning

Phaseless diffraction measurements recorded by CCD detectors are often affected by Poisson noise. In this paper, we propose a dictionary learning model by employing patches based sparsity in order to denoise such Poisson phaseless measurements. The model consists of three terms: (i) A representation term by an orthogonal dictionary, (ii) an L 0 pseudo norm of the coefficient matrix, and (iii) a Kullback-Leibler divergence term to fit phaseless Poisson data. Fast alternating minimization method (AMM) and proximal alternating linearized minimization (PALM) are adopted to solve the proposed model, and especially the theoretical guarantee of the convergence of PALM is provided. The subproblems for these two algorithms both have fast solvers, and indeed, the solutions for the sparse coding and dictionary updating both have closed forms due to the orthogonality of learned dictionaries. Numerical experiments for phase retrieval using coded diffraction and ptychographic patterns are conducted to show the efficiency and robustness of proposed methods, which, by preserving texture features, produce visually and quantitatively improved restored images compared with other phase retrieval algorithms without regularization and local sparsity promoting algorithms.

97 MATHEMATICS AND COMPUTING↗