Search NASA⌕ Search

SEARCH · Search NASA

Results for “partial differential equations”

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 253 records · Page 14

Remarks on boundary-fitted coordinate system generation

The essential part of numerical solutions of partial differential equations is the representation of gradients and integrals by, respectively, differences between points and summations over points. In order for such numerical representations to be accurate, it is necessary that these points be more closely spaced in regions of large gradients. The need for accurate representation is particularly acute near body surfaces, since the boundary conditions are generally the most influential part of a partial differential equation solution. This is especially true of viscous solutions at high Reynolds number, where very large gradients occur in the boundary layer.

Thompson, J. F.↗

Distributed Minimal Residual (DMR) method for acceleration of iterative algorithms

A new method for enhancing the convergence rate of iterative algorithms for the numerical integration of systems of partial differential equations was developed. It is termed the Distributed Minimal Residual (DMR) method and it is based on general Krylov subspace methods. The DMR method differs from the Krylov subspace methods by the fact that the iterative acceleration factors are different from equation to equation in the system. At the same time, the DMR method can be viewed as an incomplete Newton iteration method. The DMR method was applied to Euler equations of gas dynamics and incompressible Navier-Stokes equations. All numerical test cases were obtained using either explicit four stage Runge-Kutta or Euler implicit time integration. The formulation for the DMR method is general in nature and can be applied to explicit and implicit iterative algorithms for arbitrary systems of partial differential equations.

Lee, Seungsoo↗

A semi-direct procedure using a local relaxation factor and its application to an internal flow problem

Generally, fast direct solvers are not directly applicable to a nonseparable elliptic partial differential equation. This limitation, however, is circumvented by a semi-direct procedure, i.e., an iterative procedure using fast direct solvers. An efficient semi-direct procedure which is easy to implement and applicable to a variety of boundary conditions is presented. The current procedure also possesses other highly desirable properties, i.e.: (1) the convergence rate does not decrease with an increase of grid cell aspect ratio, and (2) the convergence rate is estimated using the coefficients of the partial differential equation being solved.

Chang, S. C.↗

Time-partitioning simulation models for calculation on parallel computers

A technique allowing time-staggered solution of partial differential equations is presented in this report. Using this technique, called time-partitioning, simulation execution speedup is proportional to the number of processors used because all processors operate simultaneously, with each updating of the solution grid at a different time point. The technique is limited by neither the number of processors available nor by the dimension of the solution grid. Time-partitioning was used to obtain the flow pattern through a cascade of airfoils, modeled by the Euler partial differential equations. An execution speedup factor of 1.77 was achieved using a two processor Cray X-MP/24 computer.

Milner, Edward J.↗

Time-partitioning simulation models for calculation of parallel computers

A technique allowing time-staggered solution of partial differential equations is presented in this report. Using this technique, called time-partitioning, simulation execution speedup is proportional to the number of processors used because all processors operate simultaneously, with each updating of the solution grid at a different time point. The technique is limited by neither the number of processors available nor by the dimension of the solution grid. Time-partitioning was used to obtain the flow pattern through a cascade of airfoils, modeled by the Euler partial differential equations. An execution speedup factor of 1.77 was achieved using a two processor Cray X-MP/24 computer.

Milner, Edward J.↗

Sparsified time-dependent Fourier neural operators for fusion simulations

This paper presents a sparsified Fourier neural operator for coupled time-dependent partial differential equations (ST-FNO) as an efficient machine learning surrogate for fluid and particle-based fusion codes such as NIMROD (Non-Ideal Magnetohydrodynamics with Rotation - Open Discussion) and GTC (Gyrokinetic Toroidal Code). ST-FNO leverages the structures in the governing equations and utilizes neural operators to represent Green's function-like numerical operators in the corresponding numerical solvers. Once trained, ST-FNO can rapidly and accurately predict dynamics in fusion devices compared with first-principle numerical algorithms. In general, ST-FNO represents an efficient and accurate machine learning surrogate for numerical simulators for multi-variable nonlinear time-dependent partial differential equations, with the proposed architectures and loss functions. The efficacy of ST-FNO has been demonstrated using quiescent H-mode simulation data from NIMROD and kink-mode simulation data from GTC. The ST-FNO H-mode results show orders of magnitude reduction in memory and central processing unit usage in comparison with the numerical solvers in NIMROD when computing fields over a selected poloidal plane. The ST-FNO kink-mode results achieve a factor of 2 reduction in the number of parameters compared to baseline FNO models without accuracy loss.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Error induced by coordinate systems

