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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
NASA NTRS2016

Tangle-Free Finite Element Mesh Motion for Ablation Problems

Mesh motion is the process by which a computational domain is updated in time to reflect physical changes in the material the domain represents. Such a technique is needed in the study of the thermal response of ablative materials, which erode when strong heating is applied to the boundary. Traditionally, the thermal solver is coupled with a linear elastic or biharmonic system whose sole purpose is to update mesh node locations in response to altering boundary heating. Simple mesh motion algorithms rely on boundary surface normals. In such schemes, evolution in time will eventually cause the mesh to intersect and "tangle" with itself, causing failure. Furthermore, such schemes are greatly limited in the problems geometries on which they will be successful. This paper presents a comprehensive and sophisticated scheme that tailors the directions of motion based on context. By choosing directions for each node smartly, the inevitable tangle can be completely avoided and mesh motion on complex geometries can be modeled accurately.

Droba, Justin↗
NASA NTRS2016

An Optimized Multicolor Point-Implicit Solver for Unstructured Grid Applications on Graphics Processing Units

In the field of computational fluid dynamics, the Navier-Stokes equations are often solved using an unstructuredgrid approach to accommodate geometric complexity. Implicit solution methodologies for such spatial discretizations generally require frequent solution of large tightly-coupled systems of block-sparse linear equations. The multicolor point-implicit solver used in the current work typically requires a significant fraction of the overall application run time. In this work, an efficient implementation of the solver for graphics processing units is proposed. Several factors present unique challenges to achieving an efficient implementation in this environment. These include the variable amount of parallelism available in different kernel calls, indirect memory access patterns, low arithmetic intensity, and the requirement to support variable block sizes. In this work, the solver is reformulated to use standard sparse and dense Basic Linear Algebra Subprograms (BLAS) functions. However, numerical experiments show that the performance of the BLAS functions available in existing CUDA libraries is suboptimal for matrices representative of those encountered in actual simulations. Instead, optimized versions of these functions are developed. Depending on block size, the new implementations show performance gains of up to 7x over the existing CUDA library functions.

Zubair, Mohammad↗
DOE OSTI2024

Hybrid programming-model strategies for GPU offloading of electronic structure calculation kernels

To address the challenge of performance portability and facilitate the implementation of electronic structure solvers, we developed the basic matrix library (BML) and Parallel, Rapid O(N), and Graph-based Recursive Electronic Structure Solver (PROGRESS) library. The BML implements linear algebra operations necessary for electronic structure kernels using a unified user interface for various matrix formats (dense and sparse) and architectures (CPUs and GPUs). Focusing on density functional theory and tight-binding models, PROGRESS implements several solvers for computing the single-particle density matrix and relies on BML. In this paper, we describe the general strategies used for these implementations on various computer architectures, using OpenMP target functionalities on GPUs, in conjunction with third-party libraries to handle performance critical numerical kernels. In this study, we demonstrate the portability of this approach and its performance in benchmark problems.

36 MATERIALS SCIENCE↗
DOE OSTI2022

PyAMG: Algebraic Multigrid Solvers in Python

PyAMG is a Python package of algebraic multigrid (AMG) solvers and supporting tools for approximating the solution to large, sparse linear systems of algebraic equations, Ax = b, where A is an n × n sparse matrix. Sparse linear systems arise in a range of problems in science, from fluid flows to solid mechanics to data analysis. While the direct solvers available in SciPy’s sparse linear algebra package (scipy.sparse.linalg) are highly efficient, in many cases iterative methods are preferred due to overall complexity. However, the iterative methods in SciPy, such as CG and GMRES, often require an efficient preconditioner in order to achieve a lower complexity. Preconditioning is a powerful tool whereby the conditioning of the linear system and convergence rate of the iterative method are both dramatically improved. PyAMG constructs multigrid solvers for use as a preconditioner in this setting. A summary of multigrid and algebraic multigrid solvers can be found in Olson (2015a), in Olson (2015b), and in Falgout (2006); a detailed description can be found in Briggs et al. (2000) and Trottenberg et al. (2001).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Linear source method of characteristics in HELIOS2

