Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical algorithms”

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 1,243 records · Page 69

Application of CFD Analysis to Design Support and Problem Resolution for ASRM and RSRM

The use of Navier-Stokes CFD codes to predict the internal flow field environment in a solid rocket motor is a very important analysis element during the design phase of a motor development program. These computational flow field solutions uncover a variety of potential problems associated with motor performance as well as suggesting solutions to these problems. CFD codes have also proven to be of great benefit in explaining problems associated with operational motors such as in the case of the pressure spike problem with the STS-54B flight motor. This paper presents results from analyses involving both motor design support and problem resolution. The issues discussed include the fluid dynamic/mechanical stress coupling at field joints relative to significant propellant deformations, the prediction of axial and radial pressure gradients in the motor associated with motor performance and propellant mechanical loading, the prediction of transition of the internal flow in the motor associated with erosive burning, the accumulation of slag at the field joints and in the submerged nozzle region, impingement of flow on the nozzle nose, and pressure gradients in the nozzle region of the motor. The analyses presented in this paper have been performed using a two-dimensional axisymmetric model. Fluent/BFC, a three dimensional Navier-Stokes flow field code, has been used to make the numerical calculations. This code utilizes a staggered grid formulation along with the SIMPLER numerical pressure-velocity coupling algorithm. Wall functions are used to represent the character of the viscous sub-layer flow, and an adjusted k-epsilon turbulence model especially configured for mass injection internal flows, is used to model the growth of turbulence in the motor port. Conclusions discussed in this paper consider flow field effects on the forward, center, and aft propellant grains except for the head end star grain region of the forward propellant segment. The field joints and the submerged nozzle are discussed as well. Conclusions relative to both the design evaluation of the ASRM and the RSRM scenarios explaining the pressure spikes were based on the flow field solutions presented in this paper.

Dill, Richard A.↗

A genuinely multidimensional upwind scheme and efficient multigrid solver for the compressible Euler equations

We present a new approach towards the construction of a genuinely multidimensional high-resolution scheme for computing steady-state solutions of the Euler equations of gas dynamics. The unique advantage of this approach is that the Gauss-Seidel relaxation is stable when applied directly to the high-resolution discrete equations, thus allowing us to construct a very efficient and simple multigrid steady-state solver. This is the only high-resolution scheme known to us that has this property. The two-dimensional scheme is presented in detail. It is formulated on triangular (structured and unstructured) meshes and can be interpreted as a genuinely two-dimensional extension of the Roe scheme. The quality of the solutions obtained using this scheme and the performance of the multigrid algorithm are illustrated by the numerical experiments. Construction of the three dimensional scheme is outlined briefly as well.

Sidilkover, David↗

The delayed-detonation model of a type Ia supernovae. 1: The deflagration phase

The nature of the 'delayed detonation' mechanism of Khokhlov for the explosion of Type Ia supernovae is investigated by using two-dimensional numerical hydrodynamics simulations. A new algorithm is used to treat the deflagration front. Assuming that it propagates locally at the laminar flame speed, the deflagration is insufficient to unbind the star. Expansion shuts of the flame; much of this small production of iron group nuclei occurs at lower densities, which reduces the electron-capture problem. The burning front does become wrinkled, but the wavelength of the instability is much larger than the computational grid size and is resolved; this is consistent with previous analysis. Because the degenerate star has an adiabatic exponent only slightly above 4/3, the energy released by deflagration drives a pulsation of large amplitude. During the first expansion phase, adiabatic cooling shuts off the burning, and a Rayleigh-Taylor instability then gives mixing of high-entropy ashes with low-entropy fuel. During the first contraction phase, compressional heating reignites the material. This paper deals with the deflagration phase, from the onset of burning, through expansion and quenching of the flame, to the first contraction.

Arnett, David↗

In-Flight MTF Analysis of ADAR 5500 Aircraft Sensor

The Modulation Transfer Function (MTF) of an imaging system is one parameter that can be used to describe the spatial resolution or the image quality of an imaging system. MTF is the system's frequency response to an input. The MTF at a specific frequency normally ranges from 0-1, where 0 indicates no frequency response and 1 indicates perfect frequency response. The MTF value at Nyquist frequency is calculated because the Nyquist frequency is the maximum sampling frequency of the system. MTF analysis was performed on data acquired with an ADAR 5500 flown by Positive Systems on September 13-14, 2000 over Brookings, SD. Four edges from ground targets were used as inputs to the system. The system's MTF was calculated using a Matlab-based algorithm, which applied edge detection, numerical differentiation, and Fourier transformation methods to the target images.

