Search NASA⌕ Search

SEARCH · Search NASA

Results for “implicit solvers”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

A sharp immersed method for 2D flow-body interactions using the vorticity-velocity Navier-Stokes equations

Immersed methods discretize boundary conditions for complex geometries on background Cartesian grids. Here, this makes such methods especially suitable for two-way coupled flow-body problems, where the body mechanics are partially driven by hydrodynamic forces. However, for the vorticity-velocity form of the Navier-Stokes equations, existing immersed geometry discretizations for two-way coupled problems only achieve first order spatial accuracy near solid boundaries. Here we introduce a sharp-interface approach based on the immersed interface method to handle the one- and two-way coupling between an incompressible flow and one or more rigid bodies using the 2D vorticity-velocity Navier-Stokes equations. Our main contributions are three-fold. First, we develop and analyze a moving boundary treatment for sharp immersed methods that can be applied to PDEs with implicitly defined boundary conditions, such as those commonly imposed on the vorticity field. Second, we develop a two-way coupling methodology for the vorticity-velocity Navier-Stokes equations based on control-volume momentum balance that does not require the pressure field. Third, we show through extensive testing and validation that our resulting flow-body solver reaches second-order accuracy for most practical scenarios, and provides significant efficiency benefits compared to a representative first-order approach.

42 ENGINEERING↗
DOE OSTI2025

The latent variable proximal point algorithm for variational problems with inequality constraints

The latent variable proximal point (LVPP) algorithm is a framework for solving infinite-dimensional variational problems with pointwise inequality constraints. The algorithm is a saddle point reformulation of the Bregman proximal point algorithm. At the continuous level, the two formulations are equivalent, but the saddle point formulation is more amenable to discretization because it introduces a structure-preserving transformation between a latent function space and the feasible set. Working in this latent space is much more convenient for enforcing inequality constraints than the feasible set, as discretizations can employ general linear combinations of suitable basis functions, and nonlinear solvers can involve general additive updates. LVPP yields numerical methods with observed mesh-independence for obstacle problems, contact, fracture, plasticity, and others besides; in many cases, for the first time. The framework also extends to more complex constraints, providing means to enforce convexity in the Monge–Ampère equation and handling quasi-variational inequalities, where the underlying constraint depends implicitly on the unknown solution. Here, in this paper, we describe the LVPP algorithm in a general form and apply it to ten problems from across mathematics.

Inequality constraints↗
DOE OSTI2015

Assessing a mini-application as a performance proxy for a finite element method engineering application

The performance of a large-scale, production-quality science and engineering application (‘app’) is often dominated by a small subset of the code. Even within that subset, computational and data access patterns are often repeated, so that an even smaller portion can represent the performance-impacting features. If application developers, parallel computing experts, and computer architects can together identify this representative subset and then develop a small mini-application (‘miniapp’) that can capture these primary performance characteristics, then this miniapp can be used to both improve the performance of the app as well as provide a tool for co-design for the high-performance computing community. However, a critical question is whether a miniapp can effectively capture key performance behavior of an app. This study provides a comparison of an implicit finite element semiconductor device modeling app on unstructured meshes with an implicit finite element miniapp on unstructured meshes. The goal is to assess whether the miniapp is predictive of the performance of the app. Finally, single compute node performance will be compared, as well as scaling up to 16,000 cores. Results indicate that the miniapp can be reasonably predictive of the performance characteristics of the app for a single iteration of the solver on a single compute node.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Generalized fictitious methods for fluid–structure interactions: Analysis and simulations

We present a new fictitious pressure method for fluid–structure interaction (FSI) problems in incompressible flow by generalizing the fictitious mass and damping methods we published previously in [1]. The fictitious pressure method involves modification of the fluid solver whereas the fictitious mass and damping methods modify the structure solver. We analyze all fictitious methods for simplified problems and obtain explicit expressions for the optimal reduction factor (convergence rate index) at the FSI interface [2]. This analysis also demonstrates an apparent similarity of fictitious methods to the FSI approach based on Robin boundary conditions, which have been found to be very effective in FSI problems. We implement all methods, including the semi-implicit Robin based coupling method, in the context of spectral element discretization, which is more sensitive to temporal instabilities than low-order methods. However, the methods we present here are simple and general, and hence applicable to FSI based on any other spatial discretization. In numerical tests, we verify the selection of optimal values for the fictitious parameters for simplified problems and for vortex-induced vibrations (VIV) even at zero mass ratio (“for-ever-resonance”). We also develop an empirical a posteriori analysis for complex geometries and apply it to 3D patient-specific flexible brain arteries with aneurysms for very large deformations. We demonstrate that the fictitious pressure method enhances stability and convergence, and is comparable or better in most cases to the Robin approach or the other fictitious methods.

