Results for “iterative solvers” — Page 19

DOE OSTI2023

A Mixed integer linear programming‐based distributed energy management for networked microgrids considering network operational objectives and constraints

Abstract Mixed integer linear programming (MILP)–based distributed energy management for networked microgrids embedded modern distribution systems is proposed. Considering the diverse ownership of microgrids, distributed energy resources (DERs) that interface directly with utilities and responsive loads, an alternating direction method of multipliers–based distributed framework was formulated for the scheduling of networked microgrids embedded modern distribution systems by adjusting nodal price signals iteratively. In addition, to make the formulated optimization problems resolvable through more accessible and popular MILP solvers, different linearisation techniques were employed to transform the nonlinear terms into linear or mixed integer linear formats. The proposed MILP‐based distributed method preserves all participants' autonomy (e.g., microgrids, DERs that interface directly with utilities and responsive loads), while incentivising them to actively participate in the distribution system operation with price signals. The proposed method is validated with results of numerical simulation using a modern distribution system consisting of multiple networked microgrids, DERs that interface directly with utilities, as well as responsive loads.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NASA NTRS1983

The efficient solution of transonic wing flow fields

An evaluation of the transonic-wing-analysis computer code TWING is presented. TWING utilizes a fully implicit, approximate-factorization iteration scheme to solve the full-potential equation in conservative form. A numerical elliptic-solver grid-generation scheme is used to generate the required finite-difference mesh. Several wing configurations have been analyzed, and comparisons of computed results have been made with available experimental data. Results indicate that the code is robust, accurate (when significant viscous effects are not present), and efficient. TWING generally produces solutions an order of magnitude faster than other conservative, full-potential codes using successive-line overrelaxation. The present method is applicable to a wide range of isolated wing configurations, including high-aspect-ratio transport wings and low-aspect-ratio, high-sweep, fighter configurations.

Holst, T. L.↗

NASA NTRS1992

Automatic differentiation of advanced CFD codes for multidisciplinary design

Automated multidisciplinary design of aircraft and other flight vehicles requires the optimization of complex performance objectives with respect to a number of design parameters and constraints. The effect of these independent design variables on the system performance criteria can be quantified in terms of sensitivity derivatives which must be calculated and propagated by the individual discipline simulation codes. Typical advanced CFD analysis codes do not provide such derivatives as part of a flow solution; these derivatives are very expensive to obtain by divided (finite) differences from perturbed solutions. It is shown that sensitivity derivatives can be obtained accurately and efficiently using the ADIFOR source translator for automatic differentiation. In particular, it is demonstrated that the 3-D, thin-layer Navier-Stokes, multigrid flow solver called TLNS3D is amenable to automatic differentiation in the forward mode even with its implicit iterative solution algorithm and complex turbulence modeling. It is significant that by using computational differentiation, consistent discrete nongeometric sensitivity derivatives have been obtained from an aerodynamic 3-D CFD code in a relatively short time, e.g., O(man-week) not O(man-year).

Bischof, C.↗

NASA NTRS2019

An Initial Exploration of Improved Numerics within the Guidelines of the Negative Spalart-Allmaras Turbulence Model

A simple modification to the negative Spalart-Allmaras turbulence model is suggested so that when the turbulence working variable, ~v, is negative, diagonal dominance is increased, as is the tendency for the time-advancement scheme to push e toward positive values. Owing to the fact that the modification is only active when ~v is less than zero, the physical model is left unchanged. Using the proposed modification with a strong implicit solver based on Newton's method, convergence rates can be somewhat improved, with typical reductions in iterations and computer time on the order of 15-50%. The benefits are realized primarily when second- or higher-order accuracy is used for discretizing the convective terms in the turbulence model because of large overshoots that can occur with these schemes at the edges of boundary layers and wakes. For flowfields with few regions of negative ~v, or on very fine meshes where ~v is always greater than zero, little or no benefits should be expected.

Anderson, William K.↗

NASA NTRSDate not supplied

Towards Robust and Accurate Implicit Gradient Methods for Second- and Third-Order Nodal-Gradient Cell-Centered Finite-Volume Discretizations on Tetrahedral Grids

In this paper, we introduce implicit gradient methods as alternatives to conventional least-squares gradient methods for second- and third-order nodal-gradient cell-centered finite-volume discretizations, where solutions are stored at cells but gradients are stored at nodes. Because of the unique configuration of solutions and gradients, implicit gradient systems developed for the node-centered edge-based discretization method can be directly applied once the numerical solutions are interpolated from cells to nodes with sufficient accuracy. The resulting defect-correction solver can be loosely coupled with a flow-equation solver, and at convergence, solutions and gradients that satisfy the corresponding residual equations are obtained. Each iteration is relatively cheap compared with least-squares methods involving hundreds of neighbors. Numerical results are presented for accuracy verification studies and some simple but realistic flow problems.

