Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Implicit”

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 559 records · Page 31
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

Parallel computing strategies for block multigrid implicit solution of the Euler equations

A multigrid diagonal implicit algorithm has been developed to solve the three-dimensional Euler equations of inviscid compressible flow on block-structured grids. An improved method of advancing the multigrid cycle has been examined with respect to convergence rates, accuracy, and efficiency. In this method, the multigrid cycle is advanced independently in each of the blocks, and the information exchange between the blocks is done using buffer arrays, allowing for the asynchronous updating of interface boundary conditions. This updating scheme is used to eliminate the convergence problems found in a previous implementation of the algorithm while retaining its potential for efficient parallel execution. Results are computed for transonic flows past wings and include pressure distributions to verify the accuracy of the scheme and convergence histories to demonstrate the efficiency of the method. Efficiencies that were obtained using a modest number of processors in parallel are also presented and discussed.

Yadlin, Yoram↗
NASA NTRS1992

Adaptive explicit and implicit finite element methods for transient thermal analysis

The application of adaptive finite element methods to the solution of transient heat conduction problems in two dimensions is investigated. The computational domain is represented by an unstructured assembly of linear triangular elements and the mesh adaptation is achieved by local regeneration of the grid, using an error estimation procedure coupled to an automatic triangular mesh generator. Two alternative solution procedures are considered. In the first procedure, the solution is advanced by explicit timestepping, with domain decomposition being used to improve the computational efficiency of the method. In the second procedure, an algorithm for constructing continuous lines which pass only once through each node of the mesh is employed. The lines are used as the basis of a fully implicit method, in which the equation system is solved by line relaxation using a block tridiagonal equation solver. The numerical performance of the two procedures is compared for the analysis of a problem involving a moving heat source applied to a convectively cooled cylindrical leading edge.

Probert, E. J.↗
NASA NTRS1990

Implicit application of polynomial filters in a k-step Arnoldi method

The Arnoldi process is a well known technique for approximating a few eigenvalues and corresponding eigenvectors of a general square matrix. Numerical difficulties such as loss of orthogonality and assessment of the numerical quality of the approximations as well as a potential for unbounded growth in storage have limited the applicability of the method. These issues are addressed by fixing the number of steps in the Arnoldi process at a prescribed value k and then treating the residual vector as a function of the initial Arnoldi vector. This starting vector is then updated through an iterative scheme that is designed to force convergence of the residual to zero. The iterative scheme is shown to be a truncation of the standard implicitly shifted QR-iteration for dense problems and it avoids the need to explicitly restart the Arnoldi sequence. The main emphasis of this paper is on the derivation and analysis of this scheme. However, there are obvious ways to exploit parallelism through the matrix-vector operations that comprise the majority of the work in the algorithm. Preliminary computational results are given for a few problems on some parallel and vector computers.

Sorensen, D. C.↗
NASA NTRS1993

Distributed parallel processing applied to an implicit multigrid Euler/Navier-Stokes algorithm

An implicit multigrid algorithm for the solution of the Euler and Navier-Stokes equations has been implemented within the framework of multiple block-structured grids in which the physical domain is spatially decomposed into several blocks and the solution is advanced in parallel on each block. Utilities have been developed to implement such a scheme in a distributed computing environment. The multi-block algorithm is designed so that the explicit residual calculation is identical to that of single-block scheme, and therefore converged solutions for both schemes must be the same. To accelerate convergence, synchronous and asynchronous multigrid strategies are implemented. Significant speedups have been achieved in a multiple processor environment, while convergence rates similar to those of the single-block scheme are observed.

Tysinger, T. L.↗
NASA NTRS1993

Acceleration of convergence and spectrum transformation of implicit finite difference operators associated with Navier-Stokes equations

Implicit difference operator spectra are presently computed by applying eigensystem analysis techniques to finite-difference formulations of 2D Euler and Navier-Stokes equations, and attention is given to these iterative methods' convergence and stability characteristics by taking into account the effects of grid geometry, time-step, numerical viscosity, and boundary conditions. On the basis of the eigenvalue distributions for various flow configurations, the feasibility of applying such convergence-acceleration techniques as eigenvalue annihilation and relaxation is discussed. Spectrum-shifting is applied to NASA-Ames' ARC2D flow code, achieving a 20-33 percent efficiency.

Saleem, M.↗
NASA NTRS1993

Implicit treatment of diffusion terms in lower-upper algorithms

A method is presented which allows diffusion terms to be treated implicitly in the lower-upper (LU) algorithm (which is a commonly used method for solving 'compressible' Euler and Navier-Stokes equations) so that the algorithm's good stability properties will not be impaired. The new method generalizes the concept of LU factorization from that associated with the sign of eigenvalues to that associated with backward- and forward-difference operators without regard to eigenvalues. The method is verified in a turbulent boundary layer study.

Shih, T. I.-P.↗
NASA NTRS1991

An implicit method for the nonlinear modelling and simulation of piezoceramic actuators displaying hysteresis

