Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Structural error”

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 631 records · Page 35
All sourcesNASA NTRSDOE OSTI
NASA NTRS2017

Habitable Exoplanet Imager Optical-Mechanical Design and Analysis

The Habitable Exoplanet Imager (HabEx) is a space telescope currently in development whose mission includes finding and spectroscopically characterizing exoplanets. Effective high-contrast imaging requires tight stability requirements of the mirrors to prevent issues such as line of sight and wavefront errors. PATRAN and NASTRAN were used to model updates in the design of the HabEx telescope and find how those updates affected stability. Most of the structural modifications increased first mode frequencies and improved line of sight errors. These studies will be used to help define the baseline HabEx telescope design.

Habe↗
NASA NTRS1994

The fine-structure intervals of (N-14)+ by far-infrared laser magnetic resonance

The far-infrared laser magnetic resonance spectra associated with both fine-structure transitions in (N-14)+ in its ground P-3 state have been recorded. This is the first laboratory observation of the J = 1 left arrow 0 transition and its frequency has been determined two orders of magnitude more accurately than previously. The remeasurement of the J = 2 left arrow 1 spectrum revealed a small error in the previous laboratory measurements. The fine-structure splittings (free of hyperfine interactions) determined in this work are (delta)E(sub 10) = 1461.13190 (61) GHz, (delta)E(sub 21) = 2459.38006 (37) GHz. Zero-field transition frequencies which include the effects of hyperfine structure have also been calculated. Refined values for the hyperfine constants and the g(sub J) factors have been obtained.

Brown, John M.↗
DOE OSTI2026

Multigroup Thermal Radiation Transport with Tensor Trains

We investigate the application of tensor-train (TT) algorithms to multigroup thermal radiation transport (i.e., photon radiation transport). The TT framework enables simulations at discretizations that might otherwise be computationally infeasible on conventional hardware. We show that solutions to certain multigroup problems possess an intrinsic low-rank structure, which the TT representation leverages effectively. This enables us to solve problems where the discretized solution size exceeds a trillion parameters on a single node. The solver is evaluated on a range of test problems with varying levels of complexity, consistently achieving compression factors greater than 100× and speedups exceeding 2×. We also investigate alternative TT topologies by analyzing the low-rank structure of the merged spatio-spectral core to assess the potential for greater compression. This analysis suggests that compression gains could increase by factors as large as 7. Our results indicate that the low-rank structure of the merged spatio-spectral core captures the spatio-spectral complexity of the solution, largely driven by the opacity structure of the medium. Beyond identifying opportunities for improved compression, this analysis highlights the types of errors that may arise in angle-integrated quantities when exploiting this low-rank structure.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS2004

Reconfigurability in MDO Problem Synthesis

Integrating autonomous disciplines into a problem amenable to solution presents a major challenge in realistic multidisciplinary design optimization (MDO). We propose a linguistic approach to MDO problem description, formulation, and solution we call reconfigurable multidisciplinary synthesis (REMS). With assistance from computer science techniques, REMS comprises an abstract language and a collection of processes that provide a means for dynamic reasoning about MDO problems in a range of contexts. The approach may be summarized as follows. Description of disciplinary data according to the rules of a grammar, followed by lexical analysis and compilation, yields basic computational components that can be assembled into various MDO problem formulations and solution algorithms, including hybrid strategies, with relative ease. The ability to re-use the computational components is due to the special structure of the MDO problem. The range of contexts for reasoning about MDO spans tasks from error checking and derivative computation to formulation and reformulation of optimization problem statements. In highly structured contexts, reconfigurability can mean a straightforward transformation among problem formulations with a single operation. We hope that REMS will enable experimentation with a variety of problem formulations in research environments, assist in the assembly of MDO test problems, and serve as a pre-processor in computational frameworks in production environments. This paper, Part 1 of two companion papers, discusses the fundamentals of REMS. Part 2 illustrates the methodology in more detail.

Alexandrov, Natalia M.↗
NASA NTRS2004

Reconfigurability in MDO Problem Synthesis

