Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical 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 901 records · Page 50

The a(3) Scheme--A Fourth-Order Space-Time Flux-Conserving and Neutrally Stable CESE Solver

The CESE development is driven by a belief that a solver should (i) enforce conservation laws in both space and time, and (ii) be built from a non-dissipative (i.e., neutrally stable) core scheme so that the numerical dissipation can be controlled effectively. To initiate a systematic CESE development of high order schemes, in this paper we provide a thorough discussion on the structure, consistency, stability, phase error, and accuracy of a new 4th-order space-time flux-conserving and neutrally stable CESE solver of an 1D scalar advection equation. The space-time stencil of this two-level explicit scheme is formed by one point at the upper time level and three points at the lower time level. Because it is associated with three independent mesh variables (the numerical analogues of the dependent variable and its 1st-order and 2ndorder spatial derivatives, respectively) and three equations per mesh point, the new scheme is referred to as the a(3) scheme. Through the von Neumann analysis, it is shown that the a(3) scheme is stable if and only if the Courant number is less than 0.5. Moreover, it is established numerically that the a(3) scheme is 4th-order accurate.

Chang, Sin-Chung↗

Aeroacoustic Simulations of a Nose Landing Gear with FUN3D: A Grid Refinement Study

A systematic grid refinement study is presented for numerical simulations of a partially-dressed, cavity-closed (PDCC) nose landing gear configuration that was tested in the University of Florida's open-jet acoustic facility known as the UFAFF. The unstructured-grid flow solver FUN3D is used to compute the unsteady flow field for this configuration. Mixed-element grids generated using the Pointwise (Registered Trademark) grid generation software are used for numerical simulations. Particular care is taken to ensure quality cells and proper resolution in critical areas of interest in an effort to minimize errors introduced by numerical artifacts. A set of grids was generated in this manner to create a family of uniformly refined grids. The finest grid was then modified to coarsen the wall-normal spacing to create a grid suitable for the wall-function implementation in FUN3D code. A hybrid Reynolds-averaged Navier-Stokes/large eddy simulation (RANS/LES) turbulence modeling approach is used for these simulations. Time-averaged and instantaneous solutions obtained on these grids are compared with the measured data. These CFD solutions are used as input to a FfowcsWilliams-Hawkings (FW-H) noise propagation code to compute the farfield noise levels. The agreement of the computed results with the experimental data improves as the grid is refined.

Vatsa, Veer N.↗

Numerical study of multi-component flow and mixing in a scaled fission product venting system

Numerical simulation of isothermal multi-component gas flow was conducted to study fluid flow and mixing in a scaled low-pressure, low-temperature test facility for the fission product venting system (FPVS) of a gas cooled fast reactor (GFR). The geometry of FPVS test facility was an open loop including gradual expansion coupling and two 90°pipe elbows. First, the validation of large eddy simulation (LES) wall-adapting local eddy-viscosity (WALE) turbulent model was performed for transitional flow in a circular pipe with gradual expansion. The reactingFOAM solver in OpenFOAM v8 was employed. By introducing appropriate turbulence disturbance at the flow inlet, such as turbulence intensity, the numerical results showed good agreement in (1) the velocity profile downstream of the pipe expansion measured by particle image velocimetry (PIV) in this study, and (2) the reattachment length reported in the literature. Using this validated model, the numerical simulation of flow and component mixing was performed for the FPVS with an inlet flowrate corresponding to a Reynolds number of 2,400 to investigate the flow behavior and component mixing. Standard deviation of the mass fraction of component, referred to as absolute mixing index (AMI), was calculated to quantify the mixing of components, showing that the component mixing length determined by AMI is related to the reattachment length downstream of the expansion. Additionally, this study was able to identify the best location in the FPVS test facility to measure the velocity and concentration profies where multicomponent flow is well mixed.

15 GEOTHERMAL ENERGY↗

Long-Term Creep Behavior of the Intervertebral Disk: Comparison between Bioreactor Data and Numerical Results

