Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iteration 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 1,747 records · Page 97

Computerized Inspection Of Gear-Tooth Surfaces

Method of manufacturing gears with precisely shaped teeth involves computerized inspection of gear-tooth surfaces followed by adjustments of machine-tool settings to minimize deviations between real and theoretical versions of surfaces. Thus, iterated cycles of cutting gear teeth, inspection, and adjustments help increase and/or maintain precision of subsequently manufactured gears.

Handschuh, R. F.↗

QTGA Analysis with Concurrent Deposition

Analysis of outgassed species behavior is often performed using QCM thermogravimetric analysis (QTGA). Prior methods are suited to laboratory testing of materials samples where the source of contaminant can be removed from the system. An approach suitable presented for use during hardware bakeout and outgassing certification is presented. An iterative process is shown to fit surface activation energies and the arrival flux for multiple species.

Hughes, David W.↗

Real-Time Exponential Curve Fits Using Discrete Calculus

An improved solution for curve fitting data to an exponential equation (y = Ae(exp Bt) + C) has been developed. This improvement is in four areas -- speed, stability, determinant processing time, and the removal of limits. The solution presented avoids iterative techniques and their stability errors by using three mathematical ideas: discrete calculus, a special relationship (be tween exponential curves and the Mean Value Theorem for Derivatives), and a simple linear curve fit algorithm. This method can also be applied to fitting data to the general power law equation y = Ax(exp B) + C and the general geometric growth equation y = Ak(exp Bt) + C.

Rowe, Geoffrey↗

Greedy Sampling and Incremental Surrogate Model-Based Tailoring of Aeroservoelastic Model Database for Flexible Aircraft

This paper presents a data analysis and modeling framework to tailor and develop linear parameter-varying (LPV) aeroservoelastic (ASE) model database for flexible aircrafts in broad 2D flight parameter space. The Kriging surrogate model is constructed using ASE models at a fraction of grid points within the original model database, and then the ASE model at any flight condition can be obtained simply through surrogate model interpolation. The greedy sampling algorithm is developed to select the next sample point that carries the worst relative error between the surrogate model prediction and the benchmark model in the frequency domain among all input-output channels. The process is iterated to incrementally improve surrogate model accuracy till a pre-determined tolerance or iteration budget is met. The methodology is applied to the ASE model database of a flexible aircraft currently being tested at NASA/AFRC for flutter suppression and gust load alleviation. Our studies indicate that the proposed method can reduce the number of models in the original database by 67%. Even so the ASE models obtained through Kriging interpolation match the model in the original database constructed directly from the physics-based tool with the worst relative error far below 1%. The interpolated ASE model exhibits continuously-varying gains along a set of prescribed flight conditions. More importantly, the selected grid points are distributed non-uniformly in the parameter space, a) capturing the distinctly different dynamic behavior and its dependence on flight parameters, and b) reiterating the need and utility for adaptive space sampling techniques for ASE model database compaction. The present framework is directly extendible to high-dimensional flight parameter space, and can be used to guide the ASE model development, model order reduction, robust control synthesis and novel vehicle design of flexible aircraft.

numerical analysi↗

Finding Every Root of a Broad Class of Real, Continuous Functions in a Given Interval