Computer Science↗
DOE OSTI2022

Extension of the high-resolution thermal-hydraulics code ESCOT to hexagonal core geometries for multi-physics calculations

The extension of the capabilities of the pin-level nuclear reactor core thermal-hydraulics (T/H) code ESCOT to analyze hexagonal fueled cores and its performance are presented. ESCOT is an accurate yet fast core thermal-hydraulics solution aiming at high-fidelity and high-resolution multi-physics core analysis in the framework of massively parallel computing platforms. Its algorithm solution is based on the four-equation drift-flux model for two-phase calculations, these are numerically solved by applying the Finite Volume Method (FVM) and the Semi-Implicit Method for Pressure-Linked Equation (SIMPLE)-like algorithm in a staggered grid system. Constitutive models such as turbulent mixing, pressure drop, and vapor generation are employed to simulate key phenomena in subchannel-scale analysis. ESCOT is parallelized by a double (radial and axial) domain decomposition that enables its highly parallelized execution. The coupling of the code with the neutronics whole core solver for hexagonal geometries nTRACER is described. The newly implemented ESCOT features are validated by comparing single assembly and full core steady state nTRACER-ESCOT solutions with nTRACER standalone internal one-dimensional T/H solver results. The validation problems are based on the VVER 440 and VVER 1000 cores. ESCOT results show differences within an acceptable range with respect to the simple 1D nTRACER built-in solver. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2017

A scalable nonlinear fluid–structure interaction solver based on a Schwarz preconditioner with isogeometric unstructured coarse spaces in 3D

Nonlinear fluid-structure interaction (FSI) problems on unstructured meshes in 3D appear many applications in science and engineering, such as vibration analysis of aircrafts and patient-specific diagnosis of cardiovascular diseases. In this work, we develop a highly scalable, parallel algorithmic and software framework for FSI problems consisting of a nonlinear fluid system and a nonlinear solid system, that are coupled monolithically. The FSI system is discretized by a stabilized finite element method in space and a fully implicit backward difference scheme in time. To solve the large, sparse system of nonlinear algebraic equations at each time step, we propose an inexact Newton-Krylov method together with a multilevel, smoothed Schwarz preconditioner with isogeometric coarse meshes generated by a geometry preserving coarsening algorithm. Here ''geometry'' includes the boundary of the computational domain and the wet interface between the fluid and the solid. We show numerically that the proposed algorithm and implementation are highly scalable in terms of the number of linear and nonlinear iterations and the total compute time on a supercomputer with more than 10,000 processor cores for several problems with hundreds of millions of unknowns.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A fast, matrix-based method to perform omnidirectional pressure integration

Abstract Experimentally-measured pressure fields play an important role in understanding many fluid dynamics problems. Unfortunately, pressure fields are difficult to measure directly with non-invasive, spatially resolved diagnostics, and calculations of pressure from velocity have proven sensitive to error in the data. Omnidirectional line integration methods are usually more accurate and robust to these effects as compared to implicit Poisson equations, but have seen slower uptake due to the higher computational and memory costs, particularly in 3D domains. This paper demonstrates how omnidirectional line integration approaches can be converted to a matrix inversion problem. This novel formulation uses an iterative approach so that the boundary conditions are updated each step, preserving the convergence behavior of omnidirectional schemes while also keeping the computational efficiency of Poisson solvers. This method is implemented in Matlab and also as a GPU-accelerated code in CUDA-C++. The behavior of the new method is demonstrated on 2D and 3D synthetic and experimental data. Three-dimensional grid sizes of up to 125 million grid points are tractable with this method, opening exciting opportunities to perform volumetric pressure field estimation from 3D PIV measurements.

42 ENGINEERING↗
DOE OSTI2013

Adaptive Implicit Non-Equilibrium Radiation Diffusion

