Search NASA⌕ Search

SEARCH · Search NASA

Results for “deterministic method”

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 361 records · Page 20

A System to Provide Deterministic Flight Software Operation and Maximize Multicore Processing Performance: The Safe and Precise Landing – Integrated Capabilities Evolution (SPLICE) Datapath

A method and design are described for a system that processes multiple data streams, utilizing a multicore asymmetric processing architecture, that eliminates data interrupts to the application processors. The design supports a deterministic environment for flight software in NASA’s Safe and Precise Landing – Integrated Capabilities Evolution (SPLICE) project. The SPLICE project develops sensor, algorithm, and compute technologies for Precision Landing and Hazard Avoidance (PL&HA) capabilities. The compute technology for SPLICE is the Descent and Landing Computer (DLC). The DLC hosts several SPLICE algorithms with high computational resource requirements that must be executed in a real-time and deterministic manner. The software runs on a custom Single Board Computer (SBC), with a Xilinx Ultrascale+ Multiprocessor System-on-a-Chip (MPSoC). Input data for the flight software is from a variety of sensors, unique with respect to data rate and packet size. A data path between the SPLICE sensors and algorithms is designed to efficiently deliver this data to the flight software using the MPSoC asymmetric processing cores and Field Programmable Gate Array (FPGA) fabric. This is implemented in a manner that isolates the application processors running the flight software from interrupts associated with the input data. By leveraging real-time processors on the MPSoC, and a structure with the appropriate interfaces in the shared memory on the SBC, the flight software can use the full set of application processors. The available utilization for each processor in this set is also maximized for the SPLICE applications, providing a sufficiently deterministic execution environment without the cost and overhead of a real-time operating system.

David K. Rutishauser↗

A Machine Learning Approach to Improve Air Traffic Management Initiatives