Experiments have shown that piezoceramic materials display a nonlinear relationship between the applied electric field and the actuation strain. This relationship also displays a substantial hysteresis upon reversal of the applied field. In this paper, piezoceramic actuator models are incorporated into the structural equations of motion to arrive at a set of nonlinear actively controlled structural equations of motion. A new implicit algorithm for determining the time history of the actively controlled structure is presented. The algorithm employs the trapezoidal rule for stepping the equations forward in time. The algorithm is compared to an explicit algorithm and is shown to provide greater numerical accuracy. In addition, the numerical stability and convergence characteristics are presented via example. The new algorithm displays convergence and stability properties that are comparable to the standard trapezoidal rule used for dynamic systems without hysteresis.

Leigh, Timothy D.↗
NASA NTRS1993

Implicit transient finite element structural computations on MIMD systems - FETI vs. direct solvers

A domain decomposition method for implicit schemes that require significantly less storage and is several times faster than factorization algorithms is proposed. The transient domain decomposition method is an extension of the finite element tearing and interconnecting (FETI) method for the solution of static problems. Serial and parallel performance results obtained using the CRAY Y-MP/8 and the iPSC-860/128 systems demonstrate that the FETI method is superior to both serial and parallel direct methods.

Crivelli, Luis↗
NASA NTRS1993

Implicit multigrid techniques for compressible flows

Recent advances in the development of the diagonalized alternating direction implicit multigrid method for compressible aerodynamic problems are reviewed. These include the extension of the method originally developed for the Euler equations to include viscous effects, the computation of turbulent flows and the implementation on parallel computers of the scheme on multiblock rids.

Caughey, David A.↗
NASA NTRS1991

Hypersonic cone flow predictions using an implicit upwind space-marching code

Solutions have been computed and results are presented for Problem 1, the case of Mach 9 transitional flow past a 7 deg half-angle cone at zero incidence. The solutions were computed using a code developed for the integration of the parabolized Navier-Stokes equations. The algorithm employed in the code is based on a Roe-type flux-difference-splitting scheme applied following a finite-volume approach. The basic algorithm has been modified to make it implicit and second-order accurate in the crossflow directions. Results are presented in terms of surface pressure and heat transfer as well as boundary layer profiles of pitot pressure, Mach number, and tangential velocity. The case was recalculated several times in an effort to determine sensitivities to such parameters as grid density, wall temperature, turbulence model parameters, as well as freestream expansion. Comparisons with the experimental data are presented and discussed.

Lawrence, Scott L.↗
NASA NTRS1993

Variational data assimilation with a semi-Lagrangian semi-implicit global shallow-water equation model and its adjoint

An adjoint model is developed for variational data assimilation using the 2D semi-Lagrangian semi-implicit (SLSI) shallow-water equation global model of Bates et al. with special attention being paid to the linearization of the interpolation routines. It is demonstrated that with larger time steps the limit of the validity of the tangent linear model will be curtailed due to the interpolations, especially in regions where sharp gradients in the interpolated variables coupled with strong advective wind occur, a synoptic situation common in the high latitudes. This effect is particularly evident near the pole in the Northern Hemisphere during the winter season. Variational data assimilation experiments of 'identical twin' type with observations available only at the end of the assimilation period perform well with this adjoint model. It is confirmed that the computational efficiency of the semi-Lagrangian scheme is preserved during the minimization process, related to the variational data assimilation procedure.

Li, Y.↗
NASA NTRS1993

Three-dimensional unstructured grid Euler computations using a fully-implicit, upwind method

A method has been developed to solve the Euler equations on a three-dimensional unstructured grid composed of tetrahedra. The method uses an upwind flow solver with a linearized, backward-Euler time integration scheme. Each time step results in a sparse linear system of equations which is solved by an iterative, sparse matrix solver. Local-time stepping, switched evolution relaxation (SER), preconditioning and reuse of the Jacobian are employed to accelerate the convergence rate. Implicit boundary conditions were found to be extremely important for fast convergence. Numerical experiments have shown that convergence rates comparable to that of a multigrid, central-difference scheme are achievable on the same mesh. Results are presented for several grids about an ONERA M6 wing.

Whitaker, David L.↗
NASA NTRS1993

Implicit multigrid Euler solutions with symmetric Total-Variation-Diminishing dissipation

A symmetric Total-Variation-Diminishing (TVD) formulation of the numerical dissipation terms has been incorporated into a diagonalized alternating direction implicit multigrid algorithm to solve the Euler equations of inviscid compressible flow. The new treatment of the dissipation makes is possible to capture both very strong and very weak shocks, virtually without oscillation for the steady flows of interest here. In addition, the TVD constraint fixes one of the two previously arbitrary constants in the formulation of the dissipation, and results in both converged solutions and convergence rates which are relatively insensitive to the choice of the remaining dissipation parameter.

Caughey, David A.↗
NASA NTRS1992

Point-implicit relaxation strategies for viscous, hypersonic flows