Integrating autonomous disciplines into a problem amenable to solution presents a major challenge in realistic multidisciplinary design optimization (MDO). We propose a linguistic approach to MDO problem description, formulation, and solution we call reconfigurable multidisciplinary synthesis (REMS). With assistance from computer science techniques, REMS comprises an abstract language and a collection of processes that provide a means for dynamic reasoning about MDO problems in a range of contexts. The approach may be summarized as follows. Description of disciplinary data according to the rules of a grammar, followed by lexical analysis and compilation, yields basic computational components that can be assembled into various MDO problem formulations and solution algorithms, including hybrid strategies, with relative ease. The ability to re-use the computational components is due to the special structure of the MDO problem. The range of contexts for reasoning about MDO spans tasks from error checking and derivative computation to formulation and reformulation of optimization problem statements. In highly structured contexts, reconfigurability can mean a straightforward transformation among problem formulations with a single operation. We hope that REMS will enable experimentation with a variety of problem formulations in research environments, assist in the assembly of MDO test problems, and serve as a pre-processor in computational frameworks in production environments. Part 1 of two companion papers, discusses the fundamentals of REMS. This paper, Part 2 illustrates the methodology in more detail.

Alexandrov, Natalia M.↗
DOE OSTI2019

Decorrelating the errors of the galaxy correlation function with compact transformation matrices

Abstract Covariance matrix estimation is a persistent challenge for cosmology, often requiring a large number of synthetic mock catalogues. The off-diagonal components of the covariance matrix also make it difficult to show representative error bars on the 2-point correlation function (2PCF) since errors computed from the diagonal values of the covariance matrix greatly underestimate the uncertainties. We develop a routine for decorrelating the projected and anisotropic 2PCF with simple and scale-compact transformations on the 2PCF. These transformation matrices are modelled after the Cholesky decomposition and the symmetric square root of the Fisher matrix. Using mock catalogues, we show that the transformed projected and anisotropic 2PCF recover the same structure as the original 2PCF while producing largely decorrelated error bars. Specifically, we propose simple Cholesky-based transformation matrices that suppress the off-diagonal covariances on the projected 2PCF by ${\sim } 95{{\ \rm per\ cent}}$ and that on the anisotropic 2PCF by ${\sim } 87{{\ \rm per\ cent}}$. These transformations also serve as highly regularized models of the Fisher matrix, compressing the degrees of freedom so that one can fit for the Fisher matrix with a much smaller number of mocks.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS2010

The Influence of Friction Stir Weld Tool Form and Welding Parameters on Weld Structure and Properties: Nugget Bulge in Self-Reacting Friction Stir Welds

Although friction stir welding (FSW) was patented in 1991, process development has been based upon trial and error and the literature still exhibits little understanding of the mechanisms determining weld structure and properties. New concepts emerging from a better understanding of these mechanisms enhance the ability of FSW engineers to think about the FSW process in new ways, inevitably leading to advances in the technology. A kinematic approach in which the FSW flow process is decomposed into several simple flow components has been found to explain the basic structural features of FSW welds and to relate them to tool geometry and process parameters. Using this modelling approach, this study reports on a correlation between the features of the weld nugget, process parameters, weld tool geometry, and weld strength. This correlation presents a way to select process parameters for a given tool geometry so as to optimize weld strength. It also provides clues that may ultimately explain why the weld strength varies within the sample population.

Schneider, Judy↗
DOE OSTI2018

Bi-sparsity pursuit: A paradigm for robust subspace recovery

The success of sparse models in computer vision and machine learning is due to the fact that, high dimensional data is distributed in a union of low dimensional subspaces in many real-world applications. The underlying structure may, however, be adversely affected by sparse errors. In this paper, we propose a bi-sparse model as a framework to analyze this problem, and provide a novel algorithm to recover the union of subspaces in the presence of sparse corruptions. We further show the effectiveness of our method by experiments on real-world vision data.

42 ENGINEERING↗
DOE OSTI2021

The Patterson function as auto-hologram and graph enables the direct solution to the phase problem for coherently illuminated atomistic structures