It is pointed out that the choice of a curvilinear coordinate system can have a substantial effect on the error in the numerical solution of a partial differential equation. The truncation error is dependent not only on the higher order derivatives of the solution and the local grid spacing, but also on the rate-of-change of the grid spacing and on the departure of the grid from orthogonality. In connection with the present investigation, an analysis is conducted of the local truncation error in the approximation of first and second order derivatives on a curvilinear grid. Attention is given to a number of examples which illustrate the two fundamental sources of truncation error in the numerical solution of partial differential equations on curvilinear coordinate systems. The first is the grid spacing and changes in grid spacing which is measured by the first and second order derivatives of the functions defining the coordinate system. The second source is the higher order derivatives of the solution itself.

Mastin, C. W.↗

An interaction algorithm for prediction of mean and fluctuating velocities in two-dimensional aerodynamic wake flows

A theoretical analysis is presented yielding sets of partial differential equations for determination of turbulent aerodynamic flowfields in the vicinity of an airfoil trailing edge. A four phase interaction algorithm is derived to complete the analysis. Following input, the first computational phase is an elementary viscous corrected two dimensional potential flow solution yielding an estimate of the inviscid-flow induced pressure distribution. Phase C involves solution of the turbulent two dimensional boundary layer equations over the trailing edge, with transition to a two dimensional parabolic Navier-Stokes equation system describing the near-wake merging of the upper and lower surface boundary layers. An iteration provides refinement of the potential flow induced pressure coupling to the viscous flow solutions. The final phase is a complete two dimensional Navier-Stokes analysis of the wake flow in the vicinity of a blunt-bases airfoil. A finite element numerical algorithm is presented which is applicable to solution of all partial differential equation sets of inviscid-viscous aerodynamic interaction algorithm. Numerical results are discussed.

Baker, A. J.↗

On least squares approximations to indefinite problems of the mixed type

A least squares method is presented for computing approximate solutions of indefinite partial differential equations of the mixed type such as those that arise in connection with transonic flutter analysis. The method retains the advantages of finite difference schemes namely simplicity and sparsity of the resulting matrix system. However, it offers some great advantages over finite difference schemes. First, the method is insensitive to the value of the forcing frequency, i.e., the resulting matrix system is always symmetric and positive definite. As a result, iterative methods may be successfully employed to solve the matrix system, thus taking full advantage of the sparsity. Furthermore, the method is insensitive to the type of the partial differential equation, i.e., the computational algorithm is the same in elliptic and hyperbolic regions. In this work the method is formulated and numerical results for model problems are presented. Some theoretical aspects of least squares approximations are also discussed.

Fix, G. J.↗

On the validity of the modified equation approach to the stability analysis of finite-difference methods

The validity of the modified equation stability analysis introduced by Warming and Hyett was investigated. It is shown that the procedure used in the derivation of the modified equation is flawed and generally leads to invalid results. Moreover, the interpretation of the modified equation as the exact partial differential equation solved by a finite-difference method generally cannot be justified even if spatial periodicity is assumed. For a two-level scheme, due to a series of mathematical quirks, the connection between the modified equation approach and the von Neuman method established by Warming and Hyett turns out to be correct despite its questionable original derivation. However, this connection is only partially valid for a scheme involving more than two time levels. In the von Neumann analysis, the complex error multiplication factor associated with a wave number generally has (L-1) roots for an L-level scheme. It is shown that the modified equation provides information about only one of these roots.

Chang, Sin-Chung↗

A discontinuous piecewise polynomial generalized moving least squares scheme for robust finite element analysis on arbitrary grids

A variational approach is developed with a meshless discretization to enable accurate and robust numerical simulation of partial differential equations for meshes that are of poor quality. Traditional finite element methods use the mesh to both discretize the geometric domain and to define the finite element shape functions. The latter creates a dependence between the quality of the mesh and the properties of the finite element basis that may adversely affect the accuracy of the discretized problem. Here, we propose a new approach for defining finite element shape functions that breaks this dependence and separates mesh quality from the discretization quality, which we call discontinuous piecewise polynomial generalized moving least squares (DPP-GMLS). At the core of the approach is a meshless definition of the shape functions, which limits the purpose of the mesh to representing the geometric domain and integrating the basis functions without having any role in their approximation quality. The resulting non-conforming space can be utilized within a standard discontinuous Galerkin framework, providing a rigorous foundation for solving partial differential equations on low-quality meshes. We present a collection of numerical experiments demonstrating our approach in a wide range of settings: strongly coercive elliptic problems, linear elasticity in the compressible regime, and the stationary Stokes problem. We demonstrate convergence for all problems and stability for element pairs for problems which usually require inf-sup compatibility for conforming methods, also referring to a minor modification possible through the symmetric interior penalty Galerkin framework for stabilizing element pairs that would otherwise be traditionally unstable. Mesh robustness is particularly critical for elasticity, and we provide an example that our approach provides a greater than 5 x improvement in accuracy and allows for taking an 8 x larger stable timestep for a highly deformed mesh, compared to the continuous Galerkin finite element method.

