Search NASA⌕ Search

SEARCH · Search NASA

Results for “problem solving complexity”

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 793 records · Page 44
All sourcesNASA NTRSDOE OSTI
NASA NTRS2002

Sensor Web Architectural Concepts and Implementation Challenges - An Heuristic Approach

There is a significant interest in the Earth Science remote sensing community to increase the number of observations. The obvious reasons for such a push is to improve the temporal and surface coverage of measurements. However, there is little analysis available in terms of benefits, costs and optimized set of sensors needed to make these necessary observations. In reality, this is a complex problem that should be carefully studied and balanced over many boundaries. For example, the question of technology maturity versus users desire to obtain additional measurements is non congruent. This is further complicated by the limitations of the laws of physics and the economic conditions. With the advent of advance technology, it is anticipated that the cost of the spacecraft technology will become more affordable. However, the specialized detector subsystems, and the precision flying techniques may still require substantial innovation, development time and cost. Additionally, the space deployment scheme should also be given a careful attention because of a high expense. Nonetheless, it is important to carefully examine the science priorities and steer the development efforts that can commensurate with the tangible requirements. This paper outlines a possible set of architectural concepts, operational scenarios and potential benefits of one scheme versus another. It further makes some suggestions where one can draw some boundary conditions to incrementally solve this predicament.

Habib, Shahid↗
NASA NTRS2003

Efficient Low Dissipative High Order Schemes for Multiscale MHD Flows, I: Basic Theory

The objective of this paper is to extend our recently developed highly parallelizable nonlinear stable high order schemes for complex multiscale hydrodynamic applications to the viscous MHD equations. These schemes employed multiresolution wavelets as adaptive numerical dissipation controls t o limit the amount of and to aid the selection and/or blending of the appropriate types of dissipation to be used. The new scheme is formulated for both the conservative and non-conservative form of the MHD equations in curvilinear grids. The four advantages of the present approach over existing MHD schemes reported in the open literature are as follows. First, the scheme is constructed for long-time integrations of shock/turbulence/combustion MHD flows. Available schemes are too diffusive for long-time integrations and/or turbulence/combustion problems. Second, unlike exist- ing schemes for the conservative MHD equations which suffer from ill-conditioned eigen- decompositions, the present scheme makes use of a well-conditioned eigen-decomposition obtained from a minor modification of the eigenvectors of the non-conservative MHD equations t o solve the conservative form of the MHD equations. Third, this approach of using the non-conservative eigensystem when solving the conservative equations also works well in the context of standard shock-capturing schemes for the MHD equations. Fourth, a new approach to minimize the numerical error of the divergence-free magnetic condition for high order schemes is introduced. Numerical experiments with typical MHD model problems revealed the applicability of the newly developed schemes for the MHD equations.

Sjoegreen, Bjoern↗
NASA NTRS2012

Extension of the Time-Spectral Approach to Overset Solvers for Arbitrary Motion

