Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computing methods”

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 NTRS1989

Finite element formulations for compressible flows

Researchers started their studies on the development and application of computational methods for compressible flows. Particular attention was given to proper numerical treatment of sharp layers occurring in such problems and to general mesh generation capabilities for intricate computational geometries. Mainly finite element methods enhanced with several state-of-the art techniques (such as the streamline-upwind/Petrov-Galerkin, discontinuity capturing, adaptive implicit-explicit, and trouped element-by-element approximate factorization schemes) were employed.

Tezduyar, Tayfun E.↗
NASA NTRS2008

Towards Verification of Unstructured-Grid Solvers

New methodology for verification of computational methods using unstructured grids is presented. The discretization order properties are studied in computational windows, easily constructed within a collection of grids or a single grid. The windows can be adjusted to isolate the interior discretization, the boundary discretization, or singularities. A major component of the methodology is the downscaling test, introduced previously for studying the convergence rates of truncation and discretization errors of finite-volume discretization schemes on general unstructured grids. Demonstrations of the method are shown, including a comparative accuracy assessment of commonly-used schemes on general mixed grids and the identification of local accuracy deterioration at intersections of tangency and inflow/outflow boundaries. Recommendations for the use of the methodology in large-scale computational simulations are given.

Thomas, James L.↗
NASA NTRS1992

Sparsely Sampled Phase-Insensitive Ultrasonic Transducer Arrays

Three methods of interpretation of outputs from sparsely sampled two-dimensional array of receiving ultrasonic transducers used in transmission experiments investigated. Methods are: description of sampled beam in terms of first few spatial moments of sampled distribution of energy; use of signal-dependent cutoff to limit extent of effective receiver aperture; and use of spatial interpolation to increase apparent density of sampling during computation. Methods reduce errors in computations of shapes of ultrasonic beams.

Patrick H. Johnston↗
DOE OSTI2021

PPPL Laboratory Directed Research and Development (Project Final Reports, FY2018 - FY2020)

The U.S. Department of Energy’s (DOE) Princeton Plasma Physics Laboratory (PPPL) is a collaborative national center for fusion energy science, basic sciences, and advanced technology. The Laboratory has three major missions: (1) to develop the scientific knowledge and advanced engineering to enable fusion to power the U.S. and the world; (2) to advance the science of nanoscale fabrication for technologies of tomorrow; and (3) to further the development of the scientific understanding of the plasma universe from laboratory to astrophysical scales. PPPL’s Laboratory Directed Research and Development (LDRD) program supports and encourages creativity and innovation and contributes to its long-term viability. New scientific and technical research areas emerge and are nurtured through the program. Furthermore, new capabilities are developed to enable the Laboratory to meet its and DOE’s missions. The program is used to systematically diversify the Laboratory’s programs and mission. In the last few years, the program has started projects in nanomaterial synthesis, microelectronics, advanced x-ray spectroscopy, high-energy-density physics, superconducting magnet technology, machine learning and artificial intelligence, 3D magnetic fields to optimize fusion plasmas, integration of permanent magnets with simple high-field magnets to reduce the cost of producing complex 3D magnetic fields, advanced computational methods for predictive understanding and control of fusion plasma, development of quantum computing algorithms for plasma physics, liquid metal plasma-facing components for fusion reactors, virtual engineering, and plasma-based space propulsion. The program is also the vehicle to recruit and train talented scientists and engineers with the new skills needed to perform the Laboratory’s mission. Many of the new hires through the program go on to become world-class scientists and engineers in their fields. This report provides descriptions and accomplishments of those LDRD projects that were completed during fiscal years 2018 through 2020.

36 MATERIALS SCIENCE↗
NASA NTRS1974

Measurement of the lidar cross sections of cube corner arrays for laser ranging of satellites

The satellite coordinate system necessary to describe the location and orientation of each cube corner in the array is discussed. The method of optical testing is described along with the gain function, and computational methods for deriving the gain function and experimental values for it. The velocity aberration is derived as a function of satellite orbit, a complete method for cross section evaluation is described, and finally the radar equation is described.

Minott, P. O.↗
NASA NTRS1988

SURE reliability analysis: Program and mathematics

The SURE program is a new reliability analysis tool for ultrareliable computer system architectures. The computational methods on which the program is based provide an efficient means for computing accurate upper and lower bounds for the death state probabilities of a large class of semi-Markov models. Once a semi-Markov model is described using a simple input language, the SURE program automatically computes the upper and lower bounds on the probability of system failure. A parameter of the model can be specified as a variable over a range of values directing the SURE program to perform a sensitivity analysis automatically. This feature, along with the speed of the program, makes it especially useful as a design tool.

Butler, Ricky W.↗
NASA NTRS1992

Damping modeling in Timoshenko beams

