Dependency of constraints for differential equations
Dependency of constraints for differential equations - transformation algorithm for solving system of ordinary differential equations and constraints
SEARCH · Engineering Papers
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.
Dependency of constraints for differential equations - transformation algorithm for solving system of ordinary differential equations and constraints
Explicit integration of differential equations
Localization of linear integral equation eigenvalues with applications to linear ordinary differential equations
Numerical integration of differential equations requiring one substitution
Third order nonlinear differential equation stability properties established by Liapunov second method
The numerical approximation of solutions to linear functional differential equations are considered using the so called Legendre tau method. The functional differential equation is first reformulated as a partial differential equation with a nonlocal boundary condition involving time differentiation. The approximate solution is then represented as a truncated Legendre series with time varying coefficients which satisfy a certain system of ordinary differential equations. The method is very easy to code and yields very accurate approximations. Convergence is established, various numerical examples are presented, and comparison between the latter and cubic spline approximations is made.
Initial-value ordinary differential equation solution via variable order Adams method (SIVA/DIVA) package is collection of subroutines for solution of nonstiff ordinary differential equations. There are versions for single-precision and double-precision arithmetic. Requires fewer evaluations of derivatives than other variable-order Adams predictor/ corrector methods. Option for direct integration of second-order equations makes integration of trajectory problems significantly more efficient. Written in FORTRAN 77.
The numerical approximation of solutions to linear retarded functional differential equations are considered using the so-called Legendre-tau method. The functional differential equation is first reformulated as a partial differential equation with a nonlocal boundary condition involving time-differentiation. The approximate solution is then represented as a truncated Legendre series with time-varying coefficients which satisfy a certain system of ordinary differential equations. The method is very easy to code and yields very accurate approximations. Convergence is established, various numerical examples are presented, and comparison between the latter and cubic spline approximation is made.
Explore the source record for details and available documents.
Semigroups, groups and Liapunov stability of partial differential equation, obtaining operator differential equations in Hilbert spaces
Nonlinear differential equation for oscillatory system deduced from its integral form - approximation method of deduction
Subdominant solutions of linear differential equations calculated by numerical method
Volterra and partial differential equations solution asymptotic behavior treated, indicating connection to boundary problems in parabolic equations and optimal control
Identification in partial differential equations by Laplace 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.
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.
Linear neutral differential equation uniform asymptotic stability relation to perturbed differential equation containing bounded linear operators
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.