Forced periodic flows arise in a broad range of aerodynamic applications such as rotorcraft, turbomachinery, and flapping wing configurations. Standard practice involves solving the unsteady flow equations forward in time until the initial transient exits the domain and a statistically stationary flow is achieved. It is often required to simulate through several periods to remove the initial transient making unsteady design optimization prohibitively expensive for most realistic problems. An effort to reduce the computational cost of these calculations led to the development of the Harmonic Balance method [1, 2] which capitalizes on the periodic nature of the solution. The approach exploits the fact that forced temporally periodic flow, while varying in the time domain, is invariant in the frequency domain. Expanding the temporal variation at each spatial node into a Fourier series transforms the unsteady governing equations into a steady set of equations in integer harmonics that can be tackled with the acceleration techniques afforded to steady-state flow solvers. Other similar approaches, such as the Nonlinear Frequency Domain [3,4,5], Reduced Frequency [6] and Time-Spectral [7, 8, 9] methods, were developed shortly thereafter. Additionally, adjoint-based optimization techniques can be applied [10, 11] as well as frequency-adaptive methods [12, 13, 14] to provide even more flexibility to the method. The Fourier temporal basis functions imply spectral convergence as the number of harmonic modes, and correspondingly number of time samples, N, is increased. Some elect to solve the equations in the frequency domain directly, while others choose to transform the equations back into the time domain to simplify the process of adding this capability to existing solvers, but each harnesses the underlying steady solution in the frequency domain. These temporal projection methods will herein be collectively referred to as Time-Spectral methods. Time-Spectral methods have demonstrated marked success in reducing the computational costs associated with simulating periodic forced flows, but have yet to be fully applied to overset or Cartesian solvers for arbitrary motion with dynamic hole-cutting. Overset and Cartesian grid methodologies are versatile techniques capable of handling complex geometry configurations in practical engineering applications, and the combination of the Time-Spectral approach with this general capability potentially provides an enabling new design and analysis tool. In an arbitrary moving-body scenario for these approaches, a Lagrangian body moves through a fixed Eulerian mesh and mesh points in the Eulerian mesh interior to the solid body are removed (cut or blanked), leaving a hole in the Eulerian mesh. During the dynamic motion some gridpoints in the domain are blanked and do not have a complete set of time-samples preventing a direct implementation of the Time-Spectral method. Murman[6] demonstrated the Time-Spectral approach for a Cartesian solver with a rigid domain motion, wherein the hole cutting remains constant. Similarly, Custer et al. [15, 16] used the NASA overset OVERFLOW solver and limited the amount of relative motion to ensure static hole-cutting and interpolation. Recently, Mavriplis and Mundis[17] demonstrated a qualitative method for applying the Time-Spectral approach to an unstructured overset solver for arbitrary motion. The goal of the current work is to develop a robust and general method for handling arbitrary motion with the Time-Spectral approach within an overset or Cartesian mesh method, while still approaching the spectral convergence rate of the original Time-Spectral approach. The viscous OVERFLOW solver will be augmented with the new Time-Spectral algorithm and the capability of the method for benchmark problems in rotorcraft and turbomachinery will be demonstrated. This abstract begins with a brief synopsis of the Time-Spectral approach for overset grids and provides details of e current approach to allow for arbitrary motion. Model problem results in one and two dimensions are included to demonstrate the viability of the method and the convergence properties. Section IV briefly outlines the implementation into the OVERFLOW solver, and the abstract closes with a description of the benchmark test cases which will be included in the final paper.

Leffell, Joshua Isaac↗
NASA NTRS2015

Underestimation of Project Costs

Large projects almost always exceed their budgets. Estimating cost is difficult and estimated costs are usually too low. Three different reasons are suggested: bad luck, overoptimism, and deliberate underestimation. Project management can usually point to project difficulty and complexity, technical uncertainty, stakeholder conflicts, scope changes, unforeseen events, and other not really unpredictable bad luck. Project planning is usually over-optimistic, so the likelihood and impact of bad luck is systematically underestimated. Project plans reflect optimism and hope for success in a supposedly unique new effort rather than rational expectations based on historical data. Past project problems are claimed to be irrelevant because "This time it's different." Some bad luck is inevitable and reasonable optimism is understandable, but deliberate deception must be condemned. In a competitive environment, project planners and advocates often deliberately underestimate costs to help gain project approval and funding. Project benefits, cost savings, and probability of success are exaggerated and key risks ignored. Project advocates have incentives to distort information and conceal difficulties from project approvers. One naively suggested cure is more openness, honesty, and group adherence to shared overall goals. A more realistic alternative is threatening overrun projects with cancellation. Neither approach seems to solve the problem. A better method to avoid the delusions of over-optimism and the deceptions of biased advocacy is to base the project cost estimate on the actual costs of a large group of similar projects. Over optimism and deception can continue beyond the planning phase and into project execution. Hard milestones based on verified tests and demonstrations can provide a reality check.

