Search NASA⌕ Search

SEARCH · Search NASA

Results for “implicit method”

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 487 records · Page 27

A Hybrid Gradient Method to Designing Bayesian Experiments for Implicit Models

Bayesian experimental design (BED) aims at designing an experiment to maximize the information gathering from the collected data. The optimal design is usually achieved by maximizing the mutual information (MI) between the data and the model parameters. When the analytical expression of the MI is unavailable, e.g.,having implicit models with intractable data distributions, a neural network-based lower bound of the MI was recently proposed and a gradient ascent method was used to maximize the lower bound [1]. However, the approach in [1] requires a pathwise sampling path to compute the gradient of the MI lower bound with respect to the design variables, and such a pathwise sampling path is usually inaccessible for implicit models. In this work, we propose a hybrid gradient approach that leverages recent advances in variational MI estimator and evolution strategies (ES)combined with black-box stochastic gradient ascent (SGA) to maximize the MI lower bound. This allows the design process to be achieved through a unified scalable procedure for implicit models without sampling path gradients. Several experiments demonstrate that our approach significantly improves the scalability of BED for implicit models in high-dimensional design space.

Zhang, Jiaxin↗

Stage-parallel fully implicit Runge–Kutta solvers for discontinuous Galerkin fluid simulations

In this paper, we develop new techniques for solving the large, coupled linear systems that arise from fully implicit Runge–Kutta methods. This method makes use of the iterative preconditioned GMRES algorithm for solving the linear systems, which has seen success for fluid flow problems and discontinuous Galerkin discretizations. By transforming the resulting linear system of equations, one can obtain a method which is much less computationally expensive than the untransformed formulation, and which compares competitively with other time-integration schemes, such as diagonally implicit Runge–Kutta (DIRK) methods. We develop and test several ILU-based preconditioners effective for these large systems. We additionally employ a parallel-in-time strategy to compute the Runge–Kutta stages simultaneously. Numerical experiments are performed on the Navier–Stokes equations using Euler vortex and 2D and 3D NACA airfoil test cases in serial and in parallel settings. In conclusion, the fully implicit Radau IIA Runge–Kutta methods compare favorably with equal-order DIRK methods in terms of accuracy, number of GMRES iterations, number of matrix–vector multiplications, and wall-clock time, for a wide range of time steps.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Recursive integral method with Cayley transformation

Summary The recently developed RIM (recursive integral method) finds eigenvalues in a region of the complex plane. It computes an indicator to test if the region contains eigenvalues using an approximate spectral projection. If the indicator shows that the region contains eigenvalues, it is subdivided into smaller regions, which are then recursively tested and subdivided until any eigenvalues are isolated to a specified precision. We propose an enhancement to RIM that uses Cayley transformations and Arnoldi's method to greatly decrease the number of factorizations required to solve the linear systems that arise from a discretized contour integral to compute the indicator, which substantially reduces the computational cost. We demonstrate the efficacy of our method with numerical examples and compare with the implicitly restarted Arnoldi method, as implemented in eigs in MATLAB.

Huang, R.↗

Some problems of the calculation of three-dimensional boundary layer flows on general configurations

An accurate solution of the three-dimensional boundary layer equations over general configurations such as those encountered in aircraft and space shuttle design requires a very efficient, fast, and accurate numerical method with suitable turbulence models for the Reynolds stresses. The efficiency, speed, and accuracy of a three-dimensional numerical method together with the turbulence models for the Reynolds stresses are examined. The numerical method is the implicit two-point finite difference approach (Box Method) developed by Keller and applied to the boundary layer equations by Keller and Cebeci. In addition, a study of some of the problems that may arise in the solution of these equations for three-dimensional boundary layer flows over general configurations.

Cebeci, T.↗

Investigation on numerical method of one-dimensional drift flux model for boiling two-phase flow

A numerical method for the solution of one-dimension drift-flux model has been developed. Correlations for heat and mass transfer and kinematic constitutive equation were used to close the set of the partial differential equations. The finite volume method based on the staggered grid and fully implicit backward Euler method were applied to discretize the spatial and time differential items, respectively. The discretization equations were solved iteratively in a same manner as in SIMPLE method for a single-phase flow. The verification and validation of the numerical method and closure model for one-dimension drift-flux model have been performed by comparing the code solution with the experimental data. Furthermore, the axial distribution of void fraction and pressure also have been investigated under different heated case. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Extreme scale unstructured adaptive CFD for aerodynamic flow control

