SEARCH · Engineering Papers

Results for “partial differential equation”

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.

SourceResearch connectionFrom yearThrough year

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

At least 973 records · Page 54

All sources NASA NTRS DOE OSTI

NASA NTRS1998

A Simplified Model for the Investigation of Acoustically Driven Combustion Instabilities

A simplified one-dimensional model of reactive flow is presented which captures features of aeropropulsion systems, including acoustically driven combustion instabilities. Although the resulting partial differential equations are one dimensional, they qualitatively describe observed phenomena, including, resonant frequencies and the admission of both steady and unsteady behavior. A number of simulations are shown which exhibit both steady and unsteady behavior, including flame migration and thermo acoustic instabilities. Finally, we present examples of unsteady flow resulting from fuel modulation.

Paxson, Daniel E.↗

NASA NTRS1998

Performance of a Bounce-Averaged Global Model of Super-Thermal Electron Transport in the Earth's Magnetic Field

In this paper, we report the results of our recent research on the application of a multiprocessor Cray T916 supercomputer in modeling super-thermal electron transport in the earth's magnetic field. In general, this mathematical model requires numerical solution of a system of partial differential equations. The code we use for this model is moderately vectorized. By using Amdahl's Law for vector processors, it can be verified that the code is about 60% vectorized on a Cray computer. Speedup factors on the order of 2.5 were obtained compared to the unvectorized code. In the following sections, we discuss the methodology of improving the code. In addition to our goal of optimizing the code for solution on the Cray computer, we had the goal of scalability in mind. Scalability combines the concepts of portabilty with near-linear speedup. Specifically, a scalable program is one whose performance is portable across many different architectures with differing numbers of processors for many different problem sizes. Though we have access to a Cray at this time, the goal was to also have code which would run well on a variety of architectures.

McGuire, Tim↗

NASA NTRS1999

Approximation of the Newton Step by a Defect Correction Process

In this paper, an optimal control problem governed by a partial differential equation is considered. The Newton step for this system can be computed by solving a coupled system of equations. To do this efficiently with an iterative defect correction process, a modifying operator is introduced into the system. This operator is motivated by local mode analysis. The operator can be used also for preconditioning in Generalized Minimum Residual (GMRES). We give a detailed convergence analysis for the defect correction process and show the derivation of the modifying operator. Numerical tests are done on the small disturbance shape optimization problem in two dimensions for the defect correction process and for GMRES.

Arian, E.↗

NASA NTRS1998

Flow Applications of the Least Squares Finite Element Method

The main thrust of the effort has been towards the development, analysis and implementation of the least-squares finite element method (LSFEM) for fluid dynamics and electromagnetics applications. In the past year, there were four major accomplishments: 1) special treatments in computational fluid dynamics and computational electromagnetics, such as upwinding, numerical dissipation, staggered grid, non-equal order elements, operator splitting and preconditioning, edge elements, and vector potential are unnecessary; 2) the analysis of the LSFEM for most partial differential equations can be based on the bounded inverse theorem; 3) the finite difference and finite volume algorithms solve only two Maxwell equations and ignore the divergence equations; and 4) the first numerical simulation of three-dimensional Marangoni-Benard convection was performed using the LSFEM.

Jiang, Bo-Nan↗

NASA NTRS1981

A Diagonal Form of an Implicit Approximate-Factorization Algorithm

A modification of an implicit approximate-factorization finite-difference algorithm applied to partial differential equations is presented. This algorithm is applied to the two- and three-dimensional Euler equations in general curvilinear coordinates. The modification transforms the coupled system of equations into an uncoupled diagonal form that requires less computational work. For steady-state applications, the resulting diagonal algorithm retains the stability and accuracy characteristics of the original algorithm. The diagonal algorithm reduces the storage requirement of the implicit solution process and therefore has an important effect on the application of implicit finite-difference schemes to vector processors. Results are presented for realistic two-dimensional transonic flow fields about airfoils. Computation costs are reduced 24-34%.

Pulliam, T. H.↗

NASA NTRS1999

