Search NASA⌕ Search

SEARCH · Search NASA

Results for “solvers”

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 325 records · Page 18

Edge-Based Viscous Method for Mixed-Element Node-Centered Finite-Volume Solvers

A novel, efficient, edge-based viscous (EBV) discretization method has been recently developed, implemented in a practical, unstructured-grid, node-centered, finite-volume flow solver, and applied to viscous-kernel computations that include evaluations of meanflow viscous fluxes, turbulence-model and chemistry-model diffusion terms, and the corresponding Jacobian contributions. Initially, the EBV method had been implemented for tetrahedral grids and demonstrated multifold acceleration of all viscous-kernel computations. This paper presents an extension of the EBV method for mixed-element grids. In addition to the primal edges of a given mixed-element grid, virtual edges are introduced to connect cell nodes that are not connected by a primal edge. The EBV method uses an efficient loop over all (primal and virtual) edges and features a compact discretization stencil based on the nearest neighbors. This study verifies the EBV method and assesses its efficiency on mixed-element grids by comparing the EBV solution accuracy and iterative convergence with those of well-established solutions obtained using a cell-based viscous (CBV) discretization method. The EBV solver’s memory footprint is optimized and often smaller than the memory footprint of the CBV solver. A multifold speedup is demonstrated for all viscous-kernel computations resulting in significant reduction of the time to solutions for several benchmark mixed-element-grid computations, including simulations of a flow around NASA’s juncture-flow model and a hypersonic, chemically reacting flow around a blunt body.

CFD↗

Edge-Based Viscous Method for Mixed-Element Node-Centered Finite-Volume Solvers

A novel, efficient, edge-based viscous (EBV) discretization method has been recently developed, implemented in a practical, unstructured-grid, node-centered, finite-volume flow solver, and applied to viscous-kernel computations that include evaluations of meanflow viscous fluxes, turbulence-model and chemistry-model diffusion terms, and the corresponding Jacobian contributions. Initially, the EBV method had been implemented for tetrahedral grids and demonstrated multifold acceleration of all viscous-kernel computations. This paper presents an extension of the EBV method for mixed-element grids. In addition to the primal edges of a given mixed-element grid, virtual edges are introduced to connect cell nodes that are not connected by a primal edge. The EBV method uses an efficient loop over all (primal and virtual) edges and features a compact discretization stencil based on the nearest neighbors. This study verifies the EBV method and assesses its efficiency on mixed-element grids by comparing the EBV solution accuracy and iterative convergence with those of well-established solutions obtained using a cell-based viscous (CBV) discretization method. The EBV solver’s memory footprint is optimized and often smaller than the memory footprint of the CBV solver. A multifold speedup is demonstrated for all viscous-kernel computations resulting in significant reduction of the time to solutions for several benchmark mixed-element-grid computations, including simulations of a flow around NASA’s juncture-flow model and a hypersonic, chemically reacting flow around a blunt body.

Edge-based viscous method↗

Computational Analysis of a Boundary-Layer Ingesting Tailcone Thruster Configuration Within the National Transonic Facility Using the LAVA Solver

Boundary-layer ingesting (BLI) propulsion systems are one of the many technologies currently under investigation within the aerospace community to meet NASA’s Advanced Air Transport Technology project goal of a sustainable future in aviation. To that end, an experimental campaign was conducted in the National Transonic Facility (NTF) to study the propulsion-airframe integration effects of the Boundary-Layer Ingesting Tailcone System installed in the aft portion of a 2.7% scale design of the NASA Common Research Model (CRM). This test was accompanied by a numerical simulation effort using the Launch, Ascent, and Vehicle Aerodynamics (LAVA) solver, to validate the applicability of current best-practice Reynolds-averaged Navier Stokes (RANS) models in accurately predicting the relevant flow-physics in free-air. A total of 205 steady RANS simulations were performed using LAVA, covering the range of conditions present in the NTF test matrix. Flow conditions ranged from 5- to 15-million Reynolds number, Mach numbers of 0.75, 0.80 and 0.85, and angles-of-attack between –3° and 4°. Four different mass-flow plugs were also tested to assess propulsor operating condition effects. Sensitivity to these flow conditions are analyzed in detail, especially in terms of the nacelle flow distortion which was the main subject of the study. Aerodynamic load coefficients, aftbody boundary-layer measurements and fuselage pressure tap results are also discussed, providing a wide range of validation results from this experimental campaign. This validation effort shows that current best-practices using RANS models within the LAVA solver flow solver are well suited for predicting the inlet flow distortion characteristics of novel aircraft configurations employing BLI at the aft end of the fuselage.