Understanding the flow of fluid, either liquid or gas, through and around solid bodies has challenged man since the dawn of scientific inquiry. Many of the great minds of science and mathematics have progressively built up a hierarchy of fluid models since fluid flow impacts our lives in so many fundamental ways - from the early days of flow of water in viaducts to cities, to today's flight of planes. This chapter is concerned with the computational modeling of turbulent flow around aerodynamic bodies such as planes and wind turbines. In this case, viscous effects near the solid bodies create very thin boundary layers that yield highly anisotropic (gradients normal to the surface may be 10 6 larger than gradients along the surface) solutions to the governing non-linear partial differential equations (PDE); the Navier-Stokes equations. Furthermore, turbulent flows develop extremely broad ranges of length and time scales motivating the use of discretization methods capable of employing adaptivity and implicit time integration. The combination of these features - non-linear, anisotropy, adaptivity, and implicit - dramatically raise the complexity of the discretization, posing large challenges to efficient scalable parallel implementation. However, through careful design, the more complex algorithms can provide great reductions in computational cost relative to simpler methods (e.g., Cartesian grids with explicit time integration) that are easier to mate efficiently to hardware. In this chapter, we not only describe our approach but we also address the fact that while complex algorithms may never be as efficient flop-for-flop as simple methods, in the important measure of science-per-core-hour, they can still win big by making complex features like adaptivity and implicit methods as efficient and scalable as possible.

42 ENGINEERING↗

The Use of Non-Standard Devices in Finite Element Analysis

A general mathematical description of the response behavior of thin-skin pneumatic envelopes and many other membrane and cable structures produces under-constrained systems that pose severe difficulties to analysis. These systems are mobile, and the general mathematical description exposes the mobility. Yet the response behavior of special under-constrained structures under special loadings can be accurately predicted using a constrained mathematical description. The static response behavior of systems that are infinitesimally mobile, such as a non-slack membrane subtended from a rigid or elastic boundary frame, can be easily analyzed using such general mathematical description as afforded by the non-linear, finite element method using an implicit solution scheme if the incremental uploading is guided through a suitable path. Similarly, if such structures are assembled with structural lack of fit that provides suitable self-stress, then dynamic response behavior can be predicted by the non-linear, finite element method and an implicit solution scheme. An explicit solution scheme is available for evolution problems. Such scheme can be used via the method of dynamic relaxation to obtain the solution to a static problem. In some sense, pneumatic envelopes and many other compliant structures can be said to have destiny under a specified loading system. What that means to the analyst is that what happens on the evolution path of the solution is irrelevant as long as equilibrium is achieved at destiny under full load and that the equilibrium is stable in the vicinity of that load. The purpose of this paper is to alert practitioners to the fact that non-standard procedures in finite element analysis are useful and can be legitimate although they burden their users with the requirement to use special caution. Some interesting findings that are useful to the US Scientific Balloon Program and that could not be obtained without non-standard techniques are presented.

Schur, Willi W.↗

ARKODE: A Flexible IVP Solver Infrastructure for One-step Methods

We describe the ARKODE library of one-step time integration methods for ordinary differential equation (ODE) initial-value problems (IVPs). In addition to providing standard explicit and diagonally implicit Runge–Kutta methods, ARKODE supports one-step methods designed to treat additive splittings of the IVP, including implicit-explicit (ImEx) additive Runge–Kutta methods and multirate infinitesimal (MRI) methods. We present the role of ARKODE within the SUNDIALS suite of time integration and nonlinear solver libraries, the core ARKODE infrastructure for utilities common to large classes of one-step methods, as well as its use of “time stepper” modules enabling easy incorporation of novel algorithms into the library. Numerical results show example problems of increasing complexity, highlighting the algorithmic flexibility afforded through this infrastructure, and include a larger multiphysics application leveraging multiple algorithmic features from ARKODE and SUNDIALS.

97 MATHEMATICS AND COMPUTING↗