The Studsvik Scandpower code HELIOS2 is a fast lattice transport code that has gained wide use for reactor fuel cycle analysis in commercial, regulatory, and research environments. It contains two transport solvers - Collision Probabilities (CP) and Method of Characteristics (MoC) - with a general geometry ability and generalized depletion for a variety of fuel types, experimental facilities, and isotope production applications. The HELIOS2 lattice code has been extended with the development of a linear source MoC option. The linear source equations are derived within the scope of the HELIOS2 general geometry and non-cyclic ray tracing. The implementation was tested for fine and coarse spatial mesh models of the 2D C5G7 MOX computational benchmark, which provides a pure and extreme test of a transport solver. The linear source yields at least comparable accuracy with reduced computational resource requirements relative to the flat-source approximation.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2018

High-order fully implicit solver for all-speed fluid dynamics: AUSM ride from nearly incompressible variable-density flows to shock dynamics

We introduce a novel Newton–Krylov (NK)-based fully implicit algorithm for solving fluid flows in a wide range of flow conditions—from variable density nearly incompressible to supersonic shock dynamics. The key enabling feature of our all-speed solver is the ability to efficiently solve conservation laws by choosing a set of independent variables that produce a well-conditioned Jacobian matrix for the linear iterations of the global nonlinear iterative solver. In particular, instead of choosing to discretize the conservative variables (density, momentum, total energy), which is traditionally used in Eulerian high-speed compressible fluid dynamics, we demonstrate superior performance by discretizing the primitive variables—pressure–velocity–temperature in the very low-Mach flow limits or density–velocity–temperature/entropy in the shock dynamics range. Moreover, our method allows us to avoid direct inversion of the mass matrix in discrete time derivatives, which is usually an additional source for stiffness, especially pronounced when going to very high-order schemes with non-orthogonal basis functions. Here, we show robust solutions obtained for discontinuous finite element discretization up to seventh-order accuracy. Another important aspect of the solution algorithm is the Advection Upstream Splitting Method (AUSM), adopted to compute numerical fluxes within our reconstructed discontinuous Galerkin (rDG) spatial discretization scheme. The use of the low-Mach modification of the hyperbolic flux operator is found to be necessary for enabling robust simulations of very stiff liquids and metals for Mach numbers below M=10 -5 , which is well known to be very computationally challenging for compressible solvers. We demonstrate that our fully implicit rDG-NK solver with the AUSM + -up flux treatment produces efficient and high-resolution numerical solutions at all speeds, ranging from vanishing Mach numbers to transonic and supersonic, without substantial modifications of the solution procedures. (At high speed, we add limiting and use a simpler preconditioning of the Krylov solver.) Numerical examples include nearly incompressible constant-property flow past a backward-facing step with heat transfer, low-Mach variable-property channel flow of water at supercritical state, phase change and melt pool dynamics for laser spot welding and selective laser melting in additive manufacturing, and Mach 3 flow in a wind tunnel with a step.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A fully implicit, scalable, conservative nonlinear relativistic Fokker–Planck 0D-2P solver for runaway electrons

Upon application of a sufficiently strong electric field, electrons break away from thermal equilibrium and approach relativistic speeds. These highly energetic ‘runaway’ electrons (~ MeV) play a significant role in tokamak disruption physics, and therefore their accurate understanding is essential to develop reliable mitigation strategies. As such, we have developed a fully implicit solver for the 0D-2P (i.e., including two momenta coordinates) relativistic nonlinear Fokker–Planck equation (rFP). As in earlier implicit rFP studies (NORSE, CQL3D), electron–ion interactions are modeled using the Lorentz operator, and synchrotron damping using the Abraham–Lorentz–Dirac reaction term. However, our implementation improves on these earlier studies by (1) ensuring exact conservation properties for electron collisions, (2) strictly preserving positivity, and (3) being scalable algorithmically and in parallel. Key to our proposed approach is an efficient multigrid preconditioner for the linearized rFP equation, a multigrid elliptic solver for the Braams–Karney potentials, and a novel adaptive technique to determine the associated boundary values. We verify the accuracy and efficiency of the proposed scheme with numerical results ranging from small electric-field electrical conductivity measurements to the accurate reproduction of runaway tail dynamics when strong electric fields are applied.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2019

