SEARCH · Engineering Papers

Results for “differential algebraic 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.

SourceResearch connectionFrom yearThrough year

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

At least 235 records · Page 13

All sources NASA NTRS DOE OSTI

DOE OSTI2023

Moment-Fourier approach to ion parallel fluid closures and transport for a toroidally confined plasma

A general method of solving the drift kinetic equation is developed for an axisymmetric magnetic field. Expanding a distribution function in general moments, a set of ordinary differential equations is obtained. Successively expanding the moments and magnetic-field involved quantities in Fourier series, a set of linear algebraic equations is obtained. The set of full (Maxwellian and non-Maxwellian) moment equations is solved to express the first-order density, temperature, and flow velocity in terms of radial gradients of the zeroth-order pressure and temperature. Closure relations that connect parallel heat flux density and viscosity to the radial gradients and parallel gradients of temperature and flow velocity are also obtained by solving the non-Maxwellian moment equations. The closure relations combined with the linearized fluid equations reproduce the same solution obtained directly from the full moment equations. Furthermore, the method can be generalized to derive closures and transport for an electron-ion plasma and a multi-ion plasma in a general magnetic field.

neoclassical transport↗

NASA NTRS1992

Evaluation and application of the Baldwin-Lomax turbulence model in two-dimensional, unsteady, compressible boundary layers with and without separation in engine inlets

There is a practical need to model high speed flows that exist in jet engine inlets. The boundary layers that form in these inlets may be turbulent or laminar and either separated or attached. Also, unsteady supersonic inlets may be subject to frequent changes in operating conditions. Some changes in the operating conditions of the inlets may include varying the inlet geometry, bleeds and bypasses, and rotating or translating the centerbody. In addition, the inlet may be either started or unstarted. Therefore, a CFD code, used to model these inlets, may have to run for several different cases. Also, since the flow conditions through an unsteady inlet may be continually fluctuating, the CFD code which models these flows may have to be run over many time steps. Therefore, it would be beneficial that the code run quickly. Many turbulence models, however, are cumbersome to implement and require a lot of computer time to run, since they add to the number of differential equations to be solved to model a flow. The Baldwin-Lomax turbulence model is a popular model. It is an algebraic, eddy viscosity model. The Baldwin-Lomax model is used in many CFD codes because it is quick and easy to implement. In this paper, we will discuss implementing the Baldwin-Lomax turbulence model for both steady and unsteady compressible flows. In addition, these flows may be either separated or attached. In order to apply this turbulence model to flows which may be subjected to these conditions, certain modifications should be made to the original Baldwin-Lomax model. We will discuss these modifications and determine whether the Baldwin-Lomax model is a viable turbulence model that produces reasonably accurate results for high speed flows that can be found in engine inlets.

Sakowski, Barbara↗

DOE OSTI2024

Hadamard products and BPS networks

We study examples of fourth-order Picard-Fuchs operators that are Hadamard products of two second-order Picard-Fuchs operators. Each second-order Picard-Fuchs operator is associated with a family of elliptic curves, and the Hadamard product computes period integrals on the fibred product of the two elliptic surfaces. We construct 3-cycles on this geometry as the union of 2-cycles in the fibre over contours on the base. We then use the special Lagrangian condition to constrain the contours on the base. This leads to a construction that is reminiscent of spectral networks and exponential networks that have previously appeared in string theory literature.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

NASA NTRS1982

Algorithmic aspects of transient heat transfer problems in structures

It is noted that the application of finite element or finite difference techniques to the solution of transient heat transfer problems in structures often results in a stiff system of ordinary differential equations. Such systems are usually handled most efficiently by implicit integration techniques which require the solution of large and sparse systems of algebraic equations. The assembly and solution of these systems using the incomplete Cholesky conjugate gradient algorithm is examined. Several examples are used to demonstrate the advantage of the algorithm over other techniques.

Haftka, R. T.↗