Extreme Scale Unstructured Adaptive CFD: From Multiphase Flow to Aerodynamic Flow Control

Understanding the flow of fluid, either liquid or gas, through and around solid bodies has challenged man since the dawn of scientific inquiry. Many of the great minds of science and math have progressively built up a hierarchy of fluid models. This report is concerned with the computational modeling of turbulent flow around aerodynamic bodies such as planes and wind turbines. In this case, viscous effects near the solid bodies create very thin boundary layers that yield highly anisotropic (gradients normal to the surface may be 10^6 times larger than gradients along the surface) solutions to the governing non-linear partial differential equations (PDE); the Navier-Stokes equations. Furthermore, turbulent flows develop extremely broad ranges of length and time scales.This disparity motivates the use of discretization methods capable of employing adaptivity and implicit time integration. The combination of these features (non-linear, anisotropy, adaptivity, andimplicit) dramatically raise the complexity of the discretization, posing large challenges to efficient scalable parallel implementation. However, through careful design, the more complex algorithms can provide great reductions in computational cost relative to simpler methods (e.g., Cartesian grids with explicit time integration) that are easier to mate efficiently to hardware. In this report, we not only describe our approach but we also address the fact that while complex algorithms may never be as efficient flop-for-flop as simple methods, in the important measure of science-per-core-hour, they can still win big by making complex features like adaptivity and implicit methods as efficient and scalable as possible.

42 ENGINEERING↗

A finite difference method for predicting supersonic turbulent boundary layer flows with tangential slot injection

An implicit finite difference method has been applied to tangential slot injection into supersonic turbulent boundary layer flows. In addition, the effects induced by the interaction between the boundary layer displacement thickness and the external pressure field are considered. In the present method, three different eddy viscosity models have been used to specify the turbulent momentum exchange. One model depends on the species concentration profile and the species conservation equation has been included in the system of governing partial differential equations. Results are compared with experimental data at stream Mach numbers of 2.4 and 6.0 and with results of another finite difference method. Good agreement was generally obtained for the reduction of wall skin friction with slot injection and with experimental Mach number and pitot pressure profiles. Calculations with the effects of pressure interaction included showed these effects to be smaller than effects of changing eddy viscosity models.

Miner, E. W.↗

Simple numerical method for predicting steady compressible flows

A numerical method for solving the isenthalpic form of the governing equations for compressible viscous and inviscid flows was developed. The method was based on the concept of flux vector splitting in its implicit form. The method was tested on several demanding inviscid and viscous configurations. Two different forms of the implicit operator were investigated. The time marching to steady state was accelerated by the implementation of the multigrid procedure. Its various forms very effectively increased the rate of convergence of the present scheme. High quality steady state results were obtained in most of the test cases; these required only short computational times due to the relative efficiency of the basic method.

Vonlavante, Ernst↗

Universal single level implicit algorithm for gasdynamics

A single level effectively explicit implicit algorithm for gasdynamics is presented. The method meets all the requirements for unconditionally stable global iteration over flows with mixed supersonic and supersonic zones including blunt body flow and boundary layer flows with strong interaction and streamwise separation. For hyperbolic (supersonic flow) regions the method is automatically equivalent to contemporary space marching methods. For elliptic (subsonic flow) regions, rapid convergence is facilitated by alternating direction solution sweeps which bring both sets of eigenvectors and the influence of both boundaries of a coordinate line equally into play. Point by point updating of the data with local iteration on the solution procedure at each spatial step as the sweeps progress not only renders the method single level in storage but, also, improves nonlinear accuracy to accelerate convergence by an order of magnitude over related two level linearized implicit methods. The method derives robust stability from the combination of an eigenvector split upwind difference method (CSCM) with diagonally dominant ADI(DDADI) approximate factorization and computed characteristic boundary approximations.

Lombard, C. K.↗

The relationship between pressure-based and density-based algorithms

