Engineering Papers⌕ Search

SEARCH · Engineering Papers

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

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

At least 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Optical neural engine for solving scientific partial differential equations

Abstract Solving partial differential equations (PDEs) is the cornerstone of scientific research and development. Data-driven machine learning (ML) approaches are emerging to accelerate time-consuming and computation-intensive numerical simulations of PDEs. Although optical systems offer high-throughput and energy-efficient ML hardware, their demonstration for solving PDEs is limited. Here, we present an optical neural engine (ONE) architecture combining diffractive optical neural networks for Fourier space processing and optical crossbar structures for real space processing to solve time-dependent and time-independent PDEs in diverse disciplines, including Darcy flow equation, the magnetostatic Poisson’s equation in demagnetization, the Navier-Stokes equation in incompressible fluid, Maxwell’s equations in nanophotonic metasurfaces, and coupled PDEs in a multiphysics system. We numerically and experimentally demonstrate the capability of the ONE architecture, which not only leverages the advantages of high-performance dual-space processing for outperforming traditional PDE solvers and being comparable with state-of-the-art ML models but also can be implemented using optical computing hardware with unique features of low-energy and highly parallel constant-time processing irrespective of model scales and real-time reconfigurability for tackling multiple tasks with the same architecture. The demonstrated architecture offers a versatile and powerful platform for large-scale scientific and engineering computations.

Tang, Yingheng (ORCID:0009000153622546)↗
NASA NTRS1973

A stability analysis for a semilinear parabolic partial differential equation

The parabolic partial differential equation considered is u sub t = u sub xx + f(u), where minus infinity x plus infinity and o t plus infinity. Under suitable hypotheses pertaining to f, a class of initial data is exhibited: phi(x), minus infinity x plus infinity, for which the corresponding solutions u(x,t) appraoch zero as t approaches the limit of plus infinity. This convergence is uniform with respect to x on any compact subinterval of the real axis.

Chafee, N.↗
NASA NTRS2004

Computations of Wall Distances Based on Differential Equations

The use of differential equations such as Eikonal, Hamilton-Jacobi and Poisson for the economical calculation of the nearest wall distance d, which is needed by some turbulence models, is explored. Modifications that could palliate some turbulence-modeling anomalies are also discussed. Economy is of especial value for deforming/adaptive grid problems. For these, ideally, d is repeatedly computed. It is shown that the Eikonal and Hamilton-Jacobi equations can be easy to implement when written in implicit (or iterated) advection and advection-diffusion equation analogous forms, respectively. These, like the Poisson Laplacian term, are commonly occurring in CFD solvers, allowing the re-use of efficient algorithms and code components. The use of the NASA CFL3D CFD program to solve the implicit Eikonal and Hamilton-Jacobi equations is explored. The re-formulated d equations are easy to implement, and are found to have robust convergence. For accurate Eikonal solutions, upwind metric differences are required. The Poisson approach is also found effective, and easiest to implement. Modified distances are not found to affect global outputs such as lift and drag significantly, at least in common situations such as airfoil flows.

Tucker, Paul G.↗
NASA NTRS1968

Solution of differential equations by application of transformation groups

Report applies transformation groups to the solution of systems of ordinary differential equations and partial differential equations. Lies theorem finds an integrating factor for appropriate invariance group or groups can be found and can be extended to partial differential equations.

Driskell, C. N., Jr.↗
NASA NTRS1991

Elimination of secular terms from the differential equations for the elements of perturbed two-body motion

In 1961, Sperling linearized and regularized the differential equations of motion of the two-body problem by changing the independent variable from time to fictitious time by Sundman's transformation (r = dt/ds) and by embedding the two-body energy integral and the Laplace vector. In 1968, Burdet developed a perturbation theory which was uniformly valid for all types of orbits using a variation of parameters approach on the elements which appeared in Sperling's equations for the two-body solution. In 1973, Bond and Hanssen improved Burdet's set of differential equations by embedding the total energy (which is a constant when the potential function is explicitly dependent upon time.) The Jacobian constant was used as an element to replace the total energy in a reformulation of the differential equations of motion. In the process, another element which is proportional to a component of the angular momentum was introduced. Recently trajectories computed during numerical studies of atmospheric entry from circular orbits and low thrust beginning in near-circular orbits exhibited numerical instability when solved by the method of Bond and Gottlieb (1989) for long time intervals. It was found that this instability was due to secular terms which appear on the righthand sides of the differential equations of some of the elements. In this paper, this instability is removed by the introduction of another vector integral called the delta integral (which replaces the Laplace Vector) and another scalar integral which removes the secular terms. The introduction of these integrals requires a new derivation of the differential equations for most of the elements. For this rederivation, the Lagrange method of variation of parameters is used, making the development more concise. Numerical examples of this improvement are presented.