One of the most pervasive needs within the Deep Space Network (DSN) Metric Prediction Generator (MPG) view period event generation is that of finding solutions to given occurrence conditions. While the general form of an equation expresses equivalence between its left-hand and right-hand expressions, the traditional treatment of the subject subtracts the two sides, leaving an expression of the form Integral of(x) = 0. Values of the independent variable x satisfying this condition are roots, or solutions. Generally speaking, there may be no solutions, a unique solution, multiple solutions, or a continuum of solutions to a given equation. In particular, all view period events are modeled as zero crossings of various metrics; for example, the time at which the elevation of a spacecraft reaches its maximum value, as viewed from a Deep Space Station (DSS), is found by locating that point at which the derivative of the elevation function becomes zero. Moreover, each event type may have several occurrences within a given time interval of interest. For example, a spacecraft in a low Moon orbit will experience several possible occultations per day, each of which must be located in time. The MPG is charged with finding all specified event occurrences that take place within a given time interval (or pass ), without any special clues from operators as to when they may occur, for the entire spectrum of missions undertaken by the DSN. For each event type, the event metric function is a known form that can be computed for any instant within the interval. A method has been created for a mathematical root finder to be capable of finding all roots of an arbitrary continuous function, within a given interval, to be subject to very lenient, parameterized assumptions. One assumption is that adjacent roots are separated at least by a given amount, xGuard. Any point whose function value is less than ef in magnitude is considered to be a root, and the function values at distances xGuard away from a root are larger than ef, unless there is another root located in this vicinity. A root is considered found if, during iteration, two root candidates differ by less than a pre-specified ex, and the optimum cubic polynomial matching the function at the end and at two interval points (that is within a relative error fraction L at its midpoint) is reliable in indicating whether the function has extrema within the interval. The robustness of this method depends solely on choosing these four parameters that control the search. The roots of discontinuous functions were also found, but at degraded performance.

Tausworthe, Robert C.↗

The numerical simulation of steady transonic rotational flow using a dual potential formulation

A finite-difference method is presented that simulates steady transonic rotational flow of an inviscid fluid by representing the velocity field as the sum of scalar and vector potentials. This dual potential velocity decomposition extends the validity of the scalar (full) velocity potential to include vorticity. The inclusion of a vector potential also permits an alternate treatment of lift that does not require a circulation wake cut. This is accomplished by specifying the vector potential as a constant on the airfoil surface in order to satisfy a Kutta condition. The governing equations are solved as iteratively decoupled scalar equations using approximate factorization techniques, and the overall efficiency approaches that of the full potential equation. The governing equations are able to convect entropy and vorticity throughout the flow field and are equivalent to the Euler equations in continuous flow domains, however at shocks the Rankine-Hugoniot entropy jump must be supplied. An entropy correction method is presented and verified with transonic airfoil solutions of the Euler equations.

Chaderjian, N. M.↗

The calculation of electron density profiles from topside ionograms: Method and applications

A method for converting topside sounder ionograms into topside electron density profiles is discussed. The lamination method used is modified to take into account the variation of electron density and magnetic field within each lamination. Also included is a change of variable to produce a finite integrand of the integral involved, an iteration scheme that permits convergence on an initially unknown density, a second iteration scheme to overcome the problem of an uncertainty in the electron density at the satellite, and a modification to compensate for the changing satellite altitude over the duration of the sounding. Two applications of the technique are discussed: field-aligned traces for computing field-aligned profiles and computer-aided systems for scaling ionograms.

Lockwood, G. E. K.↗

Minimal complexity control law synthesis

A paradigm for control law design for modern engineering systems is proposed: Minimize control law complexity subject to the achievement of a specified accuracy in the face of a specified level of uncertainty. Correspondingly, the overall goal is to make progress towards the development of a control law design methodology which supports this paradigm. Researchers achieve this goal by developing a general theory of optimal constrained-structure dynamic output feedback compensation, where here constrained-structure means that the dynamic-structure (e.g., dynamic order, pole locations, zero locations, etc.) of the output feedback compensation is constrained in some way. By applying this theory in an innovative fashion, where here the indicated iteration occurs over the choice of the compensator dynamic-structure, the paradigm stated above can, in principle, be realized. The optimal constrained-structure dynamic output feedback problem is formulated in general terms. An elegant method for reducing optimal constrained-structure dynamic output feedback problems to optimal static output feedback problems is then developed. This reduction procedure makes use of star products, linear fractional transformations, and linear fractional decompositions, and yields as a byproduct a complete characterization of the class of optimal constrained-structure dynamic output feedback problems which can be reduced to optimal static output feedback problems. Issues such as operational/physical constraints, operating-point variations, and processor throughput/memory limitations are considered, and it is shown how anti-windup/bumpless transfer, gain-scheduling, and digital processor implementation can be facilitated by constraining the controller dynamic-structure in an appropriate fashion.

