Results for “iterative solvers” — Page 23

NASA NTRS1993

Modeling ice streams: Derived quantities

The model addressed is a finite-element, map-plane, time-dependent, column-averaged continuity equation solver. The key to the fitting process involves the balance between ice motion dominated by flow in internal layers, and ice motion dominated by sliding at the bed. The fitting process involves an iterative process carried out in the time domain. Beginning with the portion of the ice sheet being modeled identical to the present ice sheet with uniform flow, sliding, and fraction specified at nominal values, the model monitors each nodal point surface elevation. As the calculated surface elevation deviates from the present surface, a correction proportional to the difference is applied to selected parameter sets. This correction is in a sense that would tend to improve the fit at the particular nodal point. A calculated surface elevation that was higher than the present surface would result in an increased fraction, which would tend to lower the calculated surface (if the flow or sliding constant were being used as the fitting parameter, they would be lowered to improve the fit). This process is allowed to proceed as long as is necessary for the situation to stabilize. Typically, this takes tens of thousands of model years, but the rate is dependent on other external forcings such as the accumulation rate. The primary result is that while a typical sample of ice streams from around Antarctica can be fitted quite reasonably using only the fraction of the velocity due to sliding, a different mechanism seems to be in play along the Siple Coast, where reduced sliding constants are required to attain a reasonable fit. Flow is more strongly channelized in this region, and velocities are, in general, higher than are observed in other regions. It is unlikely that the mechanism that controls the ice movement along the Siple Coast is exactly similar to the mechanisms in the other ice streams. The concept of deformable sediments and their contribution to the fast flow along the Siple Coast may have limited applicability to other Antarctic ice streams.

Fastook, James↗

DOE OSTI2024

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

The simulation of fluid flows is an essential part of the design and analysis of nuclear systems. Algorithms able to simulate flows at different fidelity levels are available in the Multiphysics Object-Oriented Simulation Environment (MOOSE) and MOOSE-based applications such as Pronghorn \cite{novak2018pronghorn}, Pronghorn-Subchannel, RELAP-7, and SAM. Currently, significant effort is being invested in the development of coarse-mesh Computational Fluid Dynamics (CFD) capabilities within MOOSE and Pronghorn for the simulation of Generation IV nuclear reactors. Traditionally, the solution algorithms in MOOSE have relied on Newton or quasi-Newton methods (such as the preconditioned Jacobian-free Newton-Krylov method) where residuals and Jacobians (or approximations thereof) are constructed. Both Newton and quasi-Newton methods require the solution of a linear system at each nonlinear Newton iteration with the Jacobian as the system matrix. The Jacobian contains blocks originating from all variables in the problem (i.e., for thermal-hydraulics at least pressure, velocities, and temperature). Due to the formulation of the problem in a general multiphysics setting on unstructured mesh, creating a good preconditioner for the linear system can be challenging, thus many fluid applications have utilized direct solver-based methods such as LU factorization. However, with increasing system size and complexity in multi-dimensional problems, the direct solution of linear systems becomes computationally expensive both in execution time and and memory. For this reason, recent effort has focused on adapting segregated solution algorithms for CFD problems in MOOSE. These algorithms use fixed-point iteration between segregated systems whose assembly and preconditioning are easier those of the monolithic system. Initial results show that the segregated solution algorithm outperforms the monolithic approach in terms of memory usage and for large 3D problems in terms of CPU time as well.

42 ENGINEERING↗

DOE OSTI2024

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

