Search NASA⌕ Search

SEARCH · Search NASA

Results for “Robust 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 109 records · Page 6

AdditiveFOAM

AdditiveFOAM is a continuum heat transfer and fluid flow code for metal additive manufacturing developed on the OpenFOAM CFD Framework. The main components of AdditiveFOAM include: a dynamic heat source model representing heat input from independently moving beams; a robust and efficient thermodynamic solver for solid-liquid phase change in metal alloys; a library to export thermal data to ExaCA— a cellular automata (CA) code used for predicting solidification grain growth. By integrating these capabilities, AdditiveFOAM offers valuable insights into the process-structure relationships of metal additive manufacturing components.

Coleman, John [Oak Ridge National Laboratory (ORNL↗

Elk: A New MOOSE Framework Application for Radio-frequency Electromagnetics

A new tool in-development for general electromagnetic (EM) simulation for modeling radio-frequency (rf) systems is presented. The primary motivation for development of this tool is to leverage the flexibility and high-performance-computing capability of the Multiphysics Object-Oriented Simulation Environment (MOOSE) Framework developed by Idaho National Laboratory (INL) for complex EM problems. A MOOSE application (or MOOSE App) enables the end user to create a fully-functional simulation scenario without needing explicit knowledge of the underlying finite-element weak form implementation. MOOSE combines the libMesh library and the PetSc suite as the finite element and solver libraries, giving a robust platform for solving highly non-linear, coupled sets of PDEs such as those found in EM and plasma physics problems. Initial validation efforts have included standard waveguide and antenna benchmarks with the current focus being field validation against the well-known capacitively-coupled GEC Reference Cell (GEC-CCP). The results of this effort will be outlined and discussed. Future work plans including cold-plasma rf wave propagation studies and coupling to the plasma fluid MOOSE App, Zapdos [Lindsay et al 2016 J. Phys. D: Appl. Phys. 49 235204], will also be discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DSD2D-FLS 2010: Bdzil's 2010 DSD Code Base; Computing tb and Dn with Edits to Reduce the Noise in the Dn Field Near HE Boundaries

The full level-set function code, DSD3D, is fully described in LA-14336 (2007) [1]. This ASCI-supported, DSD code project was the last such LANL DSD code project that I was involved with before my retirement in 2007. My part in the project was to design and build the core DSD3D solver, which was to include a robust DSD boundary condition treatment. A robust boundary condition treatment was required, since for an important local “customer,” the only description of the explosives’ boundary was through volume fraction data. Given this requirement, the accuracy issues I had encountered with our “fast-tube,” narrowband, DSD2D solver, and the difficulty we had building an efficient MPI-parallel version of the narrowband DSD2D, I decided DSD3D should be built as a full level-set function code, using a totally local DSD boundary condition algorithm for the level-­set function, phi, which did not rely on the gradient of the level-­set function being one, |grad(phi)| = 1. The narrowband DSD2D solver was built on the assumption that |grad(phi)| could be driven to one, and near the boundaries of the explosive this condition was not being satisfied. Since the narrowband is typically no more than10*dx wide, narrowband methods are discrete methods with a fixed, non-­resolvable error, where the error is related to the thickness of the band: the narrower the band the larger the errors. Such a solution represents a discrete approximation to the true solution and does not limit to the solution of the underlying PDEs under grid resolution.The full level-­set function code, DSD3D, is fully described in LA-14336 (2007) [1]. This ASCI-­supported, DSD code project was the last such LANL DSD code project that I was involved with before my retirement in 2007. My part in the project was to design and build the core DSD3D solver, which was to include a robust DSD boundary condition treatment. A robust boundary condition treatment was required, since for an important local “customer,” the only description of the explosives’ boundary was through volume fraction data. Given this requirement, the accuracy issues I had encountered with our “fast-­tube,” narrowband, DSD2D solver, and the difficulty we had building an efficient MPI-parallel version of the narrowband DSD2D, I decided DSD3D should be built as a full level-­set function code, using a totally local DSD boundary condition algorithm for the level-­set function, phi, which did not rely on the gradient of the level-­set function being one, |grad(phi)| = 1. The narrowband DSD2D solver was built on the assumption that |grad(phi)| could be driven to one, and near the boundaries of the explosive this condition was not being satisfied. Since the narrowband is typically no more than10*dx wide, narrowband methods are discrete methods with a fixed, non-resolvable error, where the error is related to the thickness of the band: the narrower the band the larger the errors. Such a solution represents a discrete approximation to the true solution and does not limit to the solution of the underlying PDEs under grid resolution.

97 MATHEMATICS AND COMPUTING↗

A STABLE, ACCURATE METHODOLOGY FOR HIGH MACH NUMBER, STRONG MAGNETIC FIELD MHD TURBULENCE WITH ADAPTIVE MESH REFINEMENT: RESOLUTION AND REFINEMENT STUDIES

Performing a stable, long-duration simulation of driven MHD turbulence with a high thermal Mach number and a strong initial magnetic field is a challenge to high-order Godunov ideal MHD schemes because of the difficulty in guaranteeing positivity of the density and pressure. We have implemented a robust combination of reconstruction schemes, Riemann solvers, limiters, and constrained transport electromotive force averaging schemes that can meet this challenge, and using this strategy, we have developed a new adaptive mesh refinement (AMR) MHD module of the ORION2 code. We investigate the effects of AMR on several statistical properties of a turbulent ideal MHD system with a thermal Mach number of 10 and a plasma {beta}{sub 0} of 0.1 as initial conditions; our code is shown to be stable for simulations with higher Mach numbers (M{sub rms}= 17.3) and smaller plasma beta ({beta}{sub 0} = 0.0067) as well. Our results show that the quality of the turbulence simulation is generally related to the volume-averaged refinement. Our AMR simulations show that the turbulent dissipation coefficient for supersonic MHD turbulence is about 0.5, in agreement with unigrid simulations.

79 ASTRONOMY AND ASTROPHYSICS↗

Robust vehicle routing under uncertainty via branch-price-and-cut

Here, this paper contemplates how branch-price-and-cut solvers can be employed along with the robust optimization paradigm to address parametric uncertainty in the context of vehicle routing problems. In this setting, given postulated uncertainty sets for customer demands and vehicle travel times, one aims to identify a set of cost-effective routes for vehicles to traverse, such that the vehicle capacities and customer time window constraints are respected under any anticipated demand and travel time realization, respectively. To tackle such problems, we propose a novel approach that combines cutting-plane techniques with an advanced branch-price-and-cut algorithm. Specifically, we use deterministic pricing procedures to generate "partially robust" vehicle routes and then utilize robust versions of rounded capacity inequalities and infeasible path elimination constraints to guarantee complete robust feasibility of routing designs against demand and travel time uncertainty. In contrast to recent approaches that modify the pricing algorithm, our approach is both modular and versatile. It permits the use of advanced branch-price-and-cut technologies without significant modification, while it can admit a variety of uncertainty sets that are commonly used in robust optimization but could not be previously employed in a branch-price-and-cut setting.

42 ENGINEERING↗

Low-synch Gram–Schmidt with delayed reorthogonalization for Krylov solvers

The parallel strong-scaling of iterative methods is often determined by the number of global reductions at each iteration. Low-synch Gram-Schmidt algorithms are applied here to the Arnoldi algorithm to reduce the number of global reductions and therefore to improve the parallel strong-scaling of iterative solvers for nonsymmetric matrices such as the GMRES and the Krylov-Schur iterative methods. In the Arnoldi context, the factorization is "left-looking" and processes one column at a time. Among the methods for generating an orthogonal basis for the Arnoldi algorithm, the classical Gram-Schmidt algorithm, with reorthogonalization (CGS2) requires three global reductions per iteration. A new variant of CGS2 that requires only one reduction per iteration is presented and applied to the Arnoldi algorithm. Delayed CGS2 (DCGS2) employs the minimum number of global reductions per iteration (one) for a one-column at-a-time algorithm. The main idea behind the new algorithm is to group global reductions by rearranging the order of operations. DCGS2 must be carefully integrated into an Arnoldi expansion or a GMRES solver. Numerical stability experiments assess robustness for Krylov-Schur eigenvalue computations. Performance experiments on the ORNL Summit supercomputer then establish the superiority of DCGS2 over CGS2.

97 MATHEMATICS AND COMPUTING↗

A Riemann solver for single-phase and two-phase shallow flow models based on relaxation. Relations with Roe and VFRoe solvers

We present a Riemann solver derived by a relaxation technique for classical single-phase shallow flow equations and for a two-phase shallow flow model describing a mixture of solid granular material and fluid. Our primary interest is the numerical approximation of this two-phase solid/fluid model, whose complexity poses numerical difficulties that cannot be efficiently addressed by existing solvers. In particular, we are concerned with ensuring a robust treatment of dry bed states. The relaxation system used by the proposed solver is formulated by introducing auxiliary variables that replace the momenta in the spatial gradients of the original model systems. The resulting relaxation solver is related to Roe solver in that its Riemann solution for the flow height and relaxation variables is formally computed as Roe's Riemann solution. The relaxation solver has the advantage of a certain degree of freedom in the specification of the wave structure through the choice of the relaxation parameters. This flexibility can be exploited to handle robustly vacuum states, which is a well known difficulty of standard Roe's method, while maintaining Roe's low diffusivity. For the single-phase model positivity of flow height is rigorously preserved. For the two-phase model positivity of volume fractions in general is not ensured, and a suitable restriction on the CFL number might be needed. Nonetheless, numerical experiments suggest that the proposed two-phase flow solver efficiently models wet/dry fronts and vacuum formation for a large range of flow conditions. As a corollary of our study, we show that for single-phase shallow flow equations the relaxation solver is formally equivalent to the VFRoe solver with conservative variables of Gallouet and Masella [T. Gallouet, J.-M. Masella, Un schema de Godunov approche C.R. Acad. Sci. Paris, Serie I, 323 (1996) 77-84]. The relaxation interpretation allows establishing positivity conditions for this VFRoe method.

97 MATHEMATICS AND COMPUTING↗

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↗

Direct Estimation of Parameters in ODE Models Using WENDy: Weak-Form Estimation of Nonlinear Dynamics

Abstract We introduce the Weak-form Estimation of Nonlinear Dynamics (WENDy) method for estimating model parameters for non-linear systems of ODEs. Without relying on any numerical differential equation solvers, WENDy computes accurate estimates and is robust to large (biologically relevant) levels of measurement noise. For low dimensional systems with modest amounts of data, WENDy is competitive with conventional forward solver-based nonlinear least squares methods in terms of speed and accuracy. For both higher dimensional systems and stiff systems, WENDy is typically both faster (often by orders of magnitude) and more accurate than forward solver-based approaches. The core mathematical idea involves an efficient conversion of the strong form representation of a model to its weak form, and then solving a regression problem to perform parameter inference. The core statistical idea rests on the Errors-In-Variables framework, which necessitates the use of the iteratively reweighted least squares algorithm. Further improvements are obtained by using orthonormal test functions, created from a set of $$C^{\infty }$$ C ∞ bump functions of varying support sizes.We demonstrate the high robustness and computational efficiency by applying WENDy to estimate parameters in some common models from population biology, neuroscience, and biochemistry, including logistic growth, Lotka-Volterra, FitzHugh-Nagumo, Hindmarsh-Rose, and a Protein Transduction Benchmark model. Software and code for reproducing the examples is available at https://github.com/MathBioCU/WENDy .

97 MATHEMATICS AND COMPUTING↗

Remark on Algorithm 1012: Computing Projections with Large Datasets

In ACM TOMS Algorithm 1012, the DELAUNAYSPARSE software is given for performing Delaunay interpolation in medium to high dimensions. When extrapolating outside the convex hull of the training set, DELAUNAYSPARSE calls the nonnegative least squares solver DWNNLS to compute projections onto the convex hull. However, DWNNLS and many other available sum-of-squares optimization solvers were not intended for usage with many variable problems, which result from the large training sets that are typical in machine learning applications. Thus, a new PROJECT subroutine is given, based on the highly customizable quadratic program solver BQPD. This solution is shown to be as robust as DELAUNAYSPARSE for projection onto both synthetic and real-world datasets, where other available solvers frequently fail. Although it is intended as an update for DELAUNAYSPARSE, due to the difficulty and prevalence of the problem, this solution is likely to be of external interest as well.

97 MATHEMATICS AND COMPUTING↗

Vacuum Neutral Transport Model in UEDGE for Tokamak Far Scrape‐Off Layer

A model for neutral transport in the far scrape-off layer (SOL) vacuum region (vacuum neutral model) has been developed and implemented in UEDGE. Free-streaming neutral trajectories between the outermost UEDGE boundary and the vessel wall are preprocessed using DEGAS2 to construct a tele-transport matrix that captures non-local neutral relocation through the vacuum. Here, this matrix is then used in UEDGE as a non-local boundary condition for the neutral equations, preserving the robustness and convergence of the implicit solver without introducing statistical noise. Simulations of a DIII-D lower single-null configuration show that the vacuum neutral model relocates neutrals from the divertor to the upstream region, increasing the outer midplane separatrix density required for detachment onset by about 30%. However, the characteristic target temperature at detachment (T e, osp ~ 3 - 4eV) and the radiation front behavior remain unchanged.

DEGAS2↗

A Scalable Reduced‐Order Model for the Steady Navier–Stokes Equations

Scaling up new scientific technologies from laboratory to industry often involves demonstrating performance on a larger scale. Computer simulations can accelerate design and predictions in the deployment process, though traditional numerical methods are computationally intractable even for intermediate pilot plant scales. Recently, the component reduced order modeling method has been developed to tackle this challenge by combining projection reduced order modeling and discontinuous Galerkin domain decomposition. However, while many scientific or engineering applications involve nonlinear physics, this method has only been demonstrated for various linear systems. In this work, the component reduced order modeling method is extended to steady Navier–Stokes flow, with application to general nonlinear physics in view. The large‐scale, global domain is decomposed into a combination of small‐scale unit component. Linear subspaces for flow velocity and pressure are identified via proper orthogonal decomposition over sample snapshots collected from each small‐scale unit component. Velocity bases are augmented with a pressure supremizer to satisfy the inf–sup condition for stable pressure prediction. Two different nonlinear reduced order modeling methods are employed and compared for efficient evaluation of nonlinear advection: A third‐order tensor projection operator and the empirical quadrature procedure. The proposed method is demonstrated on the flow over arrays of five different unit objects, achieving a 23‐fold speedup with less than 4% relative error in domains up to 256 times larger than the unit components. Furthermore, a numerical experiment with the pressure supremizer strongly indicates the need for a supremizer for stable pressure prediction. A comparison between the tensorial approach and the empirical quadrature procedure revealed a slight advantage of the empirical quadrature procedure. The framework is compared with an alternating Schwarz‐based reduced‐order approach, demonstrating improved efficiency and robustness for the DG‐based global solver while retaining flexibility for sub‐scale iterative solvers. The method is further extended to a coupled advection–diffusion and Navier–Stokes system, illustrating its applicability to multi‐physics problems and its potential for more general, inter‐coupled nonlinear systems.

42 ENGINEERING↗

High-Fidelity Energy Deposition Ignition Model Coupled with Flame Propagation Models at Engine-like Flow Conditions

With the heightened pressure on car manufacturers to increase the efficiency and reduce the carbon emissions of their fleets, more challenging engine operation has become a viable option. Highly dilute, boosted, and stratified charge, among others, promise engine efficiency gains and emissions reductions. At such demanding engine conditions, the spark-ignition process is a key factor for the flame initiation propagation and the combustion event. From a computational standpoint, there exist multiple spark-ignition models that perform well under conventional conditions but are not truly predictive under strenuous engine operation modes, where the underlying physics needs to be expanded. In this paper, a hybrid Lagrangian-Eulerian spark-ignition (LESI) model is coupled with different turbulence models, grid sizes, and combustion models. The ignition model, previously developed, relies on coupling Eulerian energy deposition with a Lagrangian particle evolution of the spark channel, at every time-step. The spark channel is attached to the electrodes and allowed to elongate at a speed derived from the flow velocity. The LESI model is used to simulate spark ignition in a nonquiescent crossflow environment at engine-like conditions, using converge commercial computational fluid dynamics (CFD) solver. The results highlight the consistency, robustness, and versatility of the model in a range of engine-like setups, from typical with Reynolds-averaged Navier-Stokes (RANS) and a larger grid size to high fidelity with large-eddy simulation (LES) and a finer grid size. The flame kernel growth is then evaluated against Schlieren images from an optical constant volume ignition chamber with a focus on the performance of flame propagation models, such as G-equation and thickened flame model, versus the baseline well-stirred reactor model. Finally, future development details are discussed.

Advanced ignition modeling↗

Incorporation of Reaction Kinetics into a Multiphase, Hydrodynamic Model of a Fischer Tropsch Slurry Bubble Column Reactor

This paper describes the development of a computational multiphase fluid dynamics (CMFD) model of the Fischer Tropsch (FT) process in a Slurry Bubble Column Reactor (SBCR). The CMFD model is fundamentally based which allows it to be applied to different industrial processes and reactor geometries. The NPHASE CMFD solver [1] is used as the robust computational platform. Results from the CMFD model include gas distribution, species concentration profiles, and local temperatures within the SBCR. This type of model can provide valuable information for process design, operations and troubleshooting of FT plants. An ensemble-averaged, turbulent, multi-fluid solution algorithm for the multiphase, reacting flow with heat transfer was employed. Mechanistic models applicable to churn turbulent flow have been developed to provide a fundamentally based closure set for the equations. In this four-field model formulation, two of the fields are used to track the gas phase (i.e., small spherical and large slug/cap bubbles), and the other two fields are used for the liquid and catalyst particles. Reaction kinetics for a cobalt catalyst is based upon values reported in the published literature. An initial, reaction kinetics model has been developed and exercised to demonstrate viability of the overall solution scheme. The model will continue to be developed with improved physics added in stages.

10 SYNTHETIC FUELS↗

Fast solvers for tokamak fluid models with PETSc

Multigrid (MG) is widely recognized as a highly effective solver for the model problem, the Laplacian, but textbook MG fails on most problems of interest. MG methods have been applied to complex, real-world applications with careful consideration of the physical model and discretization. In this work we develop the first step in applying MG methods to science and engineering relevant magnetohydrodynamics (MHD) tokamak models in the M3D-C1 (https://m3dc1.pppl.gov) fusion energy science code. The semi-implicit time integrator in M3D-C1 is composed of many linear solves. The implicit advance of the momentum equation is the most challenging and is the focus of this work. The current production solver in M3D-C1 is a block Jacobi (BJ) preconditioner within a Krylov solver, where blocks group degrees of freedom on planes of constant toroidal coordinate. BJ convergence degrades as the number of planes increases due to the spectral properties of the matrix preconditioned with BJ. The partially magnetic field-aligned, regular toroidal grid structure in M3D-C1 is amenable to semi-coarsening geometric MG in the toroidal direction. This paper develops such a solver and demonstrates competitive performance on a runaway electron model of a SPARC (https://cfs.energy/technology/sparc) disruption, and superior robustness on a stellarator model on which the BJ solver fails to converge.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Algebraic Multigrid with Filtering: An Efficient Preconditioner for Interior Point Methods in Large-Scale Contact Mechanics Optimization

Large-scale contact mechanics simulations are crucial in many engineering fields such as structural design and manufacturing. In the frictionless case, contact can be modeled by minimizing an energy functional; however, these problems are often nonlinear, nonconvex, and increasingly difficult to solve as mesh resolution increases. In this work, we employ a Newton-based interior-point (IP) filter line-search method, an effective approach for large-scale constrained optimization. While this method converges rapidly, each iteration requires solving a large saddle-point linear system that becomes ill-conditioned as the optimization process converges, largely due to IP treatment of the contact constraints. Such ill-conditioning can hinder solver scalability and increase iteration counts with mesh refinement. Here, to address this, we introduce a novel preconditioner, algebraic multigrid with filtering (AMGF), tailored to the Schur complement of the saddle-point system. Building on the classical AMG solver, commonly used for elasticity, we augment it with a specialized subspace correction that filters near null space components introduced by contact interface constraints. Through theoretical analysis and numerical experiments on a range of linear and nonlinear contact problems, we demonstrate that the proposed solver achieves mesh independent convergence and maintains robustness against the ill-conditioning that notoriously plagues IP methods. These results indicate that AMGF makes contact mechanics simulations more tractable and broadens the applicability of Newton-based IP methods in challenging engineering scenarios. More broadly, AMGF is well suited for problems, optimization or otherwise, where solver performance is limited by a low-dimensional subspace, such as those arising from localized constraints, interface conditions, or model heterogeneities. This makes the method widely applicable beyond contact mechanics and constrained optimization.

Mathematics and Computing↗

A scalable DG solver for the electroneutral Nernst-Planck equations

The robust, scalable simulation of flowing electrochemical systems is increasingly important due to the synergy between intermittent renewable energy and electrochemical technologies such as energy storage and chemical manufacturing. The high Péclet regime of many such applications prevents the use of off-the-shelf discretization methods. In this work, we present a high-order Discontinuous Galerkin scheme for the electroneutral Nernst-Planck equations. The chosen charge conservation formulation allows for the specific treatment of the different physics: upwinding for advection and migration, and interior penalty for diffusion of ionic species as well the electric potential. Similarly, the formulation enables different treatments in the preconditioner: AMG for the potential blocks and ILU-based methods for the advection-dominated concentration blocks. Here we evaluate the convergence rate of the discretization scheme through numerical tests. Strong scaling results for two preconditioning approaches are shown for a large 3D flow-plate reactor example.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

High-order two-fluid plasma solver for direct numerical simulations of plasma flows with full transport phenomena

The two-fluid plasma equations for a single ion species, with full transport terms, including temperature and magnetic field dependent ion and electron viscous stresses and heat fluxes, frictional drag force, and ohmic heating terms, have been implemented in the CFDNS code and solved by using sixth-order non-dissipative compact finite differences for plasma flows in several different regimes. In order to be able to fully resolve all the dynamically relevant time and length scales, while maintaining computational feasibility, the assumptions of infinite speed of light and negligible electron inertia have been made. Non-dimensional analysis of the two-fluid plasma equations shows that, by varying the characteristic/background number density, length scale, temperature, and magnetic strength, the corresponding Hall, resistive, and ideal magnetohydrodynamic equations can be recovered as limiting cases. The accuracy and robustness of this two-fluid plasma solver in handling plasma flows in different regimes have been validated against four canonical problems: Alfven and whistler dispersion relations, electromagnetic plasma shock, and magnetic reconnection. For all test cases, by using physical dissipation and diffusion, with negligible numerical dissipation/diffusion, fully converged Direct Numerical Simulation (DNS)-like solutions are obtained when the ion Reynolds number based on the grid size is smaller than a threshold value which is about 2.3. For the magnetic reconnection problem, the results show that the magnetic flux saturation time and value converge when the ion and magnetic Reynolds numbers are large enough. Thus, the DNS-like results become relevant to practical problems with much larger Reynolds numbers.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