Cost estimation↗
NASA NTRS1999

Space-Time Conservation Element and Solution Element Method Being Developed

The engineering research and design requirements of today pose great computer-simulation challenges to engineers and scientists who are called on to analyze phenomena in continuum mechanics. The future will bring even more daunting challenges, when increasingly complex phenomena must be analyzed with increased accuracy. Traditionally used numerical simulation methods have evolved to their present state by repeated incremental extensions to broaden their scope. They are reaching the limits of their applicability and will need to be radically revised, at the very least, to meet future simulation challenges. At the NASA Lewis Research Center, researchers have been developing a new numerical framework for solving conservation laws in continuum mechanics, namely, the Space-Time Conservation Element and Solution Element Method, or the CE/SE method. This method has been built from fundamentals and is not a modification of any previously existing method. It has been designed with generality, simplicity, robustness, and accuracy as cornerstones. The CE/SE method has thus far been applied in the fields of computational fluid dynamics, computational aeroacoustics, and computational electromagnetics. Computer programs based on the CE/SE method have been developed for calculating flows in one, two, and three spatial dimensions. Results have been obtained for numerous problems and phenomena, including various shock-tube problems, ZND detonation waves, an implosion and explosion problem, shocks over a forward-facing step, a blast wave discharging from a nozzle, various acoustic waves, and shock/acoustic-wave interactions. The method can clearly resolve shock/acoustic-wave interactions, wherein the difference of the magnitude between the acoustic wave and shock could be up to six orders. In two-dimensional flows, the reflected shock is as crisp as the leading shock. CE/SE schemes are currently being used for advanced applications to jet and fan noise prediction and to chemically reacting flows.

Chang, Sin-Chung↗
NASA NTRS2019

A Mixed Integer Efficient Global Optimization Algorithm with Multiple Infill Strategy - Applied to a Wing Topology Optimization Problem

With the advancement in high performance computing and numerical optimization techniques,engineering design optimization problems are becoming more complex, larger scale,higher fidelity, and computationally more demanding, requiring longer run times than ever before. There exists methodologies and techniques that can address some of these challenges but very few can address all, and most are limited in the extent that these concerns can be addressed. With the goal of addressing such challenging engineering problems, we developed anew optimization framework, named AMIEGO, that combines concepts from surrogate-based optimization approaches, gradient-based numerical methods, Partial Least Squares, evolutionary algorithms, and Branch-and-Bound, providing newer capabilities that were not previouslyperceived. However, the original version of this framework, in the process of adaptive samplingto explore and exploit the design space, finds only a single sample point per iteration. The efforthere builds upon this previously developed optimization framework to include multiple infillsampling capability that combines the concept of generalized expected improvement function,unsupervised learning, and multi-objective evolutionary technique. To demonstrate, AMIEGOwith the multiple infill capability (called AMIEGO-MIMOS) solves a series of increasingly difficultengineering design optimization problems. The results reveal the performance of the newapproach is problem dependent. When applied to a ten-bar truss problem, the newly proposedmultiple infill strategy consistently leads to a better design solutions when compared to theexisting CPTV method (implemented with the context of the AMIEGO framework). On theother hand, when applied to a mixed-integer high fidelity wing topology optimization problem- MIMOS, despite showing a steeper convergence at the start, eventually leads to an inferiorsolution as compared to CPTV approach. These results also reveal that a small number ofstarting points, in general, are sufficient to lead to a good overall solution.

Mixed-integer optimization↗
NASA NTRS2000

LSENS, The NASA Lewis Kinetics and Sensitivity Analysis Code

