A modified Monte-Carlo quadrature. II.
Modified Monte Carlo procedure using partitioning method and stratified sampling
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.
Modified Monte Carlo procedure using partitioning method and stratified sampling
A general model of the transverse dielectric constant of III-V compounds is developed using a hybrid method which combines the kp method with a nonlocal pseudopotential calculation. In this method the Brillouin zone is partitioned into three regions by expanding the energy bands and matrix elements about the F, X, and L symmetry points. The real and imaginary parts of the dielectric constant are calculated as a sum of the individual contributions of each region. By using this partition method, it is possible to get good insight into the dependence of the dielectric constant on the shape of the band structure.
This article discusses the application of the Category-Partition Method to the test design phase. The method provides a formal framework for reducing the total number of possible test cases to a minimum logical subset for effective testing. An automatic tool and a formal language have been developed to implement the method and produce the specification of test cases
Additive Runge-Kutta (ARK) methods are investigated for application to the spatially discretized one- dimensional convection-diffusion-reaction (CDR) equations. Accuracy, stability, conservation, and dense-output are first considered for the general case when N different Runge-Kutta methods are grouped into a single composite method. Then, implicit-explicit, (N = 2), additive Runge-Kutta (ARK(sub 2)) methods from third- to fifth-order are presented that allow for integration of stiff terms by an L-stable, stiffly-accurate explicit, singly diagonally implicit Runge-Kutta (ESDIRK) method while the nonstiff terms are integrated with a traditional explicit Runge-Kutta method (ERK). Coupling error terms of the partitioned method are of equal order to those of the elemental methods. Derived ARK(sub 2) methods have vanishing stability functions for very large values of the stiff scaled eigenvalue, z['] yields -infinity, and retain high stability efficiency in the absence of stiffness, z['] yield 0. Extrapolation-type stage- value predictors are provided based on dense-output formulae. Optimized methods minimize both leading order ARK(sub 2) error terms and Butcher coefficient magnitudes as well as maximize conservation properties. Numerical tests of the new schemes on a CDR problem show negligible stiffness leakage and near classical order convergence rates. However, tests on three simple singular-perturbation problems reveal generally predictable order reduction. Error control is best managed with a PID-controller. While results for the fifth-order method are disappointing, both the new third- and fourth-order methods are at least as efficient as existing ARK(sub 2) methods.
When developing predictive models over a dataset, the model is globally optimized across the entire feature space to learn a decision boundary. However, when unobservable variables—which cannot be measured or estimated—interact with the observable variables, this can negatively impact the optimization applied to the decision boundary since the data samples introduced by unobservable variables may have little to no association with the applied global optimization. This, consequently, penalizes the entire decision boundary and model performance. This paper examines some of the detrimental effects of unobservable variables, particularly their role in creating new modes in the distribution of observable variables and reducing the separability of class distributions. Such challenges result in skewed or warped decision boundaries and decreased accuracy of model predictions, particularly for interpretable models like logistic regression and decision trees. Through two illustrative case examples, we highlight the need to address the challenges imposed by unobservable variables. We propose a strategy to mitigate these challenges by creating local regions within the feature space through partitioning. This enables the optimization of local models within the regions to overcome the impact of unobservability in different feature space localities. Research into a more sophisticated partitioning strategy and where the partition should be relative to the sample of interest is left as future work. Through the analysis of the impact of unobservability and the development of a partitioning method, we demonstrate the clear need for a partitioning strategy that integrates knowledge from multiple local models to estimate risk factors using information fusion. Thus, we establish the foundation and motivation for using partitioning and information fusion to overcome the effects of unobservability in predictive models. Formal fusion methods, such as Dempster-Shafer theory, can better leverage the information from local regions to improve the performance of interpretable predictive models in the presence of unobservable variables.
We report on several projects in the field of computational astrobiology, which is devoted to advancing our understanding of the origin, evolution and distribution of life in the Universe using theoretical and computational tools. Research projects included modifying existing computer simulation codes to use efficient, multiple time step algorithms, statistical methods for analysis of astrophysical data via optimal partitioning methods, electronic structure calculations on water-nuclei acid complexes, incorporation of structural information into genomic sequence analysis methods and calculations of shock-induced formation of polycylic aromatic hydrocarbon compounds.
Quantum mechanical perturbation theory calculation of upper and lower bounds of energy eigenvalues using partitioning methods
The purpose of this project has been to identify and test suitable technologies for implementation of fluid flow solvers -- possibly coupled with structures and heat equation solvers -- on MIMD parallel computers. In the course of this investigation much attention has been paid to efficient domain decomposition strategies for ADI-type algorithms. Multi-partitioning derives its efficiency from the assignment of several blocks of grid points to each processor in the parallel computer. A coarse-grain parallelism is obtained, and a near-perfect load balance results. In uni-partitioning every processor receives responsibility for exactly one block of grid points instead of several. This necessitates fine-grain pipelined program execution in order to obtain a reasonable load balance. Although fine-grain parallelism is less desirable on many systems, especially high-latency networks of workstations, uni-partition methods are still in wide use in production codes for flow problems. Consequently, it remains important to achieve good efficiency with this technique that has essentially been superseded by multi-partitioning for parallel ADI-type algorithms. Another reason for the concentration on improving the performance of pipeline methods is their applicability in other types of flow solver kernels with stronger implied data dependence. Analytical expressions can be derived for the size of the dynamic load imbalance incurred in traditional pipelines. From these it can be determined what is the optimal first-processor retardation that leads to the shortest total completion time for the pipeline process. Theoretical predictions of pipeline performance with and without optimization match experimental observations on the iPSC/860 very well. Analysis of pipeline performance also highlights the effect of uncareful grid partitioning in flow solvers that employ pipeline algorithms. If grid blocks at boundaries are not at least as large in the wall-normal direction as those immediately adjacent to them, then the first processor in the pipeline will receive a computational load that is less than that of subsequent processors, magnifying the pipeline slowdown effect. Extra compensation is needed for grid boundary effects, even if all grid blocks are equally sized.
The developments toward a general multilevel optimization capability and results for a three-level structural optimization are described. The method partitions a structure into a number of substructuring levels where each substructure corresponds to a subsystem in the general case of an engineering system. The method is illustrated by a portal framework that decomposes into individual beams. Each beam is a box that can be further decomposed into stiffened plates. Substructuring for this example spans three different levels: (1) the bottom level of finite elements representing the plates; (2) an intermediate level of beams treated as substructures; and (3) the top level for the assembled structure. The three-level case is now considered to be qualitatively complete.
RANS-MP, a new implementation of a single-grid Navier-Stokes solver using the diagonalized Beam-Warming approximate-factorization scheme, is presented. This first release of the completely rewritten solver employs the following optimizations: (1) Bi-directional multi-partition method for the ADI solver part; this improves granularity and load balance; (2) Improved cache usage through elimination of non-unit-stride array access (possible in part due to multi-partitioning); (3) Preprocessing of communicating boundary conditions to streamline logic during time stepping; (4) Truly parallel, high-performance I/O using the newly-developed MPI-IO library; (5) Elimination of large amounts of redundant operations through efficient use of workspace. Results of some realistic wing computations on the IBM SP2 computer will be presented. We will demonstrate that excellent absolute performance and scalability are obtained with RANS-MP, even for relatively small grid sizes. Besides high performance, an outstanding feature of RANS-MP is its true portability, due to the use of the portable message passing and I/O libraries MPI and MPI-IO.
The accomplishments achieved under the isotropic creep-fatigue crack initiation life prediction program are summarized. A sizeable creep-fatigue crack initiation data base was generated on the nickel-base superalloy, B-1900. Companion constitutive modeling programs have also generated extensive data bases on the same heat of material. The crack initiation results have formed the basis of a new approach to creep-fatigue life prediction. The term Cyclic Damage Accumulation (CDA) was coined for the method, which was evaluated under isothermal, uniaxial conditions. Stringent laboratory verification experiments were used to test the accuracy of the method. Considering the quite limited material property data needed to evaluate the constants in the approach, the prediction accuracy is acceptable. At the expense of the larger data base required, Lewis developed total strain- strainrange partitioning method (TS-SRP) is capable of a higher degree of accuracy.
Passive microwave brightness temperatures (TBs) at 92 and 183 GHz from an aircraft thunderstorm overflight are compared with values calculated from radar-derived hydrometeor profiles and a modified proximity sounding. Two methods for modeling particles in the ice canopy are contrasted. The first is a 'traditional' approach employing Marshall-Palmer ice spheres. The second, or 'alternative', method partitions 20 percent of the ice water content into a Marshall-Palmer component for graupel and hail, and 80 percent into a modified gamma spherical particle size distribution function representing ice crystals. Results from the alternative approach are superior to those from the traditional method in the anvil and mature convective core. In the decaying convective region, the traditional approach yields better agreement with observed magnitudes. Neither method, however, matches the geometry of the observed TB depression associated with the decaying convective core. This is likely due to the presence of graupel, which is not detected as a special signature in radar reflectivity, but does diminish TBs through scattering. Brightness temperatures at the relatively high microwave frequencies considered are shown to be very sensitive to the ice-particle size distribution.
A numerical method, originally developed to analyze the morphology of global and local structure in prototype galaxies, is modified for analyzing observed disk-shape galaxies. Two digitized spiral galaxies NGC 1232 and NGC 5457 with varying degrees of contrast between arm and interarm regions are analyzed. A synergism of partitioning methods and a geometric mean least-squares regression algorithm serves to isolate local arm segments, spurs, feathers, and secondary features and to measure their pitch angles and lengths. The global arms are actually highly disjointed, with arm segments frequently revealing pitch angles between 30 and 50 deg, certainly greater than those of the parent arms. Prominent spurs tend to exhibit a much greater pitch angle. The automated mathematical algorithm is shown to have negligible numerical biasing and could be applied to any number of spiral galaxies manifesting flocculent structure, either prototype or observed, and could possibly be used as a tool for classification of multiple-armed-type galaxies.
The utility of advanced constitutive models and structural analysis methods in predicting the cyclic life of an air-cooled turbine blade is assessed. Five structural analysis methods were exercised in calculating the cyclic stress-strain response at the airfoil critical location. The methods studied were a cyclic elastic finite-element analysis, nonlinear finite-element analyses based on classical inelastic models and the unified models of Bodner and Walker, and a simplified inelastic procedure. These analyses were compared in terms of computing times and of predicted crack initiation lives using the Strainrange Partitioning method.
This paper describes a parallel implementation of the direct simulation Monte Carlo (DSMC) method. Runtime library support is used for scheduling and execution of communication between nodes, and domain decomposition is performed dynamically to maintain a good load balance. Performance tests are conducted using the code to evaluate various remapping and remapping-interval policies, and it is shown that a one-dimensional chain-partitioning method works best for the problems considered. The parallel code is then used to simulate the Mach 20 nitrogen flow over a finite-thickness flat plate. It is shown that the parallel algorithm produces results which compare well with experimental data. Moreover, it yields significantly faster execution times than the scalar code, as well as very good load-balance characteristics.
Procedures based on modification of the conventional Strainrange Partitioning method are proposed to characterize the time-dependent degradation of engineering alloys in high-temperature, low-cycle fatigue. Creep-fatigue experiments were conducted in air using different waveforms of loading on 316 stainless steel at 816 C (1500 F) to determine the effect of exposure time on cyclic life. Reductions in the partitioned cyclic lives were observed with an increase in the time of exposure (or with the corresponding decrease in the steady-state creep rate) for all the waveforms involving creep strain. Excellent correlations of the experimental data were obtained by modifying the Conventional Strainrange Partitioning life relationships involving creep strain using a power-law term of either: (1) time of exposure, or (2) steady-state creep rate of the creep-fatigue test. Environmental degradation due to oxidation, material degradation due to the precipitation of carbides along the grain boundaries and detrimental deformation modes associated with the prolonged periods of creep were observed to be the main mechanisms responsible for life reductions at long exposure times.
A method is described for reducing the visibility of artifacts arising in the display of quantized color images on CRT displays. The method is based on the differential spatial sensitivity of the human visual system to chromatic and achromatic modulations. Because the visual system has the highest spatial and temporal acuity for the luminance component of an image, a technique which will reduce luminance artifacts at the expense of introducing high-frequency chromatic errors is sought. A method based on controlling the correlations between the quantization errors in the individual phosphor images is explored. The luminance component is greatest when the phosphor errors are positively correlated, and is minimized when the phosphor errors are negatively correlated. The greatest effect of the correlation is obtained when the intensity quantization step sizes of the individual phosphors have equal luminances. For the ordered dither algorithm, a version of the method can be implemented by simply inverting the matrix of thresholds for one of the color components.
Upper and lower bounds have been calculated for the energy levels of a rigid rotator in an electric field, in order to study the problems associated with the use of the partitioning method for bracketing an eigenvalue of the Schrödinger equation. Results of arbitrarily high accuracy are possible in this example.