Theoretical and numerical results of damping model studies for composite material beams using the Timoshenko theory is presented. Based on the damping models developed for Euler-Bernoulli beams, the authors develop damping methods for both bending and shear in investigation of Timoshenko beams. A computational method for the estimation of the damping parameters is given. Experimental data with high-frequency excitation were used to test Timoshenko beam equations with different types of damping models for bending and shear in various combinations.

Banks, H. T.↗
NASA NTRS1983

Computation of internal flows: Methods and applications; Proceedings of the Energy Sources Technology Conference, New Orleans, LA, February 12-16, 1984

The present conference covers computational method applications, viscous-inviscid interaction techniques, viscous flow computational methods, and design-related methods. Attention is given to viscous flows in turbomachinery cascades, forbidden signals and apparent Mach numbers in supersonic cascades, the flow field in an engine particle separator, two-dimensional separated channel flows, turbulent separating flows over a rearward-facing step, the semielliptic analysis of two-dimensional internal and compressible viscous flows, spline solutions of the incompressible Navier-Stokes equations in a mildly nonorthogonal coordinate system, the design of highly loaded blades with blockage in cascade, and a finite analytic method for unsteady, three-dimensional Navier-Stokes equations.

Sockol, P. M.↗
NASA NTRS2006

Verification of Software: The Textbook and Real Problems

The process of verification, or determining the order of accuracy of computational codes, can be problematic when working with large, legacy computational methods that have been used extensively in industry or government. Verification does not ensure that the computer program is producing a physically correct solution, it ensures merely that the observed order of accuracy of solutions are the same as the theoretical order of accuracy. The Method of Manufactured Solutions (MMS) is one of several ways for determining the order of accuracy. MMS is used to verify a series of computer codes progressing in sophistication from "textbook" to "real life" applications. The degree of numerical precision in the computations considerably influenced the range of mesh density to achieve the theoretical order of accuracy even for 1-D problems. The choice of manufactured solutions and mesh form shifted the observed order in specific areas but not in general. Solution residual (iterative) convergence was not always achieved for 2-D Euler manufactured solutions. L(sub 2,norm) convergence differed variable to variable therefore an observed order of accuracy could not be determined conclusively in all cases, the cause of which is currently under investigation.

Carlson, Jan-Renee↗
NASA NTRS1992

CSM activities at the NASA Langley Research Center

The objective and goals of the Computational Structural Mechanics (CSM) Program as applied to airframe structures are given. It is recognized that the rapid evolution of computer hardware has opened up new opportunities for solving more complex and larger structural analysis problems than was hitherto imagined. To utilize these computers, new methods of computational structural mechanics are required. Methods are now being developed, assessed, and validated to meet the goals, and each of these goals is addressed. Plans and approaches are shown and highlights of results achieved in meeting these goals are given. Three research thrusts are shown in the five-year plan: advanced robust CSM methods, large-scale solutions, and validation/demonstration studies. The areas of research activity reflect the CSM goals. The mapping of developed methods onto high-performance and massively parallel computers is an integral part of the CSM five-year plan.

Housner, Jerrold M.↗
NASA NTRS1998

On the Numerical Formulation of Parametric Linear Fractional Transformation (LFT) Uncertainty Models for Multivariate Matrix Polynomial Problems

Robust control system analysis and design is based on an uncertainty description, called a linear fractional transformation (LFT), which separates the uncertain (or varying) part of the system from the nominal system. These models are also useful in the design of gain-scheduled control systems based on Linear Parameter Varying (LPV) methods. Low-order LFT models are difficult to form for problems involving nonlinear parameter variations. This paper presents a numerical computational method for constructing and LFT model for a given LPV model. The method is developed for multivariate polynomial problems, and uses simple matrix computations to obtain an exact low-order LFT representation of the given LPV system without the use of model reduction. Although the method is developed for multivariate polynomial problems, multivariate rational problems can also be solved using this method by reformulating the rational problem into a polynomial form.

Belcastro, Christine M.↗
DOE OSTI2021

Identifying Genomic Islands with Deep Neural Networks

Background Horizontal gene transfer is the main source of adaptability for bacteria, through which genes are obtained from different sources including bacteria, archaea, viruses, and eukaryotes. This process promotes the rapid spread of genetic information across lineages, typically in the form of clusters of genes referred to as genomic islands (GIs). Different types of GIs exist, and are often classified by the content of their cargo genes or their means of integration and mobility. While various computational methods have been devised to detect different types of GIs, no single method is capable of detecting all types. Results We propose a method, which we call Shutter Island, that uses a deep learning model (Inception V3, widely used in computer vision) to detect genomic islands. The intrinsic value of deep learning methods lies in their ability to generalize. Via a technique called transfer learning, the model is pre-trained on a large generic dataset and then re-trained on images that we generate to represent genomic fragments. We demonstrate that this image-based approach generalizes better than the existing tools. Conclusions We used a deep neural network and an image-based approach to detect the most out of the correct GI predictions made by other tools, in addition to making novel GI predictions. The fact that the deep neural network was re-trained on only a limited number of GI datasets and then successfully generalized indicates that this approach could be applied to other problems in the field where data is still lacking or hard to curate.