Zanoni, Vicki↗

NASA Tech Briefs, November 2007

Topics include: Wireless Measurement of Contact and Motion Between Contact Surfaces; Wireless Measurement of Rotation and Displacement Rate; Portable Microleak-Detection System; Free-to-Roll Testing of Airplane Models in Wind Tunnels; Cryogenic Shrouds for Testing Thermal-Insulation Panels; Optoelectronic System Measures Distances to Multiple Targets; Tachometers Derived From a Brushless DC Motor; Algorithm-Based Fault Tolerance for Numerical Subroutines; Computational Support for Technology- Investment Decisions; DSN Resource Scheduling; Distributed Operations Planning; Phase-Oriented Gear Systems; Freeze Tape Casting of Functionally Graded Porous Ceramics; Electrophoretic Deposition on Porous Non- Conductors; Two Devices for Removing Sludge From Bioreactor Wastewater; Portable Unit for Metabolic Analysis; Flash Diffusivity Technique Applied to Individual Fibers; System for Thermal Imaging of Hot Moving Objects; Large Solar-Rejection Filter; Improved Readout Scheme for SQUID-Based Thermometry; Error Rates and Channel Capacities in Multipulse PPM; Two Mathematical Models of Nonlinear Vibrations; Simpler Adaptive Selection of Golomb Power-of- Two Codes; VCO PLL Frequency Synthesizers for Spacecraft Transponders; Wide Tuning Capability for Spacecraft Transponders; Adaptive Deadband Synchronization for a Spacecraft Formation; Analysis of Performance of Stereoscopic-Vision Software; Estimating the Inertia Matrix of a Spacecraft; Spatial Coverage Planning for Exploration Robots; and Increasing the Life of a Xenon-Ion Spacecraft Thruster.

Source record↗

Closed-Form and Numerically-Stable Solutions to Problems Related to the Optimal Two-Impulse Transfer Between Specified Terminal States of Keplerian Orbits

The first part of the paper presents some closed-form solutions to the optimal two-impulse transfer between fixed position and velocity vectors on Keplerian orbits when some constraints are imposed on the magnitude of the initial and final impulses. Additionally, a numerically-stable gradient-free algorithm with guaranteed convergence is presented for the minimum delta-v two-impulse transfer. In the second part of the paper, cooperative bargaining theory is used to solve some two-impulse transfer problems when the initial and final impulses are carried by different vehicles or when the goal is to minimize the delta-v and the time-of-flight at the same time.

Senent, Juan↗

Method and system for enabling real-time speckle processing using hardware platforms

An accelerator for the speckle atmospheric compensation algorithm may enable real-time speckle processing of video feeds that may enable the speckle algorithm to be applied in numerous real-time applications. The accelerator may be implemented in various forms, including hardware, software, and/or machine-readable media.

Ortiz, Fernando E.↗

Zernike Wavefront Sensor Modeling Development for LOWFS on WFIRST-AFTA

WFIRST-AFTA design makes use of an existing 2.4m telescope for direct imaging of exoplanets. To maintain the high contrast needed for the coronagraph, wavefront error (WFE) of the optical system needs to be continuously sensed and controlled. Low Order Wavefront Sensing (LOWFS) uses the rejected starlight from an immediate focal plane to sense wavefront changes (mostly thermally induced low order WFE) by combining the LOWFS mask (a phase plate located at the small center region with reflective layer) with the starlight rejection masks, i.e. Hybrid Lyot Coronagraph (HLC)'s occulter or Shaped Pupil Coronagraph (SPC)'s field stop. Zernike wavefront sensor (ZWFS) measures phase via the phase-contrast method and is known to be photon noise optimal for measuring low order aberrations. Recently, ZWFS was selected as the baseline LOWFS technology on WFIST/AFTA for its good sensitivity, accuracy, and its easy integration with the starlight rejection mask. In this paper, we review the theory of ZWFS operation, describe the ZWFS algorithm development, and summarize various numerical sensitivity studies on the sensor performance. In the end, the predicted sensor performance on SPC and HLC configurations are presented.

Zernike phase contrast↗

Integrated Flush Air Data Sensing System Modeling for Planetary Entry Guidance with Direct Force Control