We describe methods for accurate and efficient long term time integra- tion of non-equilibrium radiation diffusion systems: implicit time integration for effi- cient long term time integration of stiff multiphysics systems, local control theory based step size control to minimize the required global number of time steps while control- ling accuracy, dynamic 3D adaptive mesh refinement (AMR) to minimize memory and computational costs, Jacobian Free Newton-Krylov methods on AMR grids for efficient nonlinear solution, and optimal multilevel preconditioner components that provide level independent solver convergence.

Philip, Bobby↗
DOE OSTI2018

Verification of iterative matrix solutions for multipoint kinetics equations

Multipoint kinetic equation systems have been solved numerically using matrix algebra software and 1st to 4th order implicit schemes based on single-step matrix propagators. These matrix schemes have been validated successfully on demanding point kinetics benchmarks with various prescribed reactivity insertions. Verification tests have also been performed on a simple 3-region fast reactor core model with asymmetric step or ramp reactivity insertions and cross-checked with the multipoint kinetics SACRE code developed at INL and based on existing and validated stiff ODE solver packages. Accurate results can be obtained at a limited time expense. The reason for intriguing results obtained in some transients has been elucidated and linked to the multipoint matrix coefficient interpolation method during the transient.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2015

Multirate Particle-in-Cell Time Integration Techniques of Vlasov-Maxwell Equations for Collisionless Kinetic Plasma Simulations

A multi-rate PIC formulation was developed that employs large timesteps for slow field evolution, and small (adaptive) timesteps for particle orbit integrations. Implementation is based on a JFNK solver with nonlinear elimination and moment preconditioning. The approach is free of numerical instabilities (ω pe Δt >>1, and Δx >> λ D ), and requires many fewer dofs (vs. explicit PIC) for comparable accuracy in challenging problems. Significant gains (vs. conventional explicit PIC) may be possible for large scale simulations. The paper is organized as follows: Vlasov-Maxwell Particle-in-cell (PIC) methods for plasmas; Explicit, semi-implicit, and implicit time integrations; Implicit PIC formulation (Jacobian-Free Newton-Krylov (JFNK) with nonlinear elimination allows different treatments of disparate scales, discrete conservation properties (energy, charge, canonical momentum, etc.)); Some numerical examples; and Summary.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2017

An overlapping Domain Decomposition preconditioning method for monolithic solution of shear bands

Metals subjected to high strain rate impact often exhibit a sudden and profound drop in the material’s load bearing capability, a ductile failure phenomenon known as shear banding. Shear bands, characterized as material instabilities, are driven by shear heating and described as narrow regions that have sustained intense plastic deformation and high temperature rise. This coupled thermo-mechanical localization problem can be formulated as a nonlinear system with two balance equations, momentum and energy, and two constitutive laws for elasticity and plasticity. Here in our formulation, mixed finite elements are used to discretize the equations in space and an implicit finite difference scheme is used to advance the system in time, where at every time step, a Newton type method is used to solve the system monolithically. To that end, a block Jacobian matrix is formed analytically using Gâteaux derivatives. The resulting Jacobian is sparse, nonsymmetric and its sparsity pattern and eigenvalue content vary with the different stages of shear bands formation, consequently posing a significant challenge to iterative solvers. To address this issue, an overlapping Domain Decomposition preconditioner that takes into account the physics of shear bands and the domain in which it forms, is proposed. The key idea is to resolve the shear band domain accurately while only solving the remaining domain approximately, with selective updates when necessary. The preconditioner is formed on the basis of an additive Schwartz method that is applied to a Schur complement partition of the system. The proposed preconditioner is implemented in parallel and tested on three different benchmark problems as compared against off-the-shelf solvers. We study the effect of h- and k-refinement that are obtained from Isogeometric discretizations of the system, the overlapping strategy and its parallel performance. Excellent performance is demonstrated in serial and parallel on all benchmark examples.

42 ENGINEERING↗
DOE OSTI2022

An unconditionally stable, time-implicit algorithm for solving the one-dimensional Vlasov–Poisson system

The development of an implicit, unconditionally stable, numerical method for solving the Vlasov–Poisson system in one dimension using a phase-space grid is presented. The algorithm uses the Crank–Nicolson discretization scheme and operator splitting allowing for direct solution of the finite difference equations. This method exactly conserves particle number, enstrophy and momentum. A variant of the algorithm which does not use splitting also exactly conserves energy but requires the use of iterative solvers. This algorithm has no dissipation and thus fine-scale variations can lead to oscillations and the production of negative values of the distribution function. We find that overall, the effects of negative values of the distribution function are relatively benign. We consider a variety of test cases that have been used extensively in the literature where numerical results can be compared with analytical solutions or growth rates. We examine higher-order differencing and construct higher-order temporal updates using standard composition methods.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2016

