Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “implicit methods”

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 415 records · Page 23

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.↗

Technical report series on global modeling and data assimilation. Volume 2: Direct solution of the implicit formulation of fourth order horizontal diffusion for gridpoint models on the sphere

High order horizontal diffusion of the form K Delta(exp 2m) is widely used in spectral models as a means of preventing energy accumulation at the shortest resolved scales. In the spectral context, an implicit formation of such diffusion is trivial to implement. The present note describes an efficient method of implementing implicit high order diffusion in global finite difference models. The method expresses the high order diffusion equation as a sequence of equations involving Delta(exp 2). The solution is obtained by combining fast Fourier transforms in longitude with a finite difference solver for the second order ordinary differential equation in latitude. The implicit diffusion routine is suitable for use in any finite difference global model that uses a regular latitude/longitude grid. The absence of a restriction on the timestep makes it particularly suitable for use in semi-Lagrangian models. The scale selectivity of the high order diffusion gives it an advantage over the uncentering method that has been used to control computational noise in two-time-level semi-Lagrangian models.

Max J. Suarez↗

Explicit and implicit solution of the Navier-Stokes equations on a massively parallel computer

The design, implementation, and performance of a two-dimensional time-accurate Navier-Stokes solver for the CM2 supercomputer are described. The program uses a single processor for each grid point. Two different time-stepping methods have so far been implemented: an explicit third-order Runge-Kutta method and an implicit approximation-factorization method. The CM2 results are checked against those of a mature well-vectorized Cray 2 program, both for correctness and performance. The code is found to be correct, and the performance in some cases is up to several times that of the Cray 2.

Levit, Creon↗

Multigrid Acceleration of Time-Accurate DNS of Compressible Turbulent Flow

An efficient scheme for the direct numerical simulation of 3D transitional and developed turbulent flow is presented. Explicit and implicit time integration schemes for the compressible Navier-Stokes equations are compared. The nonlinear system resulting from the implicit time discretization is solved with an iterative method and accelerated by the application of a multigrid technique. Since we use central spatial discretizations and no artificial dissipation is added to the equations, the smoothing method is less effective than in the more traditional use of multigrid in steady-state calculations. Therefore, a special prolongation method is needed in order to obtain an effective multigrid method. This simulation scheme was studied in detail for compressible flow over a flat plate. In the laminar regime and in the first stages of turbulent flow the implicit method provides a speed-up of a factor 2 relative to the explicit method on a relatively coarse grid. At increased resolution this speed-up is enhanced correspondingly.

Broeze, Jan↗

3D Navier-Stokes Time Accurate Solutions Using Multipartitioning Parallel Computation Methodology

A parallel CFD code solving 3D time accurate Navier-Stokes equations with multipartitioning parallel Methodology is being developed in collaboration with Ohio State University within the Air Vehicle Directorate, at Wright Patterson Air Force Base. The advantage of the multipartitioning parallel method is that the domain decomposition will not introduce domain boundaries for the implicit operators. A ring structure data communication is employed so that the implicit time accurate method can be implemented for multi-processors with the same accuracy as for the single processor. No sub-iteration is needed at the domain boundaries. The code has been validated for some typical unsteady flows, which include Coutte Flow, flow passing a cylinder. The code now is being employed for a large scale time accurate wall jet transient flow computation. 'ne preliminary results are promising. The mesh has been refined to capture more details of the flow field. The mesh refinement computation is in progress and would be difficult to successfully implement without the parallel computation techniques used. A modified version of the code with more efficient inversion of the diagonalized block matrix is currently being tested.

Zha, Ge-Cheng↗

An implicit factored scheme for the compressible Navier-Stokes equations. II - The numerical ODE connection

An attempt is made to establish a connection between linear multistep methods for applications to ordinary differential equations and their extension (by approximate factorization) to alternating direction implicit methods for partial differential equations. An earlier implicit factored scheme for the compressible Navier-Stokes equations is generalized by innovations that (1) increase the class of temporal difference schemes to include all linear multistep methods, (2) optimize the class of unconditionally stable factored schemes by a new choice of unknown variable, and (3) improve the computational efficiency by the introduction of quasi-one-leg methods.

Beam, R. M.↗

An implicit-iterative solution of the heat conduction equation with a radiation boundary condition