The simulation of fluid flows is an essential part of the design and analysis of nuclear systems. Algorithms able to simulate flows at different fidelity levels are available in the Multiphysics Object-Oriented Simulation Environment (MOOSE) and MOOSE-based applications such as Pronghorn \cite{novak2018pronghorn}, Pronghorn-Subchannel, RELAP-7, and SAM. Currently, significant effort is being invested in the development of coarse-mesh Computational Fluid Dynamics (CFD) capabilities within MOOSE and Pronghorn for the simulation of Generation IV nuclear reactors. Traditionally, the solution algorithms in MOOSE have relied on Newton or quasi-Newton methods (such as the preconditioned Jacobian-free Newton-Krylov method) where residuals and Jacobians (or approximations thereof) are constructed. Both Newton and quasi-Newton methods require the solution of a linear system at each nonlinear Newton iteration with the Jacobian as the system matrix. The Jacobian contains blocks originating from all variables in the problem (i.e., for thermal-hydraulics at least pressure, velocities, and temperature). Due to the formulation of the problem in a general multiphysics setting on unstructured mesh, creating a good preconditioner for the linear system can be challenging, thus many fluid applications have utilized direct solver-based methods such as LU factorization. However, with increasing system size and complexity in multi-dimensional problems, the direct solution of linear systems becomes computationally expensive both in execution time and and memory. For this reason, recent effort has focused on adapting segregated solution algorithms for CFD problems in MOOSE. These algorithms use fixed-point iteration between segregated systems whose assembly and preconditioning are easier those of the monolithic system. Initial results show that the segregated solution algorithm outperforms the monolithic approach in terms of memory usage and for large 3D problems in terms of CPU time as well.

42 ENGINEERING↗

NASA NTRS1996

Numerical Study of Multigrid Methods with Various Smoothers for the Elliptical Grid Generation Equations

A robust solver for the elliptic grid generation equations is sought via a numerical study. The system of PDEs is discretized with finite differences, and multigrid methods are applied to the resulting nonlinear algebraic equations. Multigrid iterations are compared with respect to the robustness and efficiency. Different smoothers are tried to improve the convergence of iterations. The methods are applied to four 2D grid generation problems over a wide range of grid distortions. The results of the study help to select smoothing schemes and the overall multigrid procedures for elliptic grid generation.

Golik, W. L.↗

DOE OSTI2021

Optimizing Power Generation of a Bottom-Raised Oscillating Surge Wave Energy Converter Using a Theoretical Model: Preprint

Preliminary sizing of an oscillating surge wave energy converter (OSWEC) is an iterative process that relies on knowledge of the relevant hydrodynamic coefficients for a given geometry. Often, the complex definition of the device geometry requires coefficients to be obtained through experiments or numerical boundary element solvers such as WAMIT. These techniques demand significant user and computational effort, therefore inhibiting the fine scale parametrization of object dimensions. In this study, a theoretical model, originally presented in Michele et al. (2016), is developed and demonstrated to efficiently optimize the power production for an OSWEC device (subjected to certain environmental conditions) with variations in device widths, heights, and distances from the seabed. Assuming negligible device thickness, the OSWEC motions are modelled as a bottom-raised two-dimensional flap in regular waves using potential flow theory formulated in elliptical coordinates. The solutions to this diffraction-radiation problem are obtained using Mathieu functions with appropriate boundary conditions. The resulting potentials are then used to derive frequency-dependent expressions for the added mass and radiation damping coefficients, along with wave excitation magnitude in surge, pitch, and coupled surge-pitch motions. Good agreement in hydrodynamic coefficient curves is shown between the theoretical model and the numerical results obtained from the boundary element-based program WAMIT. The theoretical model is then employed to maximize the time-averaged output power while maintaining or reducing the hinge reaction force, with variations in device dimensions, wave frequency and amplitude.

ACE↗

DOE OSTI2021

Optimizing Power Generation of a Bottomraised Oscillating Surge Wave Energy Converter Using a Theoretical Model