Unified CFD Methods Via Flowfield-Dependent Variation Theory

This paper addresses the flowfield-dependent variation (FDV) methods in which complex physical phenomena are taken into account in the final form of partial differential equations to be solved so that finite difference methods (FDM) or finite element methods (FEM) themselves will not dictate the physics, but rather are no more than simply the options how to discretize between adjacent nodal points or within an element. The variation parameters introduced in the formulation are calculated from the current flowfield based on changes of Mach numbers, Reynolds numbers, Peclet numbers, and Damkohler numbers between adjacent nodal points, which play many significant roles such as adjusting the governing equations (hyperbolic, parabolic, and/or e!liptic), resolving various physical phenomena, and controlling the accuracy and stability of the numerical solution. The theory is verified by a number of example problems addressing the physical implications of the variation parameters which resemble the flowfield itself, shock capturing mechanism, transitions and interactions between inviscid/viscous, compressibility/incompressibility, and laminar/turbulent flows.

Chung, T. J.↗

NASA NTRS1999

Experimental and Numerical Investigation of Adsorption/Desorption in Packed Sorption Beds Under Ideal and Non-Ideal Flows

The importance of the wall effect on packed beds in the adsorption and desorption of carbon dioxide, nitrogen, and water on molecular sieve 5A of 0.127 cm in radius is examined experimentally and with one-dimensional computer simulations. Experimental results are presented for a 22.5-cm long by 4.5-cm diameter cylindrical column with concentration measurements taken at various radial locations. The set of partial differential equations are solved using finite differences and Newman's method. Comparison of test data with the axial-dispersed, non-isothermal, linear driving force model suggests that a two-dimensional model (submitted to Separation Science and Technology) is required for accurate simulation of the average column breakthrough concentration. Additional comparisons of test data with the model provided information on the interactive effects of carrier gas coadsorption with CO2, as well as CO2-H2O interactions.

Mohamadinejad, H.↗

NASA NTRS1999

A Parallel Compact Multi-Dimensional Numerical Algorithm with Aeroacoustics Applications

In this study we propose a novel method to parallelize high-order compact numerical algorithms for the solution of three-dimensional PDEs (Partial Differential Equations) in a space-time domain. For this numerical integration most of the computer time is spent in computation of spatial derivatives at each stage of the Runge-Kutta temporal update. The most efficient direct method to compute spatial derivatives on a serial computer is a version of Gaussian elimination for narrow linear banded systems known as the Thomas algorithm. In a straightforward pipelined implementation of the Thomas algorithm processors are idle due to the forward and backward recurrences of the Thomas algorithm. To utilize processors during this time, we propose to use them for either non-local data independent computations, solving lines in the next spatial direction, or local data-dependent computations by the Runge-Kutta method. To achieve this goal, control of processor communication and computations by a static schedule is adopted. Thus, our parallel code is driven by a communication and computation schedule instead of the usual "creative, programming" approach. The obtained parallelization speed-up of the novel algorithm is about twice as much as that for the standard pipelined algorithm and close to that for the explicit DRP algorithm.

Povitsky, Alex↗

NASA NTRS1997

Nonlinear Waves and Particle Heating in the Auroral Ionosphere

In the two year period, the researchers have developed innovative 2-D simulation codes for modeling the interaction between electron beams and plasma waves and particles in the auroral ionosphere. These new simulations include kinetic wave particles as well as wave-wave interactions near and above approximately 500 km. The principal numerical model consists of partial-differential equations which evolve large amplitude magnetized 2-D Langmuir waves self-consistently with the electron distribution function. Progress was also made in developing 2-D Particle in Cell (PIC) codes.

Goldman, Martin↗

NASA NTRS2000

Two-Dimensional Array Beam Scanning Via Externally and Mutually Injection Locked Coupled Oscillators