Bernstein, Dennis S.↗

Numerical simulation of thermocapillary flow under zero and low gravity conditions

This paper discusses the numerical solution methods and results of steady and unsteady thermocapillary (surface-tension) and buoyancy driven flows in 2D cavities and liquid columns. The 2D cavity was assumed to be square with one free surface with a zero Capillary number (i.e., the free surface was constrained to be flat). A pseudospectral method was used to solve steady and unsteady surface tension-driven and mixed buoyancy-surface tension flows in a square cavity. For the liquid column a finite-difference scheme based on a Picard iteration was used to solve for the flow, temperature and free surface shape. The surface of the liquid column was allowed to deform and, as for the 2D cavity, the surface tension was assumed to depend on temperature.

Alexander, J. I. D.↗

Dynamic structural correlation via nonlinear programming techniques

A solution to the correlation between structural dynamic test results and finite element analyses of the same components is presented in this paper. Basically, the method can be categorized as a Levenberg-Marquardt type Gauss-Newton method which requires only the differences between FE modal analyses and test results and their first derivatives with respect to preassigned design variables. With proper variable normalization and equation scaling, the method has been made numerically better-conditioned and the inclusion of the Levenberg-Marquardt technique overcomes any remaining difficulty encountered in inverting singular or near-singular matrices. An important feature is that each iteration requires only one function evaluation along with the associated design sensitivity analysis and so the procedure is computationally efficient.

Ting, T.↗

Rational Design of Nanoplasmonic Array Geometries for Biosensing

Background: Molecular diagnostics provide early and accurate diagnosis, which is essential for the prevention and treatment of infectious as well as chronic diseases. These tests are designed to detect disease-specific bioanalytes such as nucleic acid (DNA or RNA) or protein (antigens, antibodies) biomarkers. In the context of infectious disease diagnosis, nucleic acid-based detection methods are known to provide more specific and sensitive results. Here, the presence of a unique sequence belonging to the pathogenic genomic material is targeted to identify species, organism, genera and/or antimicrobial resistant gene markers. The majority of the common nucleic acid based diagnostic techniques require amplification (polymerase chain reaction, isothermal amplification etc.) of the pathogenic genetic material prior to detection impacting diagnostic speed, complexity, and cost thereby limiting ease of use. Thus, the development of simplified nucleic acid-based diagnostics that can be even used in resource-poor settings may hugely benefit patients across the globe. Nanopath is a molecular diagnostics company utilizing a solid-state nanosensor to enable sequence-specific detection of target nucleic acids without the need of amplification. These nanostructures enable ultra-sensitive biomarker detection using geometric, feature-dependent properties highly dependent on the local dielectric environment, allowing them to be sensitive to low concentration binding events. This paper describes an application of this approach to provide highly relevant clinical information within a single doctor’s office visit. Intro: The Nanopath team is in collaboration with NASA (National Aeronautics and Space Administration) and NIST (National Institute of Standards and Technology) to push the bounds of the fundamental physics associated with their biosensing platform. The ability of metals to support electromagnetic surface waves gives rise to surface plasmons when optically illuminated. This property, and its strong sensitivity to changes in the local refractive index, allows for the use of metal nanoparticles as ultra-sensitive transducers. In prior work by members of this team, ensembles of randomly oriented nanoparticles (i.e., colloidal nanorods dispersed on chip) were employed for sequence-specific nucleic acid sensing (1-3). While these particle sensors have the advantage of rapid fabrication, they suffer from low sensitivity and quality factor due to the random particle dispersity. In contrast, in this study we employ ordered array nanoparticle ensembles which can be used to improve sensor sensitivity and figure-of-merit. Study Methods Overview: In this talk, we detail the results of sensing experiments and computational simulations to outline a rational design of the structure of these plasmonic nanoparticle arrays for biomolecular sensing. Through simulation and experiment, we iteratively tailor nanostructure dimension to provide high quality signal and large resonance shifts upon modeled nucleic acid binding. In particular, full-wave electromagnetic simulations were conducted using Lumerical photonic simulation software in which periodic boundary conditions were applied in the x- and y- dimensions for each of the nanoplasmonic sensor geometries. To simulate the resonance response to changes in the bulk solution in contact with the sensor surface, the refractive index of the surrounding media was changed appropriately. Nucleic acid hybridization events were modeled using either using spherical structures approximating the relevant radius of genomic material as estimated by polymer models, or as conformal layers with the known refractive indices for nucleic acids. On the basis of initial simulations, nanosensors were fabricated using traditional electron-beam lithography protocols at NIST. To evaluate consensus between simulations and experiments, bulk sensing experiments were carried out in which the resonance peaks were obtained by submerging the sensors in refractive index standards. Key nanosensor characteristics including resonance peak locations, resonance peak shifts as a function of refractive index, and figure of merit (FOM) of extinction curves were examined between the experimental and simulation results prior to proceeding with simulations on additional geometries and more complex solution conditions, and further device fabrication. This iterative process is repeated toward a rational design of nanoplasmonic array geometries for biosensing optimizing response for targeted disease detection. In summary, this study puts forth a methodology for rational design and characterization of regularly spaced nanoparticle arrays for optics-based biosensing. The results of this study will allow for more informed design of nanostructure geometries towards sequence-specific nucleic acid detection. These improved designs have the potential to improve clinical sensitivity and limit-of-detection across disease indication.