Collaborating closely with commercial air carriers and related organizations, the Federal Aviation Administration(FAA) regulates air traffic and ensures the safety and efficiency of air operations. Air traffic controllers make strategic decisions, such as delaying, rerouting, or canceling flights, partly based on guidance provided by the FAA’s Air TrafficControl System Command Center (ATCSCC). The guidance includes, among other things, control measures known asTraffic Management Initiatives (TMIs) designed to enhance safety and improve operational efficiency. TMIs play a crucial role in managing the demand and capacity within the U.S. National Airspace System (NAS). Two major TMIs that are routinely used (primarily to mitigate the adverse effects of bad weather) are Ground Delay Programs (GDPs) andGround Stops (GSs). In a GDP, flights destined for airports facing thunderstorm activity experience delays at their origin airports. This proactive approach minimizes the risk of routing aircraft through hazardous weather conditions and also replaces (fuel burning) airborne delays with ground delays. In a GS, a temporary restriction is imposed on the departure or arrival of aircraft at a specific airport or within a designated airspace. Although other TMIs (e.g., miles-in-trail) are also implemented as part of (air) traffic flow management in the NAS, the focus of this work is on GDPs and GSs. Since TMIs, by design, lead to flight delays or cancellations, it is crucial to put in place the right set of parameters(e.g., scope and duration of the GDP). For example, when the end time of a GDP extends beyond what is necessary, it imposes unnecessary delays on departing flights. This situation could occur as a result of inaccurate prediction of the(required) duration of the GDP based on the weather forecast. On the other hand, if a GDP ends prematurely before the underlying capacity constraints are resolved at the destination airport, it may result in airborne holding. The delicate balance lies in matching the termination of the GDP precisely with the resolution of capacity constraints, avoiding both the imposition of unnecessary ground delays and the need for airborne holding due to premature program termination.Failing to specify the right parameters for TMIs also leads to flight delays, creating a significant obstacle in managing the increasing traffic volumes causing increased work load for the controllers. To address this issue, we propose the integration of Machine Learning (ML) models in the traffic flow management(TFM) pipeline. In current operations, decisions are made by human experts based on extensive training, historical patterns, available traffic and weather data. Since we have an abundance of data from past events that tell us the likely impact of various TMIs, by ingesting historical data, properly trained ML models can offer valuable insights and aid human decision-making. With the FAA increasingly exploring advanced analytics, ML emerges as a focal point for enhancing TFM within the National Airspace System (NAS). As a first step, this study aims to provide traffic controllers with decision-making support for the issuance and adjustment of TMIs. Data analytics and machine learning have been previously employed to address some of the challenges associated with TMIs. Numerous studies have concentrated on various facets of TMI issuance, exploring factors influencing TMI parameters, including arrival rate, airport capacity, and delay prediction. For example, using weather forecasts, several statistical methods were used to produce probabilistic capacity profiles which in conjunction with deterministic models provided insights into the GDP planning process [1–4]. The downside of using deterministic models is that they rely on fixed inputs and predetermined rules, which lack the ability to account for the inherent uncertainty and variability present in real-world scenarios. In a separate series of studies, researchers aimed to predict the occurrences of GDPs and GSs. The majority of these studies utilized various supervised learning methods, including Decision Trees, Naive Bayes, Support VectorMachines, and Random Forests to analyze the influence of weather conditions and arrival demand on TMI incidents[5–8]. However, these studies primarily focused on predicting the incidence of TMIs without explicitly addressing the scope of TMIs, including their duration and their geographical coverage. Furthermore, the emphasis of these studies was largely on GDPs, given their higher frequency and longer duration when compared to GSs. A limited number of studies focused on predicting the parameters of TMIs, specifically addressing their duration and extent. In one such study focusing on optimizing the TMI parameters at San Francisco International Airport (SFO),the authors utilized a probabilistic forecast of fog [9]. They simulated various capacity scenarios based on the (fog)burn-off forecasts, selecting GDP parameters that minimized airborne and overall ground delays. However, this approach exclusively emphasizes stratus (fog) burn-off as the primary determinant of GDP and GS, neglecting other influential factors like severe weather events, runway closures, lower capacity than traffic demand, and other important variables. Given the complexity of predicting the TMI and determining its scope, we seek a more holistic approach. We aim to consider all significant factors that could impact TMIs and their parameters. What sets this research apart is the fusion of all data sources relevant to the issuance and adjustment of TMIs and it represents the first comprehensive attempt to optimize TMIs in this manner. Since this comprehensive solution involves various aspects, we break down the problem into smaller components and input all parameters into a unified model called the “TMI Adjuster”. Figure 1 shows the overall framework and the list of datasets used in each model. The objective of the TMI Adjuster module is to deliver reliable, consistent and expedited recommendations for the progression, adjustment, and termination of TMIs. The ML solution entails developing a pipeline capable of predicting the necessity of a TMI (e.g., GS or GDP) along with its various parameters. For example, in the case of a GS, this includes the scope of the GS either in terms of distance from the destination airport or based on pre-defined airspace sectors. Here, scope refers to those regions and departing airports that are subject to the GS. In this paper, we concentrate on the issuance of GSs in the three major airports in the New York area — LaGuardia(LGA), John F. Kennedy International (JFK), and Newark Liberty International (EWR). We fuse traffic, weather and other relevant aviation data from years 2017 to 2019 to train and validate the ML models. In particular, we use the following datasets: •Terminal Aerodrome Forecast (TAF): meteorological forecasts specific to each airport, issued four times a day, covering predefined time periods. •TMI data: includes all GSs and GDPs along with their respective parameters. •Aviation System Performance Metrics (ASPM): includes traffic related data such as aircraft delays, arrival, and departure rates. •Notices to Airmen (NOTAMs): utilized to extract runway closure data and manage interdependencies between terminals in close proximity. •Flight cancellation data •Airspace Flow Programs (AFP): includes information on flight airborne holdings caused by TMIs. The data preprocessing entails transforming ASPM, TMI, AFP, NOTAMs, and weather data into an hourly format and consolidating all datasets by merging them based on date and time as the primary key. The TMI Adjuster framework comprises two parallel models: one dedicated to GS and a second model focused on GDP. As previously mentioned, our specific focus is on the GS model as a multi-classification problem. In this framework, each data point of the GS model input summarizes ten hours of data. Specifically, the data loader for the GS model generates the input and output of the model as follows: at a given time step, the input includes the actual traffic, weather, and TMI data from the two-hour window before the time step, alongside the weather forecast and scheduled traffic for the next 8 hours starting from the time step. Based on this information, the output of the GS model for each time interval consists of three dimensions. The first dimension represents a binary decision on whether there should be a GS in place for the next hour or not. The second dimension is related to the scope of the GS in the United States, and the third dimension is related to the scope of the GS in Canada (i.e., to determine if the GS impacts airports in Canada).One of the challenges with TMI modeling is the sparsity of TMI events, particularly regarding its scope. To address this challenge in the scope of the GS model output, we implement grouping. The GS scope for the US region is defined based on a list of centers that should be included when the GS is in place. With 20 centers in the US, we utilized historical data to group them into 4 categories. In particular, we summarized our historical data in a graph format where nodes represent centers, and link weights are defined based on the co-occurrence of centers in the scope parameter ofTMIs. By identified strongly connected components in this graph, we were able to partition the centers into four groups. We consider two model structures for the GS Model. Firstly, a hierarchical classification model [10], where the human decision-making for a GS is of hierarchical nature. The decision-maker first decides whether there is a need fora GS, and if the answer is yes, determines the scope. A hierarchical classification model organizes the problem into a class hierarchy, typically a tree or a Directed Acyclic Graph (DAG) structure, and considers the dependency of the decision in the previous step to the next component [10]. Here, we employ the local classifier per level approach, which involves training one multi-class classifier for each level of the class hierarchy. The second structure is the independent structure. In this setting, as the name suggests, we do not consider the dependency of the decisions in the different dimensions of the output of the model. Instead, for each dimension, we train a multi-class classifier independently. Table 1 summarizes GS model statistics for training, validation and testing. The table documents the effect of limiting data to the time steps when there was actually a TMI in place or when a TMI had just terminated. This resulted in a more balanced distribution of the GS class(GS positive class)versus “No GS”(GS negative class), which might help the training process. While JFK and LGA follow very similar distributions, with 40% and 42% GS positive class respectively, EWR has proportionally fewer GS incidents at 28%. Our subsequent phase involves evaluating the performance of both hierarchical structure and independent structure using different state-of-the-art multi-class classifier models such as Random Forest, Decision Trees, K-nearest Neighbors, and Logistic Regression and forecast the duration and scope of the GSs.