For the problem of predicting one-dimensional heat transfer between conducting and radiating mediums by an implicit finite difference method, four different formulations were used to approximate the surface radiation boundary condition while retaining an implicit formulation for the interior temperature nodes. These formulations are an explicit boundary condition, a linearized boundary condition, an iterative boundary condition, and a semi-iterative boundary method. The results of these methods in predicting surface temperature on the space shuttle orbiter thermal protection system model under a variety of heating rates were compared. The iterative technique caused the surface temperature to be bounded at each step. While the linearized and explicit methods were generally more efficient, the iterative and semi-iterative techniques provided a realistic surface temperature response without requiring step size control techniques.

Williams, S. D.↗

Transient Heat Transfer in a Semitransparent Radiating Layer with Boundary Convection and Surface Reflections

Surface convection and refractive index are examined during transient radiative heating or cooling of a grey semitransparent layer with internal absorption, emission and conduction. Each side of the layer is exposed to hot or cold radiative surroundings, while each boundary is heated or cooled by convection. Emission within the layer and internal reflections depend on the layer refractive index. The reflected energy and heat conduction distribute energy across the layer and partially equalize the transient temperature distributions. Solutions are given to demonstrate the effect of radiative heating for layers with various optical thicknesses, the behavior of the layer heated by radiation on one side and convectively cooled on the other, and a layer heated by convection while being cooled by radiation. The numerical method is an implicit finite difference procedure with non-uniform space and time increments. The basic method developed in earlier work is expanded to include external convection and incident radiation.

Siegel, Robert↗

Implicity restarted Arnoldi/Lanczos methods for large scale eigenvalue calculations

Eigenvalues and eigenfunctions of linear operators are important to many areas of applied mathematics. The ability to approximate these quantities numerically is becoming increasingly important in a wide variety of applications. This increasing demand has fueled interest in the development of new methods and software for the numerical solution of large-scale algebraic eigenvalue problems. In turn, the existence of these new methods and software, along with the dramatically increased computational capabilities now available, has enabled the solution of problems that would not even have been posed five or ten years ago. Until very recently, software for large-scale nonsymmetric problems was virtually non-existent. Fortunately, the situation is improving rapidly. The purpose of this article is to provide an overview of the numerical solution of large-scale algebraic eigenvalue problems. The focus will be on a class of methods called Krylov subspace projection methods. The well-known Lanczos method is the premier member of this class. The Arnoldi method generalizes the Lanczos method to the nonsymmetric case. A recently developed variant of the Arnoldi/Lanczos scheme called the Implicitly Restarted Arnoldi Method is presented here in some depth. This method is highlighted because of its suitability as a basis for software development.

Sorensen, Danny C.↗

Transient MOC with frequency transform and DSA on unstructured mesh

We present an implementation of the transient method of characteristics (MOC) with isotropic time derivatives, accelerated by diffusion synthetic acceleration (DSA). The fully implicit frequency transform method is used to solve the transient problem with analytic precursor integration. The code works on meshes composed of almost any of the commonly used non-curvilinear finite element types, and can handle the deformation of geometry in time-dependent transport calculations. We present results of a continuous Fourier analysis for the transient multigroup DSA problem, and representative benchmarking results are presented for the C5G7-TD benchmark in 2D showing reasonable performance and agreement compared to other codes. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Nonequilibrium statistical mechanics and optimal prediction of partially-observed complex systems

Abstract Only a subset of degrees of freedom are typically accessible or measurable in real-world systems. As a consequence, the proper setting for empirical modeling is that of partially-observed systems. Notably, data-driven models consistently outperform physics-based models for systems with few observable degrees of freedom; e.g. hydrological systems. Here, we provide an operator-theoretic explanation for this empirical success. To predict a partially-observed system’s future behavior with physics-based models, the missing degrees of freedom must be explicitly accounted for using data assimilation and model parametrization. Data-driven models, in contrast, employ delay-coordinate embeddings and their evolution under the Koopman operator to implicitly model the effects of the missing degrees of freedom. We describe in detail the statistical physics of partial observations underlying data-driven models using novel maximum entropy and maximum caliber measures. The resulting nonequilibrium Wiener projections applied to the Mori–Zwanzig formalism reveal how data-driven models may converge to the true dynamics of the observable degrees of freedom. Additionally, this framework shows how data-driven models infer the effects of unobserved degrees of freedom implicitly, in much the same way that physics models infer the effects explicitly. This provides a unified implicit-explicit modeling framework for predicting partially-observed systems, with hybrid physics-informed machine learning methods combining both implicit and explicit aspects.