Preliminary sizing of an oscillating surge wave energy converter (OSWEC) is an iterative process that relies on knowledge of the relevant hydrodynamic coefficients for a given geometry. Often, the complex definition of the device geometry requires coefficients to be obtained through experiments or numerical boundary element solvers such as WAMIT. These techniques demand significant user and computational effort, therefore inhibiting the fine scale parametrization of object dimensions. In this study, a theoretical model, originally presented in Michele et al. (2016), is developed and demonstrated to efficiently optimize the power production for an OSWEC device (subjected to certain environmental conditions) with variations in device widths, heights, and distances from the seabed. Assuming negligible device thickness, the OSWEC motions are modelled as a bottom-raised two-dimensional flap in regular waves using potential flow theory formulated in elliptical coordinates. The solutions to this diffraction-radiation problem are obtained using Mathieu functions with appropriate boundary conditions. The resulting potentials are then used to derive frequency-dependent expressions for the added mass and radiation damping coefficients, along with wave excitation magnitude in surge, pitch, and coupled surge-pitch motions. Good agreement in hydrodynamic coefficient curves is shown between the theoretical model and the numerical results obtained from the boundary element-based program WAMIT. The theoretical model is then employed to maximize the time-averaged output power while maintaining or reducing the hinge reaction force, with variations in device dimensions, wave frequency and amplitude.

ACE↗

DOE OSTI2025

A unified funnel restoration SQP algorithm

We consider nonlinearly constrained optimization problems and discuss a generic double-loop framework consisting of basic algorithmic ingredients that unifies a broad range of nonlinear optimization solvers. This framework has been implemented in the open-source solver Uno, a Swiss Army knife-like C++ optimization framework that unifies many nonlinearly constrained nonconvex optimization solvers. We illustrate the framework with a sequential quadratic programming (SQP) algorithm that maintains an acceptable upper bound on the constraint violation, called a funnel, that is monotonically decreased to control the feasibility of the iterates. Infeasible quadratic subproblems are handled by a feasibility restoration strategy. Globalization is controlled by a line search or a trust-region method. We prove global convergence of the trust-region funnel SQP method, building on known results from filter methods. We implement the algorithm in Uno, and we provide extensive test results for the trust-region line-search funnel SQP on small CUTEst instances.

