Search NASA⌕ Search

SEARCH · Search NASA

Results for “PDEs”

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

Spillover, nonlinearity, and flexible structures

Many systems whose evolution in time is governed by Partial Differential Equations (PDEs) are linearized around a known equilibrium before Computer Aided Control Engineering (CACE) is considered. In this case, there are infinitely many independent vibrational modes, and it is intuitively evident on physical grounds that infinitely many actuators would be needed in order to control all modes. A more precise, general formulation of this grave difficulty (spillover problem) is due to A.V. Balakrishnan. A possible route to circumvention of this difficulty lies in leaving the PDE in its original nonlinear form, and adding the essentially finite dimensional control action prior to linearization. One possibly applicable technique is the Liapunov Schmidt rigorous reduction of singular infinite dimensional implicit function problems to finite dimensional implicit function problems. Omitting details of Banach space rigor, the formalities of this approach are given.

Bass, Robert W.↗
NASA NTRS1991

Mapping implicit spectral methods to distributed memory architectures

Spectral methods were proven invaluable in numerical simulation of PDEs (Partial Differential Equations), but the frequent global communication required raises a fundamental barrier to their use on highly parallel architectures. To explore this issue, a 3-D implicit spectral method was implemented on an Intel hypercube. Utilization of about 50 percent was achieved on a 32 node iPSC/860 hypercube, for a 64 x 64 x 64 Fourier-spectral grid; finer grids yield higher utilizations. Chebyshev-spectral grids are more problematic, since plane-relaxation based multigrid is required. However, by using a semicoarsening multigrid algorithm, and by relaxing all multigrid levels concurrently, relatively high utilizations were also achieved in this harder case.

Overman, Andrea L.↗
NASA NTRS1990

Simulation of the collapse and dissipation of Langmuir wave packets

Particle-in-cell (PIC) simulations and Zakharov's partial differential equations (PDEs) are used to investigate the collapse of isolated Langmuir wave packets in two dimensions. Collapse thresholds are determined numerically, and the roles of enhanced Langmuir wave damping and nonlinearities not included in the standard Zakharov equations are discussed. The Langmuir wave and ion dynamics in PIC simulations are compared with the predictions of PDE simulations incorporating enhanced Langmuir damping. Electron heating and coherent acceleration in the PIC simulations are discussed and compared with predictions of the transit-time theory.

Newman, D. L.↗
NASA NTRS1991

An improved error analysis of finite element solutions for postbuckled plates

The accurate calculation of stresses at boundaries and interfaces where FEM analysis may be unreliable is presently undertaken by an error analysis that derives a continuous approximation to discrete finite-element data, which can be differentiated to compute continuous stresses for component-failure predictions. An evaluation is conducted of this approximation in the context of the nonlinear PDEs. A novel interpolation formula which is a simple modification of the double Fourier sine series is used to reduce truncation errors near the rectangular plate boundary by means of an 'extended grid'. Results are presented from a FEM solution, a conventional double-Fourier series' continuous approximation, and a solution applying interpolation on the extended grid, which yields superior convergence properties near the plate boundaries.

Sistla, Rajaram↗
NASA NTRS1990

SIAM Conference on Parallel Processing for Scientific Computing, 4th, Chicago, IL, Dec. 11-13, 1989, Proceedings

Attention is given to such topics as an evaluation of block algorithm variants in LAPACK and presents a large-grain parallel sparse system solver, a multiprocessor method for the solution of the generalized Eigenvalue problem on an interval, and a parallel QR algorithm for iterative subspace methods on the CM2. A discussion of numerical methods includes the topics of asynchronous numerical solutions of PDEs on parallel computers, parallel homotopy curve tracking on a hypercube, and solving Navier-Stokes equations on the Cedar Multi-Cluster system. A section on differential equations includes a discussion of a six-color procedure for the parallel solution of elliptic systems using the finite quadtree structure, data parallel algorithms for the finite element method, and domain decomposition methods in aerodynamics. Topics dealing with massively parallel computing include hypercube vs. 2-dimensional meshes and massively parallel computation of conservation laws. Performance and tools are also discussed.

Dongarra, Jack↗
NASA NTRS1991

Discussion summary: Fictitious domain methods