97 MATHEMATICS AND COMPUTING↗

A numerical method for computing unsteady 2-D boundary layer flows

A numerical method for computing unsteady two-dimensional boundary layers in incompressible laminar and turbulent flows is described and applied to a single airfoil changing its incidence angle in time. The solution procedure adopts a first order panel method with a simple wake model to solve for the inviscid part of the flow, and an implicit finite difference method for the viscous part of the flow. Both procedures integrate in time in a step-by-step fashion, in the course of which each step involves the solution of the elliptic Laplace equation and the solution of the parabolic boundary layer equations. The Reynolds shear stress term of the boundary layer equations is modeled by an algebraic eddy viscosity closure. The location of transition is predicted by an empirical data correlation originating from Michel. Since transition and turbulence modeling are key factors in the prediction of viscous flows, their accuracy will be of dominant influence to the overall results.

Krainer, Andreas↗

Calculation of wall and free turbulent-shear flows at supersonic speeds

Supersonic turbulent flows are simulated numerically by solving the Reynolds-averaged full Navier-Stokes equations by an implicit finite-volume method. This flux-vector-split upwind scheme uses approximate factorization followed by line-Gauss-Seidel relaxations. The effects of turbulence are modeled by two eddy viscosity models. High-Reynolds-number form of the k-epsilon model is coupled with a wall-function to avoid excessive refinement of the grid in the low-Reynolds number regions. The k-epsilon equations are solved by the explicit-implicit MacCormack method. The algebraic Baldwin-Lomax model is also being used as an inexpensive alternative for the cases which do not experience massive separation. Several examples of two-dimensional solutions are given to illustrate both wall and free turbulent shear flows which include fluid dynamic phenomena, such as shocks, boundary layers, shear layers, wakes, separations and recirculations. The results compared with experimental data show good agreeent.

Baysal, O.↗

The Dynamics of Some Iterative Implicit Schemes

The global asymptotic nonlinear behavior of some standard iterative procedures in solving nonlinear systems of algebraic equations arising from four implicit linear multistep methods (LMMs) in discretizing 2 x 2 systems of first-order autonomous nonlinear ordinary differential equations is analyzed using the theory of dynamical systems. With the aid of parallel Connection Machines (CM-2 and CM-5), the associated bifurcation diagrams as a function of the time step, and the complex behavior of the associated 'numerical basins of attraction' of these iterative implicit schemes are revealed and compared. Studies showed that all of the four implicit LMMs exhibit a drastic distortion and segmentation but less shrinkage of the basin of attraction of the true solution than standard explicit methods. The numerical basins of attraction of a noniterative implicit procedure mimic more closely the basins of attraction of the differential equations than the iterative implicit procedures for the four implicit LMMs.

Yee, H. C.↗

High-order partitioned spectral deferred correction solvers for multiphysics problems

We present an arbitrarily high-order, conditionally stable, partitioned spectral deferred correction (SDC) method for solving multiphysics problems using a sequence of pre-existing single-physics solvers. This method extends the work in [1], [2], which used implicit-explicit Runge-Kutta methods (IMEX) to build high-order, partitioned multiphysics solvers. We consider a generic multiphysics problem modeled as a system of coupled ordinary differential equations (ODEs), coupled through coupling terms that can depend on the state of each subsystem; therefore the method applies to both a semi-discretized system of partial differential equations (PDEs) or problems naturally modeled as coupled systems of ODEs. The sufficient conditions to build arbitrarily high-order partitioned SDC schemes are derived. Based on these conditions, various of partitioned SDC schemes are designed. The stability of the first-order partitioned SDC scheme is analyzed in detail on a coupled, linear model problem. We show that the scheme is conditionally stable, and under conditions on the coupling strength, the scheme can be unconditionally stable. We demonstrate the performance of the proposed partitioned solvers on several classes of multiphysics problems with moderate coupling strength. They include a stiff linear system of ODEs, advection-diffusion-reaction systems, and fluid-structure interaction problems with both incompressible and compressible flows, where we verify the design order of the SDC schemes and study various stability properties. We also directly compare the accuracy, stability, and cost of the proposed partitioned SDC solver with the partitioned IMEX method in [1], [2] on this suite of test problems. The results suggest that the high-order partitioned SDC solvers are more robust than the partitioned IMEX solvers for the numerical examples considered in this work, while the IMEX methods require fewer implicit solves.

97 MATHEMATICS AND COMPUTING↗