sensor↗

Nasa Hytec CMC Turbine Blade Durability

The objective of the CMC turbine blade durability program is to identify critical material and design parameters that affect durability of ceramic matrix composite (CMC) turbine blades. A baseline architecture for a cooled high-pressure turbine (HPT) CMC blade and accompanying sub-component test articles were developed with the intent to demonstrate through analysis and subcomponent testing how material and design parameters impact key failure modes. As part of this program, a notional architecture for a cooled CMC blade was matured through a design review rhythm to produce a blade test article containing the necessary features required for operation in an engine like environment. Further validation of the durability of these features were achieved through coupon and sub-component testing to demonstrate the durability of cooling hole configurations and blade attachment designs. Analytical methods were also used to evaluate the acceptability of the baseline blade test article architecture against relevant design requirements and identify abatement and recommended changes to key design drivers to improve component durability for future design iterations.

CMC, Blade↗

Multi-grid domain decomposition approach for solution of Navier-Stokes equations in primitive variable form

The new multigrid (or adaptive) pseudospectral element method was carried out for the solution of incompressible flow in terms of primitive variable formulation. The desired features of the proposed method include the following: (1) the ability to treat complex geometry; (2) high resolution adapted in the interesting areas; (3) requires minimal working space; and (4) effective in a multiprocessing environment. The approach for flow problems, complex geometry or not, is to first divide the computational domain into a number of fine-grid and coarse-grid subdomains with the inter-overlapping area. Next, it is necessary to implement the Schwarz alternating procedure (SAP) to exchange the data among subdomains, where the coarse-grid correction is used to remove the high frequency error that occurs when the data interpolation from the fine-grid subdomain to the coarse-grid subdomain is conducted. The strategy behind the coarse-grid correction is to adopt the operator of the divergence of the velocity field, which intrinsically links the pressure equation, into this process. The solution of each subdomain can be efficiently solved by the direct (or iterative) eigenfunction expansion technique with the least storage requirement, i.e. O(N(exp 3)) in 3-D and O(N(exp 2)) in 2-D. Numerical results of both driven cavity and jet flow will be presented in the paper to account for the versatility of the proposed method.

Ku, Hwar-Ching↗

An application of a linear programing technique to nonlinear minimax problems