A hybrid incremental projection method for thermal-hydraulics applications

In this paper, a new second-order accurate, hybrid, incremental projection method for time-dependent incompressible viscous flow is introduced in this paper. The hybrid finite-element/finite-volume discretization circumvents the well-known Ladyzhenskaya–Babuška–Brezzi conditions for stability, and does not require special treatment to filter pressure modes by either Rhie–Chow interpolation or by using a Petrov–Galerkin finite element formulation. The use of a co-velocity with a high-resolution advection method and a linearly consistent edge-based treatment of viscous/diffusive terms yields a robust algorithm for a broad spectrum of incompressible flows. The high-resolution advection method is shown to deliver second-order spatial convergence on mixed element topology meshes, and the implicit advective treatment significantly increases the stable time-step size. The algorithm is robust and extensible, permitting the incorporation of features such as porous media flow, RANS and LES turbulence models, and semi-/fully-implicit time stepping. A series of verification and validation problems are used to illustrate the convergence properties of the algorithm. The temporal stability properties are demonstrated on a range of problems with 2 ≤ CFL ≤ 100. The new flow solver is built using the Hydra multiphysics toolkit. The Hydra toolkit is written in C++ and provides a rich suite of extensible and fully-parallel components that permit rapid application development, supports multiple discretization techniques, provides I/O interfaces, dynamic run-time load balancing and data migration, and interfaces to scalable popular linear solvers, e.g., in open-source packages such as HYPRE, PETSc, and Trilinos.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

A tightly-coupled domain-decomposition approach for highly nonlinear stochastic multiphysics systems

Multiphysics simulations often involve nonlinear components that are driven by internally generated or externally imposed random fluctuations. When used with a domain-decomposition (DD) algorithm, such components have to be coupled in a way that both accurately propagates the noise between the subdomains and lends itself to a stable and cost-effective temporal integration. We develop a conservative DD approach in which tight coupling is obtained by using a Jacobian-free Newton–Krylov (JfNK) method with a generalized minimum residual iterative linear solver. This strategy is tested on a coupled nonlinear diffusion system forced by a truncated Gaussian noise at the boundary. Enforcement of path-wise continuity of the state variable and its flux, as opposed to continuity in the mean, at interfaces between subdomains enables the DD algorithm to correctly propagate boundary fluctuations throughout the computational domain. Reliance on a single Newton iteration (explicit coupling), rather than on the fully converged JfNK (implicit) coupling, may increase the solution error by an order of magnitude. Increase in communication frequency between the DD components reduces the explicit coupling's error, but makes it less efficient than the implicit coupling at comparable error levels for all noise strengths considered. Finally, the DD algorithm with the implicit JfNK coupling resolves temporally-correlated fluctuations of the boundary noise when the correlation time of the latter exceeds some multiple of an appropriately defined characteristic diffusion time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Compressible, multiphase semi-implicit method with moment of fluid interface representation

A unified method for simulating multiphase flows using an exactly mass, momentum, and energy conserving Cell-Integrated Semi-Lagrangian advection algorithm is presented. The deforming material boundaries are represented using the moment-of-fluid method. Our new algorithm uses a semi-implicit pressure update scheme that asymptotically preserves the standard incompressible pressure projection method in the limit of infinite sound speed. The asymptotically preserving attribute makes the new method applicable to compressible and incompressible flows including stiff materials; enabling large time steps characteristic of incompressible flow algorithms rather than the small time steps required by explicit methods. Moreover, shocks are captured and material discontinuities are tracked, without the aid of any approximate or exact Riemann solvers. As a result, wimulations of underwater explosions and fluid jetting in one, two, and three dimensions are presented which illustrate the effectiveness of the new algorithm at efficiently computing multiphase flows containing shock waves and material discontinuities with large “impedance mismatch.”

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Development of an Advanced Simulator to Model Mobility Control and Geomechanics during CO 2 Floods