HALA: Handy Accelerated Linear Algebra

Accelerated linear algebra libraries often come with C-style of interfaces or even older Fortran77 standards, which makes it difficult to use within generic template programming environment of modern C++. For example, the BLAS and derived standards such as cuBLAS do not accept overloads and a different functions have to be called for each input type, thus it is very challenging to write a single template that handles multiple precision modes and works well with different C++ containers. HALA offers a series of templates that wrap around the BLAS/cuBLAS and other similar methods, automatically infer the relevant types and call the appropriate back-end. The templates work out-of-the-box with all C++ standard vector-like containers and can be easily extended (with template specializations) to handle user-provided containers. The HALA API is also overloaded to handle both GPU and CPU cases with a single "engine" class, thus a single high-level algorithms can utilize both CPU or GPU backends, i.e., the HALA API is unified and handles the variations between cuBLAS and BLAS. In addition to BLAS and cuBLAS, wrapper templates are provided for subset of LAPACK, cuSparse, and Cholmod methods. Work is in progress to complete as many of these standards as possible. HALA also includes a module for low-level extended register vectorization for complex number arithmetic and several simple solvers that build on the basic linear algebra capabilities. A single unified C++ API will benefit fast prototyping and easily writing code that is portable across GPU/CPU platforms as well as precision types and user containers. Note that HALA does not provide any accelerated algorithms, it simply serves as a "handy" front-end to other standards.

Stoyanov, MiroslavK.↗
NASA NTRS1991

An adaptively-refined Cartesian mesh solver for the Euler equations

A method for adaptive refinement of a Cartesian mesh for the solution of the steady Euler equations is presented. The algorithm creates an initial uniform mesh and cuts the body out of that mesh. The mesh is then refined based on body curvature. Next, the solution is converged to a steady state using a linear reconstruction and Roe's approximate Riemann solver. Solution-adaptive refinement of the mesh is then applied to resolve high-gradient regions of the flow. The numerical results presented show the flexibility of this approach and the accuracy attainable by solution-based refinement.

De Zeeuw, Darren↗
DOE OSTI2025

Hydrodynamic characterization of the coastal pioneer array ocean observing system

Ocean observation buoys require relatively small amounts of power, yet traditionally necessitate costly resupply trips for battery replacement. With the offshore location of the buoys and small power requirements, wave energy may be an effective solution for providing consistent and reliable power to support the buoy instrumentation. The US National Science Foundation Ocean Observatories Initiative (OOI) includes arrays of point absorber-like buoy systems used for ocean observation that have been deployed at multiple locations including the Southern Mid-Atlantic Bight. A study is currently underway to design a pitch resonator wave energy converter to supplement existing renewable energy generation for powering observation instrumentation. This paper details field measurements from surface moorings of the OOI Coastal Pioneer Array, which informs the subsequent development of a numerical model for the moored observation system. The model is developed in Wave Energy Converter Simulator (WEC-Sim), which leverages the Simscape multibody solver within the MATLAB/Simulink framework and linear potential flow theory to simulate the hydrodynamic interactions and multibody dynamics in 6 degrees of freedom. Multiple tuning variables are considered to produce a model for the system that matches well with empirical data (about 8% error). In conclusion, the WEC-Sim model will serve as a platform for integrating the pitch resonator wave energy converter concept and deployment preparation (detailed design including power take-off and control systems, response evaluation, etc.).