A general chemical kinetics and sensitivity analysis code for complex, homogeneous, gas-phase reactions is described. The main features of the code, LSENS (the NASA Lewis kinetics and sensitivity analysis code), are its flexibility, efficiency and convenience in treating many different chemical reaction models. The models include: static system; steady, one-dimensional, inviscid flow; incident-shock initiated reaction in a shock tube; and a perfectly stirred reactor. In addition, equilibrium computations can be performed for several assigned states. An implicit numerical integration method (LSODE, the Livermore Solver for Ordinary Differential Equations), which works efficiently for the extremes of very fast and very slow reactions, is used to solve the "stiff" ordinary differential equation systems that arise in chemical kinetics. For static reactions, the code uses the decoupled direct method to calculate sensitivity coefficients of the dependent variables and their temporal derivatives with respect to the initial values of dependent variables and/or the rate coefficient parameters. Solution methods for the equilibrium and post-shock conditions and for perfectly stirred reactor problems are either adapted from or based on the procedures built into the NASA code CEA (Chemical Equilibrium and Applications).

Radhakrishnan, K.↗
NASA NTRS1995

Optimal guidance law development for an advanced launch system

The objective of this research effort was to develop a real-time guidance approach for launch vehicles ascent to orbit injection. Various analytical approaches combined with a variety of model order and model complexity reduction have been investigated. Singular perturbation methods were first attempted and found to be unsatisfactory. The second approach based on regular perturbation analysis was subsequently investigated. It also fails because the aerodynamic effects (ignored in the zero order solution) are too large to be treated as perturbations. Therefore, the study demonstrates that perturbation methods alone (both regular and singular perturbations) are inadequate for use in developing a guidance algorithm for the atmospheric flight phase of a launch vehicle. During a second phase of the research effort, a hybrid analytic/numerical approach was developed and evaluated. The approach combines the numerical methods of collocation and the analytical method of regular perturbations. The concept of choosing intelligent interpolating functions is also introduced. Regular perturbation analysis allows the use of a crude representation for the collocation solution, and intelligent interpolating functions further reduce the number of elements without sacrificing the approximation accuracy. As a result, the combined method forms a powerful tool for solving real-time optimal control problems. Details of the approach are illustrated in a fourth order nonlinear example. The hybrid approach is then applied to the launch vehicle problem. The collocation solution is derived from a bilinear tangent steering law, and results in a guidance solution for the entire flight regime that includes both atmospheric and exoatmospheric flight phases.

Calise, Anthony J.↗
NASA NTRS2003

Auction Mechanism to Allocate Air Traffic Control Slots

This article deals with an auction mechanism for airspace slots, as a means of solving the European airspace congestion problem. A disequilibrium, between Air Traffic Control (ATC) services supply and ATC services demand are at the origin of almost one fourth of delays in the air transport industry in Europe. In order to tackle this congestion problem, we suggest modifying both pricing and allocation of ATC services, by setting up an auction mechanism. Objects of the auction will be the right for airlines to cross a part of the airspace, and then to benefit from ATC services over a period corresponding to the necessary time for the crossing. Allocation and payment rules have to be defined according to the objectives of this auction. The auctioneer is the public authority in charge of ATC services, whose aim is to obtain an efficient allocation. Therefore, the social value will be maximized. Another objective is to internalize congestion costs. To that end, we apply the principle of Clarke-Groves mechanism auction: each winner has to pay the externalities imposed on other bidders. The complex context of ATC leads to a specific design for this auction.

Raffarin, Marianne↗
NASA NTRS1984

Fundamental differences between optimization code test problems in engineering applications