Abstract The coherent Patterson function, derived from the coherent scattering intensities from N atoms, can be described as an auto-holographic image, i.e., the superposition of N -holographic images in which each atom serves as the source of a different reference wave, and as a mathematical graph of the unknown structure. These insights indicate that the unknown structure is significantly over-determined by the inherent information content in a Patterson function by a factor of ( N − 1)/2 (for non-degenerate structures), independent of dimensionality. However, we also show that the ability to resolve the distinct features in the Patterson function depends strongly on details of the experimental design (data range, sampling frequency, and dimensionality). This re-interpretation suggests that the coherent Patterson function provides a natural context for describing the information content in coherent scattering, reveals that there is no inherent phase problem for coherently illuminated pointwise structures, and enables the design of an algorithm which retrieves the structure directly from the Patterson function, without using error metric minimization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

BI-sparsity pursuit for robust subspace recovery

Here, the success of sparse models in computer vision and machine learning in many real-world applications, may be attributed in large part, to the fact that many high dimensional data are distributed in a union of low dimensional subspaces. The underlying structure may, however, be adversely affected by sparse errors, thus inducing additional complexity in recovering it. In this paper, we propose a bi-sparse model as a framework to investigate and analyze this problem, and provide as a result , a novel algorithm to recover the union of subspaces in presence of sparse corruptions. We additionally demonstrate the effectiveness of our method by experiments on real-world vision data.

47 OTHER INSTRUMENTATION↗
DOE OSTI2016

TH-CD-206-12: Image-Based Motion Estimation for Plaque Visualization in Coronary Computed Tomography Angiography

Purpose: Visualization and quantification of coronary artery calcification and atherosclerotic plaque benefits from coronary artery motion (CAM) artifact elimination. This work applies a rigid linear motion model to a Volume of Interest (VoI) for estimating motion estimation and compensation of image degradation in Coronary Computed Tomography Angiography (CCTA). Methods: In both simulation and testbench experiments, translational CAM was generated by displacement of the imaging object (i.e. simulated coronary artery and explanted human heart) by ∼8 mm, approximating the motion of a main coronary branch. Rotation was assumed to be negligible. A motion degraded region containing a calcification was selected as the VoI. Local residual motion was assumed to be rigid and linear over the acquisition window, simulating motion observed during diastasis. The (negative) magnitude of the image gradient of the reconstructed VoI was chosen as the motion estimation objective and was minimized with Covariance Matrix Adaptation Evolution Strategy (CMAES). Results: Reconstruction incorporated the estimated CAM yielded signification recovery of fine calcification structures as well as reduced motion artifacts within the selected local region. The compensated reconstruction was further evaluated using two image similarity metrics, the structural similarity index (SSIM) and Root Mean Square Error (RMSE). At the calcification site, the compensated data achieved a 3% increase in SSIM and a 91.2% decrease in RMSE in comparison with the uncompensated reconstruction. Conclusion: Results demonstrate the feasibility of our image-based motion estimation method exploiting a local rigid linear model for CAM compensation. The method shows promising preliminary results for the application of such estimation in CCTA. Further work will involve motion estimation of complex motion corrupted patient data acquired from clinical CT scanner.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2019

De novo Nanopore read quality improvement using deep learning

BACKGROUND: Long read sequencing technologies such as Oxford Nanopore can greatly decrease the complexity of de novo genome assembly and large structural variation identification. Currently Nanopore reads have high error rates, and the errors often cluster into low-quality segments within the reads. The limited sensitivity of existing read-based error correction methods can cause large-scale mis-assemblies in the assembled genomes, motivating further innovation in this area. RESULTS: Here we developed a Convolutional Neural Network (CNN) based method, called MiniScrub, for identification and subsequent "scrubbing" (removal) of low-quality Nanopore read segments to minimize their interference in downstream assembly process. MiniScrub first generates read-to-read overlaps via MiniMap2, then encodes the overlaps into images, and finally builds CNN models to predict low-quality segments. Applying MiniScrub to real world control datasets under several different parameters, we show that it robustly improves read quality, and improves read error correction in the metagenome setting. Compared to raw reads, de novo genome assembly with scrubbed reads produces many fewer mis-assemblies and large indel errors. CONCLUSIONS: MiniScrub is able to robustly improve read quality of Oxford Nanopore reads, especially in the metagenome setting, making it useful for downstream applications such as de novo assembly. We propose MiniScrub as a tool for preprocessing Nanopore reads for downstream analyses. MiniScrub is open-source software and is available at https://bitbucket.org/berkeleylab/jgi-miniscrub .

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Multi-Tiered Estimation for Correlation Spectroscopy in 3D (MTECS3D) v0.1