Farzan Masrour Shalmani↗

Numerical methods for fractional Fokker–Planck equation with multiplicative Marcus Lévy noises

The Fokker–Planck equation (FPE) is an important deterministic tool for investigating stochastic dynamical systems. In this paper, we consider the space-time fractional FPE driven by multiplicative Marcus Lévy noises. Efficient numerical schemes are presented to solve the equations. Stability and convergence of the methods are also discussed. We give some numerical experiments to validate our schemes, and examine the effects of parameters on solutions. Additionally, we analyze the maximal likely trajectories and the critical time for the change of the most probability location.

Mathematics↗

Efficient solution of the Wigner–Liouville equation using a spectral decomposition of the force field

The Wigner–Liouville equation is reformulated using a spectral decomposition of the classical force field instead of the potential energy. The latter is shown to simplify the Wigner–Liouville kernel both conceptually and numerically as the spectral force Wigner–Liouville equation avoids the numerical evaluation of the highly oscillatory Wigner kernel which is nonlocal in both position and momentum. The quantum mechanical evolution is instead governed by a term local in space and non-local in momentum, where the non-locality in momentum has only a limited range. An interpretation of the time evolution in terms of two processes is presented; a classical evolution under the influence of the averaged driving field, and a probability-preserving quantum-mechanical generation and annihilation term. Using the inherent stability and reduced complexity, a direct deterministic numerical implementation using Chebyshev and Fourier pseudo-spectral methods is detailed. For the purpose of illustration, we present results for the time-evolution of a one-dimensional resonant tunneling diode driven out of equilibrium.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Bottom-up fabrication of scalable room-temperature diamond quantum computing and sensing technologies

The nitrogen-vacancy (NV) centre in diamond is a premier solid-state defect for quantum information processing and metrology. An integrated diamond quantum device harnesses the collective properties of multiple NV centres, enabling room-temperature quantum computing and sensing. While large-scale devices are poised to fill an important gap in the burgeoning quantum technology landscape, their practical realisation has not been achieved using current top-down fabrication techniques such as ion implantation. Consequently, this necessitates the development of a bottom-up fabrication technique, which is scalable, deterministic, and possesses atomic-scale precision. Informed by existing methods for fabricating phosphorous defect qubits in silicon, we envision a hydrogen depassivation lithography technique for atomically-precise manufacturing of nitrogen-vacancy centres in diamond. This perspective article outlines a viable multi-step procedure for realising scalable fabrication of diamond quantum devices and identifies the key challenges in its development.