Kiessling, David [Katholieke Univ. Leuven, Heverle↗

NASA NTRS2000

Transonic Flow Computations Using Nonlinear Potential Methods

This presentation describes the state of transonic flow simulation using nonlinear potential methods for external aerodynamic applications. The presentation begins with a review of the various potential equation forms (with emphasis on the full potential equation) and includes a discussion of pertinent mathematical characteristics and all derivation assumptions. Impact of the derivation assumptions on simulation accuracy, especially with respect to shock wave capture, is discussed. Key characteristics of all numerical algorithm types used for solving nonlinear potential equations, including steady, unsteady, space marching, and design methods, are described. Both spatial discretization and iteration scheme characteristics are examined. Numerical results for various aerodynamic applications are included throughout the presentation to highlight key discussion points. The presentation ends with concluding remarks and recommendations for future work. Overall. nonlinear potential solvers are efficient, highly developed and routinely used in the aerodynamic design environment for cruise conditions. Published by Elsevier Science Ltd. All rights reserved.

Holst, Terry L.↗

DOE OSTI2022

Low level coupling scheme between neutronics and thermal-hydraulics based on Anderson acceleration

The simulation of nuclear reactors is a multiphysics problem mixing, amongst other fields, neutron transport and thermal-hydraulics. The simplest and most used approach in multiphysics simulation is based on the coupling of single-physics codes in a black-box fashion. However, in order to reduce the computational time needed for such simulations, case-dependent optimizations are often required. In this paper, we aim at reducing the computational time required to solve a coupled neutronic/thermal-hydraulic steady-state problem on a simplified Pressurized Water Reactor (PWR) core. The idea is to deal simultaneously with the coupling of the energy groups of the deterministic neutronic description of the core and its thermal-hydraulic description with the Anderson acceleration. By doing so, the fission source terms are directly accelerated instead of the power map as done in most cases. The power method used to solve the k-eigenvalue problem inside the neutronic solver is thus accelerated with the Anderson acceleration. The numerical experimentations conducted in this work are performed using APOLLO3 and THEDI, and indicate that such coupling strategy improves the convergence rates in terms of number of iterations required and the total computational time. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

NASA NTRS1983

Algorithms and data structures for adaptive multigrid elliptic solvers

Adaptive refinement and the complicated data structures required to support it are discussed. These data structures must be carefully tuned, especially in three dimensions where the time and storage requirements of algorithms are crucial. Another major issue is grid generation. The options available seem to be curvilinear fitted grids, constructed on iterative graphics systems, and unfitted Cartesian grids, which can be constructed automatically. On several grounds, including storage requirements, the second option seems preferrable for the well behaved scalar elliptic problems considered here. A variety of techniques for treatment of boundary conditions on such grids are reviewed. A new approach, which may overcome some of the difficulties encountered with previous approaches, is also presented.

Vanrosendale, J.↗

DOE OSTI2020

Multiscale formulation of frictional contact mechanics at the pore scale

Direct numerical simulation (DNS) yields the highest fidelity predictions of mechanical deformation at the pore scale, but is prohibitively expensive for analyzing large or many samples. Discrete element methods (DEM) are an efficient alternative, but are limited to granular media and incapable of estimating or controlling prediction errors. We present a pore-level multiscale method (PLMM) that approximates DNS efficiently and with controllable accuracy. We focus on the linear elastic response of a consolidated geologic porous medium with arbitrary microstructure, heterogeneous mineralogy, containing cracks or defects. PLMM decomposes the solid phase into non-overlapping subdomains, on which local basis functions are constructed. The bases are then coupled with a global interface problem that accounts for slip or stick contact conditions between the subdomains. PLMM produces an initial, but accurate, approximation to DNS that can be iteratively improved. It is amenable to parallelism and allows for different mesh, models, and physics in each subdomain. An algebraic interpretation of PLMM as a preconditioner is also presented to allow non-intrusive implementation into existing solvers. Lastly, this work extends previous developments of PLMM in fluid dynamics to solid mechanics and enables future extensions towards modeling coupled flow and mechanics problems.

42 ENGINEERING↗

NASA NTRS1989

Numerical algorithms for steady and unsteady incompressible Navier-Stokes equations

The numerical analysis of the incompressible Navier-Stokes equations are becoming important tools in the understanding of some fluid flow problems which are encountered in research as well as in industry. With the advent of the supercomputers, more realistic problems can be studied with a wider choice of numerical algorithms. An alternative formulation is presented for viscous incompressible flows. The incompressible Navier-Stokes equations are cast in a velocity/vorticity formulation. This formulation consists of solving the Poisson equations for the velocity components and the vorticity transport equation. Two numerical algorithms for the steady two-dimensional laminar flows are presented. The first method is based on the actual partial differential equations. This uses a finite-difference approximation of the governing equations on a staggered grid. The second method uses a finite element discretization with the vorticity transport equation approximated using a Galerkin approximation and the Poisson equations are obtained using a least squares method. The equations are solved efficiently using Newton's method and a banded direct matrix solver (LINPACK). The method is extended to steady three-dimensional laminar flows and applied to a cubic driven cavity using finite difference schemes and a staggered grid arrangement on a Cartesian mesh. The equations are solved iteratively using a plane zebra relaxation scheme. Currently, a two-dimensional, unsteady algorithm is being developed using a generalized coordinate system. The equations are discretized using a finite-volume approach. This work will then be extended to three-dimensional flows.

Hafez, Mohammed↗

NASA NTRS1993

A Lanczos algorithm for vibration, suckling and termal analysis

This paper reviews an eigensolver algorithm based on the Lanczos Method for vibration, buckling and thermal analysis. The original code was written for inclusion in the Computational Mechanics Testbed (COMET), a general purpose finite element code. A portable version of the Lanczos code that is optimized for high-performance supercomputers has been developed. Special features of the algorithm include the capability to compute rigid body modes, thermal modes and Lanczos vectors that are derived from the applied load vector. The latter is necessary when using the Lanczos vectors as reduced-basis vectors in transient structural response and transient heat conduction calculations. The modularity of the code allows the user the option of including the most up-to-date utilities, such as the equation solver best suited for the application. The algorithm is discussed in detail and results of several applications are presented. Timing results for a vibration application indicate that the Lanczos algorithm is twenty times faster than the subspace iteration method which has been extensively used in the past.

Bostic, Susan W.↗

DOE OSTI2021

Source term method for binary neutron stars initial data

The initial condition problem for a binary neutron star system requires a Poisson equation solver for the velocity potential with a Neumann-like boundary condition on the surface of the star. Difficulties that arise in this boundary value problem are: (a) the boundary is not known a priori, but constitutes part of the solution of the problem; (b) various terms become singular at the boundary. In this work, we present a new method to solve the fluid Poisson equation for irrotational/spinning binary neutron stars. The advantage of the new method is that it does not require complex fluid surface fitted coordinates and it can be implemented in a Cartesian grid, which is a standard choice in numerical relativity calculations. This is accomplished by employing the source term method proposed by Towers, where the boundary condition is treated as a jump condition and is incorporated as additional source terms in the Poisson equation, which is then solved iteratively. The issue of singular terms caused by vanishing density on the surface is resolved with an additional separation that shifts the computation boundary to the interior of the star. We present two-dimensional tests to show the convergence of the source term method, and we further apply this solver to a realistic three-dimensional binary neutron star problem. By comparing our solution with the one coming from the initial data solver cocal, we demonstrate agreement to approximately 1%. We report our method can be used in other problems with non-smooth solutions like in magnetized neutron stars.

79 ASTRONOMY AND ASTROPHYSICS↗

NASA NTRS2012

OVERSMART Reporting Tool for Flow Computations Over Large Grid Systems

Structured grid solvers such as NASA's OVERFLOW compressible Navier-Stokes flow solver can generate large data files that contain convergence histories for flow equation residuals, turbulence model equation residuals, component forces and moments, and component relative motion dynamics variables. Most of today's large-scale problems can extend to hundreds of grids, and over 100 million grid points. However, due to the lack of efficient tools, only a small fraction of information contained in these files is analyzed. OVERSMART (OVERFLOW Solution Monitoring And Reporting Tool) provides a comprehensive report of solution convergence of flow computations over large, complex grid systems. It produces a one-page executive summary of the behavior of flow equation residuals, turbulence model equation residuals, and component forces and moments. Under the automatic option, a matrix of commonly viewed plots such as residual histograms, composite residuals, sub-iteration bar graphs, and component forces and moments is automatically generated. Specific plots required by the user can also be prescribed via a command file or a graphical user interface. Output is directed to the user s computer screen and/or to an html file for archival purposes. The current implementation has been targeted for the OVERFLOW flow solver, which is used to obtain a flow solution on structured overset grids. The OVERSMART framework allows easy extension to other flow solvers.

Kao, David L.↗

DOE OSTI2020

A WKB based preconditioner for the 1D Helmholtz wave equation

Frequency-domain full-wave solutions to the cold-plasma problem have become ubiquitous in the study of radio frequency power in fusion plasmas. However, recent efforts at extreme levels of geometric fidelity have revealed fundamental limits in the problem size that can be solved by typical sparse direct solver based methods. These limits are of particular importance in the 3D study of RF launchers, where the number of degrees of freedom required can exceed 100 million. In such cases, it would be advantageous to solve the system via iterative means, but due to the large null space of the curl-curl operator, the convergence properties of algorithms like GMRES are poor. Here we present a physics-based preconditioner in the form of a WKB solution and demonstrate the iterative solution to the frequency-domain Helmholtz problem in 1D for several cases ranging from satisfying the WKB approximation to strongly violating it.

Green, David↗

DOE OSTI2025

Simulation Center for Runaway Electron Avoidance and Mitigation (SCREAM SciDAC) (Technical Final Report)

Runaway electrons can severely damage the plasma facing components on ITER during a major disruption and pose a major risk for tokamak fusion. It has been recognized that an adequate disruption mitigation system (DMS) is essential for the safe operation of ITER. The United States is responsible for the design and implementation of the disruption mitigation system on ITER, and in July 2016 the Simulation Center for Runaway Electron Avoidance and Mitigation (SCREAM) was launched by DOE, in a joint Fusion Energy Sciences (FES) and Advanced Scientific Computing Research (ASCR) collaboration. SCREAM was a comprehensive theory and simulation SciDAC center that provided physics guidance in the avoidance and mitigation of runaway electrons, and in tandem with domestic and international experiments, helped establish the qualitative and quantitative bases for safe operational scenarios and viable mitigation techniques. The SCREAM center assembled a national team of experts in runaway electron physics, tokamak disruptions, magnetohydrodynamic (MHD) simulation, and advanced algorithms and computing. The team combined advanced simulation and analysis capability facilitated by direct participation of ASCR SciDAC institutes with theoretical models and code development by FES scientists to focus on the runaway risk for ITER and tokamaks in general. The research scope was focussed on integrated simulations of kinetic runaway electrons, including MHD and fluid models of impurity transport, within a research plan guided by theory. The specific research tasks were (1) establish the fundamental physics of runaway generation, saturation, and dynamical evolution in a tokamak; (2) examine the critical path toward runaway avoidance; and (3) investigate the viability and effectiveness of the leading candidate schemes for runaway mitigation. In all three areas, members of the team carried out scoping studies that established the readiness for rapid and critical advances, especially in the deployment and further development of large-to extreme-scale simulation tools. Our multi-pronged computational approach included (1) relativistic Fokker-Planck solvers with discretization in phase space, (2) self-consistent particle-in-cell techniques, (3) particle-based Monte-Carlo, and (4) MHD-particle hybrid simulations. Cross-check between these different methods provided an additional means for verification and further bolstered the fidelity of our physics prediction. Validation against experimental results brings confidence to the predictive capability for ITER and frequently leads to new ideas for understanding and mitigating the thermal quench driven runaway electron phenomenon.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2025

Axisymmetric gyrokinetic simulation of ASDEX-Upgrade scrape-off layer using a conservative implicit BGK collision operator

Collisions play an important role in turbulence and transport of fusion plasmas. For kinetic simulations, as the collisionality increases in the domain of interest, the size of the time step to resolve the collisional physics can become overly restrictive in an explicit time integration scheme, leading to high computational cost. With the aim of overcoming such restriction, we have implemented an implicit Bhatnagar–Gross–Krook (BGK) collision operator for use in the discontinuous Galerkin full-f gyrokinetic solver within the Gkeyll framework, which, when combined with Gkeyll's traditional explicit time integrator for collisionless advection, can significantly increase the time step in gyrokinetic simulations of highly collisional regimes. To ensure conservation of density, momentum, and energy, we utilize an iterative scheme to correct the discretized approximation to the equilibrium Maxwellian distribution to which the BGK collision operator relaxes. We have further generalized the BGK infrastructure, both the implicit scheme and the correction routine, to handle cross-species collisions. This improved implicit and conservative BGK operator is benchmarked against the more accurate but more computationally expensive Lenard–Bernstein–Dougherty (LBD) operator, which has been utilized in prior studies with Gkeyll. The implicit BGK operator enables 2D axisymmetric simulations of the ASDEX-Upgrade scrape-off layer to run 56 times faster to completion than the simulations with the LBD operator, because the BGK operator is more robust and converges at a lower resolution than is required by the LBD operator. Additionally, in this more collisional limit, we demonstrate that the results of our simulations utilizing the implicit BGK operator agreed well with simulations utilizing the more computationally expensive LBD operator.

Gyrokinetic simulations↗