SEARCH · Engineering Papers
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.
Strainrange Partitioning provides unifying framework for characterizing high-temperature, low-cycle, creep-fatigue properties of metals and alloys. Method offers distinct advantage to designers of immediately providing reliable upper and lower bounds on cyclic life for any type of inelastic strain cycle that may be encountered in service.
The utility of advanced structural analysis and life prediction techniques was evaluated for the life assessment of a commercial air-cooled turbine blade with a history of tip cracking. Three dimensional, nonlinear finite element structural analyses were performed for the blade tip region. The computed strain-temperature history of the critical location was imposed on a uniaxial strain controlled test specimen to evaluate the validity of the structural analysis method. Experimental results indicated higher peak stresses and greater stress relaxation than the analytical predictions. Life predictions using the Strainrange Partitioning and Frequency Modified approaches predicted 1200 to 4420 cycles and 2700 cycles to crack initiation, respectively, compared to an observed life of 3000 cycles.
A technique for the simulation of unsteady flows in and around complex rotating machinery is presented. Additional domain decomposition mechanisms are introduced which extend the range of applicability of software developed for the time-accurate simulation of rotating machinery flowfields. The flow models uses the unsteady 3D Euler equations, discretized as a finite-volume method, utilizing a high-resolution approximate Riemann solver for cell interface flux definitions. Multiblock domain decomposition is used to partition the field radially, axially, as well as circumferentially into an ordered arrangement of blocks which exhibit varying degrees of similarity. A general high-order numerical scheme is applied to satisfy the geometric conservation law. Two configurations are presented - ducted single rotation prop-fan and a rotor-deswirl vane combination which form a single stage fan. Comparisons are made to other numerical solutions for these geometries and to available experimental data.
This paper presents a summary of the results to date of a Jet Propulsion Laboratory internally funded research task to study the costing process and parameters used by internally recognized software cost estimating experts. Protocol Analysis and Markov process modeling were used to capture software engineer's forecasting mental models. While there is significant variation between the mental models that were studied, it was nevertheless possible to identify a core set of cost forecasting activities, and it was also found that the mental models cluster around three forecasting techniques. Further partitioning of the mental models revealed clustering of activities, that is very suggestive of a forecasting lifecycle. The different forecasting methods identified were based on the use of multiple-decomposition steps or multiple forecasting steps. The multiple forecasting steps involved either forecasting software size or an additional effort forecast. Virtually no subject used risk reduction steps in combination. The results of the analysis include: the identification of a core set of well defined costing activities, a proposed software forecasting life cycle, and the identification of several basic software forecasting mental models. The paper concludes with a discussion of the implications of the results for current individual and institutional practices.
Many large-scale computational problems are based on unstructured computational domains. Primary examples are unstructured grid calculations based on finite volume methods in computational fluid dynamics, or structural analysis problems based on finite element approximations. The question of how to distribute such unstructured computational domains over a large number of processors in a MIMD machine with distributed memory is addressed. A graph theoretical framework for these problems is established. Based on this framework three decomposition algorithms are introduced. In particular a new decomposition algorithm is discussed, which is based on the computation of an eigenvector of the Laplacian matrix associated with the graph. Numerical comparisons on large-scale two- and three-dimensional problems demonstrate the superiority of the new spectral bisection algorithm.
Relative motion in the Cartesian or overset framework causes certain spatial nodes to move in and out of the physical domain as they are dynamically blanked by moving solid bodies. This poses a problem for the conventional Time-Spectral approach, which expands the solution at every spatial node into a Fourier series spanning the period of motion. The proposed extension to the Time-Spectral method treats unblanked nodes in the conventional manner but expands the solution at dynamically blanked nodes in a basis of barycentric rational polynomials spanning partitions of contiguously defined temporal intervals. Rational polynomials avoid Runge's phenomenon on the equidistant time samples of these sub-periodic intervals. Fourier- and rational polynomial-based differentiation operators are used in tandem to provide a consistent hybrid Time-Spectral overset scheme capable of handling relative motion. The hybrid scheme is tested with a linear model problem and implemented within NASA's OVERFLOW Reynolds-averaged Navier- Stokes (RANS) solver. The hybrid Time-Spectral solver is then applied to inviscid and turbulent RANS cases of plunging and pitching airfoils and compared to time-accurate and experimental data. A limiter was applied in the turbulent case to avoid undershoots in the undamped turbulent eddy viscosity while maintaining accuracy. The hybrid scheme matches the performance of the conventional Time-Spectral method and converges to the time-accurate results with increased temporal resolution.
This study develops the use of spectral total and diffuse irradiance measurements, made from a prototype hyperspectral total-diffuse sunshine pyranometer (SPN-S), to retrieve layer fine-mode aerosol (τ aer ) and total optical depths from airborne platforms. Additionally, we use spectral analysis in an attempt to partition the total optical depth into its τ aer and cirrus cloud optical depth (τ cld ) components in the absence of coarse-mode aerosols. Two retrieval methods are developed: one leveraging information in the diffuse irradiance and the other using spectral characteristics of the transmitted direct beam, with each approach best suited for specific cloud and aerosol conditions. The SPN-S has advantages over traditional sun photometer systems, including no moving parts and a low cost. However, a significant drawback of the instrument is that it is unable to measure the direct-beam irradiance as accurately as sun photometers. To compensate for the greater measurement uncertainty in the radiometric irradiances, these retrieval techniques employ ratioed inputs or spectral information to reduce output uncertainty. This analysis uses irradiance measurements from the SPN-S and the solar spectral flux radiometer (SSFR) aboard the National Aeronautics and Space Administration’s (NASA) P-3 aircraft during the 2018 deployment of the ObseRvations of Aerosols above CLouds and their intEractionS (ORACLES) campaign and the 2019 Cloud, Aerosol and Monsoon Processes Philippines Experiment (CAMP 2 Ex) mission to quantify above-aircraft cirrus τ cld and derive vertical profiles of layer τ aer . Validation of the τ aer retrieval is accomplished by comparison with co-located measurements of direct solar irradiance made by the Sky-Scanning Sun-Tracking Atmospheric Research (4STAR) and in situ measurements of aerosol optical depth. For the aggregated 2018 ORACLES results, regression between the SPN-S-based method and sun photometer τ aer values yields a slope of 0.96 with an R 2 of 0.96, while the root mean square error (RMSE) is 3.0 x 10 -2 . When comparing the retrieved τ aer to profiles of integrated in situ measurements of optical extinction, the slope, R 2 , and RMSE values for ORACLES are 0.90, 0.96, and 3.4 x 10 -2 , and for CAMP 2 Ex they are 0.94, 0.97, and 3.4 x 10 -2 , respectively. This paper is a demonstration of methods for deriving cloud and aerosol optical properties in environments where both atmospheric constituents may be present. With improvements to the low-cost SPN-S radiometer instrument, it may be possible to extend these methods to a broader set of sampling applications, such as ground-based settings.
This paper presents a systematic study of applying composite method approximations with locally dense basis sets (LDBS) to efficiently calculate NMR shielding constants in small and medium-sized molecules. The pcSseg-n series of basis sets are shown to have similar accuracy to the pcS-n series when n ≥ 1 and can slightly reduce computational costs. We identify two different LDBS partition schemes that perform very effectively for density functional calculations. Here, we select a large subset of the recent NS372 database containing 290 H, C, N, and O shielding values evaluated by reference methods on 106 molecules to carefully assess methods of the high, medium, and low computational costs to make practical recommendations. Our assessment covers conventional electronic structure methods (density functional theory and wave function) with global basis calculations, as well as their use in one of the satisfactory LDBS approaches, and a range of composite approaches, also with and without LDBS. Altogether 99 methods are evaluated. On this basis, we recommend different methods to reach three different levels of accuracy and time requirements across the four nuclei considered.
Microalgae present promising feedstocks to produce renewable fuel and chemical intermediates, in part due to high storage carbon flux capacity to triacylglycerides or storage carbohydrates upon nutrient deprivation. However, the mechanism(s) governing deprivation-mediated carbon partitioning remain to be fully elucidated, limiting targeted strain engineering strategies in algal biocatalysts. Though genomic and transcriptomic analyses offer key insights into these mechanisms, active post-transcriptional regulatory mechanisms, ubiquitous in many microalgae, necessitate proteomic and post-translational (e.g., phospho- and nitroso-proteomic) analyses to more completely evaluate algal responsiveness to nutrient deprivation. Herein, we describe methods for isolating total algal protein and conducting proteomic, phosphoproteomic, and nitrosoproteomic analyses. We focus on methods deployed for the chlorophyte, Chlorella vulgaris, a model oleaginous alga with high flux to renewable fuel and chemical precursors.
This work introduces Jacobian-scaled K-means (JSK-means) clustering, which is a physicsinformed clustering strategy centered on the K-means framework. The method allows for the injection of underlying physical knowledge into the clustering procedure through a distance function modification: instead of leveraging conventional Euclidean distance vectors, the JSKmeans procedure operates on distance vectors scaled by matrices obtained from dynamical system Jacobians evaluated at the cluster centroids. The goal of this work is to show how the JSKmeans algorithm - without modifying the input dataset - produces clusters that capture regions of dynamical similarity, in that the clusters are redistributed towards high-sensitivity regions in phase space and are described by similarity in the source terms of samples instead of the samples themselves. The algorithm is demonstrated on a complex reacting flow simulation dataset (a channel detonation configuration), where the dynamics in the thermochemical composition space are known through the highly nonlinear and stiff Arrhenius-based chemical source terms. Interpretations of cluster partitions in both physical space and composition space reveal how JSK-means shifts clusters produced by standard K-means towards regions of high chemical sensitivity (e.g., towards regions of peak heat release rate near the detonation reaction zone). Furthermore, the findings presented here illustrate the benefits of utilizing Jacobian-scaled distances in clustering techniques, and the JSK-means method in particular displays promising potential for improving former partition-based modeling strategies in reacting flow (and other multi-physics) applications.
In this work, we propose a new method that extends conservative explicit multirate methods to implicit explicit-multirate methods. We develop extensions of order one and two with different stability properties on the implicit side. The method is suitable for time-stepping adaptive mesh refinement PDE discretizations with different degrees of stiffness. A numerical example with an advection-diffusion problem illustrates the new method's properties.
This paper describes a technique for estimating the liquid water content (LWC) and a characteristic particle diameter in stratocumulus clouds using radar and lidar observations. The uncertainty in LWC estimate from radar and lidar measurements is significantly reduced once the characteristic particle diameter is known. The technique is independent of the drop size distribution. It is applicable for a broad range of W-band reflectivity Z between -30 and 0 dBZ and all values of lidar backscatter β observations. No partitioning of cloud or drizzle is required on the basis of an arbitrary threshold of Z as in prior studies. A method for estimating droplet diameter and LWC was derived from the electromagnetic simulations of radar and lidar observations. In situ stratocumulus cloud and drizzle probe spectra were input to the electromagnetic simulation. The retrieved droplet diameter and LWC were validated using in situ measurements from the southeastern Pacific Ocean. The retrieval method was applied to radar and lidar measurements from the northeastern Pacific. Uncertainty in the retrieved droplet diameter and LWC that are due to the measurement errors in radar and lidar backscatter measurements are 7% and 14%, respectively. The retrieved LWC was validated using the concurrent G-band radiometer estimates of the liquid water path.
Different methods for solving the 'two-level problem' are discussed, namely, the problem of what happens to a material system having only two nondegenerate energy levels when it is perturbed by an electromagnetic field that varies with time in a monochromatic sinusoidal fashion. The various methods discussed include: (1) the Sen Gupta technique using nondegenerate Rayleigh-Schroedinger perturbation theory, (2) the Salwen-Winter-Shirley partitioning perturbation technique, (3) the Shirley and series degenerate Rayleigh-Schroedinger expansion, (4) the degenerate Rayleigh-Schroedinger technique for considering high frequency fields, and (5) the singular perturbation expansion technique.
Five programming techniques used to decrease core and increase program versatility and efficiency are explained. The techniques are: (1) dynamic storage allocation, (2) automatic core-sizing and core-resizing, (3) matrix partitioning, (4) free field alphanumeric reads, and (5) incorporation of a data complex. The advantages of these techniques and the basic methods for employing them are explained and illustrated. Several actual program applications which utilize these techniques are described as examples.
Techniques for partitioning optical linear algebra problems to make them amenable to solution using optical processors programmed with simple algorithms are explored. Generalized methods for splitting a linear algebra matrix into a series of submatrices are reviewed, showing that simple forms can be pipelined smoothly and that parallel accumulation can be achieved by beam combining on detectors or by summing electronically. The techniques offer simplified bookkeeping, algorithmic independence, and high efficiency. The computational speed will depend on the number of multiplier-accumulators devoted to the task.
Load distribution schemes are presented which minimize the total data traffic in the Cholesky factorization of dense and sparse, symmetric, positive definite matrices on multiprocessor systems with local and shared memory. The total data traffic in factoring an n x n sparse, symmetric, positive definite matrix representing an n-vertex regular 2-D grid graph using n (sup alpha), alpha is equal to or less than 1, processors are shown to be O(n(sup 1 + alpha/2)). It is O(n(sup 3/2)), when n (sup alpha), alpha is equal to or greater than 1, processors are used. Under the conditions of uniform load distribution, these results are shown to be asymptotically optimal. The schemes allow efficient use of up to O(n) processors before the total data traffic reaches the maximum value of O(n(sup 3/2)). The partitioning employed within the scheme, allows a better utilization of the data accessed from shared memory than those of previously published methods.
The simultaneous use of adaptive meshing techniques with a multigrid strategy for solving the 2-D Euler equations in the context of unstructured meshes is studied. To obtain optimal efficiency, methods capable of computing locally improved solutions without recourse to global recalculations are pursued. A method for locally refining an existing unstructured mesh, without regenerating a new global mesh is employed, and the domain is automatically partitioned into refined and unrefined regions. Two multigrid strategies are developed. In the first, time-stepping is performed on a global fine mesh covering the entire domain, and convergence acceleration is achieved through the use of zonal coarse grid accelerator meshes, which lie under the adaptively refined regions of the global fine mesh. Both schemes are shown to produce similar convergence rates to each other, and also with respect to a previously developed global multigrid algorithm, which performs time-stepping throughout the entire domain, on each mesh level. However, the present schemes exhibit higher computational efficiency due to the smaller number of operations on each level.
Single event upset (SEU) analysis of complex systems is challenging. Currently, system SEU analysis is performed by component level partitioning and then either: the most dominant SEU cross-sections (SEUs) are used in system error rate calculations; or the partition SEUs are summed to eventually obtain a system error rate. In many cases, system error rates are overestimated because these methods generally overlook system level derating factors. The problem with overestimating is that it can cause overdesign and consequently negatively affect the following: cost, schedule, functionality, and validation/verification. The scope of this presentation is to discuss the risks involved with our current scheme of SEU analysis for complex systems; and to provide alternative methods for improvement.