A differential correction technique for solving nonlinear minimax problems is presented. The basis of the technique is a linear programing algorithm which solves the linear minimax problem. By linearizing the original nonlinear equations about a nominal solution, both nonlinear approximation and estimation problems using the minimax norm may be solved iteratively. Some consideration is also given to improving convergence and to the treatment of problems with more than one measured quantity. A sample problem is treated with this technique and with the least-squares differential correction method to illustrate the properties of the minimax solution. The results indicate that for the sample approximation problem, the minimax technique provides better estimates than the least-squares method if a sufficient amount of data is used. For the sample estimation problem, the minimax estimates are better if the mathematical model is incomplete.

Schiess, J. R.↗

Use of adaptive walls in 2D tests

A new method for computing the wall effects gives precise answers to some questions arising in adaptive wall concept applications: length of adapted regions, fairings with up and downstream regions, residual misadjustments effects, reference conditions. The acceleration of the iterative process convergence and the development of an efficient technology used in CERT T2 wind tunnels give in a single run the required test conditions. Samples taken from CAST 7 tests demonstrate the efficiency of the whole process to obtain significant results with considerations of tridimensional case extension.

Archambaud, J. P.↗

Comparative study of computational efficiency of two LU schemes for non-equilibrium reacting flows

The systems of equations governing chemically nonequilibrium flows are solved numerically by two lower-upper(LU) algorithms, namely, LU-SSOR (Yoon and Jameson, 1987) and LU-SW (Steger and Warming, 1981). The methods of flux-Jacobian splitting differentiate the two LU algorithms. The LU-SSOR gives a simpler implicit operator with less temporal damping, while the LU-SW converges faster but requires more computation for each iteration. Relative efficiencies and mutual merits of these two LU algorithms are compared. The results show that LU-SW with upwind-differenced right-hand-side gives the best convergence.

Tsai, Y.-L. Peter↗

Gain weighted eigenspace assignment

This report presents the development of the gain weighted eigenspace assignment methodology. This provides a designer with a systematic methodology for trading off eigenvector placement versus gain magnitudes, while still maintaining desired closed-loop eigenvalue locations. This is accomplished by forming a cost function composed of a scalar measure of error between desired and achievable eigenvectors and a scalar measure of gain magnitude, determining analytical expressions for the gradients, and solving for the optimal solution by numerical iteration. For this development the scalar measure of gain magnitude is chosen to be a weighted sum of the squares of all the individual elements of the feedback gain matrix. An example is presented to demonstrate the method. In this example, solutions yielding achievable eigenvectors close to the desired eigenvectors are obtained with significant reductions in gain magnitude compared to a solution obtained using a previously developed eigenspace (eigenstructure) assignment method.

Davidson, John B.↗

High-Order Space-Time Methods for Conservation Laws

Current high-order methods such as discontinuous Galerkin and/or flux reconstruction can provide effective discretization for the spatial derivatives. Together with a time discretization, such methods result in either too small a time step size in the case of an explicit scheme or a very large system in the case of an implicit one. To tackle these problems, two new high-order space-time schemes for conservation laws are introduced: the first is explicit and the second, implicit. The explicit method here, also called the moment scheme, achieves a Courant-Friedrichs-Lewy (CFL) condition of 1 for the case of one-spatial dimension regardless of the degree of the polynomial approximation. (For standard explicit methods, if the spatial approximation is of degree p, then the time step sizes are typically proportional to 1/p(exp 2)). Fourier analyses for the one and two-dimensional cases are carried out. The property of super accuracy (or super convergence) is discussed. The implicit method is a simplified but optimal version of the discontinuous Galerkin scheme applied to time. It reduces to a collocation implicit Runge-Kutta (RK) method for ordinary differential equations (ODE) called Radau IIA. The explicit and implicit schemes are closely related since they employ the same intermediate time levels, and the former can serve as a key building block in an iterative procedure for the latter. A limiting technique for the piecewise linear scheme is also discussed. The technique can suppress oscillations near a discontinuity while preserving accuracy near extrema. Preliminary numerical results are shown

Huynh, H. T.↗