Computational Fluid Dynamics↗

NASA NTRSDate not supplied

Nonlinear Nonmodal Analysis of Hypersonic Flow over Blunt Cones

The linear amplification of modal disturbances that lead to boundary-layer transition in two-dimensional/axisymmetric hypersonic configurations is strongly reduced by the presence of a blunt nosetip, and the mechanisms underlying the observed onset of transition over the cone frustum are currently unknown. Linear nonmodal analysis has shown that both planar and oblique traveling disturbances that peak within the entropy layer experience appreciable energy amplification for moderate to large nosetip bluntness. The present study extends the previous linear analysis by including the nonlinear effects. Specifically, the perturbation form of the 2D, harmonic Navier-Stokes equations (HNSE) are solved with a fully implicit formulation and the Newton-Raphson method. The increased number of degrees of freedom for the nonlinear system presents difficulties for solution strategies based on direct solution of the linearized system. Such difficulties are overcome by using the GMRES iterative method with a preconditioner corresponding to a simplified Jacobian without the cross derivative terms. The HNSE solver is verified by comparing with nonlinear parabolized stability equation (NPSE) results for the nonlinear evolution of planar waves in an incompressible Blasius boundary layer and in a Mach 6 flow over a blunt cone. Finally, nonlinear nonmodal results are presented for planar traveling disturbances over the blunt cone. The nonmodal analysis demonstrates that entropy-layer disturbances generated close to the nose tip can seed the amplification of higher frequency Mack’s second-mode instabilities further downstream.

boundary layer transition↗

NASA NTRSDate not supplied

Nonlinear Nonmodal Analysis of Hypersonic Flow over Blunt Cones

The linear amplification of modal disturbances that lead to boundary-layer transition in two-dimensional/axisymmetric hypersonic configurations is strongly reduced by the presence of a blunt nosetip, and the mechanisms underlying the observed onset of transition over the cone frustum are currently unknown. Linear nonmodal analysis has shown that both planar and oblique traveling disturbances that peak within the entropy layer experience appreciable energy amplification for moderate to large nosetip bluntness. The present study extends the previous linear analysis by including the nonlinear effects. Specifically, the perturbation form of the 2D, harmonic Navier-Stokes equations (HNSE) are solved with a fully implicit formulation and the Newton-Raphson method. The increased number of degrees of freedom for the nonlinear system presents difficulties for solution strategies based on direct solution of the linearized system. Such difficulties are overcome by using the GMRES iterative method with a preconditioner corresponding to a simplified Jacobian without the cross derivative terms. The HNSE solver is verified by comparing with nonlinear parabolized stability equation (NPSE) results for the nonlinear evolution of planar waves in an incompressible Blasius boundary layer and in a Mach 6 flow over a blunt cone. Finally, nonlinear nonmodal results are presented for planar traveling disturbances over the blunt cone. The nonmodal analysis demonstrates that entropy-layer disturbances generated close to the nose tip can seed the amplification of higher frequency Mack’s second-mode instabilities further downstream.

boundary layer transition↗

DOE OSTI2022

A low-rank power iteration scheme for neutron transport criticality problems

Computing effective eigenvalues for neutron transport often requires a fine numerical resolution. Here, the main challenge of such computations is the high memory effort of classical solvers, which limits the accuracy of chosen discretizations. In this work, we derive a method for the computation of effective eigenvalues when the underlying solution has a low-rank structure. This is accomplished by utilizing dynamical low-rank approximation (DLRA), which is an efficient strategy to derive time evolution equations for low-rank solution representations. The main idea is to interpret the iterates of the classical inverse power iteration as pseudo-time steps and apply the DLRA concepts in this framework. In our numerical experiment, we demonstrate that our method significantly reduces memory requirements while achieving the desired accuracy. Analytic investigations show that the proposed iteration scheme inherits the convergence speed of the inverse power iteration, at least for a simplified setting.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Full time-dependent SOLPS-ITER simulation of the SPARC tokamak: actuator design for particle and divertor condition control *