AATT↗

Implicit Preconditioning for Explicit Multigrid Solvers on Cut-Cell Cartesian Meshes

This work assesses the effectiveness of linearized implicit Euler preconditioning for multigrid solvers using an unpreconditioned, Jacobian-free Newton Krylov method to converge the linear system of equations. Multigrid convergence rates improve to approximately 0.75 across the cases tested including a Mach 2 supersonic wedge, transonic NACA 0012 airfoil, and ONERA M6 wing. While larger Krylov subspaces increase the convergence rate, they also increase the computational cost, such that 4-8 Krylov vectors often offers the fastest turnaround. Further reductions in computational cost are achieved with a sequential hybrid preconditioner that begins with the explicit multigrid solver before transitioning to the preconditioned algorithm later on. In addition, a novel implementation of dual time stepping is extended to include both common BDF methods as well as high-order implicit Runge-Kutta schemes. This particular formulation, which uses A −1 preconditioning, is amenable to matrix-free solvers, and the L-stable methods are especially suited for meshes with arbitrarily small cut-cells. Asymptotic order of convergence is demonstrated for BDF1, BDF2, SDIRK2, and 3rd-order Radau IIA time integration with unsteady 2D vortex simulations.

ARMD↗

Computational Analysis of a Boundary Layer Ingesting Tailcone Thruster Configuration Using the LAVA Curvilinear Solver

Boundary layer ingesting (BLI) propulsion systems are one of the many technologies currently under investigation within the aerospace community to meet NASA's Advanced Air Transport Technology project goal of a sustainable future in aviation. To that end, an experimental campaign was conducted in the National Transonic Facility (NTF) wind tunnel to study the propulsion-airframe integration effects of the Boundary Layer Ingesting Tailcone System installed in the aft portion of a 2.7% scale design of the NASA Common Research Model (CRM). This test was accompanied by a numerical simulation effort using the Launch, Ascent, and Vehicle Aerodynamics (LAVA) curvilinear solver to validate the applicability of current best-practice Reynolds-Averaged Navier-Stokes (RANS) models in accurately predicting the relevant flow physics in free-air. A total of 205 steady RANS simulations were performed using LAVA, covering the range of conditions present in the NTF test matrix. Flow conditions ranged from 5- to 15-million Reynolds number, Mach numbers of 0.75, 0.80 and 0.85, and angles of attack between -3 and 4 degrees. Four different mass-flow plugs were also tested to assess propulsor operating condition effects. Sensitivity to these flow conditions is analyzed in detail, especially in terms of the nacelle flow distortion which was the main subject of the study. Aerodynamic load coefficients, aft body boundary layer measurements and fuselage pressure tap results are also discussed, providing a wide range of validation results from this experimental campaign. This validation effort shows that current best-practices using RANS models within the LAVA curvilinear solver flow solver are well suited for predicting the inlet flow distortion characteristics of novel aircraft configurations employing BLI at the aft end of the fuselage. This talk will cover the combined experimental and numerical efforts that resulted from this BLI-focused investigation.

ARMD↗

Coordinate-Space Hartree-Fock-Bogoliubov Solvers for Superfluid Fermi Systems in Large Boxes

The self-consistent Hartree-Fock-Bogoliubov problem in large boxes can be solved accurately in the coordinate space with the recently developed solvers HFB-AX (2D) and MADNESS-HFB (3D). This is essential for the description of superfluid Fermi systems with complicated topologies and significant spatial extend, such as fissioning nuclei, weakly-bound nuclei, nuclear matter in the neutron star rust, and ultracold Fermi atoms in elongated traps. The HFB-AX solver based on B-spline techniques uses a hybrid MPI and OpenMP programming model for parallel computation for distributed parallel computation, within a node multi-threaded LAPACK and BLAS libraries are used to further enable parallel calculations of large eigensystems. The MADNESS-HFB solver uses a novel multi-resolution analysis based adaptive pseudo-spectral techniques to enable fully parallel 3D calculations of very large systems. In this work we present benchmark results for HFB-AX and MADNESS-HFB on ultracold trapped fermions.