The simulator is an isothermal, three-dimensional, four-phase, compositional, equation-of–state (EOS) simulator. We have named the simulator UTDOE-CO2 capable of simulating various recovery processes (i.e., primary, secondary waterflooding, and miscible and immiscible gas flooding). We include both the Peng-Robinson EOS and the Redlich-Kwong EOS models. A Gibbs stability test is also included in the model to perform a phase identification test to consistently label each phase for subsequent property calculations such as relative permeability, viscosity, density, interfacial tension, and capillary pressure. Our time step strategy is based on an IMPEC-type method (implicit pressure and explicit concentration). The gridblock pressure is solved first using the explicit dating of saturation-dependent terms. Subsequently, the material balance equations are solved explicitly for the total concentration of each component. The physical dispersion term is also included in the governing equations. The simulator includes (1) several foam model(s) for gas mobility control, (2) compositional relative permeability models with the hysteresis option, (3) corner point grid and several efficient solvers, (4) geomechanics module to compute stress field as the result of CO 2 injection/production, (5) the format of commercial visualization software, S3graf from Science-soft Ltd., was implemented for user friendly visualization of the simulation results. All tasks are completed and the simulator was fully tested and delivered to the DOE office including a user’s guide and several input files and the executable for Windows Pcs. We have published several SPE papers, presented several posters, and one MS thesis is completed (V. Pudugramam, 2013) resulting from this DOE funded project.

02 PETROLEUM↗
DOE OSTI2016

Developing A Fully Implicit Compressible Flow Valve Model in RELAP-7 and Its Application in Short Term BWR Station Black-Out Analyses

This paper presents a set of dynamical models for SRV simulation and their implementation in the RELAP-7 code, which is a new reactor system analysis code being developed at INL. RELAP-7 is based on the MOOSE (the Multi-Physics Object-Oriented Simulation Environment) framework. The compressible flow SRV model covers three different sets of models: fully closed case, subsonic case, and choking case. The RELAP-7 is a fully implicit code and the preconditioned Jacobian-free Newton-Krylov (JFNK) method is used to solve the discretized nonlinear problem. The JFNK method generally needs a good preconditioning scheme to be effective and efficient. There are different ways to precondition the JFNK method. In RELAP-7, two main options are used to obtain the preconditioning matrix: (1) FDP (Finite Difference Preconditioning) option which uses the default finite differencing method provided in the PETSc package. PETSc is the numerical solver software developed by Argonne National Laboratory and used by MOOSE as the numerical solution engine; (2) SMP (Single Matrix Preconditioning) option which requires code developers to provide approximate analytical Jacobian inputs for the important diagonal and off-diagonal terms. Due to the strong discontinuity in the residual vector space when the compressible flow valve model switches from one set of model to another, FDP option cannot guarantee convergence. Instead, accurate analytical Jacobain terms are provided for the compressible flow valve model. With the SMP option selected, the compressible flow valve model can be solved efficiently under different cases. The developed compressible flow valve model has been used for SRV component simulation in several simplified BWR SBO (Station Black-Out) simulations with RELAP-7. This paper only presents cases for short-term SBO in which all the safety systems fail to start and function properly when SBO occurs. Consequently, only the SRVs automatically open and close periodically to control the primary system pressure and discharge the high temperature and high pressure steam into the suppression pool. Although simplified, this case is quite similar to what happened in Fukushima Daiichi Unit 1. Unit 1 had no RCIC system, while the isolation condenser system was believed to be non-functioning, or only available for a very short period of time during the accident. Therefore, the Unit 1 reactor core reached a fuel failure temperature only a few hours into the accident. Two short-term SBO cases will be compared: one with single SRV discharge line which represents all the SRV lines and another case with multi-group SRVs which represent each group of SRV line with different setting points.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2013

Solving implicit multi-mesh flow and conjugate heat transfer problems with RELAP-7

The fully implicit simulation capability of RELAP-7 to solve multi-mesh flow and conjugate heat transfer problems for reactor system safety analysis is presented. Compared to general single-mesh simulations, the reactor system safety analysis-type of code has unique challenges due to its highly simplified, interconnected, one-dimensional, and zero-dimensional flow network describing multiple physics with significantly different time and length scales. To use the Jacobian-free Newton Krylov-type of solver, preconditioning is generally required for the Krylov method. The uniqueness of the reactor safety analysis-type of code in treating the interconnected flow network and conjugate heat transfer also introduces challenges in providing preconditioning matrix. Typical flow and conjugate heat transfer problems involved in reactor safety analysis using RELAP-7, as well as the special treatment on the preconditioning matrix are presented in detail. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