Abstract This paper presents the application of full time-dependent SOLPS-ITER simulations for actuator design in the SPARC tokamak. This study employs both the EIRENE module, a neutral solver, and the B2.5 plasma module in a time-dependent mode. This is in contrast to most SOLPS simulations, which focus on steady-state solutions, where the neutral distribution is evolved without any time limit or for a time step of 1 ⋅ 10 − 3 second, which is several orders of magnitude larger than the fluid plasma time step. The time-dependent EIRENE was tested with a fixed B2.5 background and compared with a simple conductance based model in a simplified pump chamber geometry. This comparison aimed to verify the reliability of the neutral relaxation timescale derived from the time-dependent EIRENE. Subsequently, a full time-dependent simulation was performed in a realistic geometry, with the Monte-Carlo neutral time step synchronized with the plasma fluid time step. The numerical setup of the code, including relative time steps and the size of the census data used to store Monte-Carlo particle information is considered. The full-time dependent simulations are then applied to inform the design of the SPARC louver structure, which affects divertor plasma parameters by regulating the neutral conductance from the divertor to the pump. The response of the plasma and neutral parameters was captured on a timescale that enables the design of the actuator to consider time-dependent control capability. It was found that changing the louver opacity has an equivalent effect as varying the gas throughput via puff actuation. Therefore, equivalent divertor plasma conditions can be obtained from both actuators, while the neutral pressure distribution in the pump and divertor differs for each actuator.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NASA NTRS1986

A new approach for solving the three-dimensional steady Euler equations. I - General theory

The present iterative procedure combines the Clebsch potentials and the Munk-Prim (1947) substitution principle with an extension of a semidirect Cauchy-Riemann solver to three dimensions, in order to solve steady, inviscid three-dimensional rotational flow problems in either subsonic or incompressible flow regimes. This solution procedure can be used, upon discretization, to obtain inviscid subsonic flow solutions in a 180-deg turning channel. In addition to accurately predicting the behavior of weak secondary flows, the algorithm can generate solutions for strong secondary flows and will yield acceptable flow solutions after only 10-20 outer loop iterations.

Chang, S.-C.↗

DOE OSTI2021

Beyond Taylor’s hypothesis: a novel volumetric reconstruction of velocity and density fields for variable‑density and shear flows

Abstract This work presents a novel numerical procedure for reconstructing volumetric density and velocity fields from planar laser-induced fluorescence (PLIF) and stereoscopic particle image velocimetry (SPIV) data. This new method is theoretically and practically demonstrated to provide more accurate 3D vortical structures and density fields in high shear flows than reconstruction methods based on the mean convective velocity. While Taylor’s hypothesis of frozen turbulence is commonly applied by using the local mean streamwise velocity, the proposed algorithm uses the measured local instantaneous velocity for data convection. It consists of a step-by-step reconstruction based on a mixed Lagrangian–Eulerian solver that includes the 3D interpolation of scattered flow data and that relaxes the Taylor’s hypothesis by iterative enforcement of the incompressibility constraint on the velocity field. This methodology provides 3D fields with temporal resolution, spatial resolution, and accuracy comparable to that of real 3D snapshots, thus providing a practical alternative to tomographic measurements. The procedure is validated using numerical data of the constant-density channel flow available on the Johns Hopkins University Turbulence Database (JHTDB), showing the accurate reconstruction of the 3D velocity field. The algorithm is applied to an experimental dataset of PLIF and SPIV measurements of a variable-density jet flow, demonstrating its capability to provide 3D velocity and density fields that are more consistent with the Navier–Stokes equations compared to the mean flow convective method. Graphic abstract

42 ENGINEERING↗

NASA NTRSDate not supplied

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↗

NASA NTRSDate not supplied

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↗

DOE OSTI2020

GMRES with embedded ensemble propagation for the efficient solution of parametric linear systems in uncertainty quantification of computational models

In a previous work, embedded ensemble propagation was proposed to improve the efficiency of sampling-based uncertainty quantification methods of computational models on emerging computational architectures. It consists of simultaneously evaluating the model for a subset of samples together, instead of evaluating them individually. A first approach introduced to solve parametric linear systems with ensemble propagation is ensemble reduction. In Krylov methods for example, this reduction consists in coupling the samples together using an inner product that sums the sample contributions. Ensemble reduction has the advantages of being able to use optimized implementations of BLAS functions and having a stopping criterion which involves only one scalar. However, the reduction potentially decreases the rate of convergence due to the gathering of the spectra of the samples. In this paper, we investigate a second approach: ensemble propagation without ensemble reduction in the case of GMRES. This second approach solves each sample simultaneously but independently to improve the convergence compared to ensemble reduction. This raises two new issues which are solved in this paper: the fact that optimized implementations of BLAS functions cannot be used anymore and that ensemble divergence, whereby individual samples within an ensemble must follow different code execution paths, can occur. We tackle those issues by implementing a high-performing ensemble GEMV and by using masks. The proposed ensemble GEMV leads to a similar cost per GMRES iteration for both approaches, i.e. with and without reduction. For illustration, we study the performances of the new linear solver in the context of a mesh tying problem. Furthermore, this example demonstrates improved ensemble propagation speed-up without reduction.