Fictitious Domain methods are constructed in the following manner: Suppose a partial differential equation is to be solved on an open bounded set, Omega, in 2-D or 3-D. Let R be a rectangle domain containing the closure of Omega. The partial differential equation is first solved on R. Using the solution on R, the solution of the equation on Omega is then recovered by some procedure. The advantage of the fictitious domain method is that in many cases the solution of a partial differential equation on a rectangular region is easier to compute than on a nonrectangular region. Fictitious domain methods for solving elliptic PDEs on general regions are also very efficient when used on a parallel computer. The reason is that one can use the many domain decomposition methods that are available for solving the PDE on the fictitious rectangular region. The discussion on fictitious domain methods began with a talk by R. Glowinski in which he gave some examples of a variational approach to ficititious domain methods for solving the Helmholtz and Navier-Stokes equations.

Glowinski, Rowland↗
NASA NTRS1993

On waveform multigrid method

Waveform multigrid method is an efficient method for solving certain classes of time dependent PDEs. This paper studies the relationship between this method and the analogous multigrid method for steady-state problems. Using a Fourier-Laplace analysis, practical convergence rate estimates of the waveform multigrid iterations are obtained. Experimental results show that the analysis yields accurate performance prediction.

Taasan, Shlomo↗
NASA NTRS1993

A dual reciprocal boundary element formulation for viscous flows

The advantages inherent in the boundary element method (BEM) for potential flows are exploited to solve viscous flow problems. The trick is the introduction of a so-called dual reciprocal technique in which the convective terms are represented by a global function whose unknown coefficients are determined by collocation. The approach, which is necessarily iterative, converts the governing partial differential equations into integral equations via the distribution of fictitious sources or dipoles of unknown strength on the boundary. These integral equations consist of two parts. The first is a boundary integral term, whose kernel is the unknown strength of the fictitious sources and the fundamental solution of a convection-free flow problem. The second part is a domain integral term whose kernel is the convective portion of the governing PDEs. The domain integration can be transformed to the boundary by using the dual reciprocal (DR) concept. The resulting formulation is a pure boundary integral computational process.

Lafe, Olu↗
NASA NTRS1993

On the dynamics of approximating schemes for dissipative nonlinear equations