Pei, J. C.↗

Amesos2 Templated Direct Sparse Solver Package

Amesos2 is a templated direct sparse solver package. Amesos2 provides interfaces to direct sparse solvers, rather than providing native solver capabilities. Amesos2 is a derivative work of the Trilinos package Amesos.

Source record↗

Scalable PETSc Implementation of the Three-Phase Unbalanced AC Power Flow Solver

A revolutionary transition of energy infrastructure, spanning across supply and demand sectors, is happening all around the world. Integration of renewable energy sources into our ever-complex power distribution networks is central to the infrastructure planning of the future. One step towards achieving this goal is to solve unbalanced transmission and distribution systems. Traditional approaches and software tools are not suitable because they assume a completely balanced 3-phase system, hence a single-phase equivalent can be solved. Renewable energy such as wind and solar power are intermittent and can pose a challenge when integrating into an already unbalanced power grid. Furthermore, these power grids can be quite large at scale consisting of potentially thousands of buses, which can be computationally demanding. This poster presents preliminary work on designing a robust and scalable 3-phase unbalanced AC power flow solver. The proposed power flow solver will eventually be built on top of the PETSc library and utilizes state-of-the-art parallel data structures like the DMNetwork as well as iterative solvers and preconditioners.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Performance Improvement of the Linear System Solver for CMFD Acceleration in PROTEUS-MOC

The PROTEUS code developed under the DOE NEAMS program is a high-fidelity capable whole core transports solver based on unstructured finite element meshes [1]. PROTEUS includes three distinct transport solvers: SN, MOC and NODAL. Among them, the PROTEUS-MOC is the 3D method of characteristics (MOC) solver for extruded geometries. In order to accelerate the convergence of 3D MOC calculation, the CMFD acceleration method was implemented in PROTEUS-MOC [2]. For solving the CMFD linear system, the unpreconditioned GMRES algorithm was used in the previous work [3, 4] for implementing the CMFD scheme because of low computation cost of coarse mesh calculations. In the performance tests, we found that the overhead of the CMFD acceleration became non-negligible as the condition number of the CMFD linear system and the size of problem increase. This indicated that the CMFD overhead should be reduced in the preconditioning technique in order to improve the computational performance. In this work, the performance of CMFD acceleration was notably improved by developing and implementing the new formulation of CMFD linear system and preconditioning technique.

Jung, Yeon Sang↗

Integrated solver for fluid driven fracture and fragmentation

An integrated solver may be used for both a fluid phase and a solid phase. The integrated solver may use constitutive equations for the fluid phase and the solid phase, and calculate the stress in the fluid and solid using the same integration point. The integrated solver may also calculate other state variables using the same integration point.

97 MATHEMATICS AND COMPUTING↗

Use of Generalized Davidson Eigenvalue Solver for Coarse Mesh Finite Difference Acceleration

This paper summarizes improvements in the coarse mesh finite difference (CMFD) performance by focusing on the eigenvalue solution methodology. The current solution technique uses a shifted power iteration with the PETSc solver package. A generalized Davidson methodology has been implemented into MPACT using the Trilinos solver package. The new generalized Davidson solver shows significant improvements in the overall runtime for the CMFD acceleration scheme and the overall MPACT performance. The performance improves between 5 and 27 times for the CMFD runtime. This results in a speedup of between 2.5 to 5 times on the overall solution time for MPACT.

Collins, Benjamin↗

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

An Orthogonal Recursive Bisection (ORB) Based Time Advancement Algorithm for CFD-DEM Solvers