Some years ago, Stephan proposed an approach to one dimensional (linear) phased array beam steering which requires only a single phase shifter. This involves the use of a linear array of voltage-controlled electronic oscillators coupled to nearest neighbors. The oscillators are mutually injection locked by controlling their coupling and tuning appropriately. Stephan's approach consists of deriving two signals from a master oscillator, one signal phase shifted with respect to the other by means of a single phase shifter. These two signals are injected into the end oscillators of the array. The result is a linear phase progression across the oscillator array. Thus, if radiating elements are connected to each oscillator and spaced uniformly along a line, they will radiate a beam at an angle to that line determined by the phase gradient which is, in turn, determined by the phase difference between the injection signals.The beam direction is therefore controlled by adjusting this phase difference. Recently, Pogorzelski and York presented a formulation which facilitates theoretical analysis of the above beam steering technique. This was subsequently applied by Pogorzelski in analysis of two dimensional beam steering using perimeter detuning of a coupled oscillator array. The formulation is based on a continuum model in which the oscillator phases are represented by a continuous function satisfying a partial differential equation of diffusion type. This equation can be solved via the Laplace transform and the resulting solution exhibits the dynamic behavior of the array as the beam is steered. Stephan's beam steering technique can be similarly generalized to two-dimensional arrays in which the beam control signals are applied to the oscillators on the perimeter of the array. In this paper the continuum model for this two-dimensional case is developed and the dynamic solution for the corresponding aperture phase function is obtained. The corresponding behavior of the resulting far-zone radiation pattern is displayed as well.

Pogorzelski, Ronald J.↗

NASA NTRS2000

Developing CORBA-Based Distributed Scientific Applications from Legacy Fortran Programs

Recent progress in distributed object technology has enabled software applications to be developed and deployed easily such that objects or components can work together across the boundaries of the network, different operating systems, and different languages. A distributed object is not necessarily a complete application but rather a reusable, self-contained piece of software that co-operates with other objects in a plug-and-play fashion via a well-defined interface. The Common Object Request Broker Architecture (CORBA), a middleware standard defined by the Object Management Group (OMG), uses the Interface Definition Language (IDL) to specify such an interface for transparent communication between distributed objects. Since IDL can be mapped to any programming language, such as C++, Java, Smalltalk, etc., existing applications can be integrated into a new application and hence the tasks of code re-writing and software maintenance can be reduced. Many scientific applications in aerodynamics and solid mechanics are written in Fortran. Refitting these legacy Fortran codes with CORBA objects can increase the codes reusability. For example, scientists could link their scientific applications to vintage Fortran programs such as Partial Differential Equation(PDE) solvers in a plug-and-play fashion. Unfortunately, CORBA IDL to Fortran mapping has not been proposed and there seems to be no direct method of generating CORBA objects from Fortran without having to resort to manually writing C/C++ wrappers. In this paper, we present an efficient methodology to integrate Fortran legacy programs into a distributed object framework. Issues and strategies regarding the conversion and decomposition of Fortran codes into CORBA objects are discussed. The following diagram shows the conversion and decomposition mechanism we proposed. Our goal is to keep the Fortran codes unmodified. The conversion- aided tool takes the Fortran application program as input and helps programmers generate C/C++ header file and IDL file for wrapping the Fortran code. Programmers need to determine by themselves how to decompose the legacy application into several reusable components based on the cohesion and coupling factors among the functions and subroutines. However, programming effort still can be greatly reduced because function headings and types have been converted to C++ and IDL styles. Most Fortran applications use the COMMON block to facilitate the transfer of large amount of variables among several functions. The COMMON block plays the similar role of global variables used in C. In the CORBA-compliant programming environment, global variables can not be used to pass values between objects. One approach to dealing with this problem is to put the COMMON variables into the parameter list. We do not adopt this approach because it requires modification of the Fortran source code which violates our design consideration. Our approach is to extract the COMMON blocks and convert them into a structure-typed attribute in C++. Through attributes, each component can initialize the variables and return the computation result back to the client. We have tested successfully the proposed conversion methodology based on the f2c converter. Since f2c only translates Fortran to C, we still needed to edit the converted code to meet the C++ and IDL syntax. For example, C++/IDL requires a tag in the structure type, while C does not. In this paper, we identify the necessary changes to the f2c converter in order to directly generate the C++ header and the IDL file. Our future work is to add GUI interface to ease the decomposition task by simply dragging and dropping icons.