The loaded disk culture system is an intervertebral disk (IVD)-oriented bioreactor developed by the VU Medical Center (VUmc, Amsterdam, The Netherlands), which has the capacity of maintaining up to 12 IVDs in culture, for approximately 3 weeks after extraction. Using this system, eight goat IVDs were provided with the essential nutrients and submitted to compression tests without losing their biomechanical and physiological properties, for 22 days. Based on previous reports (Paul et al., 2012, 2013; Detiger et al., 2013), four of these IVDs were kept in physiological condition (control) and the other four were previously injected with chondroitinase ABC (CABC), in order to promote degenerative disk disease (DDD). The loading profile intercalated 16 h of activity loading with 8 h of loading recovery to express the standard circadian variations. The displacement behavior of these eight IVDs along the first 2 days of the experiment was numerically reproduced, using an IVD osmo-poro-hyper-viscoelastic and fiber-reinforced finite element (FE) model. The simulations were run on a custom FE solver (Castro et al., 2014). The analysis of the experimental results allowed concluding that the effect of the CABC injection was only significant in two of the four IVDs. The four control IVDs showed no signs of degeneration, as expected. In what concerns to the numerical simulations, the IVD FE model was able to reproduce the generic behavior of the two groups of goat IVDs (control and injected). However, some discrepancies were still noticed on the comparison between the injected IVDs and the numerical simulations, namely on the recovery periods. This may be justified by the complexity of the pathways for DDD, associated with the multiplicity of physiological responses to each direct or indirect stimulus. Nevertheless, one could conclude that ligaments, muscles, and IVD covering membranes could be added to the FE model, in order to improve its accuracy and properly describe the recovery periods.

60 APPLIED LIFE SCIENCES↗

Algorithms and Application of Sparse Matrix Assembly and Equation Solvers for Aeroacoustics

An algorithm for symmetric sparse equation solutions on an unstructured grid is described. Efficient, sequential sparse algorithms for degree-of-freedom reordering, supernodes, symbolic/numerical factorization, and forward backward solution phases are reviewed. Three sparse algorithms for the generation and assembly of symmetric systems of matrix equations are presented. The accuracy and numerical performance of the sequential version of the sparse algorithms are evaluated over the frequency range of interest in a three-dimensional aeroacoustics application. Results show that the solver solutions are accurate using a discretization of 12 points per wavelength. Results also show that the first assembly algorithm is impractical for high-frequency noise calculations. The second and third assembly algorithms have nearly equal performance at low values of source frequencies, but at higher values of source frequencies the third algorithm saves CPU time and RAM. The CPU time and the RAM required by the second and third assembly algorithms are two orders of magnitude smaller than that required by the sparse equation solver. A sequential version of these sparse algorithms can, therefore, be conveniently incorporated into a substructuring for domain decomposition formulation to achieve parallel computation, where different substructures are handles by different parallel processors.

Watson, W. R.↗

Multithreaded Model for Dynamic Load Balancing Parallel Adaptive PDE Computations