The purpose here is to suggest that there is at least one fundamental difference between the problems used for testing optimization codes and the problems that engineers often need to solve; in particular, the level of precision that can be practically achieved in the numerical evaluation of the objective function, derivatives, and constraints. This difference affects the performance of optimization codes, as illustrated by two examples. Two classes of optimization problem were defined. Class One functions and constraints can be evaluated to a high precision that depends primarily on the word length of the computer. Class Two functions and/or constraints can only be evaluated to a moderate or a low level of precision for economic or modeling reasons, regardless of the computer word length. Optimization codes have not been adequately tested on Class Two problems. There are very few Class Two test problems in the literature, while there are literally hundreds of Class One test problems. The relative performance of two codes may be markedly different for Class One and Class Two problems. Less sophisticated direct search type codes may be less likely to be confused or to waste many function evaluations on Class Two problems. The analysis accuracy and minimization performance are related in a complex way that probably varies from code to code. On a problem where the analysis precision was varied over a range, the simple Hooke and Jeeves code was more efficient at low precision while the Powell code was more efficient at high precision.

Eason, E. D.↗
NASA NTRS1986

On realizations of least-squares estimation and Kalman filtering by systolic arrays

Least-squares (LS) estimation is a basic operation in many signal processing problems. Given y = Ax + v, where A is a m x n coefficient matrix, y is a m x 1 observation vector, and v is a m x 1 zero mean white noise vector, a simple least-squares solution is finding the estimated vector x which minimizes the norm of /Ax-y/. It is well known that for an ill-conditioned matrix A, solving least-squares problems by orthogonal triangular (QR) decomposition and back substitution has robust numerical properties under finite word length effect since 2-norm is preserved. Many fast algorithms have been proposed and applied to systolic arrays. Gentleman-Kung (1981) first presented the trianglular systolic array for a basic Givens reduction. McWhirter (1983) used this array structure to find the least-squares estimation errors. Then by geometric approach, several different systolic array realizations of the recursive least-squares estimation algorithms of Lee et al (1981) were derived by Kalson-Yao (1985). Basic QR decomposition algorithms are considered in this paper and it is found that under a one-row time updating situation, the Householder transformation degenerates to a simple Givens reduction. Next, an improved least-squares estimation algorithm is derived by considering a modified version of fast Givens reduction. From this approach, the basic relationship between Givens reduction and Modified-Gram-Schmidt transformation can easily be understood. This improved algorithm also has simpler computational and inter-cell connection complexities while compared with other known least-squares algorithms and is more realistic for systolic array implementation.

Chen, M. J.↗
NASA NTRS1993

A comparison of high resolution upwind solvers on 3-D inviscid hypersonic flows

A detailed comparison of numerical results obtained by solving the Euler equations for the inviscid flow over delta wings in reentry configurations is presented. The investigation involves a side-by-side comparison between independently developed upwind Euler solvers at VKI (M3D) and NASA Johnson Space Center (E3D) using identical grids. In both solvers the governing equations are integrated by means of time marching finite volume shock capturing methods, based on a cell centered upwind evaluation of the cell face fluxes and nonlinear limiters. High resolution schemes are obtained via MUSCL characteristic variable extrapolation to ensure total variation diminishing (TVD) properties and therefore monotonic discontinuity capturing. Further comparisons are made with several published results by other authors based on both upwind and central discretizations. The present results contribute in asserting the high resolution upwind TVD schemes as the most reliable numerical technique to handle the strong discontinuities typical of high speed flows. The performances of the two upwind solvers are satisfactory and the numerical results in good agreement. However, the important issue of reaching a grid converged solution for the present complex three-dimensional inviscid flow problems was not achieved.

Manna, M.↗
NASA NTRS2009

NASA Composite Materials Development: Lessons Learned and Future Challenges

Composite materials have emerged as the materials of choice for increasing the performance and reducing the weight and cost of military, general aviation, and transport aircraft and space launch vehicles. Major advancements have been made in the ability to design, fabricate, and analyze large complex aerospace structures. The recent efforts by Boeing and Airbus to incorporate composite into primary load carrying structures of large commercial transports and to certify the airworthiness of these structures is evidence of the significant advancements made in understanding and use of these materials in real world aircraft. NASA has been engaged in research on composites since the late 1960 s and has worked to address many development issues with these materials in an effort to ensure safety, improve performance, and improve affordability of air travel for the public good. This research has ranged from synthesis of advanced resin chemistries to development of mathematical analyses tools to reliably predict the response of built-up structures under combined load conditions. The lessons learned from this research are highlighted with specific examples to illustrate the problems encountered and solutions to these problems. Examples include specific technologies related to environmental effects, processing science, fabrication technologies, nondestructive inspection, damage tolerance, micromechanics, structural mechanics, and residual life prediction. The current state of the technology is reviewed and key issues requiring additional research identified. Also, grand challenges to be solved for expanded use of composites in aero structures are identified.

