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,315 records · Page 73

Parallel Unsteady Turbopump Flow Simulations for Reusable Launch Vehicles

An efficient solution procedure for time-accurate solutions of Incompressible Navier-Stokes equation is obtained. Artificial compressibility method requires a fast convergence scheme. Pressure projection method is efficient when small time-step is required. The number of sub-iteration is reduced significantly when Poisson solver employed with the continuity equation. Both computing time and memory usage are reduced (at least 3 times). Other work includes Multi Level Parallelism (MLP) of INS3D, overset connectivity for the validation case, experimental measurements, and computational model for boost pump.

Kiris, Cetin↗

Higher Order Bases in a 2D Hybrid BEM/FEM Formulation

The advantages of using higher order, interpolatory basis functions are examined in the analysis of transverse electric (TE) plane wave scattering by homogeneous, dielectric cylinders. A boundary-element/finite-element (BEM/FEM) hybrid formulation is employed in which the interior dielectric region is modeled with the vector Helmholtz equation, and a radiation boundary condition is supplied by an Electric Field Integral Equation (EFIE). An efficient method of handling the singular self-term arising in the EFIE is presented. The iterative solution of the partially dense system of equations is obtained using the Quasi-Minimal Residual (QMR) algorithm with an Incomplete LU Threshold (ILUT) preconditioner. Numerical results are shown for the case of an incident wave impinging upon a square dielectric cylinder. The convergence of the solution is shown versus the number of unknowns as a function of the completeness order of the basis functions.

Fink, Patrick W.↗

Improving Multi-Model Trajectory Simulation Estimators using Model Selection and Tuning

Multi-model Monte Carlo methods have been demonstrated to be an efficient and accurate alternative to standard Monte Carlo (MC) in the model-based propagation of uncertainty in entry, descent, and landing (EDL) applications. These multi-model MC methods fuse predictions from low-fidelity models with the high-fidelity EDL model of interest to produce unbiased statistics with a fraction of the computational cost. The accuracy and efficiency of the multi-model MC methods are dependent upon the magnitude of correlations of the low-fidelity models with the high-fidelity model, but also upon the correlation amongst the low-fidelity models, and their relative computational cost. Because of this layer of complexity, the question of how to optimally select the set of low-fidelity models has remained open. In this work, methods for optimal model construction and tuning are investigated as a means to increase the speed and precision of trajectory simulation for EDL. Specifically, the focus is on the inclusion of low-fidelity model tuning within the sample allocation optimization that accompanies multi-model MC methods. Preliminary results indicate that low-fidelity model tuning can significantly improve efficiency and precision of trajectory simulations and provide an increased edge to multi-model MC methods when compared to standard MC. The challenges and potential benefits to exploring a fully iterative and comprehensive optimization strategy in future work are highlighted.

uncertainty quantification↗

Improving Multi-Model Trajectory Simulation Estimators using Model Selection and Tuning

Multi-model Monte Carlo methods have been demonstrated to be an efficient and accurate alternative to standard Monte Carlo (MC) in the model-based propagation of uncertainty in entry, descent, and landing (EDL) applications. These multi-model MC methods fuse predictions from low-fidelity models with the high-fidelity EDL model of interest to produce unbiased statistics with a fraction of the computational cost. The accuracy and efficiency of the multi-model MC methods are dependent upon the magnitude of correlations of the low-fidelity models with the high-fidelity model, but also upon the correlation among the low-fidelity models, and their relative computational cost. Because of this layer of complexity, the question of how to optimally select the set of low-fidelity models has remained open. In this work, methods for optimal model construction and tuning are investigated as a means to increase the speed and precision of trajectory simulation for EDL. Specifically, the focus is on the inclusion of low-fidelity model tuning within the sample allocation optimization that accompanies multi-model MC methods. Preliminary results indicate that low-fidelity model tuning can significantly improve efficiency and precision of trajectory simulations and provide an increased edge to multi-model MC methods when compared to standard MC. The challenges and potential benefits to exploring a fully iterative and comprehensive optimization strategy in future work are highlighted.

uncertainty quantification↗

Machine Learning for Dynamic Test Sensor Placement

There are multiple different algorithms to perform modal test sensor placement optimization: effective independence, residual kinetic energy, iterative Guyan reduction, genetic algorithms, or a brute-force methodology. However, any of these methods may be computationally expensive, especially for structural models with a large number of degrees of freedom. Given the high-cost and the need to optimize the solution, modal sensor placement is a great application for machine learning (ML) algorithms. In this paper, we will apply ML algorithms to determine the optimal sensor locations for simple and complex structures. We will also discuss the benefits and drawbacks of using machine learning over other sensor placement algorithms.

Kelsey Buckles↗

Low Density Parity Check Codes Based on Finite Geometries: A Rediscovery and More