Computer Vision↗
NASA NTRS1990

Integral-equation methods in steady and unsteady subsonic, transonic and supersonic aerodynamics for interdisciplinary design

Progress in the development of computational methods for steady and unsteady aerodynamics has perennially paced advancements in aeroelastic analysis and design capabilities. Since these capabilities are of growing importance in the analysis and design of high-performance aircraft, considerable effort has been directed toward the development of appropriate aerodynamic methodology. The contributions to those efforts from the integral-equations research program at the NASA Langley Research Center is reviewed. Specifically, the current scope, progress, and plans for research and development for inviscid and viscous flows are discussed, and example applications are shown in order to highlight the generality, versatility, and attractive features of this methodology.

Yates, E. Carson, Jr.↗
NASA NTRS2015

Estimation of Surface Temperature and Heat Flux by Inverse Heat Transfer Methods Using Internal Temperatures Measured While Radiantly Heating a Carbon/Carbon Specimen up to 1920 F

The ability to solve the heat conduction equation is needed when designing materials to be used on vehicles exposed to extremely high temperatures; e.g. vehicles used for atmospheric entry or hypersonic flight. When using test and flight data, computational methods such as finite difference schemes may be used to solve for both the direct heat conduction problem, i.e., solving between internal temperature measurements, and the inverse heat conduction problem, i.e., using the direct solution to march forward in space to the surface of the material to estimate both surface temperature and heat flux. The completed research first discusses the methods used in developing a computational code to solve both the direct and inverse heat transfer problems using one dimensional, centered, implicit finite volume schemes and one dimensional, centered, explicit space marching techniques. The developed code assumed the boundary conditions to be specified time varying temperatures and also considered temperature dependent thermal properties. The completed research then discusses the results of analyzing temperature data measured while radiantly heating a carbon/carbon specimen up to 1920 F. The temperature was measured using thermocouple (TC) plugs (small carbon/carbon material specimens) with four embedded TC plugs inserted into the larger carbon/carbon specimen. The purpose of analyzing the test data was to estimate the surface heat flux and temperature values from the internal temperature measurements using direct and inverse heat transfer methods, thus aiding in the thermal and structural design and analysis of high temperature vehicles.

Pizzo, Michelle↗
NASA NTRS2007

Automated Knowledge Discovery From Simulators

A computational method, SimLearn, has been devised to facilitate efficient knowledge discovery from simulators. Simulators are complex computer programs used in science and engineering to model diverse phenomena such as fluid flow, gravitational interactions, coupled mechanical systems, and nuclear, chemical, and biological processes. SimLearn uses active-learning techniques to efficiently address the "landscape characterization problem." In particular, SimLearn tries to determine which regions in "input space" lead to a given output from the simulator, where "input space" refers to an abstraction of all the variables going into the simulator, e.g., initial conditions, parameters, and interaction equations. Landscape characterization can be viewed as an attempt to invert the forward mapping of the simulator and recover the inputs that produce a particular output. Given that a single simulation run can take days or weeks to complete even on a large computing cluster, SimLearn attempts to reduce costs by reducing the number of simulations needed to effect discoveries. Unlike conventional data-mining methods that are applied to static predefined datasets, SimLearn involves an iterative process in which a most informative dataset is constructed dynamically by using the simulator as an oracle. On each iteration, the algorithm models the knowledge it has gained through previous simulation trials and then chooses which simulation trials to run next. Running these trials through the simulator produces new data in the form of input-output pairs. The overall process is embodied in an algorithm that combines support vector machines (SVMs) with active learning. SVMs use learning from examples (the examples are the input-output pairs generated by running the simulator) and a principle called maximum margin to derive predictors that generalize well to new inputs. In SimLearn, the SVM plays the role of modeling the knowledge that has been gained through previous simulation trials. Active learning is used to determine which new input points would be most informative if their output were known. The selected input points are run through the simulator to generate new information that can be used to refine the SVM. The process is then repeated. SimLearn carefully balances exploration (semi-randomly searching around the input space) versus exploitation (using the current state of knowledge to conduct a tightly focused search). During each iteration, SimLearn uses not one, but an ensemble of SVMs. Each SVM in the ensemble is characterized by different hyper-parameters that control various aspects of the learned predictor - for example, whether the predictor is constrained to be very smooth (nearby points in input space lead to similar output predictions) or whether the predictor is allowed to be "bumpy." The various SVMs will have different preferences about which input points they would like to run through the simulator next. SimLearn includes a formal mechanism for balancing the ensemble SVM preferences so that a single choice can be made for the next set of trials.

Burl, Michael↗