BLAS↗

DOE OSTI2022

MPACT Theory Manual (V.4.3)

This manual presents the theory underlying the three-dimensional (3D) whole-core, pin-resolved neutron transport calculation methodologies employed in the MPACT code. MPACT’s primary goal is to provide accurate sub-pin power distributions in a computationally efficient manner. To accomplish this, MPACT offers several different transport method options. The 2D/1D method, in which 3D problems are decomposed into an axial stack of radial “slices,” is currently the most commonly used. In this option, two-dimensional (2D) planar solutions are provided by the method of characteristics (MOC), and axial solutions are provided via one-dimensional (1D) approximate diffusion, or P3 solutions. The radial and axial solutions are coupled by (i) axial and radial transverse leakages, and (ii) a global 3D coarse mesh finite difference (CMFD) solve, which provides both acceleration and stability to the solution iteration scheme. The subsequent chapters of this manual present a range of topics, including MOC, CMFD, axial nodal transport solvers, 2D/1D, self-shielding, depletion, thermal-hydraulics, and transient methods. Development of the underlying theory of the 2D/1D method is presented, diagrams are included to highlight important algorithmic flow, and important concepts are discussed as appropriate. This manual is intended to be self-sufficient, but references to published articles and other materials are included for further reading. MPACT is a relatively new code, with new capabilities and many computational methods that did not exist until recently. This manual is an even newer document, with chapters written by several different code contributors working under time constraints. For these reasons, the manual is not yet complete and finalized. Future versions of this manual will address current deficiencies.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1993

Computational analysis of methods for reduction of induced drag

The purpose of this effort was to perform a computational flow analysis of a design concept centered around induced drag reduction and tip-vortex energy recovery. The flow model solves the unsteady three-dimensional Euler equations, discretized as a finite-volume method, utilizing a high-resolution approximate Riemann solver for cell interface flux definitions. The numerical scheme is an approximately-factored block LU implicit Newton iterative-refinement method. Multiblock domain decomposition is used to partition the field into an ordered arrangement of blocks. Three configurations are analyzed: a baseline fuselage-wing, a fuselage-wing-nacelle, and a fuselage-wing-nacelle-propfan. Aerodynamic force coefficients, propfan performance coefficients, and flowfield maps are used to qualitatively access design efficacy. Where appropriate, comparisons are made with available experimental data.

Janus, J. M.↗

NASA NTRS2015

High-Order Hyperbolic Residual-Distribution Schemes on Arbitrary Triangular Grids

In this paper, we construct high-order hyperbolic residual-distribution schemes for general advection-diffusion problems on arbitrary triangular grids. We demonstrate that the second-order accuracy of the hyperbolic schemes can be greatly improved by requiring the scheme to preserve exact quadratic solutions. We also show that the improved second-order scheme can be easily extended to third-order by further requiring the exactness for cubic solutions. We construct these schemes based on the LDA and the SUPG methodology formulated in the framework of the residual-distribution method. For both second- and third-order-schemes, we construct a fully implicit solver by the exact residual Jacobian of the second-order scheme, and demonstrate rapid convergence of 10-15 iterations to reduce the residuals by 10 orders of magnitude. We demonstrate also that these schemes can be constructed based on a separate treatment of the advective and diffusive terms, which paves the way for the construction of hyperbolic residual-distribution schemes for the compressible Navier-Stokes equations. Numerical results show that these schemes produce exceptionally accurate and smooth solution gradients on highly skewed and anisotropic triangular grids, including curved boundary problems, using linear elements. We also present Fourier analysis performed on the constructed linear system and show that an under-relaxation parameter is needed for stabilization of Gauss-Seidel relaxation.

Mazaheri, Alireza↗

DOE OSTI2022

Enhancements to Overset Methods for Achieving Higher Accuracy and Solution Convergence: Preprint

Overset methods, when utilized within a multi-solver framework, provide a very flexible and powerful toolset for analyzing moving body problem. However, many overset framework suffer from several deficiencies such as (1) convergence degradation of the non-linear iterative schemes (2) difficulty in achieving higher-order accuracy and (3) high computational costs over long simulation times. In this work, we explore approaches that mitigate these deficiencies and provide a pathway for improved accuracy and fidelity of overset methods. A high-order, discontinuous Galerkin solver is integrated into an existing overset framework and applied to an unsteady ROBIN fuselage case. For convergence acceleration, an Overset-GMRES linear solver with a timestep controller is applied to a DLR-F6 aircraft steady simulation and an unsteady, notional rotor-fuselage. Finally the same rotor-fuselage case as well as the JVX rotor/wing case is simulated using a reduced-order aerodynamic model.

aerospace↗