Flush air data sensing (FADS) systems have been previously used at both Earth and Mars to provide onboard estimates of angle of attack, sideslip angle, and dynamic pressure. However, these FADS data were often not used in an in-the-loop sense to inform the onboard guidance and control systems. A method to integrate FADS-derived density and wind estimates with a numerical predictor-corrector guidance algorithm is presented. The method is demonstrated in a high-fidelity simulation of a human-scale Mars entry vehicle that utilizes a hypersonic inflatable aerodynamic decelerator (HIAD) with direct force control. Effects on guidance commands and state uncertainties both with and without FADS system modeling are presented and discussed.

Lugo, Rafael A.↗

On Hermite Interpolation using Bernstein Polynomials for Trajectory Generation

This work presents a solution to the two-point Hermite interpolation problem using Bernstein polynomials. The Hermite interpolation problem is of particular interest in aerospace applications where boundary conditions for trajectories often specify derivative constraints. In the examples shown, a trajectory will be generated between an initial condition and a final condition. For example, a trajectory is generated that connects an aircraft’s current position and velocity with a point on the runway at a desired landing velocity. The numerical stability of the proposed algorithms is analyzed empirically.

Bezier curves↗

Performance Analysis of Magnetohydrodynamic Drag Modulation for Actively Controlled Aerocapture at Neptune

While the Ice Giants are a top priority for flagship missions in the NASA’s near-term future, current technologies limit the scientific payload and mission timeline for future Uranian and Neptunian missions due to the need for fuel for orbit insertion maneuvers. Thus, to maximize the scientific potential of future missions, atmospheric aerocapture has been heavily researched. While atmospheric aerocapture simulations have proven enabling for capturing around Neptune, its deep atmospheric pass requires an aeroshell with robust thermal protection systems (TPS). Magnetohydrodynamically-controlled aerocapture serves as a potential solution to the limitations of both fully propulsive orbit insertion and aerodynamically controlled aerocapture. Through NASA Langley’s high-fidelity flight dynamics simulation, the Program to Optimize Simulated Trajectories II, both the aerodynamic-only and magnetohydrodynamic aerocapture methods were simulated and compared for identical missions to Neptune. After applying an optimized numerical predictor-corrector guidance algorithm for both methods, the results showed that magnetohydrodynamics has not only the control authority to successfully capture around Neptune, but also the unique advantage of a shallower atmospheric pass, decreasing the maximum heat load and the required TPS mass.

Danny N. Nguyen↗

Quantum spatial search with multiple excitations

Spatial search is the problem of finding a marked vertex in a graph. A continuous-time quantum walk in the single-excitation subspace of an $n$ spin system solves the problem of spatial search by finding the marked vertex in $O(\sqrt{n})$ time. Here, we investigate a natural extension of the spatial search problem, marking multiple vertices of a graph, which are still marked with local fields. We prove that a continuous-time quantum walk in the $k$-excitation subspace of $n$ spins can determine the binary string of $k$ marked vertices with an asymptotic fidelity in time $O(\sqrt{n})$, despite the size of the state space growing as $O(n^k)$. Numerically, we show that this algorithm can be implemented with interactions that decay as $1/r^\alpha$, where $r$ is the distance between spins, and an $\alpha$ that is readily available in current ion trap systems.

Lewis, Dylan↗

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001↗

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001↗

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001↗

A Hierarchical OPF Algorithm with Improved Gradient Evaluation in Three-Phase Networks

Linear approximation commonly used in solving alternating-current optimal power flow (AC-OPF) simplifies the system models but incurs accumulated voltage errors in large power networks. Such errors will make the primal-dual type gradient algorithms converge to solutions with voltage violation. In this paper, we improve a recent hierarchical OPF algorithm that rested on primal-dual gradients evaluated with a linearized distribution power flow model. Specifically, we propose a more accurate gradient evaluation method based on an unbalanced three-phase nonlinear distribution power flow model to mitigate the errors arising from linearization. The resultant gradients feature a blocked structure that enables our development of an improved hierarchical primal-dual algorithm to solve the OPF problem. Numerical results on the IEEE 123-bus test feeder and a 4,518-node test feeder show that the proposed method can enhance voltage safety at comparable computational efficiency with the linearized algorithm.

approximation algorithms↗

A simple suboptimal least-squares algorithm for attitude determination with multiple sensors