The PISO, pressure-based algorithm, is compared with implicit time-marching systems to ascertain their similarities and differences. Both methods are expressed in vector form for comparison purposes. The vector form of the PISO method is triangular, allowing an uncoupled solution procedure, while the Euler implicit method requires the simultaneous solution of all equations. Upwind differencing is performed according to the direction of the eigenvalues in both systems, but this is the particle velocity in the PISO method and the acoustic velocity in the Euler method. Vector stability calculations show that the PISO method is conditionally stable depending on the time step, but that it provides adequate damping at small time steps to enable good convergence. Unconditional stability can be provided by retaining the energy coupling terms in the time derivative. Transforming the Euler implicit equations to the PISO variables along with a modification of the time derivatives gives the density-based method the same amplification factors at low speeds as the pressure-based method without affecting their behavior at high speeds.

Merkle, Charles L.↗

Efficient IMEX Runge-Kutta Methods for Nonhydrostatic Dynamics

We develop new implicit-explicit Runge-Kutta (IMEX RK) methods for integrating horizontally explicit, vertically implicit (HEVI) partitionings of nonhydrostatic atmosphere models (HEVI models). These new methods, termed IMKG methods, are IMEX RK methods whose explicit part has optimal or near-optimal stability on the imaginary axis and whose implicit part is I-stable. A specialized stability region is presented for characterizing the stability of IMKG and other IMEX methods integrating HEVI models. Subsequently, we formulate two families of IMEX RK methods to enable deriving IMKG methods with a high explicit stage count for integrating HEVI models with large, stable time-steps. Here, we then derive a HEVI partitioning of the HOMME-NH nonhydrostatic model and use this model to compare the accuracy and efficiency of several IMKG methods with other IMEX RK methods from the literature.

58 GEOSCIENCES↗

A Conservative Finite-Volume Based Interface-Tracking Algorithm Using the Signed Distance Function

Methods for tracking an interface between two fluid phases are developed to ensure desired fluid properties, conservation, and stability are preserved in a finitevolume (FV) discretization. Here, the interface is tracked using a level set method where the signed distance function implicitly defines the interface. Marching methods are used to evaluate the value of the signed distance function, including a novel initialization method to initialize any implicit function to the signed distance function around sharp corners in the level set. Global conservation and consistency with a set of governing equations is enforced by a compression coefficient that measures the volumetric compression or expansion due to inaccuracies in the level set evaluation. A redistribution method is integrated into the volume correction to eliminate the small-cell instability while maintaining global conservation. This suite of methods is implemented and tested using static uniform velocity, and potential flow cases with multiple interface geometries. Results show these methods achieve up to second order accuracy, and are conservative. The application for these methods is intended to track the interface of a 3D printing filament in a finite-volume discretization of the all-speed Navier-Stokes equations.

42 ENGINEERING↗

Boundary-fitted coordinates for regions with highly curved boundaries and reentrant boundaries

A procedure was developed using the differential equation approach for generating boundary fitted coordinates for regions with highly curved boundaries as well as reentrant boundaries, such as those encountered in breaking surface waves. The resulting coordinates are nearly orthogonal and can provide adequate resolution even in the reentrant region. Consistent treatment of end boundaries and the use of a systematic initialization scheme and advanced implicit numerical solution techniques make the procedure highly efficient. The method developed for implicit enforcement of the periodicity boundary condition should be beneficial in the analysis of turbomachinery flow applications.

Ghia, U.↗

A computational procedure for large rotational motions in multibody dynamics

A computational procedure suitable for the solution of equations of motion for multibody systems is presented. The present procedure adopts a differential partitioning of the translational motions and the rotational motions. The translational equations of motion are then treated by either a conventional explicit or an implicit direct integration method. A principle feature of this procedure is a nonlinearly implicit algorithm for updating rotations via the Euler four-parameter representation. This procedure is applied to the rolling of a sphere through a specific trajectory, which shows that it yields robust solutions.

Park, K. C.↗

A computational procedure for large rotational motions in multibody dynamics

A computational procedure suitable for the solution of equations of motion for multibody systems is presented. The present procedure adopts a differential partitioning of the translational motions and the rotational motions. The translational equations of motion are then treated by either a conventional explicit or implicit direct integration method. A principal feature of this procedure is a nonlinearly implicit algorithm for updating rotations via the Euler four-parameter representation. This procedure is applied to the rolling of a sphere through a specific trajectory, which shows that it yields robust solutions.

Park, K. C.↗