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.
The real zeros of the transcendental function y = ax + becx are characterized, and the results should alleviate the difficulty of determining their existence, location, and number.
From tabulated nuclear and degenerate equations of state to photon and neutrino opacities and nuclear reaction rates, tabulated data is ubiquitous in computational astrophysics. The dynamic range that must be covered by these tables typically spans many orders of magnitude. Here we present a novel strategy for accurately and performantly interpolating tabulated data that spans these large dynamic ranges. We demonstrate the efficacy of this strategy in tabulated lookups for nuclear and terrestrial equations of state. We show that this strategy is a faster drop-in replacement for linear interpolation of logarithmic grids.
Transcendental profile function in conduction and convection
A completely general method for computing the Keplerian state transition matrix in terms of Goodyear's universal variables is presented. This includes a new scheme for solving Kepler's problem which is a necessary first step to computing the transition matrix. The Kepler problem is solved in terms of a new independent variable requiring the evaluation of only one transcendental function. Furthermore, this transcendental function may be conveniently evaluated by means of a Gaussian continued fraction.
Tabulation of definite and indefinite integrals of products of error function with elementary and transcendental functions
Collision Detection for Spacecraft Proximity Operations This thesis describes the development of a new collision detection algorithm to be used when two spacecraft are operating in the same vicinity. The two spacecraft are modelled as unions of convex polyhedra, where the polyhedron resulting from the union may be either convex or nonconvex. The relative motion of the two spacecraft is assumed to be such that one vehicle is moving with constant linear and angular velocity with respect to the other. The algorithm determines if a collision is possible and, if so, predicts the time when the collision will take place. The theoretical basis for the new collision detection algorithm is the C-function formulation of the configuration space approach recently introduced by researchers in robotics. Three different types of C-functions are defined that model the contacts between the vertices, edges, and faces of the polyhedra representing the two spacecraft. These C-functions are used to formulate three "collision" conditions. The first of these conditions limits the points representing potential collisions to the zeros of the C-functions. The new algorithm is fundamentally a search for the smallest zero of any C-function that satisfies the second and third collision conditions. The C-functions are shown to be transcendental functions of time for the assumed trajectory of the moving spacecraft. The zeros of these functions cannot be expressed in dosed form. Therefore, numerical search procedures are developed to find aLl of the zeros of a C-function in specified bounded intervals of time. These bounded intervals of time are found by examining the second and third collision conditions. The capabilities of the new algorithm are demonstrated for several example cases. These include examples of collisions determined by zeros of each of the three different types of C-functions. In addition to predicting the time of first contact of the polyhedra, the algorithm identifies the features of the two polyhedra that are touching at this time. The new collision detection algorithm is the first such algorithm that is capable of solving the collision detection problem exactly for the case where the moving object has constant linear and angular velocities. This is a significant improvement on previous collision detection algorithms described in the literature. In particular, the ability to handle constant angular velocity represents a more realistic type of rotational motion than those which have been used in other algorithms.
Multivariable least squares approximation polynomials and transcendental function problem solving for missile trajectories
Programming language for transcendental functions in applied mathematics
The transmission parameters for the dynamic characteristics of a feedline were approximated using both power and product series expansions. The feedline transfer functions of a shuttle orbiter feedline configuration were obtained using power and product series approximations of 60th, 120th, 180th, and 240th, order. Bode plots using the above polynomial approximations were obtained and the results compared with the exact solution. The exact solution to the feedline transfer function was obtained by using the transcendental terms appearing in the transmission parameters. The results show that the shuttle orbiter feedline may be modeled adequately by using polynomial approximations for the transcendental functions appearing in the transmission parameters. The power series approach was shown to be preferable to the product series method.
Differential dynamic logic is a formal framework to specify and reason about hybrid programs (HPs). The core of dL is a proof calculus that contains a collection of axioms and rules for the rigorous verification of properties of HPs. Recently, dL has been embedded within the theorem prover Prototype Verification System (PVS) resulting in the tool Plaidypvs2. The integration of dL into PVS expands its expressive power; user defined functions, such as trigonometric and other transcendental functions, can be used inside the dL framework, and meta-reasoning about HPs can be performed, including reasoning about entire classes of HPs, specified using dependent types in PVS. The differential temporal dynamic logic (dTL2) extends dL with temporal logic operators to reason about all the states reachable during the execution of an HP. This paper presents a work in progress focusing on embedding dTL2 in PVS as an extension of Plaidypvs. Plaidypvs is expanded with the formalization of a trace semantics for HPs, the definition of the LTL temporal operators eventually and globally, and the implementation of the proof calculus for dTL2. This new embedding has the same capabilties as Plaidypvs, which allows user defined functions and meta-reasoning of properties of HPs. To the best of the authors’ knowledge this is the first implementation of dTL2.
Asymptotic solutions are developed for the motion of a geocentric satellite in the equatorial plane due to gravitational perturbations such as nonsphericity (especially oblateness) of the primary body. Axisymmetric potentials are considered. A class of transformations is developed and the equations of motion are solved by the method of generalized multiple scales. Further it is shown that the equations of motion can be transformed into the required form to within any specified degree of accuracy. The transformations form an Abelian group of infinite order which leaves the differential equations of motion invariant. Solutions are developed in terms of elementary functions instead of elliptic or other higher transcendental functions and are shown to agree with known results.
A multi-angle spectro-polarimetric imager (MSPI) is an advanced camera system currently under development at JPL for possible future consideration on a satellite-based Aerosol-Cloud-Environ - ment (ACE) interaction study. The light in the optical system is subjected to a complex modulation designed to make the overall system robust against many instrumental artifacts that have plagued such measurements in the past. This scheme involves two photoelastic modulators that are beating in a carefully selected pattern against each other. In order to properly sample this modulation pattern, each of the proposed nine cameras in the system needs to read out its imager array about 1,000 times per second. The onboard processing required to compress this data involves least-squares fits (LSFs) of Bessel functions to data from every pixel in realtime, thus requiring an onboard computing system with advanced data processing capabilities in excess of those commonly available for space flight. As a potential solution to meet the MSPI onboard processing requirements, an LSF algorithm was developed on the Xilinx Virtex-4FX60 field programmable gate array (FPGA). In addition to configurable hardware capability, this FPGA includes Power -PC405 microprocessors, which together enable a combination hardware/ software processing system. A laboratory demonstration was carried out based on a hardware/ software co-designed processing architecture that includes hardware-based data collection and least-squares fitting (computationally), and softwarebased transcendental function computation (algorithmically complex) on the FPGA. Initial results showed that these calculations can be handled using a combination of the Virtex- 4TM Power-PC core and the hardware fabric.
Approximations to several transcendental functions in universal form of two body problem
Direct summation of series involving higher transcendental functions, integrals of confluent hypergeometric functions, and computer methods for approximating continuous functions
Algorithm and computer program of diagonal discrimination method for computing nonlinear and transcendental functions
Table of definite and indefinite integrals of products of exponential integrals with elementary or transcendental functions
Transcendental functions and Kepler equation modifications in two body problem
A control model describing a network flow hindered by multiple pure time (or transport) delays is formulated. Feedbacks connect each desired output with a single control sector situated at the origin. The dynamic formulation invokes the use of differential difference equations. This causes the characteristic equation of the model to consist of transcendental functions instead of a common algebraic polynomial. A general graphical criterion is developed to evaluate the stability of such a problem. A digital computer simulation confirms the validity of such criterion. An optimal decision making process with multiple delays is presented.