Sang, Janche↗

NASA NTRS2000

Ordering Unstructured Meshes for Sparse Matrix Computations on Leading Parallel Systems

The ability of computers to solve hitherto intractable problems and simulate complex processes using mathematical models makes them an indispensable part of modern science and engineering. Computer simulations of large-scale realistic applications usually require solving a set of non-linear partial differential equations (PDES) over a finite region. For example, one thrust area in the DOE Grand Challenge projects is to design future accelerators such as the SpaHation Neutron Source (SNS). Our colleagues at SLAC need to model complex RFQ cavities with large aspect ratios. Unstructured grids are currently used to resolve the small features in a large computational domain; dynamic mesh adaptation will be added in the future for additional efficiency. The PDEs for electromagnetics are discretized by the FEM method, which leads to a generalized eigenvalue problem Kx = AMx, where K and M are the stiffness and mass matrices, and are very sparse. In a typical cavity model, the number of degrees of freedom is about one million. For such large eigenproblems, direct solution techniques quickly reach the memory limits. Instead, the most widely-used methods are Krylov subspace methods, such as Lanczos or Jacobi-Davidson. In all the Krylov-based algorithms, sparse matrix-vector multiplication (SPMV) must be performed repeatedly. Therefore, the efficiency of SPMV usually determines the eigensolver speed. SPMV is also one of the most heavily used kernels in large-scale numerical simulations.

Oliker, Leonid↗

NASA NTRS2000

A Probabilistic Framework for the Validation and Certification of Computer Simulations

The paper presents a methodology for quantifying, propagating, and managing the uncertainty in the data required to initialize computer simulations of complex phenomena. The purpose of the methodology is to permit the quantitative assessment of a certification level to be associated with the predictions from the simulations, as well as the design of a data acquisition strategy to achieve a target level of certification. The value of a methodology that can address the above issues is obvious, specially in light of the trend in the availability of computational resources, as well as the trend in sensor technology. These two trends make it possible to probe physical phenomena both with physical sensors, as well as with complex models, at previously inconceivable levels. With these new abilities arises the need to develop the knowledge to integrate the information from sensors and computer simulations. This is achieved in the present work by tracing both activities back to a level of abstraction that highlights their commonalities, thus allowing them to be manipulated in a mathematically consistent fashion. In particular, the mathematical theory underlying computer simulations has long been associated with partial differential equations and functional analysis concepts such as Hilbert spares and orthogonal projections. By relying on a probabilistic framework for the modeling of data, a Hilbert space framework emerges that permits the modeling of coefficients in the governing equations as random variables, or equivalently, as elements in a Hilbert space. This permits the development of an approximation theory for probabilistic problems that parallels that of deterministic approximation theory. According to this formalism, the solution of the problem is identified by its projection on a basis in the Hilbert space of random variables, as opposed to more traditional techniques where the solution is approximated by its first or second-order statistics. The present representation, in addition to capturing significantly more information than the traditional approach, facilitates the linkage between different interacting stochastic systems as is typically observed in real-life situations.

Ghanem, Roger↗

NASA NTRS2001

Discontinuous Galerkin Methods for NonLinear Differential Systems

This talk considers simplified finite element discretization techniques for first-order systems of conservation laws equipped with a convex (entropy) extension. Using newly developed techniques in entropy symmetrization theory, simplified forms of the discontinuous Galerkin (DG) finite element method have been developed and analyzed. The use of symmetrization variables yields numerical schemes which inherit global entropy stability properties of the PDE (partial differential equation) system. Central to the development of the simplified DG methods is the Eigenvalue Scaling Theorem which characterizes right symmetrizers of an arbitrary first-order hyperbolic system in terms of scaled eigenvectors of the corresponding flux Jacobian matrices. A constructive proof is provided for the Eigenvalue Scaling Theorem with detailed consideration given to the Euler equations of gas dynamics and extended conservation law systems derivable as moments of the Boltzmann equation. Using results from kinetic Boltzmann moment closure theory, we then derive and prove energy stability for several approximate DG fluxes which have practical and theoretical merit.