Tenney, Darrel R.↗
NASA NTRS1994

A genetic technique for planning a control sequence to navigate the state space with a quasi-minimum-cost output trajectory for a non-linear multi-dimnensional system

There are many multi-stage optimization problems that are not easily solved through any known direct method when the stages are coupled. For instance, we have investigated the problem of planning a vehicle's control sequence to negotiate obstacles and reach a goal in minimum time. The vehicle has a known mass, and the controlling forces have finite limits. We have developed a technique that finds admissible control trajectories which tend to minimize the vehicle's transit time through the obstacle field. The immediate applications is that of a space robot which must rapidly traverse around 2-or-3 dimensional structures via application of a rotating thruster or non-rotating on-off for such vehicles is located at the Marshall Space Flight Center in Huntsville Alabama. However, it appears that the development method is applicable to a general set of optimization problems in which the cost function and the multi-dimensional multi-state system can be any nonlinear functions, which are continuous in the operating regions. Other applications included the planning of optimal navigation pathways through a transversability graph; the planning of control input for under-water maneuvering vehicles which have complex control state-space relationships; the planning of control sequences for milling and manufacturing robots; the planning of control and trajectories for automated delivery vehicles; and the optimization and athletic training in slalom sports.

Hein, C.↗
NASA NTRS2000

Effects of Inert Dust Clouds on the Extinction of Strained, Laminar Flames at Normal and Micro Gravity

A combined experimental and detailed numerical study was conducted on the interaction between chemically inert solid particles and strained, atmospheric methane/air and propane/air laminar flames, both premixed and non-premixed. Experimentally, the opposed jet configuration was used with the addition of a particle seeder capable of operating in conditions of varying gravity. The particle seeding system was calibrated under both normal and micro gravity and a noticeable gravitational effect was observed. Flame extinction experiments were conducted at normal gravity by seeding inert particles at various number densities and sizes into the reacting gas phase. Experimental data were taken for 20 and 37 (mu) nickel alloy and 25 and 60 (mu) aluminum oxide particles. The experiments were simulated by solving along the stagnation streamline the conservation equations of mass, momentum, energy, and species conservation for both phases, with detailed descriptions of chemical kinetics, molecular transport, and thermal radiation. The experimental data were compared with numerical simulations, and insight was provided into the effects on extinction of the fuel type, equivalence ratio, flame configuration, strain rate. particle type. particle size. particle mass, delivery rate. the orientation of particle injection with respect to the flame and gravity. It was found that for the same injected solid mass, larger particles can result in more effective flame cooling compared to smaller particles, despite the fact that equivalent masses of the larger particles have smaller total surface area to volume ratio. This counter-intuitive finding resulted from the fact that the heat exchange between the two phases is controlled by the synergistic effect of the total contact area and the temperature difference between the two phases. Results also demonstrate that meaningful scaling of interactions between the two phases may not be possible due to the complexity of the couplings between the dynamic and thermal parameters of the problem.

Andac, M. Gurhan↗
NASA NTRS2011

Should Pruning be a Pre-Processor of any Linear System?