CVD↗

A Comparison of Monte Carlo and Deterministic Solvers for keff and Sensitivity Calculations

Verification and validation of our solutions for calculating the neutron reactivity for nuclear materials is a key issue to address for many applications, including criticality safety, research reactors, power reactors, and nuclear security. Neutronics codes solve variations of the Boltzmann transport equation. The two main variants are Monte Carlo versus deterministic solutions, e.g. the MCNP [1] versus PARTISN [2] codes, respectively. There have been many studies over the decades that examined the accuracy of such solvers and the general conclusion is that when the problems are well-posed, either solver can produce accurate results. However, the devil is always in the details. The current study examines the issue of self-shielding and the stress it puts on deterministic solvers. Most Monte Carlo neutronics codes use continuous-energy descriptions of the neutron interaction data that are not subject to this effect. The issue of self-shielding occurs because of the discretisation of data used by the deterministic solutions. Multigroup data used in these solvers are the average cross section and scattering parameters over an energy range. Resonances in cross sections can occur that change the likelihood of interaction by one to three orders of magnitude over a small energy range. Self-shielding is the numerical effect that the average cross section in groups with strong resonances can be strongly affected as neutrons within that material are preferentially absorbed or scattered out of the resonance energies. This affects both the average cross section and the scattering matrix.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Design of suboptimal regulators for nonlinear systems

An optimal feedback control law is preferred for the regulation of a deterministic nonlinear system. In this paper, a practical, iterative design method leading to a sequence of suboptimal control laws with successively improved performance is presented. The design method requires the determination of an upper bound to the performance of each successive control law. This is obtained by solving a partial differential inequality by means of a linear programming technique. Robustness properties and the application of the design method to the control of a robot manipulator arm are also presented.

Balaram, J.↗

Deterministic and Probabilistic Creep and Creep Rupture Enhancement to CARES/Creep: Multiaxial Creep Life Prediction of Ceramic Structures Using Continuum Damage Mechanics and the Finite Element Method

High temperature and long duration applications of monolithic ceramics can place their failure mode in the creep rupture regime. A previous model advanced by the authors described a methodology by which the creep rupture life of a loaded component can be predicted. That model was based on the life fraction damage accumulation rule in association with the modified Monkman-Grant creep ripture criterion However, that model did not take into account the deteriorating state of the material due to creep damage (e.g., cavitation) as time elapsed. In addition, the material creep parameters used in that life prediction methodology, were based on uniaxial creep curves displaying primary and secondary creep behavior, with no tertiary regime. The objective of this paper is to present a creep life prediction methodology based on a modified form of the Kachanov-Rabotnov continuum damage mechanics (CDM) theory. In this theory, the uniaxial creep rate is described in terms of stress, temperature, time, and the current state of material damage. This scalar damage state parameter is basically an abstract measure of the current state of material damage due to creep deformation. The damage rate is assumed to vary with stress, temperature, time, and the current state of damage itself. Multiaxial creep and creep rupture formulations of the CDM approach are presented in this paper. Parameter estimation methodologies based on nonlinear regression analysis are also described for both, isothermal constant stress states and anisothermal variable stress conditions This creep life prediction methodology was preliminarily added to the integrated design code CARES/Creep (Ceramics Analysis and Reliability Evaluation of Structures/Creep), which is a postprocessor program to commercially available finite element analysis (FEA) packages. Two examples, showing comparisons between experimental and predicted creep lives of ceramic specimens, are used to demonstrate the viability of this methodology and the CARES/Creep program.

Jadaan, Osama M.↗

DG-IMEX Stochastic Galerkin Schemes for Linear Transport Equation with Random Inputs and Diffusive Scalings

In this paper, we consider the linear transport equation under diffusive scaling and with random inputs. The method is based on the generalized polynomial chaos approach in the stochastic Galerkin framework. Several theoretical aspects will be addressed. Additionally, a uniform numerical stability with respect to the Knudsen number ϵ, and a uniform in ϵ error estimate is given. For temporal and spatial discretizations, we apply the implicit–explicit scheme under the micro–macro decomposition framework and the discontinuous Galerkin method, as proposed in Jang et al. (SIAM J Numer Anal 52:2048–2072, 2014) for deterministic problem. Lastly, we provide a rigorous proof of the stochastic asymptotic-preserving (sAP) property. Extensive numerical experiments that validate the accuracy and sAP of the method are conducted.