The time integration of the granular phase in coupled computational fluid dynamics (CFD) – discrete element method (DEM) simulations presents a unique computational challenge brought about by the large variations in particle collisional time scales. Particles in the dilute regions of the computational domain can be advanced with large time steps while dense regions require much smaller time increments. However, the time step size in most solvers is globally set as the limit for accuracy and stability imposed by the collisions and is typically orders of magnitude less than that required away from collisions. This work addresses this precise issue and provides a strategy to avoid the use of a global conservative small time step size for the entire set of particles.A novel time stepping algorithm for CFD-DEM solvers using a partitioning approach using orthogonal recursive bisection (ORB) that allows for variable time steps among particles is described and its computational performance is compared against baseline explicit methods, typically used in several CFD-DEM solvers. ORB has advantages of being relatively quick and easy to update incrementally and has the required heuristic behavior (i.e., it will split the region in half with a cluster on each side) when groups of particles are well separated (clustered). The algorithm presented in this work uses a local time stepping approach to resolve collisional time scales for subsets of particles that are present at the leaves of the ORB, thereby resulting in substantial reduction of computational cost. The parallel implementation of this method where a ``knapsack” algorithm is used in tandem with ORB for effective load-balancing is also presented, where a best possible partitioning is obtained based on number of particles and local time-stepping costs. The algorithm is tested against benchmark problems with varying particle distributions that include fluidized bed and riser flow scenarios. Preliminary results indicate that the approach is 2-3X faster than traditional explicit methods for problems that involve both dense and dilute regions, while maintaining the same level of accuracy.

adaptive timestepping↗

Mesoflow: An Open-Source Reacting Flow Solver for Catalysis at Mesoscale

We present the capabilities and software performance metrics of our open-source continuum solver for catalysis, Mesoflow, developed specifically for modeling transport and chemistry at the mesoscale. Our solver utilizes Cartesian block-structured adaptive mesh refinement to resolve complex catalyst surface morphologies directly obtained from X-ray tomography data. An immersed boundary based formulation enables rapid representation of complex geometries prevalent in most mesoporous catalyst interfaces. The solver is developed on top of open-source performance portable library, AMReX, providing parallel execution capabilities on current and upcoming high-performance-computing (HPC) architectures. Our flexible software framework enables integration of complex chemical mechanisms at heterogenous interfaces and time-split algorithms for circumventing highly disparate reaction and flow time-scales. Our current studies indicate a ten-fold performance gain by using graphics-processing-units (GPUs) compared to a single processor for representative problem sizes (2 million cell mesh). We will also present a brief introduction on how to build and use this software for application problems pertaining to catalytic upgrading and gas transport within porous catalyst particles.

adaptive meshing↗

Assessment of the 2D MOC solver in MPACT: Michigan parallel characteristics transport code

MPACT (Michigan Parallel Characteristics Transport Code) is a new reactor analysis tool being developed by researchers at the University of Michigan as an advanced pin-resolved transport capability within VERA (Virtual Environment for Reactor Analysis). VERA is the end-user reactor simulation tool being developed by the Consortium for the Advanced Simulation of Light Water Reactors (CASL). The MPACT development project is itself unique for the way it is changing how students perform research to achieve the instructional and research goals of an academic institution, while providing immediate value to the industry. One of the major computational pieces in MPACT is the 2D MOC solver. It is critical that the 2D MOC solver provide an efficient, accurate, and robust solution over a broad range of reactor operating conditions. The C5G7 benchmark is first used to test the accuracy of the method with a fixed set of cross-sections. The VERA Core Physics Progression Problems are then used to compare the accuracy of both the 2D transport solver and also the cross-section treatments. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Implementation of hybrid finite element method based transport solver in GRIFFIN

A new transport solver option based on the hybrid FEM (HFEM) was implemented in GRIFFIN, the MOOSE-based reactor analysis code, as an effort to support routine core design calculations for advanced reactor applications. The HFEM formulation with P{sub N} (spherical harmonics expansion), akin to the variational nodal method, is effective for solving a spatially homogenized problem with strong transport effect. The residual and Jacobian evaluations of the HFEM weak form were derived and successfully implemented in GRIFFIN, having the diffusion and the PN options available in the new HFEM based transport solver. The performance was tested with the simplified ABTR benchmark problems. The results indicate that the HFEM-based transport solver is a feasible option for solving problems with spatially homogenized and strong streaming by providing superior accuracy with a proper p-refinement. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