There are many real-world problems whose mathematical models turn out to be linear systems Ax = b, where A is an m x n matrix. Each equation of the linear system is an information. An information, in a physical problem, such as 4 mangoes, 6 bananas, and 5 oranges cost $10, is mathematically modeled as an equation 4x(sub 1) + 6x(sub 2) + 5x(sub 3) = 10 , where x(sub 1), x(sub 2), x(sub 3) are each cost of one mango, that of one banana, and that of one orange, respectively. All the information put together in a specified context, constitutes the physical problem and need not be all distinct. Some of these could be redundant, which cannot be readily identified by inspection. The resulting mathematical model will thus have equations corresponding to this redundant information and hence are linearly dependent and thus superfluous. Consequently, these equations once identified should be better pruned in the process of solving the system. The benefits are (i) less computation and hence less error and consequently a better quality of solution and (ii) reduced storage requirements. In literature, the pruning concept is not in vogue so far although it is most desirable. It is assumed that at least one information, i.e. one equation is known to be correct and which will be our first equation. In a numerical linear system, the system could be slightly inconsistent or inconsistent of varying degree. If the system is too inconsistent, then we should fall back on to the physical problem (PP), check the correctness of the PP derived from the material universe, modify it, if necessary, and then check the corresponding mathematical model (MM) and correct it. In nature/material universe, inconsistency is completely nonexistent. If the MM becomes inconsistent, it could be due to error introduced by the concerned measuring device and/or due to assumptions made on the PP to obtain an MM which is relatively easily solvable or simply due to human error. No measuring device can usually measure a quantity with an accuracy greater that 0.005% or, equivalently with a relative error less than 0.005%. Hence measurement error is unavoidable in a numerical linear system when the quantities are continuous (or even discrete with extremely large number). Assumptions, though not desirable, are usually made when we find the problem sufficiently difficult to be solved within the available means/tools/resources and hence distort the PP and the corresponding MM. The . error thus introduced in the system could (not always necessarily though) make the system somewhat inconsistent. If the inconsistency (contradiction) is too much then one should definitely not proceed to solve the system in terms of getting a least-squares solution or the minimum-norm least-squares solution. All these solutions will be invariably of no real-world use. If, on the other hand, inconsistency is reasonably low, i.e. the system is near-consistent or, equivalently, has near-linearly-dependent rows, then the foregoing solutions are useful. Pruning in such a near-consistent system should be performed based on the desired accuracy and on the definition of near-linear dependence. In this article, we discuss pruning over various kinds of linear systems and strongly suggest its use as a pre-processor or as a part of an algorithm. Ideally pruning should (i) be a part of the solution process (algorithm) of the system, (ii) reduce both computational error and complexity of the process, and (iii) take into account the numerical zero defined in the context. These are precisely what we achieve through our proposed O(mn2) algorithm presented in Matlab, that uses a subprogram of solving a single linear equation and that has embedded in it the pruning.

Sen, Syamal K.↗
NASA NTRS1989

A second-generation supersonic transport

Ever since the advent of commercial flight vehicles, one goal of designers has been to develop aircraft that can fly faster and carry more passengers than before. After the development of practical supersonic military aircraft, this desire was naturally manifested in a search for a practical supersonic commercial aircraft. The first and, to date, only supersonic civil transport is the Concorde, manufactured by a consortium of British and French aerospace companies. Unfortunately, due to a number of factors, including low passenger capacity and limited range, the Concorde has not been an economic success. It is for this reason that there is considerable interest in developing a design for a supersonic civil transport that addresses some of the inadequacies of the Concorde. For the design of such an aircraft to be feasible in the near term, certain guidelines must be established at the outset. Based upon the experience with the Concorde, whose 100- passenger capacity is not large enough for profitable operation, a minimum capacity of 250 passengers is desired. Second, to date, because of the limited range of the Concorde, supersonic commercial flight has been restricted to trans-Atlantic routes. In order to broaden the potential market, any new design must have the capability of trans-Pacific flight. A summary of the potential markets involved is presented in Fig. 1. Also, because of both the cost and complexity involved with actively cooling an entire aircraft, an additional design constraint is that the aircraft as a whole be passively cooled. One additional design constraint is somewhat less quantitative in nature but of great importance nonetheless. Any time a new design is attempted, the tendency is to assume great strides in technology that serve as the basis for actual realization of the design. While it is not always possible to avoid this dependence on "enabling technology," since this design is desired for the near term, it is prudent, wherever possible, to rely on already existing technology. This is of particular importance with respect to support technology such as airport terminals and runways. Based on the above introductory remarks, a possible approach to the design of a second-generation supersonic civil transport is presented below. The design Mach number for this aircraft is 3.5. This value was chosen as it represents the limiting Mach number in the absence of active cooling. The ensuing design attempts to deal with the particular problems that are the most demanding, while relying on proven technology where it is adequate. The report clearly does not solve, or even deal with, every aspect of the aircraft design. Rather, a general direction is suggested and supported with initial, approximate calculations.