Low density parity check (LDPC) codes with iterative decoding based on belief propagation achieve astonishing error performance close to Shannon limit. No algebraic or geometric method for constructing these codes has been reported and they are largely generated by computer search. As a result, encoding of long LDPC codes is in general very complex. This paper presents two classes of high rate LDPC codes whose constructions are based on finite Euclidean and projective geometries, respectively. These classes of codes a.re cyclic and have good constraint parameters and minimum distances. Cyclic structure adows the use of linear feedback shift registers for encoding. These finite geometry LDPC codes achieve very good error performance with either soft-decision iterative decoding based on belief propagation or Gallager's hard-decision bit flipping algorithm. These codes can be punctured or extended to obtain other good LDPC codes. A generalization of these codes is also presented.

Kou, Yu↗

An efficient formulation and implementation of the analytic energy gradient method to the single and double excitation coupled-cluster wave function - Application to Cl2O2

The analytic energy gradient for the single and double excitation coupled-cluster (CCSD) wave function has been reformulated and implemented in a new set of programs. The reformulated set of gradient equations have a smaller computational cost than any previously published. The iterative solution of the linear equations and the construction of the effective density matrices are fully vectorized, being based on matrix multiplications. The new method has been used to investigate the Cl2O2 molecule, which has recently been postulated as an important intermediate in the destruction of ozone in the stratosphere. In addition to reporting computational timings, the CCSD equilibrium geometries, harmonic vibrational frequencies, infrared intensities, and relative energetics of three isomers of Cl2O2 are presented.

Rendell, Alistair P.↗

SGBEM-FEM Alternating Method for Analyzing 3D Non-Planar Cracks and Their Growth in Structural Components

The highly accurate and efficient Symmetric Galerkin Boundary Element Method (SGBEM), a Finite Element Method (FEM)-based alternating method, is proposed for analyzing three-dimensional non-planar cracks and their growth. The cracks are modeled using the symmetric Galerkin boundary element method as a distribution of displacement discontinuities, simulating an infinite medium. The finite element method only analyzes the stress for the uncracked body. The solution for the cracked structural component is determined by an iteration procedure. This process alternates between an FEM solution for the uncracked body and the SGBEM solution for a crack in an infinite body. Numerical analysis, and the Java code used, evaluate stress intensity factors and model fatigue crack growth. Examples of non-planar cracks in infinite media and planar cracks in finite bodies, as well as growth under fatigue, show the accuracy of the method.

Nikishkov, G. P.↗

The treatment of convected vortices in compressible potential flow

A method is described for incorporating line vortices into the three dimensional compressible potential flow equation. A modified Biot-Savart law is used to compute a vortical velocity field, which is added to the gradient of the potential to form a total velocity. A rapidly converging approximate factorization (AFZ) scheme is then used to compute a potential such that the modified potential flow equation as well as the appropriate boundary conditions, based on total velocity, are satisfied. As part of a coupled iteration procedure, the positions of the line vortices are computed so that they convect with the total flow. The method is used to compute the field due to a single line vortex convecting past a wing. This represents an approximation of the effect of a canard or other lifting surface ahead of the wing, which sheds a tip vortex. It is seen that the flow field is substantially modified by the passage of the vortex. Unlike Euler equation schemes, which are also used to compute these flows, the solutions exhibit no numerical diffusion: The convected vortices retain their initial upstream width. Euler solutions, on the other hand, involve a vorticity which is numerically convected in an Eulerian frame and, unless extensive adaptive grid refinement is used they result in vortices with spread as they convect. Also, the potential flow method requires approximately two orders of magnitude less computing time and much less computer storage than the Euler methods.

Steinhoff, J.↗

An experimental comparison of several current viscoplastic constitutive models at elevated temperature

Four current viscoplastic models are compared experimentally for Inconel 718 at 593 C. This material system responds with apparent negative strain rate sensitivity, undergoes cyclic work softening, and is susceptible to low cycle fatigue. A series of tests were performed to create a data base from which to evaluate material constants. A method to evaluate the constants is developed which draws on common assumptions for this type of material, recent advances by other researchers, and iterative techniques. A complex history test, not used in calculating the constants, is then used to compare the predictive capabilities of the models. The combination of exponentially based inelastic strain rate equations and dynamic recovery is shown to model this material system with the greatest success. The method of constant calculation developed was successfully applied to the complex material response encountered. Backstress measuring tests were found to be invaluable and to warrant further development.

James, G. H.↗

Adaptive relaxation for the steady-state analysis of Markov chains

We consider a variant of the well-known Gauss-Seidel method for the solution of Markov chains in steady state. Whereas the standard algorithm visits each state exactly once per iteration in a predetermined order, the alternative approach uses a dynamic strategy. A set of states to be visited is maintained which can grow and shrink as the computation progresses. In this manner, we hope to concentrate the computational work in those areas of the chain in which maximum improvement in the solution can be achieved. We consider the adaptive approach both as a solver in its own right and as a relaxation method within the multi-level algorithm. Experimental results show significant computational savings in both cases.

Horton, Graham↗

The use of curved higher order panels for vortex sheet modeling

A method is presented for predicting the geometry of a vortex sheet trailing a lift generating wing in its vicinity. It differs from others in that it uses a continuous vorticity distribution rather than discrete vortex filaments. It was found that the results were in good agreement with available experimental data, after the initial cycle of what was to be a relaxation scheme, so that iterations for this end were unnecessary. While the technique is computing intensive, it becomes attractive when used in conjunction with panel methods applications for complete aircraft configurations. The panel method solution needs to be found only once for each streamwise station downstream of the wing. Corrections applied are geometric in nature and are independent of other computational aspects.