This innovative software estimates rotational diffusion coefficients of particles from X-ray photon correlation spectroscopy (XPCS) data of monodispersed particle systems. It is the first method capable of extracting rotational diffusion information from three-dimensional particle systems using XPCS. Using the angular-temporal cross-correlation of the XPCS images, this software is able to estimate the rotational diffusion coefficients with only a few percent relative errors while requiring minimal prior knowledge of particle structures. This software enhances XPCS analysis capabilities, allowing researchers to study translational and rotational Brownian dynamics of particles in suspension across various temporal and spatial scales.

Hu, Zixi↗
NASA NTRS1980

Software reliability: Application of a reliability model to requirements error analysis

The application of a software reliability model having a well defined correspondence of computer program properties to requirements error analysis is described. Requirements error categories which can be related to program structural elements are identified and their effect on program execution considered. The model is applied to a hypothetical B-5 requirement specification for a program module.

Logan, J.↗
NASA NTRS1982

Improvement of a large dynamic analytical model using ground vibration test data

A method has been developed which uses measured normal modes and natural frequencies to improve an analytical mass and stiffness matrix model of a structure. The method directly identifies, without iteration, a set of minimum changes in the analytical matrices which force the eigensolutions to agree with the test measurements. An application is presented in which the analytical model had 508 degrees of freedom and 19 modes were measured at 101 locations on the structure. The resulting changes in the model are judged to be small compared to expectations of errors in the analysis. Thus the improved model is accepted as a reasonable model of the structure with improved dynamic response characteristics. In addition, it is shown that the procedure may be a useful tool in identifying apparent measured modes which are not true normal modes of the structures.

Berman, A.↗
NASA NTRS1982

Tenth NASTRAN User's Colloquium

The development of the NASTRAN computer program, a general purpose finite element computer code for structural analysis, was discussed. The application and development of NASTRAN is presented in the following topics: improvements and enhancements; developments of pre and postprocessors; interactive review system; the use of harmonic expansions in magnetic field problems; improving a dynamic model with test data using Linwood; solution of axisymmetric fluid structure interaction problems; large displacements and stability analysis of nonlinear propeller structures; prediction of bead area contact load at the tire wheel interface; elastic plastic analysis of an overloaded breech ring; finite element solution of torsion and other 2-D Poisson equations; new capability for elastic aircraft airloads; usage of substructuring analysis in the get away special program; solving symmetric structures with nonsymmetric loads; evaluation and reduction of errors induced by Guyan transformation.

Source record↗
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 NTRS1987

A combined stochastic feedforward and feedback control design methodology with application to autoland design

A combined stochastic feedforward and feedback control design methodology was developed. The objective of the feedforward control law is to track the commanded trajectory, whereas the feedback control law tries to maintain the plant state near the desired trajectory in the presence of disturbances and uncertainties about the plant. The feedforward control law design is formulated as a stochastic optimization problem and is embedded into the stochastic output feedback problem where the plant contains unstable and uncontrollable modes. An algorithm to compute the optimal feedforward is developed. In this approach, the use of error integral feedback, dynamic compensation, control rate command structures are an integral part of the methodology. An incremental implementation is recommended. Results on the eigenvalues of the implemented versus designed control laws are presented. The stochastic feedforward/feedback control methodology is used to design a digital automatic landing system for the ATOPS Research Vehicle, a Boeing 737-100 aircraft. The system control modes include localizer and glideslope capture and track, and flare to touchdown. Results of a detailed nonlinear simulation of the digital control laws, actuator systems, and aircraft aerodynamics are presented.

Halyo, Nesim↗