W. Humphrey↗
NASA NTRS2011

Should Pruning be a Pre-Processor of any Linear System?

There are many real-world problems whose mathematical models turn out to be linear systems Ax = b , where A is an m by x n matrix. Each equation of the linear system is an information. An information, in a physical problem, such as 4 mangoes, 6 bananas, and 5 oranges cost $10, is mathematically modeled as 4x(sub 1) + 6x(sub 2) + 5x (sub 3) = 10, where x(sub 1), x(sub 2), x(sub 3) are each cost of one mango, that of one banana, and that of one orange, respectively. All the information put together in a specified context, constitutes the physical problem and need not be all distinct. Some of these could be redundant, which cannot be readily identified by inspection. The resulting mathematical model will thus have equations corresponding to this redundant information and hence are linearly dependent and thus superfluous. Consequently, these equations once identified should be better pruned in the process of solving the system. The benefits are (i) less computation and hence less error and consequently a better quality of solution and (ii) reduced storage requirements. In literature, the pruning concept is not in vogue so far although it is most desirable. In a numerical linear system, the system could be slightly inconsistent or inconsistent of varying degree. If the system is too inconsistent, then we should fall back on to the physical problem (PP), check the correctness of the PP derived from the material universe, modify it, if necessary, and then check the corresponding mathematical model (MM) and correct it. In nature/material universe, inconsistency is completely nonexistent. If the MM becomes inconsistent, it could be due to error introduced by the concerned measuring device and/or due to assumptions made on the PP to obtain an MM which is relatively easily solvable or simply due to human error. No measuring device can usually measure a quantity with an accuracy greater that 0.005% or, equivalently with a relative error less than 0.005%. Hence measurement error is unavoidable in a numerical linear system when the quantities are continuous (or even discrete with extremely large number). Assumptions, though not desirable, are usually made when we find the problem sufficiently difficult to be solved within the available means/tools/resources and hence distort the PP and the corresponding MM. The error thus introduced in the system could (not always necessarily though) make the system somewhat inconsistent. If the inconsistency (contradiction) is too much then one should definitely not proceed to solve the system in terms of getting a least-squares solution or a minimum norm solution or the minimum-norm least-squares solution. All these solutions will be invariably of no real-world use. If, on the other hand, inconsistency is reasonably low, i.e. the system is near-consistent or, equivalently, has near-linearly-dependent rows, then the foregoing solutions are useful. Pruning in such a near-consistent system should be performed based on the desired accuracy and on the definition of near-linear dependence. In this article, we discuss pruning over various kinds of linear systems and strongly suggest its use as a pre-processor or as a part of an algorithm. Ideally pruning should (i) be a part of the solution process (algorithm) of the system, (ii) reduce both computational error and complexity of the process, and (iii) take into account the numerical zero defined in the context. These are precisely what we achieve through our proposed O(mn2) algorithm presented in Matlab, that uses a subprogram of solving a single linear equation and that has embedded in it the pruning.

Sen, Syamal K.↗