Since one can rarely write down the analytical solutions to nonlinear dissipative partial differential equations (PDE's), it is important to understand whether, and in what sense, the behavior of approximating schemes to these equations reflects the true dynamics of the original equations. Further, because standard error estimates between approximations of the true solutions coming from spectral methods - finite difference or finite element schemes, for example - and the exact solutions grow exponentially in time, this analysis provides little value in understanding the infinite time behavior of a given approximating scheme. The notion of the global attractor has been useful in quantifying the infinite time behavior of dissipative PDEs, such as the Navier-Stokes equations. Loosely speaking, the global attractor is all that remains of a sufficiently large bounded set in phase space mapped infinitely forward in time under the evolution of the PDE. Though the attractor has been shown to have some nice properties - it is compact, connected, and finite dimensional, for example - it is in general quite complicated. Nevertheless, the global attractor gives a way to understand how the infinite time behavior of approximating schemes such as the ones coming from a finite difference, finite element, or spectral method relates to that of the original PDE. Indeed, one can often show that such approximations also have a global attractor. We therefore only need to understand how the structure of the attractor for the PDE behaves under approximation. This is by no means a trivial task. Several interesting results have been obtained in this direction. However, we will not go into the details. We mention here that approximations generally lose information about the system no matter how accurate they are. There are examples that show certain parts of the attractor may be lost by arbitrary small perturbations of the original equations.

Jones, Donald A.↗
NASA NTRS1994

Magnetocentrifugally driven flows from young stars and disks. 2: Formulation of the dynamical problem

We formulate the dynamical problem of a cool wind centrifugally driven from the magnetic interface of a young star and an adjoining Keplerian disk. We examine the situation for mildly accreting T Tauri stars that rotate slowly as well as rapidly accreting protostars that rotate near break-up. In both cases a wind can be driven from a small X-region just outside the stellar magnetopause, where the field lines assume an open geometry and are rooted to material that rotates at an angular speed equal both to the local Keplerian value and to the stellar angular speed. Assuming axial symmetry for the ideal magnetohydrodynamic flow, which requires us to postpone asking how the (lightly ionized) gas is loaded onto field lines, we can formally integrate all the governing equations analytically except for a partial equation that describes how streamlines spread in the meridional plane. Apart from the difficulty of dealing with PDEs of mixed type, finding the functional forms of the conserved quantities along streamlines - the ratio beta of magnetic field to mass flux, the specific energy H of the fluid in the rotating frame, and the total specific angular momentum J carried in the matter and the field - constitutes a standard difficulty in this kind of (Grad-Shafranov) formalism. Fortunately, because the ratio of the thermal speed of the mass-loss regions to the Keplerian speed of rotation of the interface constitutes a small parameter epsilon, we can attack the overall problem by the method of matched asymptotic expansions. This procedure leads to a natural and systematic technique for obtaining the relevant functional dependences of beta, H, and J. Moreover, we are able to solve analytically for the properties of the flow emergent from the small transsonic region driven by gas pressure without having to specify the detailed form of any of the conserved functions, beta, H, and J. This analytical solution provides inner boundary conditions for the numerical computation in a companion paper by Najita & Shu of the larger region where the main acceleration to terminal speeds occurs.

Shu, Frank H.↗
NASA NTRS1995

Dynamical Approach Study of Spurious Steady-State Numerical Solutions of Nonlinear Differential Equations: Global Asymptotic Behavior of Time Discretizations - 2

The global asymptotic nonlinear behavior of 1 1 explicit and implicit time discretizations for four 2 x 2 systems of first-order autonomous nonlinear ordinary differential equations (ODES) is analyzed. The objectives are to gain a basic understanding of the difference in the dynamics of numerics between the scalars and systems of nonlinear autonomous ODEs and to set a baseline global asymptotic solution behavior of these schemes for practical computations in computational fluid dynamics. We show how 'numerical' basins of attraction can complement the bifurcation diagrams in gaining more detailed global asymptotic behavior of time discretizations for nonlinear differential equations (DEs). We show how in the presence of spurious asymptotes the basins of the true stable steady states can be segmented by the basins of the spurious stable and unstable asymptotes. One major consequence of this phenomenon which is not commonly known is that this spurious behavior can result in a dramatic distortion and, in most cases, a dramatic shrinkage and segmentation of the basin of attraction of the true solution for finite time steps. Such distortion, shrinkage and segmentation of the numerical basins of attraction will occur regardless of the stability of the spurious asymptotes, and will occur for unconditionally stable implicit linear multistep methods. In other words, for the same (common) steady-state solution the associated basin of attraction of the DE might be very different from the discretized counterparts and the numerical basin of attraction can be very different from numerical method to numerical method. The results can be used as an explanation for possible causes of error, and slow convergence and nonconvergence of steady-state numerical solutions when using the time-dependent approach for nonlinear hyperbolic or parabolic PDES.

Yee, H. C.↗
NASA NTRS1996

A Cell-Centered Multigrid Algorithm for All Grid Sizes

Multigrid methods are optimal; that is, their rate of convergence is independent of the number of grid points, because they use a nested sequence of coarse grids to represent different scales of the solution. This nesting does, however, usually lead to certain restrictions of the permissible size of the discretised problem. In cases where the modeler is free to specify the whole problem, such constraints are of little importance because they can be taken into consideration from the outset. We consider the situation in which there are other competing constraints on the resolution. These restrictions may stem from the physical problem (e.g., if the discretised operator contains experimental data measured on a fixed grid) or from the need to avoid limitations set by the hardware. In this paper we discuss a modification to the cell-centered multigrid algorithm, so that it can be used br problems with any resolution. We discuss in particular a coarsening strategy and choice of intergrid transfer operators that can handle grids with both an even or odd number of cells. The method is described and applied to linear equations obtained by discretization of two- and three-dimensional second-order elliptic PDEs.

Gjesdal, Thor↗
NASA NTRS1996

Numerical Study of Multigrid Methods with Various Smoothers for the Elliptical Grid Generation Equations

A robust solver for the elliptic grid generation equations is sought via a numerical study. The system of PDEs is discretized with finite differences, and multigrid methods are applied to the resulting nonlinear algebraic equations. Multigrid iterations are compared with respect to the robustness and efficiency. Different smoothers are tried to improve the convergence of iterations. The methods are applied to four 2D grid generation problems over a wide range of grid distortions. The results of the study help to select smoothing schemes and the overall multigrid procedures for elliptic grid generation.

Golik, W. L.↗
NASA NTRS1995

Dynamical Approach Study of Spurious Steady-State Numerical Solutions of Nonlinear Differential Equations: Global Asymptotic Behavior of Time Discretizations - Part 2

The global asymptotic nonlinear behavior of 11 explicit and implicit time discretizations for four 2 x 2 systems of first-order autonomous nonlinear ordinary differential equations (ODEs) is analyzed. The objectives are to gain a basic understanding of the difference in the dynamics of numerics between the scalars and systems of nonlinear autonomous ODEs and to set a baseline global asymptotic solution behavior of these schemes for practical computations in computational fluid dynamics. We show how 'numerical' basins of attraction can complement the bifurcation diagrams in gaining more detailed global asymptotic behavior of time discretizations for nonlinear differential equations (DEs). We show how in the presence of spurious asymptotes the basins of the true stable steady states can be segmented by the basins of the spurious stable and unstable asymptotes. One major consequence of this phenomenon which is not commonly known is that this spurious behavior can result in a dramatic distortion and, in most cases, a dramatic shrinkage and segmentation of the basin of attraction of the true solution for finite time steps. Such distortion, shrinkage and segmentation of the numerical basins of attraction will occur regardless of the stability of the spurious asymptotes, and will occur for unconditionally stable implicit linear multistep methods. In other words, for the same (common) steady-state solution the associated basin of attraction of the DE might be very different from the discretized counterparts and the numerical basin of attraction can be very different from numerical method to numerical method. The results can be used as an explanation for possible causes of error, and slow convergence and nonconvergence of steady-state numerical solutions when using the time-dependent approach for nonlinear hyperbolic or parabolic PDEs.

Yee, H. C.↗
NASA NTRS1997

Convergence Estimates for Multidisciplinary Analysis and Optimization

A quantitative analysis of coupling between systems of equations is introduced. This analysis is then applied to problems in multidisciplinary analysis, sensitivity, and optimization. For the sensitivity and optimization problems both multidisciplinary and single discipline feasibility schemes are considered. In all these cases a "convergence factor" is estimated in terms of the Jacobians and Hessians of the system, thus it can also be approximated by existing disciplinary analysis and optimization codes. The convergence factor is identified with the measure for the "coupling" between the disciplines in the system. Applications to algorithm development are discussed. Demonstration of the convergence estimates and numerical results are given for a system composed of two non-linear algebraic equations, and for a system composed of two PDEs modeling aeroelasticity.

Arian, Eyal↗
NASA NTRS1998

Globalized Newton-Krylov-Schwarz Algorithms and Software for Parallel Implicit CFD

Implicit solution methods are important in applications modeled by PDEs with disparate temporal and spatial scales. Because such applications require high resolution with reasonable turnaround, "routine" parallelization is essential. The pseudo-transient matrix-free Newton-Krylov-Schwarz (Psi-NKS) algorithmic framework is presented as an answer. We show that, for the classical problem of three-dimensional transonic Euler flow about an M6 wing, Psi-NKS can simultaneously deliver: globalized, asymptotically rapid convergence through adaptive pseudo- transient continuation and Newton's method-, reasonable parallelizability for an implicit method through deferred synchronization and favorable communication-to-computation scaling in the Krylov linear solver; and high per- processor performance through attention to distributed memory and cache locality, especially through the Schwarz preconditioner. Two discouraging features of Psi-NKS methods are their sensitivity to the coding of the underlying PDE discretization and the large number of parameters that must be selected to govern convergence. We therefore distill several recommendations from our experience and from our reading of the literature on various algorithmic components of Psi-NKS, and we describe a freely available, MPI-based portable parallel software implementation of the solver employed here.

Gropp, W. D.↗
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 NTRS2001

Modeling of Multi-Tube Pulse Detonation Engine Operation

The present paper explores some preliminary issues concerning the operational characteristics of multiple-tube pulsed detonation engines (PDEs). The study is based on a two-dimensional analysis of the first-pulse operation of two detonation tubes exhausting through a common nozzle. Computations are first performed to assess isolated tube behavior followed by results for multi-tube flow phenomena. The computations are based on an eight-species, finite-rate transient flow-field model. The results serve as an important precursor to understanding appropriate propellant fill procedures and shock wave propagation in multi-tube, multi-dimensional simulations. Differences in behavior between single and multi-tube PDE models are discussed, The influence of multi-tube geometry and the preferred times for injecting the fresh propellant mixture during multi-tube PDE operation are studied.

Ebrahimi, Houshang B.↗