hydrodynamic modeling↗
DOE OSTI2019

Real and complex valued geometrical optics inverse ray-tracing for inline field calculations

In this work, a 3-D ray based model for computing laser fields in dissipative and amplifying media is presented. The eikonal equation is solved using inverse ray-tracing on a dedicated nonstructured 3-D mesh. Inverse ray-tracing opens the possibility of using Complex Geometrical Optics (CGO), for which we propose a propagation formalism in a finite element mesh. Divergent fields at caustics are corrected using an etalon integral method for fold-type caustics. This method is successfully applied in dissipative media by modifying the ray-ordering and root selection rules, thereby allowing one to reconstruct the field in the entire caustic region. In addition, we demonstrate how caustics in the CGO framework can disappear entirely for sufficiently dissipative media, making the complex ray approach valid in the entire medium. CGO is shown to offer a more precise modeling of laser refraction and absorption in a dissipative medium when compared to Geometrical Optics (GO). In the framework of Inertial Confinement Fusion (ICF), this occurs mostly at intermediate temperatures or at high temperatures close to the critical density. Additionally, GO is invalid at low temperatures if an approximated expression of the permittivity is used. The inverse ray-tracing algorithm for GO and CGO is implemented in the IFRIIT code, in the framework of a dielectric permittivity described in 3-D using a piecewise linear approximation in tetrahedrons. Fields computed using GO and CGO are compared to results from the electromagnetic wave solver LPSE. Excellent agreement is obtained in 1-D linear and nonlinear permittivity profiles. Good agreement is also obtained for ICF-like Gaussian density profiles in 2-D. Finally, we demonstrate how the model reproduces Gaussian beam diffraction using CGO. The IFRIIT code will be interfaced inline to 3-D radiative hydrodynamic codes to describe the nonlinear laser plasma interaction in ICF and high-energy-density plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Nonlinear Elimination Applied to Radiation Diffusion

We apply a nonlinearly preconditioned, quasi-Newton framework to accelerate the numerical solution of the thermal radiative transfer (TRT) equations. This framework was inspired by the unpublished method that has existed for years in Teton, Lawrence Livermore National Laboratory’s deterministic TRT code. In this paper, we cast this iteration scheme within a formal nonlinear preconditioning framework and compare its performance against other iteration schemes in the framework. With proper choices of iteration controls for the various levels of the solver, we can recover the standard linearized one-step method, a full nonlinear Newton scheme, as well as the method in Teton. In brief, the nonlinear preconditioning TRT scheme formally eliminates the material temperature equation from the nonlinear system in a nonlinear analog of a Schur complement. This nonlinear elimination step involves solving a decoupled nonlinear equation for each spatial degree of freedom and is therefore inexpensive. By applying a quasi-Newton iteration scheme on the new system, we obtain a three-level iteration scheme that is at least as efficient as commonly used TRT schemes. The new method allows full convergence to the nonlinear backward Euler time-discretized system, increasing accuracy and robustness, while using a similar number of linear iterations as the more common linearized one-step methods Eq. (4).

77 NANOSCIENCE AND NANOTECHNOLOGY↗
DOE OSTI2019

symPACK v2.0

SymPACK is a parallel direct solver for sparse symmetric systems of linear equations. SymPACK is implemented for large- scale distributed-memory platforms. It employs several innovative ideas, including the use of an asynchronous task paradigm, one-sided communication, and dynamic scheduling.

Ng, EsmondG↗
DOE OSTI2022

On the Response of a Herschel–Bulkley Fluid Due to a Moving Plate

In this paper, we study the boundary-layer flow of a Herschel–Bulkley fluid due to a moving plate; this problem has been experimentally investigated by others, where the fluid was assumed to be Carbopol, which has similar properties to cement. The computational fluid dynamics finite volume method from the open-source toolbox/library OpenFOAM is used on structured quad grids to solve the mass and the linear momentum conservation equations using the solver “overInterDyMFoam” customized with non-Newtonian viscosity libraries. The governing equations are solved numerically by using regularization methods in the context of the overset meshing technique. The results indicate that there is a good comparison between the experimental data and the simulations. The boundary layer thicknesses are predicted within the uncertainties of the measurements. The simulations indicate strong sensitivities to the rheological properties of the fluid.