97 MATHEMATICS AND COMPUTING↗

Dynamic characteristics of a two-stage variable-mass flexible missile with internal flow

A general formulation of the dynamical problems associated with powered flight of a two stage flexible, variable-mass missile with internal flow, discrete masses, and aerodynamic forces is presented. The formulation comprises six ordinary differential equations for the rigid body motion, 3n ordinary differential equations for the n discrete masses and three partial differential equations with the appropriate boundary conditions for the elastic motion. This set of equations is modified to represent a single stage flexible, variable-mass missile with internal flow and aerodynamic forces. The rigid-body motion consists then of three translations and three rotations, whereas the elastic motion is defined by one longitudinal and two flexural displacements, the latter about two orthogonal transverse axes. The differential equations are nonlinear and, in addition, they possess time-dependent coefficients due to the mass variation.

Meirovitch, L.↗

Nonlinear Equations of Motion for Cantilever Rotor Blades in Hover with Pitch Link Flexibility, Twist, Precone, Droop, Sweep, Torque Offset, and Blade Root Offset

Nonlinear equations of motion for a cantilever rotor blade are derived for the hovering flight condition. The blade is assumed to have twist, precone, droop, sweep, torque offset and blade root offset, and the elastic axis and the axes of center of mass, tension, and aerodynamic center coincident at the quarter chord. The blade is cantilevered in bending, but has a torsional root spring to simulate pitch link flexibility. Aerodynamic forces acting on the blade are derived from strip theory based on quasi-steady two-dimensional airfoil theory. The equations are hybrid, consisting of one integro-differential equation for root torsion and three integro-partial differential equations for flatwise and chordwise bending and elastic torsion. The equations are specialized for a uniform blade and reduced to nonlinear ordinary differential equations by Galerkin's method. They are linearized for small perturbation motions about the equilibrium operating condition. Modal analysis leads to formulation of a standard eigenvalue problem where the elements of the stability matrix depend on the solution of the equilibrium equations. Two different forms of the root torsion equation are derived that yield virtually identical numerical results. This provides a reasonable check for the accuracy of the equations.

Hodges, D. H.↗

Convergence of infinite dimensional sampled LQR problems - Theory and numerical results

A theory is developed for the convergence of the closed-loop solution to infinite-dimensional discrete-time linear-quadratic regulator (LQR) problems on the infinite time interval to the solution of a corresponding continuous-time LQR problem as the length of the sampling interval tends toward zero. Convergence of solutions to the operator algebraic Riccati equation and corresponding optimal feedback control gains is guaranteed under appropriate uniform stabilizability and detectability conditions and consistent sampling. Also presented are numerical results involving the optimal LQ control of a heat or diffusion equation, a hereditary or delay differential equation, and a hybrid system of ordinary and partial differential equations describing the transverse vibration of a cantilevered Voigt-Kelvin viscoelastic beam with tip mass.

Rosen, I. G.↗

Numerical investigations of low-density nozzle flow by solving the Boltzmann equation

A two-dimensional finite-difference code to solve the BGK-Boltzmann equation has been developed. The solution procedure consists of three steps: (1) transforming the BGK-Boltzmann equation into two simultaneous partial differential equations by taking moments of the distribution function with respect to the molecular velocity u(sub z), with weighting factors 1 and u(sub z)(sup 2); (2) solving the transformed equations in the physical space based on the time-marching technique and the four-stage Runge-Kutta time integration, for a given discrete-ordinate. The Roe's second-order upwind difference scheme is used to discretize the convective terms and the collision terms are treated as source terms; and (3) using the newly calculated distribution functions at each point in the physical space to calculate the macroscopic flow parameters by the modified Gaussian quadrature formula. Repeating steps 2 and 3, the time-marching procedure stops when the convergent criteria is reached. A low-density nozzle flow field has been calculated by this newly developed code. The BGK Boltzmann solution and experimental data show excellent agreement. It demonstrated that numerical solutions of the BGK-Boltzmann equation are ready to be experimentally validated.

Deng, Zheng-Tao↗