NASA NTRS1994

A note on the regularity of solutions of infinite dimensional Riccati equations

This note is concerned with the regularity of solutions of algebraic Riccati equations arising from infinite dimensional LQR and LQG control problems. We show that distributed parameter systems described by certain parabolic partial differential equations often have a special structure that smoothes solutions of the corresponding Riccati equation. This analysis is motivated by the need to find specific representations for Riccati operators that can be used in the development of computational schemes for problems where the input and output operators are not Hilbert-Schmidt. This situation occurs in many boundary control problems and in certain distributed control problems associated with optimal sensor/actuator placement.

Burns, John A.↗

NASA NTRS1994

The Dynamics of Some Iterative Implicit Schemes

Yee, H. C.↗

NASA NTRS2011

Stellar Mixing: I. Formalism

In this paper we use the Reynolds stress models (RSM) to derive algebraic expressions for the following variables: a) heat fluxes; b) J.l fluxes; and c) momentum fluxes. These relations, which are fully 3D, include: 1) stable and unstable stratification, represented by the Brunt-Vaislila frequency, N(exp 2) =-g/H(sub p_(del - del(sub ad))(1 - RI(sub mu)); 2) double diffusion, salt-fingers, and semi-convection, represented by the density ratio R(sub mu) = del(sub mu)/(del - del(sub ad)); 3) shear (differential rotation), represented by the mean squared shear Sigma(exp 2) or by the Richardson number, Ri =N(exp 2)Sigma(exp -2); 4) radiative losses represented by a Peclet number, Pe; 5) a complete analytical solution of the ID version of the model. In general, the model requires the solution of two differential equations for the eddy kinetic energy K and its rate of dissipation, epsilon. In the local and stationary cases, when production equals dissipation, the model equations are all algebraic.

Canuto, V .M.↗

NASA NTRS2004

Rapid Airplane Parametric Input Design(RAPID)

An efficient methodology is presented for defining a class of airplane configurations. Inclusive in this definition are surface grids, volume grids, and grid sensitivity. A small set of design parameters and grid control parameters govern the process. The general airplane configuration has wing, fuselage, vertical tail, horizontal tail, and canard components. The wing, tail, and canard components are manifested by solving a fourth-order partial differential equation subject to Dirichlet and Neumann boundary conditions. The design variables are incorporated into the boundary conditions, and the solution is expressed as a Fourier series. The fuselage has circular cross section, and the radius is an algebraic function of four design parameters and an independent computational variable. Volume grids are obtained through an application of the Control Point Form method. Grid sensitivity is obtained by applying the automatic differentiation precompiler ADIFOR to software for the grid generation. The computed surface grids, volume grids, and sensitivity derivatives are suitable for a wide range of Computational Fluid Dynamics simulation and configuration optimizations.

Smith, Robert E.↗

NASA NTRS1972

Optimal control of first order distributed systems