Nagati, M. G.↗

Selection of Next Priority IMPACT Medical Conditions Based on Available Terrestrial and Spaceflight Data

BACKGROUND: As the era of exploration class missions begins, identification of medical conditions that may occur and require management becomes essential for the modeling of medical risk. To this end, NASA has developed IMPACT (Informing Mission Planning via Analysis of Complex Tradespaces), a suite of tools to assist in assessment of medical risk analysis. It has incorporated an initial list of the 120 conditions of highest concern, labeled the IMPACT condition list 1.0 (ICL 1.0). This abstract describes a method for prioritizing the 92 conditions included on the Proposed Future Conditions List (PFCL) for inclusion in future iterations of the ICL. OVERVIEW: To construct the Prioritized Proposed Future Conditions List (P-PFCL), each condition on the PFCL was scored as “low,” “medium,” or “high” on each of four variables: incidence, likelihood of significant task impairment, diagnostic and treatment complexity, and treatment futility. Qualitative assessment using clinical judgement was utilized to score complexity, futility, and likelihood of impairment. Incidence was assessed quantitatively using spaceflight data and/or analog populations where available then assigned a score using established cutoffs. Logarithmic numerical values were assigned to each category label. A Prioritization Score was generated for each condition by taking the product of incidence and likelihood of task impairment (risk) divided by the product of complexity and futility (difficulty of care), with higher values corresponding to higher priority for future inclusion in the ICL. DISCUSSION: The described methods allow for the generation of a ranked P-PFCL to act as a decision support tool for selection of the next generation of modeled medical conditions. Some of the conditions ranked highly on the P-PFCL include EVA-related upper and lower extremity sprain/strain, iron deficiency, delirium, and hypertension, among others. While this effort does not attempt to quantify the absolute risk associated with each condition, it does attempt to semi-quantitatively estimate the risk of each condition relative to the other possible conditions. This tool in concert with subject matter expert opinion could optimize the future use of limited resources thereby producing a more accurate medical risk model, which will be essential to the upcoming exploration class missions.

Michael Pohlen↗

Multigrid properties of upwind-biased data reconstructions

The multigrid properties of two data reconstruction methods used for achieving second-order spatial accuracy when solving the two-dimensional Euler equations are examined. The data reconstruction methods are used with an implicit upwind algorithm which uses linearized backward-Euler time-differencing. The solution of the resulting linear system is performed by an iterative procedure. In the present study only regular quadrilateral grids are considered, so a red-black Gauss-Seidel iteration is used. Although the Jacobian is approximated by first-order upwind extrapolation, two alternative data reconstruction techniques for the flux integral that yield higher-order spatial accuracy at steady state are examined. The first method, probably most popular for structured quadrilateral grids, is based on estimating the cell gradients using one-dimensional reconstruction along curvilinear coordinates. The second method is based on Green's theorem. Analysis and numerical results for the two dimensional Euler equations show that data reconstruction based on Green's theorem has superior multigrid properties as compared to the one-dimensional data reconstruction method.

Warren, Gary P.↗

A lifting surface computer code with jet-in-crossflow interference effects. Volume 1: Theoretical description

A method is proposed to combine a numerical description of a jet in a crossflow with a lifting surface panel code to calculate the jet/aerodynamic-surface interference effects on a V/STOL aircraft. An iterative technique is suggested that starts with a model for the properties of a jet/flat plate configuration and modifies these properties based on the flow field calculated for the configuration of interest. The method would estimate the pressures, forces, and moments on an aircraft out of ground effect. A first-order approximation to the method suggested is developed and applied to two simple configurations. The first-order approximation is a noniterative precedure which does not allow for interactions between multiple jets in a crossflow and also does not account for the influence of lifting surfaces on the jet properties. The jet/flat plate model utilized in the examples presented is restricted to a uniform round jet injected perpendicularly into a uniform crossflow for a range of jet-to-crossflow velocity ratios from three to ten.

Furlong, K. L.↗

Abstract models for the synthesis of optimization algorithms.

Systematic approach to the problem of synthesis of optimization algorithms. Abstract models for algorithms are developed which guide the inventive process toward ?conceptual' algorithms which may consist of operations that are inadmissible in a practical method. Once the abstract models are established a set of methods for converting ?conceptual' algorithms falling into the class defined by the abstract models into ?implementable' iterative procedures is presented.

Meyer, G. G. L.↗

Unsteady transonic flow analysis for low aspect ratio, pointed wings.

Oswatitsch and Keune's parabolic method for steady transonic flow is applied and extended to thin slender wings oscillating in the sonic flow field. The parabolic constant for the wing was determined from the equivalent body of revolution. Laplace transform methods were used to derive the asymptotic equations for pressure coefficient, and the Adams-Sears iterative procedure was employed to solve the equations. A computer program was developed to find the pressure distributions, generalized force coefficients, and stability derivatives for delta, convex, and concave wing planforms.

Kimble, K. R.↗