97 MATHEMATICS AND COMPUTING↗

Response of launch pad structures to random acoustic excitation

Two solutions (probabilistic and deterministic) for the random vibration problem are presented in this paper from the standpoint of their applicability to predict the response of ground structures subjected to acoustic loading during the launch of a Space Shuttle. Deficiencies of the probabilistic method, especially to predict response in the low-frequency regime, prompted the development of the deterministic analysis, which offers a valid alternative. Challenges associated with the implementation of these response solutions in a commercially available Finite Element Method (FEM) code are briefly addressed.

Margasahayam, Ravi↗

Implementation of Krylov acceleration method for 3D S{sub N} transport code AETIUS with unstructured tetrahedral mesh - 25557

We have been developing an in-house deterministic neutron and gamma transport solver, AETIUS (An Easy modeling Transport code using Unstructured tetrahedral mesh, Shared memory parallel). To achieve fast results, BiCGStab (one of the Krylov acceleration methods) was implemented as a within-group iteration solver. In this paper, two test problems (simple double cube problem and helical tube in the outer cube problem) were used to verify the acceleration performance. The number of iterations and the calculation time were demonstrated and compared with the source iteration. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

Tensor Decompositions for Count Data that Leverage Stochastic and Deterministic Optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the global maximum likelihood estimator from local minima. Simultaneously, a recent trend in theoretical computer science and numerical linear algebra leverages randomization to solve very large, hard problems. The typical approach is to use randomization for a fast approximation and determinism for refinement to yield effective algorithms with theoretical guarantees. Two popular algorithms for Poisson CPD reflect that emergent dichotomy: CP Alternating Poisson Regression is a deterministic algorithm and Generalized Canonical Polyadic decomposition makes use of stochastic algorithms in several variants. This work extends recent work to develop two new methods that leverage randomized and deterministic algorithms for improved accuracy and performance.

97 MATHEMATICS AND COMPUTING↗

Nonlinear Elimination Applied to Radiation Diffusion

We apply a nonlinearly preconditioned, quasi-Newton framework to accelerate the numerical solution of the thermal radiative transfer (TRT) equations. This framework was inspired by the unpublished method that has existed for years in Teton, Lawrence Livermore National Laboratory’s deterministic TRT code. In this paper, we cast this iteration scheme within a formal nonlinear preconditioning framework and compare its performance against other iteration schemes in the framework. With proper choices of iteration controls for the various levels of the solver, we can recover the standard linearized one-step method, a full nonlinear Newton scheme, as well as the method in Teton. In brief, the nonlinear preconditioning TRT scheme formally eliminates the material temperature equation from the nonlinear system in a nonlinear analog of a Schur complement. This nonlinear elimination step involves solving a decoupled nonlinear equation for each spatial degree of freedom and is therefore inexpensive. By applying a quasi-Newton iteration scheme on the new system, we obtain a three-level iteration scheme that is at least as efficient as commonly used TRT schemes. The new method allows full convergence to the nonlinear backward Euler time-discretized system, increasing accuracy and robustness, while using a similar number of linear iterations as the more common linearized one-step methods Eq. (4).

77 NANOSCIENCE AND NANOTECHNOLOGY↗

A stochastic Galerkin method for first-order quasilinear hyperbolic systems with uncertainty

This paper is concerned with generalized polynomial chaos (gPC) approximation for first-order quasilinear hyperbolic systems with uncertainty. The one-dimensional (1D) hyperbolic system is first symmetrized with the aid of left eigenvector matrix of the Jacobian matrix. Then the gPC stochastic Galerkin method is applied to derive a provably symmetrically hyperbolic equations for the gPC expansion coefficients. The resulting deterministic gPC Galerkin system is discretized by a path-conservative finite volume WENO scheme in space and a third-order total variation diminishing Runge–Kutta method in time. The method is further extended to two-dimensional (2D) quasilinear hyperbolic system with uncertainty, where the symmetric hyperbolicity of the one-dimensional gPC Galerkin system is carried over via an operator splitting technique. Several numerical experiments are conducted to demonstrate the accuracy and effectiveness of the proposed gPC stochastic Galerkin method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On-Orbit Calibration of Redundant Spacecraft Gyros by Optimal Reduction to Three Axes