The problem of characterizing optimal controls for a class of distributed-parameter systems is considered. The system dynamics are characterized mathematically by a finite number of coupled partial differential equations involving first-order time and space derivatives of the state variables, which are constrained at the boundary by a finite number of algebraic relations. Multiple control inputs, extending over the entire spatial region occupied by the system ("distributed controls') are to be designed so that the response of the system is optimal. A major example involving boundary control of an unstable low-density plasma is developed from physical laws.

Johnson, T. L.↗

NASA NTRS1988

Iterates of maps with symmetry

Fixed-point bifurcation, period doubling, and Hopf bifurcation (HB) for iterates of equivariant mappings are investigated analytically, with a focus on HB in the presence of symmetry. An algebraic formulation for the hypotheses of the theorem of Ruelle (1973) is derived, and the case of standing waves in a system of ordinary differential equations with O(2) symmetry is considered in detail. In this case, it is shown that HB can lead directly to motion on an invariant 3-torus, with an unexpected third frequency due to drift of standing waves along the torus.

Chossat, Pascal↗

NASA NTRS1990

Calculation of turbulent flow in complex geometries with a second-moment closure model

A full Reynolds stress turbulence model is applied to calculate the flow in various channels with complex cross-section. The model is shown to be more robust and to produce more consistent results than algebraic stress models. The relationship between various versions of the latter is provided. It is shown that differential or algebraic stress models derived from a direct application of a popular linear approximation for the pressure-strain terms in the Reynolds stress equations will always underpredict the secondary motion, and hence the accompanying distortion of other flow properties. A simple approximation which leads to better predictions is presented and related to previous practice.

Demuren, A. O.↗

DOE OSTI2024

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1980

Newton's method: A link between continuous and discrete solutions of nonlinear problems

Newton's method for nonlinear mechanics problems replaces the governing nonlinear equations by an iterative sequence of linear equations. When the linear equations are linear differential equations, the equations are usually solved by numerical methods. The iterative sequence in Newton's method can exhibit poor convergence properties when the nonlinear problem has multiple solutions for a fixed set of parameters, unless the iterative sequences are aimed at solving for each solution separately. The theory of the linear differential operators is often a better guide for solution strategies in applying Newton's method than the theory of linear algebra associated with the numerical analogs of the differential operators. In fact, the theory for the differential operators can suggest the choice of numerical linear operators. In this paper the method of variation of parameters from the theory of linear ordinary differential equations is examined in detail in the context of Newton's method to demonstrate how it might be used as a guide for numerical solutions.

Thurston, G. A.↗

DOE OSTI2023

Hierarchical off-diagonal low-rank approximation of Hessians in inverse problems, with application to ice sheet model initialization

Obtaining lightweight and accurate approximations of discretized objective functional Hessians in inverse problems governed by partial differential equations (PDEs) is essential to make both deterministic and Bayesian statistical large-scale inverse problems computationally tractable. The cubic computational complexity of dense linear algebraic tasks, such as Cholesky factorization, that provide a means to sample Gaussian distributions and determine solutions of Newton linear systems is a computational bottleneck at large-scale. These tasks can be reduced to log-linear complexity by utilizing hierarchical off-diagonal low-rank (HODLR) matrix approximations. In this work, we show that a class of Hessians that arise from inverse problems governed by PDEs are well approximated by the HODLR matrix format. In particular, we study inverse problems governed by PDEs that model the instantaneous viscous flow of ice sheets. In these problems, we seek a spatially distributed basal sliding parameter field such that the flow predicted by the ice sheet model is consistent with ice sheet surface velocity observations. Here, we demonstrate the use of HODLR Hessian approximation to efficiently sample the Laplace approximation of the posterior distribution with covariance further approximated by HODLR matrix compression. Computational studies are performed which illustrate ice sheet problem regimes for which the Gauss–Newton data-misfit Hessian is more efficiently approximated by the HODLR matrix format than the low-rank (LR) format. We then demonstrate that HODLR approximations can be favorable, when compared to global LR approximations, for large-scale problems by studying the data-misfit Hessian associated with inverse problems governed by the first-order Stokes flow model on the Humboldt glacier and Greenland ice sheet.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1994

Global Asymptotic Behavior of 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 three models of 2 x 2 systems of first-order autonomous nonlinear ordinary differential equations (ODEs) is analyzed using the theory of dynamical systems. The iterative procedures include simple iteration and full and modified Newton iterations. The results are compared with standard Runge-Kutta explicit methods, a noniterative implicit procedure, and the Newton method of solving the steady part of the ODEs. Studies showed that aside from exhibiting spurious asymptotes, all of the four implicit LMMs can change the type and stability of the steady states of the differential equations (DEs). They also exhibit a drastic distortion but less shrinkage of the basin of attraction of the true solution than standard nonLMM explicit methods. The simple iteration procedure exhibits behavior which is similar to standard nonLMM explicit methods except that spurious steady-state numerical solutions cannot occur. The numerical basins of attraction of the noniterative implicit procedure mimic more closely the basins of attraction of the DEs and are more efficient than the three iterative implicit procedures for the four implicit LMMs. Contrary to popular belief, the initial data using the Newton method of solving the steady part of the DEs may not have to be close to the exact steady state for convergence. These results can be used as an explanation for possible causes and cures of slow convergence and nonconvergence of steady-state numerical solutions when using an implicit LMM time-dependent approach in computational fluid dynamics.

Yee, H. C.↗

NASA NTRS1993

Structured adaptive grid generation using algebraic methods

The accuracy of the numerical algorithm depends not only on the formal order of approximation but also on the distribution of grid points in the computational domain. Grid adaptation is a procedure which allows optimal grid redistribution as the solution progresses. It offers the prospect of accurate flow field simulations without the use of an excessively timely, computationally expensive, grid. Grid adaptive schemes are divided into two basic categories: differential and algebraic. The differential method is based on a variational approach where a function which contains a measure of grid smoothness, orthogonality and volume variation is minimized by using a variational principle. This approach provided a solid mathematical basis for the adaptive method, but the Euler-Lagrange equations must be solved in addition to the original governing equations. On the other hand, the algebraic method requires much less computational effort, but the grid may not be smooth. The algebraic techniques are based on devising an algorithm where the grid movement is governed by estimates of the local error in the numerical solution. This is achieved by requiring the points in the large error regions to attract other points and points in the low error region to repel other points. The development of a fast, efficient, and robust algebraic adaptive algorithm for structured flow simulation applications is presented. This development is accomplished in a three step process. The first step is to define an adaptive weighting mesh (distribution mesh) on the basis of the equidistribution law applied to the flow field solution. The second, and probably the most crucial step, is to redistribute grid points in the computational domain according to the aforementioned weighting mesh. The third and the last step is to reevaluate the flow property by an appropriate search/interpolate scheme at the new grid locations. The adaptive weighting mesh provides the information on the desired concentration of points to the grid redistribution scheme. The evaluation of the weighting mesh is accomplished by utilizing the weight function representing the solution variation and the equidistribution law. The selection of the weight function plays a key role in grid adaptation. A new weight function utilizing a properly weighted boolean sum of various flowfield characteristics is defined. The redistribution scheme is developed utilizing Non-Uniform Rational B-Splines (NURBS) representation. The application of NURBS representation results in a well distributed smooth grid by maintaining the fidelity of the geometry associated with boundary curves. Several algebraic methods are applied to smooth and/or nearly orthogonalize the grid lines. An elliptic solver is utilized to smooth the grid lines if there are grid crossings. Various computational examples of practical interest are presented to demonstrate the success of these methods.

Yang, Jiann-Cherng↗

NASA NTRS1982

Global differential geometry: An introduction for control engineers

The basic concepts and terminology of modern global differential geometry are discussed as an introduction to the Lie theory of differential equations and to the role of Grassmannians in control systems analysis. To reach these topics, the fundamental notions of manifolds, tangent spaces, vector fields, and Lie algebras are discussed and exemplified. An appendix reviews such concepts needed for vector calculus as open and closed sets, compactness, continuity, and derivative. Although the content is mathematical, this is not a mathematical treatise but rather a text for engineers to understand geometric and nonlinear control.

Doolin, B. F.↗

NASA NTRS1974

A minimum principle for smooth first-order distributed systems

Consideration of the problem of characterizing optimal controls for a class of distributed parameter systems. The system dynamics are characterized mathematically by a finite number of coupled partial differential equations involving first-order time and space derivatives of the state variables. Boundary conditions on the state are in the form of a finite number of algebraic relations between the state and boundary control variables. A few directions are outlined in which the results obtained may be extended further.

Johnson, T. L.↗