Three-axis attitude determination is equivalent to finding a coordinate transformation matrix which transforms a set of reference vectors fixed in inertial space to a set of measurement vectors fixed in the spacecraft. The attitude determination problem can be expressed as a constrained optimization problem. The constraint is that a coordinate transformation matrix must be proper, real, and orthogonal. A transformation matrix can be thought of as optimal in the least-squares sense if it maps the measurement vectors to the reference vectors with minimal 2-norm errors and meets the above constraint. This constrained optimization problem is known as Wahba's problem. Several algorithms which solve Wahba's problem exactly have been developed and used. These algorithms, while steadily improving, are all rather complicated. Furthermore, they involve such numerically unstable or sensitive operations as matrix determinant, matrix adjoint, and Newton-Raphson iterations. This paper describes an algorithm which minimizes Wahba's loss function, but without the constraint. When the constraint is ignored, the problem can be solved by a straightforward, numerically stable least-squares algorithm such as QR decomposition. Even though the algorithm does not explicitly take the constraint into account, it still yields a nearly orthogonal matrix for most practical cases; orthogonality only becomes corrupted when the sensor measurements are very noisy, on the same order of magnitude as the attitude rotations. The algorithm can be simplified if the attitude rotations are small enough so that the approximation sin(theta) approximately equals theta holds. We then compare the computational requirements for several well-known algorithms. For the general large-angle case, the QR least-squares algorithm is competitive with all other know algorithms and faster than most. If attitude rotations are small, the least-squares algorithm can be modified to run faster, and this modified algorithm is faster than all but a similarly specialized version of the QUEST algorithm. We also introduce a novel measurement averaging technique which reduces the n-measurement case to the two measurement case for our particular application, a star tracker and earth sensor mounted on an earth-pointed geosynchronous communications satellite. Using this technique, many n-measurement problems reduce to less than or equal to 3 measurements; this reduces the amount of required calculation without significant degradation in accuracy. Finally, we present the results of some tests which compare the least-squares algorithm with the QUEST and FOAM algorithms in the two-measurement case. For our example case, all three algorithms performed with similar accuracy.

Brozenec, Thomas F.↗

Run Time Assurance for Electric Vertical Takeoff and Landing Aircraft

NASA is conducting research to demonstrate and evaluate the application of Run Time Assurance (RTA) as a means to assure safety in Electric Vertical Takeoff and Landing (eVTOL) aircraft with highly automated or autonomous flight capability supervised by a single onboard pilot. The work described in this report demonstrates an application of RTA and examines the implications for design and analysis of aircraft functions and systems; aircraft safety hazards; safety assurance; development assurance; and pilot tasks and performance. This research effort also seeks to assess the efficacy of the combined application of traditional Functional Hazard Analysis (FHA) and the more modern System Theoretic Process Analysis (STPA) techniques to perform hazard analyses on aircraft with complex automated and autonomous systems and an onboard pilot. During the research effort we developed architectural designs of two alternate eVTOL aircraft, generally following the process characterized in the SAE standards ARP4754 and ARP4761. The design has focused on the control architectures of these aircraft, which are identical except that one incorporates RTA techniques to reduce the criticality of some key software components. Artifacts of this process include a taxonomy of aircraft-level functions, aircraft-level architecture diagrams, aircraft-level functional hazard assessments (AFHA), function allocations onto aircraft systems and subsystems, functional block diagrams for a select set of control-related functions, and system-level functional hazard assessments (SFHA) for those functions. This project has highlighted the notion that DAL D is something of a sweet spot for low-confidence controllers in an RTA-based design. Among the many activities described in DO-178C, the activities related to requirement verifiability, algorithmic accuracy, and test coverage can be the most challenging for the kinds of advanced control techniques that may be desirable in novel UAM designs, such as adaptive control, machine-learning, artificial intelligence, numerical search, and Monte Carlo based algorithms. Moreover, the standard requires that development teams demonstrate that errors leading to unacceptable failure conditions have been removed from the software. The RTA architecture, which cordons off the low-confidence function, makes it much easier to show this for these kinds of algorithms. With regard to the use of STPA and FHA as complementary hazard analysis techniques, our research effort led us to the conclusion that STPA should be used to derive requirements for hardware and software systems and/or components. Also, STPA is a natural complement to other processes in ARP4754A involving design studies and iteration.

Run-time assurance↗