An upwind-biased, point-implicit relaxation algorithm for obtaining the numerical solution to the governing equations for 3D, viscous, hypersonic flows in chemical and thermal nonequilibrium is described. The algorithm is derived using a finite-volume formulation in which the inviscid components of flux across cell walls are described with a modified Roe's averaging and Harten's entropy fix with second-order corrections based on Yee's symmetric total variation diminishing scheme. Newton relaxation of the fully coupled equation set is employed on a cell-to-cell basis. Under-relaxation of the inviscid and over-relaxation of the viscous contributions to the residual are implemented. Computational work is easily partitioned among many processors in an asynchronous, dynamic mode for convergence acceleration. An overview of the physical models employed herein for thermochemical nonequilibrium is included. Several test cases and comparisons with experimental data are presented involving hypersonic flow over blunt bodies which illustrate the qualitative and quantitative capabilities of this approach.

Gnoffo, P. A.↗
NASA NTRS1994

An implicit numerical scheme for the simulation of internal viscous flows on unstructured grids

The Navier-Stokes equations are solved numerically for two-dimensional steady viscous laminar flows. The grids are generated based on the method of Delaunay triangulation. A finite-volume approach is used to discretize the conservation law form of the compressible flow equations written in terms of primitive variables. A preconditioning matrix is added to the equations so that low Mach number flows can be solved economically. The equations are time marched using either an implicit Gauss-Seidel iterative procedure or a solver based on a conjugate gradient like method. A four color scheme is employed to vectorize the block Gauss-Seidel relaxation procedure. This increases the memory requirements minimally and decreases the computer time spent solving the resulting system of equations substantially. A factor of 7.6 speed up in the matrix solver is typical for the viscous equations. Numerical results are obtained for inviscid flow over a bump in a channel at subsonic and transonic conditions for validation with structured solvers. Viscous results are computed for developing flow in a channel, a symmetric sudden expansion, periodic tandem cylinders in a cross-flow, and a four-port valve. Comparisons are made with available results obtained by other investigators.

Jorgenson, Philip C. E.↗
NASA NTRS1994

An analysis of supersonic flows with low-Reynolds number compressible two-equation turbulence models using LU finite volume implicit numerical techniques

A generalized flow solver using an implicit Lower-upper (LU) diagonal decomposition based numerical technique has been coupled with three low-Reynolds number kappa-epsilon models for analysis of problems with engineering applications. The feasibility of using the LU technique to obtain efficient solutions to supersonic problems using the kappa-epsilon model has been demonstrated. The flow solver is then used to explore limitations and convergence characteristics of several popular two equation turbulence models. Several changes to the LU solver have been made to improve the efficiency of turbulent flow predictions. In general, the low-Reynolds number kappa-epsilon models are easier to implement than the models with wall-functions, but require much finer near-wall grid to accurately resolve the physics. The three kappa-epsilon models use different approaches to characterize the near wall regions of the flow. Therefore, the limitations imposed by the near wall characteristics have been carefully resolved. The convergence characteristics of a particular model using a given numerical technique are also an important, but most often overlooked, aspect of turbulence model predictions. It is found that some convergence characteristics could be sacrificed for more accurate near-wall prediction. However, even this gain in accuracy is not sufficient to model the effects of an external pressure gradient imposed by a shock-wave/ boundary-layer interaction. Additional work on turbulence models, especially for compressibility, is required since the solutions obtained with base line turbulence are in only reasonable agreement with the experimental data for the viscous interaction problems.

Lee, J.↗
NASA NTRS1995

The Method of Space-time Conservation Element and Solution Element: Development of a New Implicit Solver

The method of space-time conservation element and solution element is a nontraditional numerical method designed from a physicist's perspective, i.e., its development is based more on physics than numerics. It uses only the simplest approximation techniques and yet is capable of generating nearly perfect solutions for a 2-D shock reflection problem used by Helen Yee and others. In addition to providing an overall view of the new method, we introduce a new concept in the design of implicit schemes, and use it to construct a highly accurate solver for a convection-diffusion equation. It is shown that, in the inviscid case, this new scheme becomes explicit and its amplification factors are identical to those of the Leapfrog scheme. On the other hand, in the pure diffusion case, its principal amplification factor becomes the amplification factor of the Crank-Nicolson scheme.

Chang, S. C.↗
NASA NTRS1995

Implicit method for the computation of unsteady flows on unstructured grids

An implicit method for the computation of unsteady flows on unstructured grids is presented. Following a finite difference approximation for the time derivative, the resulting nonlinear system of equations is solved at each time step by using an agglomeration multigrid procedure. The method allows for arbitrarily large time steps and is efficient in terms of computational effort and storage. Inviscid and viscous unsteady flows are computed to validate the procedure. The issue of the mass matrix which arises with vertex-centered finite volume schemes is addressed. The present formulation allows the mass matrix to be inverted indirectly. A mesh point movement and reconnection procedure is described that allows the grids to evolve with the motion of bodies. As an example of flow over bodies in relative motion, flow over a multi-element airfoil system undergoing deployment is computed.

Venkatakrishnan, V.↗