The Aqua spacecraft will carry four single-axis gyros configured with three orthogonal axes and one skew axis. This redundancy presents a challenge for batch methods of on-orbit gyro calibration that use a spacecraft rotation model deterministically related to gyro data, in that sensor data can respond to at most three angular velocity components. When the number of gyros, N, is greater than 3, the 3xN matrix, G, that reduces the N gyro measurements to three body-frame angular-velocity components cannot be fully determined by such methods; there are many such matrices that produce essentially the same angular velocity history. In such a case, spacecraft operators require information about the Nx3 gyro linear response matrix, R, that relates gyro outputs to the body-frame angular velocities causing them. This matrix provides sufficient information to determine multiple reduced-dimension G-matrices for use in case of failure or degradation of one or more gyros, as well as to determine an optimal 3xN G for the fully-functional configuration. A viable proposal is to apply a 3xN pre-filter matrix, F, to the N gyro outputs before carrying out a conventional gyro calibration procedure. The angular-velocity history emerging from conventional calibration may then be used as input data, together with the same gyro data that generated it, to fit the alignment, scale-factor, and bias parameters of each gyro axis in turn. A difficulty of such a proposal is the arbitrariness in the choice of F. Due to gyro noise, different pre-filter matrices produce different calibrations. This paper presents a method of choosing F that is based on optimizing gyro consistency in the limit of infinite weight on gyro data, as compared to sensor data. The choice of F is independent of a priori alignment and is based on the gyro data alone. The method is applicable to any N of three or more, but reduces to conventional batch-estimation methodologies when N = 3. Results of computational comparison among calibration simulations using various choices of F will be presented for the Aqua gyro configuration with N = 4.

Radomski, M. S.↗

Adiabatic phase-conserving processes for executing quantum operations with ultracold atoms

We have studied the regimes of deterministic single-atom Rydberg excitation in the conditions of Rydberg blockade and the methods of compensation for the dynamic phase of the wave function during the adiabatic passage. Using these methods, we have proposed schemes of single-qubit and two-qubit quantum states with mesoscopic atomic ensembles containing a random number of atoms, considred as quibits. The double adiabatic passage of the Förster resonance for two interacting atoms with a deterministic phase shift can be used for the implementation of two-qubit gates with reduced sensitivity of the gate fidelity to the fluctuations of the interatomic distance. (paper)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A survey of inlet/engine distortion compatibility

The history of distortion analysis is traced back to its origin in parallel compressor theory which was initially proposed in the late fifties. The development of this theory is reviewed up to its inclusion in the complex computer codes of today. It is found to be a very useful tool to guide development but not quantitative enough to predict compatibility. Dynamic or instantaneous distortion methodology is also reviewed from its origins in the sixties, to its current application in the eighties. Many of the requirements for interpreting instantaneous distortion are considered and illustrated. Statistical methods for predicting the peak distortion are described, and their limitations and advantages discussed. Finally, some Reynolds number and scaling considerations for inlet testing are considered. It is concluded that the deterministic instantaneous distortion methodology combined with distortion testing of engines with screens will remain the primary method of predicting compatibility for the near future. However, parallel compressor analysis and statistical peak distortion prediction will be important tools employed during the development of inlet/engine compatibility.

Bowditch, D. N.↗

A survey of inlet/engine distortion compatibility

The history of distortion analysis is traced back to its origin in parallel compressor theory which was initially proposed in the late fifties. The development of this theory is reviewed up to its inclusion in the complex computer codes of today. It is found to be a very useful tool to guide development but not quantitative enough to predict compatibility. Dynamic or instantaneous distortion methodology is also reviewed from its origins in the sixties, to its current application in the eighties. Many of the requirements for interpreting instantaneous distortion are considered and illustrated. Statistical methods for predicting the peak distortion are described, and their limitations and advantages discussed. Finally, some Reynolds number and scaling considerations for inlet testing are considered. It is concluded that the deterministic instantaneous distortion methodology combined with distortion testing of engines with screens will remain the primary method of predicting compatibility for the near future. However, parallel compressor analysis and statistical peak distortion prediction will be important tools employed during the development of inlet/engine compatibility. Previously announced in STAR as N83-27991

Bowditch, D. N.↗