Search NASA⌕ Search

SEARCH · Search NASA

Results for “first order”

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 199 records · Page 11

Curvature-Squared Cosmology In The First-Order Formalism

Paper presents theoretical study of some of general-relativistic ramifications of gravitational-field energy density proportional to R - alpha R(exp 2) (where R is local scalar curvature of space-time and alpha is a constant).

Shahid-Saless, Bahman↗

A first-order global model of Late Cenozoic climatic change: Orbital forcing as a pacemaker of the ice ages

The development of a theory of the evolution of the climate of the earth over millions of years can be subdivided into three fundamental, nested, problems: (1) to establish by equilibrium climate models (e.g., general circulation models) the diagnostic relations, valid at any time, between the fast-response climate variables (i.e., the 'weather statistics') and both the prescribed external radiative forcing and the prescribed distribution of the slow response variables (e.g., the ice sheets and shelves, the deep ocean state, and the atmospheric CO2 concentration); (2) to construct, by an essentially inductive process, a model of the time-dependent evolution of the slow-response climatic variables over time scales longer than the damping times of these variables but shorter than the time scale of tectonic changes in the boundary conditions (e.g., altered geography and elevation of the continents, slow outgassing, and weathering) and ultra-slow astronomical changes such as in the solar radiative output; and (3) to determine the nature of these ultra-slow processes and their effects on the evolution of the equilibrium state of the climatic system about which the above time-dependent variations occur. All three problems are discussed in the context of the theory of the Quaternary climate, which will be incomplete unless it is embedded in a more general theory for the fuller Cenozoic that can accommodate the onset of the ice-age fluctuations. We construct a simple mathematical model for the Late Cenozoic climatic changes based on the hypothesis that forced and free variations of the concentration of atmospheric greenhouse gases (notably CO2), coupled with changes in the deep ocean state and ice mass, under the additional 'pacemaking' influence of earth-orbital forcing, are primary determinants of the climate state over this period. Our goal is to illustrate how a single model governing both very long term variations and higher frequency oscillatory variations in the Pleistocene can be formulated with relatively few adjustable parameters.

Saltzman, Barry↗

An approach to the development of numerical algorithms for first order linear hyperbolic systems in multiple space dimensions: The constant coefficient case

Two methods for developing high order single step explicit algorithms on symmetric stencils with data on only one time level are presented. Examples are given for the convection and linearized Euler equations with up to the eighth order accuracy in both space and time in one space dimension, and up to the sixth in two space dimensions. The method of characteristics is generalized to nondiagonalizable hyperbolic systems by using exact local polynominal solutions of the system, and the resulting exact propagator methods automatically incorporate the correct multidimensional wave propagation dynamics. Multivariate Taylor or Cauchy-Kowaleskaya expansions are also used to develop algorithms. Both of these methods can be applied to obtain algorithms of arbitrarily high order for hyperbolic systems in multiple space dimensions. Cross derivatives are included in the local approximations used to develop the algorithms in this paper in order to obtain high order accuracy, and improved isotropy and stability. Efficiency in meeting global error bounds is an important criterion for evaluating algorithms, and the higher order algorithms are shown to be up to several orders of magnitude more efficient even though they are more complex. Stable high order boundary conditions for the linearized Euler equations are developed in one space dimension, and demonstrated in two space dimensions.

Goodrich, John W.↗

First-Order System Least Squares for Velocity-Vorticity-Pressure Form of the Stokes Equations, with Application to Linear Elasticity

In this paper, we study the least-squares method for the generalized Stokes equations (including linear elasticity) based on the velocity-vorticity-pressure formulation in d = 2 or 3 dimensions. The least squares functional is defined in terms of the sum of the L(exp 2)- and H(exp -1)-norms of the residual equations, which is weighted appropriately by by the Reynolds number. Our approach for establishing ellipticity of the functional does not use ADN theory, but is founded more on basic principles. We also analyze the case where the H(exp -1)-norm in the functional is replaced by a discrete functional to make the computation feasible. We show that the resulting algebraic equations can be uniformly preconditioned by well-known techniques.

Cai, Zhiqiang↗

First-Order System Least Squares for the Stokes Equations, with Application to Linear Elasticity

Following our earlier work on general second-order scalar equations, here we develop a least-squares functional for the two- and three-dimensional Stokes equations, generalized slightly by allowing a pressure term in the continuity equation. By introducing a velocity flux variable and associated curl and trace equations, we are able to establish ellipticity in an H(exp 1) product norm appropriately weighted by the Reynolds number. This immediately yields optimal discretization error estimates for finite element spaces in this norm and optimal algebraic convergence estimates for multiplicative and additive multigrid methods applied to the resulting discrete systems. Both estimates are uniform in the Reynolds number. Moreover, our pressure-perturbed form of the generalized Stokes equations allows us to develop an analogous result for the Dirichlet problem for linear elasticity with estimates that are uniform in the Lame constants.

Cai, Z.↗

First-Order Altitude Effects on the Cruise Efficiency of Subsonic Transport Aircraft