We present a multithreaded model for the dynamic load-balancing of numerical, adaptive computations required for the solution of Partial Differential Equations (PDE's) on multiprocessors. Multithreading is used as a means of exploring concurrency in the processor level in order to tolerate synchronization costs inherent to traditional (non-threaded) parallel adaptive PDE solvers. Our preliminary analysis for parallel, adaptive PDE solvers indicates that multithreading can be used an a mechanism to mask overheads required for the dynamic balancing of processor workloads with computations required for the actual numerical solution of the PDE's. Also, multithreading can simplify the implementation of dynamic load-balancing algorithms, a task that is very difficult for traditional data parallel adaptive PDE computations. Unfortunately, multithreading does not always simplify program complexity, often makes code re-usability not an easy task, and increases software complexity.

Chrisochoides, Nikos↗

A New Semistructured Algebraic Multigrid Method

Multigrid methods are well suited to large massively parallel computer architectures because they are mathematically optimal and display good parallelization properties. Since current architecture trends are favoring regular compute patterns to achieve high performance, the ability to express structure has become much more important. The hypre software library provides high-performance multigrid preconditioners and solvers through conceptual interfaces, including a semistructured interface that describes matrices primarily in terms of stencils and logically structured grids. This paper presents a new semistructured algebraic multigrid (SSAMG) method built on this interface. The numerical convergence and performance of a CPU implementation of this method are evaluated for a set of semistructured problems. In conclusion, SSAMG achieves significantly better setup times than hypre’s unstructured AMG solvers and comparable convergence. In addition, the new method is capable of solving more complex problems than hypre’s structured solvers.

97 MATHEMATICS AND COMPUTING↗

WARP3D-Release 10.8: Dynamic Nonlinear Analysis of Solids using a Preconditioned Conjugate Gradient Software Architecture

This report describes theoretical background material and commands necessary to use the WARP3D finite element code. WARP3D is under continuing development as a research code for the solution of very large-scale, 3-D solid models subjected to static and dynamic loads. Specific features in the code oriented toward the investigation of ductile fracture in metals include a robust finite strain formulation, a general J-integral computation facility (with inertia, face loading), an element extinction facility to model crack growth, nonlinear material models including viscoplastic effects, and the Gurson-Tver-gaard dilatant plasticity model for void growth. The nonlinear, dynamic equilibrium equations are solved using an incremental-iterative, implicit formulation with full Newton iterations to eliminate residual nodal forces. The history integration of the nonlinear equations of motion is accomplished with Newmarks Beta method. A central feature of WARP3D involves the use of a linear-preconditioned conjugate gradient (LPCG) solver implemented in an element-by-element format to replace a conventional direct linear equation solver. This software architecture dramatically reduces both the memory requirements and CPU time for very large, nonlinear solid models since formation of the assembled (dynamic) stiffness matrix is avoided. Analyses thus exhibit the numerical stability for large time (load) steps provided by the implicit formulation coupled with the low memory requirements characteristic of an explicit code. In addition to the much lower memory requirements of the LPCG solver, the CPU time required for solution of the linear equations during each Newton iteration is generally one-half or less of the CPU time required for a traditional direct solver. All other computational aspects of the code (element stiffnesses, element strains, stress updating, element internal forces) are implemented in the element-by- element, blocked architecture. This greatly improves vectorization of the code on uni-processor hardware and enables straightforward parallel-vector processing of element blocks on multi-processor hardware.

Koppenhoefer, Kyle C.↗

Implicit flux-split Euler schemes for unsteady aerodynamic analysis involving unstructured dynamic meshes

Improved algorithms for the solution of the time-dependent Euler equations are presented for unsteady aerodynamic analysis involving unstructured dynamic meshes. The improvements have been developed recently to the spatial and temporal discretizations used by unstructured grid flow solvers. The spatial discretization involves a flux-split approach which is naturally dissipative and captures shock waves sharply with at most one grid point within the shock structure. The temporal discretization involves an implicit time-integration shceme using a Gauss-Seidel relaxation procedure which is computationally efficient for either steady or unsteady flow problems. For example, very large time steps may be used for rapid convergence to steady state, and the step size for unsteady cases may be selected for temporal accuracy rather than for numerical stability. Steady and unsteady flow results are presented for the NACA 0012 airfoil to demonstrate applications of the new Euler solvers. The unsteady results were obtained for the airfoil pitching harmonically about the quarter chord. The resulting instantaneous pressure distributions and lift and moment coefficients during a cycle of motion compare well with experimental data. The paper presents a description of the Euler solvers along with results and comparisons which assess the capability.

Batina, John T.↗

Implicit flux-split Euler schemes for unsteady aerodynamic analysis involving unstructured dynamic meshes

Improved algorithm for the solution of the time-dependent Euler equations are presented for unsteady aerodynamic analysis involving unstructured dynamic meshes. The improvements were developed recently to the spatial and temporal discretizations used by unstructured grid flow solvers. The spatial discretization involves a flux-split approach which is naturally dissipative and captures shock waves sharply with at most one grid point within the shock structure. The temporal discretization involves an implicit time-integration scheme using a Gauss-Seidel relaxation procedure which is computationally efficient for either steady or unsteady flow problems. For example, very large time steps may be used for rapid convergence to steady state, and the step size for unsteady cases may be selected for temporal accuracy rather than for numerical stability. Steady and unsteady flow results are presented for the NACA 0012 airfoil to demonstrate applications of the new Euler solvers. The unsteady results were obtained for the airfoil pitching harmonically about the quarter chord. The resulting instantaneous pressure distributions and lift and moment coefficients during a cycle of motion compare well with experimental data. A description of the Euler solvers is presented along with results and comparisons which assess the capability.

Batina, John T.↗

Numerical investigation of an internal layer in turbulent flow over a curved hill

A numerical investigation of incompressible and compressible turbulent flows over strongly curved surfaces is presented. The turbulent flow equations are solved by a pressure based Navier-Stokes equations solver. In the method, the conservation of mass equation is replaced by a pressure correction equation applicable for both compressible and incompressible flows. The turbulence is described by a multiple time scale turbulence model supplemented with a near-wall turbulence model. The numerical results show that the internal layer is a strong turbulence field which is developed beneath the external boundary layer and is located very close to the wall. The development of the internal layer is attributed to the enormous mean flow strain rate caused by the streamline curvature. The external boundary layer flow responds rather slowly to the streamline curvature. Thus, the turbulence field of the forward corner of the curved hill is characterized by two turbulence fields interacting with each other. The turbulence intensity of the internal layer is much stronger than that of the external boundary layer, so that the development of a new boundary layer in the downstream region of the curved hill depends mostly on the internal layer. These numerical results are in good agreement with the measured data, and show that the turbulence model can resolve the turbulence field subjected to the strong streamline curvature.

Kim, S.-W.↗

Particle-in-cell Simulations of Relativistic Magnetic Reconnection with Advanced Maxwell Solver Algorithms

Abstract Relativistic magnetic reconnection is a nonideal plasma process that is a source of nonthermal particle acceleration in many high-energy astrophysical systems. Particle-in-cell (PIC) methods are commonly used for simulating reconnection from first principles. While much progress has been made in understanding the physics of reconnection, especially in 2D, the adoption of advanced algorithms and numerical techniques for efficiently modeling such systems has been limited. With the GPU-accelerated PIC code WarpX, we explore the accuracy and potential performance benefits of two advanced Maxwell solver algorithms: a nonstandard finite-difference scheme (CKC) and an ultrahigh-order pseudo-spectral method (PSATD). We find that, for the relativistic reconnection problem, CKC and PSATD qualitatively and quantitatively match the standard Yee-grid finite-difference method. CKC and PSATD both admit a time step that is 40% longer than that of Yee, resulting in a ∼40% faster time to solution for CKC, but no performance benefit for PSATD when using a current deposition scheme that satisfies Gauss’s law. Relaxing this constraint maintains accuracy and yields a 30% speedup. Unlike Yee and CKC, PSATD is numerically stable at any time step, allowing for a larger time step than with the finite-difference methods. We found that increasing the time step 2.4–3 times over the standard Yee step still yields accurate results, but it only translates to modest performance improvements over CKC, due to the current deposition scheme used with PSATD. Further optimization of this scheme will likely improve the effective performance of PSATD.

79 ASTRONOMY AND ASTROPHYSICS↗

Visualizing biomolecular electrostatics in virtual reality with UnityMol-APBS

The APBS software was developed to solve the equations of continuum electrostatics for large biomolecular assemblages. APBS has enjoyed widespread adoption throughout the biomedical community and is used in numerous applications involving biomolecular structures. However, visualization of complex biomolecular electrostatic properties can be challenging for two-dimensional graphics systems. Therefore, advanced visualization and manipulation capabilities have been incorporated. In particular, APBS tools have been integrated with the UnityMolX virtual reality platform to provide an immersive experience for preparing biomolecular systems for calculations as well as visualizing and comparing calculated results.

electrostatics, molecular visualization, solvation↗

Stochastic average model methods

We consider the solution of finite-sum minimization problems, such as those appearing in nonlinear least-squares or general empirical risk minimization problems. We are motivated by problems in which the summand functions are computationally expensive and evaluating all summands on every iteration of an optimization method may be undesirable. Here we present the idea of stochastic average model (SAM) methods, inspired by stochastic average gradient methods. SAM methods sample component functions on each iteration of a trust-region method according to a discrete probability distribution on component functions; the distribution is designed to minimize an upper bound on the variance of the resulting stochastic model. We present promising numerical results concerning an implemented variant extending the derivative-free model-based trust-region solver POUNDERS, which we name SAM-POUNDERS.

97 MATHEMATICS AND COMPUTING↗

Reducing spurious mesh motion in Lagrangian finite volume and discontinuous Galerkin hydrodynamic methods

The Lagrangian finite volume (FV) cell-centered hydrodynamic (CCH) method and the Lagrangian discontinuous Galerkin (DG) CCH method have been demonstrated to be quite stable and capable of producing very accurate solutions on many mesh topologies. However, some challenges can arise with higher-order elements and polygonal elements that have many deformational degrees of freedom. With these types of meshes, elements can deform in unphysical ways and the mesh can tangle. In this study, we present methods for obtaining more robust Lagrangian solutions on polygonal and higher-order elements. The robustness is achieved by (1) incorporating a new iterative method that modifies the velocity reconstructions in the corners of the elements, and (2) a new multidirectional approximate Riemann solver that, when coupled with the iterative method, reduces spurious mesh motion. Lastly, the details of the numerical methods are discussed and their utility is demonstrated on a diverse suite of test problems using higher-order and polygonal elements.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Failure Probability Constrained AC Optimal Power Flow

Despite cascading failures being the central cause of blackouts in power transmission systems, existing operational and planning decisions are made largely by ignoring their underlying cascade potential. This paper posits a reliability-aware AC Optimal Power Flow formulation that seeks to design a dispatch point which has a low operator-specified likelihood of triggering a cascade starting from any single component outage. By exploiting a recently developed analytical model of the probability of component failure, our Failure Probability-constrained ACOPF (FP-ACOPF) utilizes the system's expected first failure time as a smoothly tunable and interpretable signature of cascade risk. Here, we use techniques from bilevel optimization and numerical linear algebra to efficiently formulate and solve the FP-ACOPF using off-the-shelf solvers. Extensive simulations on the IEEE 118-bus case show that, when compared to the unconstrained and N-1 security-constrained ACOPF, our probability-constrained dispatch points can significantly lower the probabilities of long severe cascades and of large demand losses, while incurring only minor increases in total generation costs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Low-Memory, Discrete Ordinates, Discontinuous Galerkin Methods for Radiative Transport

The discrete ordinates discontinuous Galerkin (SN-DG) method is a well-established and practical approach for solving the radiative transport equation. In this paper, we study a low-memory variation of the upwind SN-DG method. The proposed method uses a smaller finite element space that is constructed by coupling spatial unknowns across collocation angles, thereby yielding an approximation with fewer degrees of freedom than the standard method. Like the original SN-DG method, the low-memory variation still preserves the asymptotic diffusion limit and maintains the characteristic structure needed for mesh sweeping algorithms. While we observe second-order convergence in the scattering dominated, diffusive regime, the low-memory method is in general only first-order accurate. To address this issue, we use upwind reconstruction to recover second-order accuracy. Finally, for both methods, numerical procedures based on upwind sweeps are proposed to reduce the system dimension in the underlying Krylov solver strategy.

97 MATHEMATICS AND COMPUTING↗

Parallel-in-Time Solution of Scalar Nonlinear Conservation Laws

Here, we consider the parallel-in-time solution of scalar nonlinear conservation laws in one spatial dimension. The equations are discretized in space with a conservative finite-volume method using weighted essentially nonoscillatory (WENO) reconstructions, and in time with high-order explicit Runge–Kutta methods. The solution of the global, discretized space-time problem is sought via a nonlinear iteration that uses a novel linearization strategy in cases of nondifferentiable equations. Under certain choices of discretization and algorithmic parameters, the nonlinear iteration coincides with Newton’s method, although, more generally, it is a preconditioned residual correction scheme. At each nonlinear iteration, the linearized problem takes the form of a certain discretization of a linear conservation law over the space-time domain in question. An approximate parallel-in-time solution of the linearized problem is computed with a single multigrid reduction-in-time (MGRIT) iteration; however, any other effective parallel-in-time method could be used in its place. The MGRIT iteration employs a novel coarse-grid operator that is a modified conservative semi-Lagrangian discretization and generalizes those we have developed previously for nonconservative scalar linear hyperbolic problems. Numerical tests are performed for the inviscid Burgers and Buckley–Leverett equations. For many test problems, the solver converges in just a handful of iterations with a convergence rate independent of mesh resolution, including problems with (interacting) shocks and rarefactions.

97 MATHEMATICS AND COMPUTING↗