Bond, Victor R.↗
NASA NTRS1993

Description and use of LSODE, the Livermore Solver for Ordinary Differential Equations

LSODE, the Livermore Solver for Ordinary Differential Equations, is a package of FORTRAN subroutines designed for the numerical solution of the initial value problem for a system of ordinary differential equations. It is particularly well suited for 'stiff' differential systems, for which the backward differentiation formula method of orders 1 to 5 is provided. The code includes the Adams-Moulton method of orders 1 to 12, so it can be used for nonstiff problems as well. In addition, the user can easily switch methods to increase computational efficiency for problems that change character. For both methods a variety of corrector iteration techniques is included in the code. Also, to minimize computational work, both the step size and method order are varied dynamically. This report presents complete descriptions of the code and integration methods, including their implementation. It also provides a detailed guide to the use of the code, as well as an illustrative example problem.

Radhakrishnan, Krishnan↗
NASA NTRS1983

Transformation matrices between non-linear and linear differential equations

In the linearization of systems of non-linear differential equations, those systems which can be exactly transformed into the second order linear differential equation Y"-AY'-BY=0 where Y, Y', and Y" are n x 1 vectors and A and B are constant n x n matrices of real numbers were considered. The 2n x 2n matrix was used to transform the above matrix equation into the first order matrix equation X' = MX. Specially the matrix M and the conditions which will diagonalize or triangularize M were studied. Transformation matrices P and P sub -1 were used to accomplish this diagonalization or triangularization to return to the solution of the second order matrix differential equation system from the first order system.

Sartain, R. L.↗
NASA NTRS1974

Classical seventh-, sixth-, and fifth-order Runge-Kutta-Nystrom formulas with stepsize control for general second-order differential equations

Runge-Kutta-Nystrom formulas of the seventh, sixth, and fifth order were derived for the general second order (vector) differential equation written as the second derivative of x = f(t, x, the first derivative of x). The formulas include a stepsize control procedure, based on a complete coverage of the leading term of the local truncation error in x, and they require no more evaluations per step than the earlier Runge-Kutta formulas for the first derivative of x = f(t, x). The developed formulas are expected to be time saving in comparison to the Runge-Kutta formulas for first-order differential equations, since it is not necessary to convert the second-order differential equations into twice as many first-order differential equations. The examples shown saved from 25 percent to 60 percent more computer time than the earlier formulas for first-order differential equations, and are comparable in accuracy.

Fehlberg, E.↗
DOE OSTI2024

Collocation methods for nonlinear differential equations on low-rank manifolds

We introduce new methods for integrating nonlinear differential equations on low-rank manifolds. These methods rely on interpolatory projections onto the tangent space, enabling low-rank time integration of vector fields that can be evaluated entry-wise. A key advantage of our approach is that it does not require the vector field to exhibit low-rank structure, thereby overcoming significant limitations of traditional dynamical low-rank methods based on orthogonal projection. To construct the interpolatory projectors, we develop a sparse tensor sampling algorithm based on the discrete empirical interpolation method (DEIM) that parameterizes tensor train manifolds and their tangent spaces with cross interpolation. Using these projectors, we propose two time integration schemes on low-rank tensor train manifolds. The first scheme integrates the solution at selected interpolation indices and constructs the solution with cross interpolation. The second scheme generalizes the well-known orthogonal projector-splitting integrator to interpolatory projectors. We demonstrate the proposed methods with applications to several tensor differential equations arising from the discretization of partial differential equations.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1977

MACSYMA's symbolic ordinary differential equation solver

The MACSYMA's symbolic ordinary differential equation solver ODE2 is described. The code for this routine is delineated, which is of interest because it is written in top-level MACSYMA language, and may serve as a good example of programming in that language. Other symbolic ordinary differential equation solvers are mentioned.

Golden, J. P.↗
NASA NTRS1973

Topologies for neutral functional differential equations.

Bounded topologies are considered for functional differential equations of the neutral type in which present dynamics of the system are influenced by its past behavior. A special bounded topology is generated on a collection of absolutely continuous functions with essentially bounded derivatives, and an application to a class of nonlinear neutral functional differential equations due to Driver (1965) is presented.

Melvin, W. R.↗