Aircraft fuel efficiency is a function of many different parameters, including characteristics of the engines, characteristics of the airframe, and the conditions under which the aircraft is operated. For a given vehicle, the airframe and engine characteristics are for the most part fixed quantities and efficiency is primarily a function of operational conditions. One important influence on cruise efficiency is cruise altitude. Various future scenarios have been postulated for cruise altitude, from the freedom to fly at optimum altitudes to altitude restrictions imposed for environmental reasons. This report provides background on the fundamental relationships determining aircraft cruise efficiency and examines the sensitivity of efficiency to cruise altitude. Analytical models of two current aircraft designs are used to derive quantitative results. Efficiency penalties are found to be generally less than 1% when within roughly 2000 ft of the optimum cruise altitude. Even the restrictive scenario of constant altitude cruise is found to result in a modest fuel consumption penalty if the fixed altitude is in an appropriate range.

Guynn, Mark D.↗

Runtime Verification: From Propositional to First-Order Temporal Logic

Runtime Verification is a branch of formal methods concerned with analysis of execution traces for the purpose of determining the state or general quality of the executing system. The field covers numerous approaches, one of which is specification-based runtime verification, where execution traces are checked against formal specifications. The paper presents syntax, semantics, and monitoring algorithms for respectively propositional and first-order temporal logics. In propositional logics the observed events in the execution trace are represented using atomic propositions, while first-order logic allows universal and existential quantification over data occurring as arguments in events. Monitoring of the first-order case is drastically more challenging than the propositional case, and we present a solution for this problem based on BDDs. We furthermore discuss monitorability of temporal properties by dividing them into different classes representing different degrees of monitorability.

Peled, Doron↗

First Order Temporal Logic Monitoring with BDDs

Runtime verification is aimed at analyzing execution traces stemming from a running program or system. The traditional purpose is to detect the lack of conformance with respect to a formal specification. Numerous efforts in the field have focused on monitoring so-called parametric specifications, where events carry data, and formulas can refer to such. Since a monitor for such specifications has to store observed data, the challenge is to have an efficient representation and manipulation of Boolean operators, quantification, and lookup of data. The fundamental problem is that the actual values of the data are not necessarily bounded or provided in advance. In this work we explore the use of Binary Decision Diagrams (BDDs) for representing observed data. Our experiments show a substantial improvement in performance compared to related work.

Ulus, Dogan↗

DejaVu: A Monitoring Tool for First-Order Temporal Logic

Runtime Verification (rv) is aimed at analyzing individual execution traces and temporal behaviors observed from running programs and systems. Its traditional purpose is in detecting the lack of conformance with respect to a formal specification. While very early rv systems were based on specifications given in some form of propositional temporal logic, recent efforts have focused on monitoring so-called parametric specifications over events that carry data. Since a monitor for such specifications has to store observed data, the challenge is to have an efficient representation and manipulation of data. The fundamental problem is that the actual values of the data are not necessarily bounded or provided in advance. In this paper, we describe our monitoring tool, DejaVu, which implements our algorithm [HPU17] for monitoring first-order past linear-time temporal logic over a sequence of events that carry data. We propose the use of Binary Decision Diagrams (bdds) [Bry86] for representing and manipulating sets of observed data since (1) bdds provide highly compact representations, (2) operations over bdds, in particular complementation, are very efficient, and (3) the monitor construction for the propositional case shown in [HR02] naturally extends to bdds. Our experiments show a substantial improvement in performance compared to a related tool.

Ulus, Dogan↗

Efficient Runtime Verification of First-Order Temporal Properties

Runtime verification allows monitoring the execution of a system against a temporal property, raising an alarm if the property is violated. In this paper we present a theory and system for runtime verification of a first-order past time linear temporal logic. The first-order nature of the logic allows a monitor to reason about events with data elements. While runtime verification of propositional temporal logic requires only a fixed amount of memory, the first-order variant has to deal with a number of data values potentially growing unbounded in the length of the execution trace. This requires special compactness considerations in order to allow checking very long executions. In previous work we presented an efficient use of BDDs for such first-order runtime verification, implemented in the tool DEJAVU. We first summarize this previous work. Subsequently, we look at the new problem of dynamically identifying when data observed in the past are no longer needed, allowing to reclaim the data elements used to represent them. We also study the problem of adding relations over data values. Finally, we present parts of the implementation, including a new concept of user defined property macros.

Peled, Doron↗

P- and L-Band Retrieval of Subsurface Soil Moisture and Temperature Profiles as First-Order Polynomial Function

This paper demonstrates the potential use of P and L band passive measurements to determine root zone soil moisture (SM) and soil temperature(ST). SM and ST data have been taken as a function of depth during the NASA GSFC PLEX19 experiment in the summer of 2019 at Beltsville, MD, USA. Using these data, a coherent model has been used to compute H and V brightness temperatures at frequencies of 0.8 and 1.4 GHz with an observation angle of 35 degrees. These synthetic brightness data are then used to estimate the SM and ST profiles which are represented by linear polynomials. The inversion problem is formulated as a least square problem that is solved by a global optimization method known as the Adaptive Simulated Annealing(ASA) method. Four inversion examples having different SM and ST profiles are presented. Selected results show that the standard deviation between the retrieved and measured data is less than 0.077 cm3/cm3 for SM, and 2.245 °C for ST.

Ming Li↗