36 MATERIALS SCIENCE↗
NASA NTRS1989

Cooperative control of two active spacecraft during proximity operations

A cooperative autopilot is developed for the control of the relative attitude, relative position and absolute attitude of two maneuvering spacecraft during on orbit proximity operations. The autopilot consists of an open-loop trajectory solver which computes a nine dimensional linearized nominal state trajectory at the beginning of each maneuver and a phase space regulator which maintains the two spacecraft on the nominal trajectory during coast phases of the maneuver. A linear programming algorithm is used to perform jet selection. Simulation tests using a system of two space shuttle vehicles are performed to verify the performance of the cooperative controller and comparisons are made to a traditional passive target/active pursuit vehicle approach to proximity operations. The cooperative autopilot is shown to be able to control the two vehicle system when both the would be pursuit vehicle and the target vehicle are not completely controllable in six degrees of freedom. The cooperative controller is also shown to use as much as 37 percent less fuel and 57 percent fewer jet firings than a single pursuit vehicle during a simple docking approach maneuver.

Polutchko, Robert J.↗
DOE OSTI2023

Symmetric Random Butterfly Transform (SRBT) Based Preconditioner

Summary of work using Symmetric Random Butterfly Transformation (SRBT) in conjunction with Incomplete LDL T factorization as a preconditioner for FGMRES solver as a way of solving linear systems arising from interior point methods applied to power system problems. These linear systems have proven difficult to parallelize and this represents a possible route forward.

interior point optimization↗
DOE OSTI2019

A communication-avoiding 3D sparse triangular solver

We present a novel distributed memory algorithm to improve the strong scalability of the solution of a sparse triangular system. This operation appears in the solve phase of direct methods for solving general sparse linear systems, Ax = b. Our 3D sparse triangular solver employs several techniques, including a 3D MPI process grid, elimination tree parallelism, and data replication, all of which reduce the per-process communication when combined. We present analytical models to understand the communication cost of our algorithm and show that our 3D sparse triangular solver can reduce the per-process communication volume asymptotically by a factor of O(n1/4) and O(n1/6) for problems arising from the finite element discretizations of 2D "planar" and 3D "non-planar" PDEs, respectively. We implement our algorithm for use in SuperLU_DIST3D, using a hybrid MPI+OpenMP programming model. Our 3D triangular solve algorithm, when run on 12k cores of Cray XC30, outperforms the current state-of-the-art 2D algorithm by 7.2x for planar and 2.7x for the non-planar sparse matrices, respectively.

Sao, Piyush↗
NASA NTRSDate not supplied

Gradient-Based Optimization of the Common Research Model Wing Subject to CFD-Based Gust and Flutter Constraints

The linearized frequency-domain method was recently implemented in the stabilized finite element solver in NASA’s FUN3D code. Previous work by the authors used this method for enforcing flutter constraints during gradient-based optimizations. More recently, the solver was expanded to account for continuous (also known as stochastic) gust responses. This paper expands on recent Common Research Model wing optimization work, which demonstrated gradient-based optimization with flutter and stochastic gust constraints, among others. While that work utilized FUN3D for static aeroelastic solutions but relied on doublet lattice aerodynamics for gust and flutter responses, the present work replaces these unsteady aerodynamic analyses with those of FUN3D’s linearized frequency-domain solver. With analytic derivatives available, gradient-based optimization is performed through the use of the OpenMDAO/MPhys libraries with over 700 shape, structural, and aerodynamic design variables and over 10 nonlinear constraints. Comparisons of analysis results and optimized designs are made between doublet lattice and linearized frequency-domain solutions.

aeroelasticity↗