Barth, Timothy↗

NASA NTRS2001

Displacement Models for THUNDER Actuators having General Loads and Boundary Conditions

This paper summarizes techniques for quantifying the displacements generated in THUNDER actuators in response to applied voltages for a variety of boundary conditions and exogenous loads. The PDE (partial differential equations) models for the actuators are constructed in two steps. In the first, previously developed theory quantifying thermal and electrostatic strains is employed to model the actuator shapes which result from the manufacturing process and subsequent repoling. Newtonian principles are then employed to develop PDE models which quantify displacements in the actuator due to voltage inputs to the piezoceramic patch. For this analysis, drive levels are assumed to be moderate so that linear piezoelectric relations can be employed. Finite element methods for discretizing the models are developed and the performance of the discretized models are illustrated through comparison with experimental data.

Wieman, Robert↗

NASA NTRS2002

Elliptic Grid Generation of Spiral-Bevel Pinion Gear Typical of OH-58 Helicopter Transmission

This paper discusses the source term treatment in the numerical solution of elliptic partial differential equations for an interior grid generation problem in generalized curvilinear coordinates. The geometry considered is that of a planar cross-section of a generic spiral-bevel gear tooth typical of a pinion in the OH-58 helicopter transmission. The source terms used are appropriate for an interior grid domain where all the boundaries are prescribed via a combination of Dirichlet and Neumann boundary conditions. New constraints based on the Green's Theorem are derived which uniquely determine the coefficients in the source terms. These constraints are designed for boundary clustered grids where gradients in physical quantities need to be resolved adequately. However, it is seen that the present formulation works satisfactorily for mild clustering also. Thus, a fully automated elliptic grid generation technique is made possible where there is no need for a parametric study of these parameters since the new relations fix these free parameters uniquely.

Kaul, Upender K.↗

NASA NTRS1996

Hyperbolic Methods for Surface and Field Grid Generation

This chapter describes the use of hyperbolic partial differential equation methods for structured surface grid generation and field grid generation. While the surface grid generation equations are inherently three dimensional, the field grid generation equations can be formulated in two or three dimensions. The governing equations are derived from orthogonality relations and cell area/volume constraints; and are solved numerically by marching from an initial curve or surface. The marching step size and marching distance can be prescribedly the user. Exact specifications of the side and outer boundaries are not possible with a one sweep marching scheme but limited control is achievable. Excellent orthogonality and grid clustering characteristics are provided by hyperbolic methods with one to two orders of magnitude savings in time over typical elliptic methods. Since hyperbolic grid generation methods do not require the exact specifications of the side and outer boundaries of a grid, these methods are particularly well suited for the overlapping grid approach for solving problems on complex configurations. Grid generation software based on hyperbolic methods and their applications on several complex configurations will be described.

Chan, William M.↗

NASA NTRS2001

Building Blocks for Reliable Complex Nonlinear Numerical Simulations

This chapter describes some of the building blocks to ensure a higher level of confidence in the predictability and reliability (PAR) of numerical simulation of multiscale complex nonlinear problems. The focus is on relating PAR of numerical simulations with complex nonlinear phenomena of numerics. To isolate sources of numerical uncertainties, the possible discrepancy between the chosen partial differential equation (PDE) model and the real physics and/or experimental data is set aside. The discussion is restricted to how well numerical schemes can mimic the solution behavior of the underlying PDE model for finite time steps and grid spacings. The situation is complicated by the fact that the available theory for the understanding of nonlinear behavior of numerics is not at a stage to fully analyze the nonlinear Euler and Navier-Stokes equations. The discussion is based on the knowledge gained for nonlinear model problems with known analytical solutions to identify and explain the possible sources and remedies of numerical uncertainties in practical computations. Examples relevant to turbulent flow computations are included.

Yee, H. C.↗