On the control of a linear functional- differential equation with quadratic cost
Linear functional differential equations control with quadratic cost
SEARCH · Search NASA
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.
Linear functional differential equations control with quadratic cost
Critical cases for neutral functional differential equations
Investigating asymptotic solutions of ordinary differential equations
Hybrid computers solution of linear differential equations, analyzing Taylor series /derivatives/ use for compensation
If a system of ordinary differential equations represents a property conserving system that can be expressed linearly (e.g., conservation of mass), it is then desirable that the numerical integration method used conserve the same quantity. It is shown that both linear multistep methods and Runge-Kutta methods are 'conservative' and that Newton-type methods used to solve the implicit equations preserve the inherent conservation of the numerical method. It is further shown that a method used by several authors is not conservative.
The hyperbolic system of partial differential equations with a real constant square coefficient matrix A is considered. The problem of finding an energy conserving norm for the solution of the system is reduced to the problem of characterizing those matrices appearing in the boundary conditions which satisfy two specific matrix equations. Necessary and sufficient conditions on the coefficient matrix A and the matrices appearing in boundary conditions are derived for an energy conserving norm. The conditions serve as criteria on a given system which determine whether or not the solution will have its energy conserved in some norm. Examples of specific systems and boundary conditions are also provided.
Classical asymptotic analysis of ordinary differential equations derives approximate solutions that are numerically stable. However, the analysis also leads to tedious expansions in powers of the relevant parameter for a particular problem. The expansions are replaced with integrals that can be evaluated by numerical integration. The resulting numerical solutions retain the linear independence that is the main advantage of asymptotic solutions. Examples, including the Falkner-Skan equation from laminar boundary layer theory, illustrate the method of asymptotic analysis with numerical integration.
The differential equation description of exospheric lateral transport of Hodges and Johnson is reformulated to extend its utility to light gases. Accuracy of the revised equation is established by applying it to terrestrial hydrogen. The resulting global distributions for several static exobase models are shown to be essentially the same as those that have been computed by Quessette using an integral equation approach. The present theory is subsequently used to elucidate the effects of nonzero lateral flow, exobase rotation, and diurnal tidal winds on the hydrogen distribution. Finally it is shown that the differential equation of exospheric transport is analogous to a diffusion equation. Hence it is practical to consider exospheric transport as a continuation of thermospheric diffusion, a concept that alleviates the need for an artificial exobase dividing thermosphere and exosphere.
This report demonstrates universal differential equations (UDEs) as an approach to bridge the gap between ordinary differential equations (ODE) models and agent-based models (ABMs). Using UDE models as surrogates for ABMs allows us to preserve the foundational ODE that represents global disease dynamics while coupling it with a neural network model to approximate functions for the local behaviors of the ABM.
Partial integro-differential equations (PIDEs) have broad applications in the sciences, from electro-magnetism to options pricing. Here, in this paper, we introduce a new finite expression method (FEX) to solve PIDEs. This approach builds upon the original FEX and its inherent advantages with new advances: 1) A novel method of parameter grouping is proposed to reduce the number of coefficients in high-dimensional function approximation; 2) A Taylor series approximation method is implemented to significantly improve the computational efficiency and accuracy of the evaluation of the integral terms of PIDEs. The new FEX based method, denoted FEX-PG to indicate the addition of the parameter grouping (PG) step to the algorithm, provides both high accuracy and interpretable numerical solutions, with the outcome being an explicit equation that facilitates intuitive understanding of the underlying solution structures. These features are often absent in traditional methods, such as finite element methods (FEM) and finite difference methods, as well as in deep learning-based approaches. To benchmark our method against recent advances, we apply the new FEX-PG to solve benchmark PIDEs in the literature. In high-dimensional settings, FEX-PG exhibits strong and robust performance, achieving relative errors on the order of single precision machine epsilon, significantly outperforming existing approaches based on neural networks.
Finite difference method for solving symmetric positive linear differential equations
Stability of processes defined by stochastic difference and differential equations
Formulation and study of the initial value problem for neutral functional differential equations. The existence, uniqueness, and continuation of solutions to this problem are investigated, and an analysis is made of the dependence of the solutions on the initial conditions and parameters, resulting in the derivation of a continuous dependence theorem in which the fundamental mathematical principles underlying the continuous dependence problem for a very general system of nonlinear neutral functional differential equations are separated out.
In this work, we develop implicit rank-adaptive schemes for time-dependent matrix differential equations. The dynamic low rank approximation (DLRA) is a well-known technique to capture the dynamic low rank structure based on Dirac–Frenkel time-dependent variational principle. In recent years, it has attracted a lot of attention due to its wide applicability. Our schemes are inspired by the three-step procedure used in the rank adaptive version of the unconventional robust integrator (the so called BUG integrator) (Ceruti et al. in BIT Numer Math 62(4):1149–1174, 2022) for DLRA. First, a prediction (basis update) step is made computing the approximate column and row spaces at the next time level. Second, a Galerkin evolution step is invoked using an implicit solves for the small core matrix. Finally, a truncation is made according to a prescribed error threshold. Since the DLRA is evolving the differential equation projected on to the tangent space of the low rank manifold, the error estimate of the BUG integrator contains the tangent projection (modeling) error which cannot be easily controlled by mesh refinement. This can cause convergence issue for equations with cross terms. To address this issue, we propose a simple modification, consisting of merging the row and column spaces from the explicit step truncation method together with the BUG spaces in the prediction step. In addition, we propose an adaptive strategy where the BUG spaces are only computed if the residual for the solution obtained from the prediction space by explicit step truncation method, is too large. Here, we prove stability and estimate the local truncation error of the schemes under assumptions. We benchmark the schemes in several tests, such as anisotropic diffusion, solid body rotation and the combination of the two, to show robust convergence properties.
Second order differential equation for undamped forced nonlinear oscillations
Dimensional analysis and group theory methods of solving ordinary and partial differential equations
The propagation of errors in the solutions of the differential equations for the orbital elements of perturbed two-body motion is investigated. It is shown that the error in the time-element grows linearly for differential equations for orbital elements when only perturbations are present on the right-hand side, cubically for formulations which have a two-body term on the right-hand side, and linearly for formulations based upon extended phase space Hamiltonians.
Projection-based reduced order models are effective at approximating parameter-dependent differential equations that are parametrically separable. When parametric separability is not satisfied, which occurs in both linear and nonlinear problems, projection-based methods fail to adequately reduce the computational complexity. Devising alternative reduced order models is crucial for obtaining efficient and accurate approximations to expensive high-fidelity models. In this work, we develop a timestepping procedure for dynamical parameter-dependent problems, in which a neural-network is trained to propagate the coefficients of a reduced basis expansion. This results in an online stage with a computational cost independent of the size of the underlying problem. Here, we demonstrate our method on several parabolic partial differential equations, including a problem that is not parametrically separable.