Search NASA⌕ Search

SEARCH · Search NASA

Results for “partitioned 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 829 records · Page 46

Three-dimensional Euler time accurate simulations of fan rotor-stator interactions

A numerical method useful to describe unsteady 3-D flow fields within turbomachinery stages is presented. The method solves the compressible, time dependent, Euler conservation equations with a finite volume, flux splitting, total variation diminishing, approximately factored, implicit scheme. Multiblock composite gridding is used to partition the flow field into a specified arrangement of blocks with static and dynamic interfaces. The code is optimized to take full advantage of the processing power and speed of the Cray Y/MP supercomputer. The method is applied to the computation of the flow field within a single stage, axial flow fan, thus reproducing the unsteady 3-D rotor-stator interaction.

Boretti, A. A.↗

In silico environmental chemical science: properties and processes from statistical and computational modelling

Quantitative structure–activity relationships (QSARs) have long been used in the environmental sciences. More recently, molecular modeling and chemoinformatic methods have become widespread. These methods have the potential to expand and accelerate advances in environmental chemistry because they complement observational and experimental data with “in silico” results and analysis. The opportunities and challenges that arise at the intersection between statistical and theoretical in silico methods are most apparent in the context of properties that determine the environmental fate and effects of chemical contaminants (degradation rate constants, partition coefficients, toxicities, etc.). The main example of this is the calibration of QSARs using descriptor variable data calculated from molecular modeling, which can make QSARs more useful for predicting property data that are unavailable, but also can make them more powerful tools for diagnosis of fate determining pathways and mechanisms. Emerging opportunities for “in silico environmental chemical science” are to move beyond the calculation of specific chemical properties using statistical models and toward more fully in silico models, prediction of transformation pathways and products, incorporation of environmental factors into model predictions, integration of databases and predictive models into more comprehensive and efficient tools for exposure assessment, and extending the applicability of all the above from chemicals to biologicals and materials.

54 ENVIRONMENTAL SCIENCES↗

An Orthogonal Recursive Bisection (ORB) Based Time Advancement Algorithm for CFD-DEM Solvers

The time integration of the granular phase in coupled computational fluid dynamics (CFD) – discrete element method (DEM) simulations presents a unique computational challenge brought about by the large variations in particle collisional time scales. Particles in the dilute regions of the computational domain can be advanced with large time steps while dense regions require much smaller time increments. However, the time step size in most solvers is globally set as the limit for accuracy and stability imposed by the collisions and is typically orders of magnitude less than that required away from collisions. This work addresses this precise issue and provides a strategy to avoid the use of a global conservative small time step size for the entire set of particles.A novel time stepping algorithm for CFD-DEM solvers using a partitioning approach using orthogonal recursive bisection (ORB) that allows for variable time steps among particles is described and its computational performance is compared against baseline explicit methods, typically used in several CFD-DEM solvers. ORB has advantages of being relatively quick and easy to update incrementally and has the required heuristic behavior (i.e., it will split the region in half with a cluster on each side) when groups of particles are well separated (clustered). The algorithm presented in this work uses a local time stepping approach to resolve collisional time scales for subsets of particles that are present at the leaves of the ORB, thereby resulting in substantial reduction of computational cost. The parallel implementation of this method where a ``knapsack” algorithm is used in tandem with ORB for effective load-balancing is also presented, where a best possible partitioning is obtained based on number of particles and local time-stepping costs. The algorithm is tested against benchmark problems with varying particle distributions that include fluidized bed and riser flow scenarios. Preliminary results indicate that the approach is 2-3X faster than traditional explicit methods for problems that involve both dense and dilute regions, while maintaining the same level of accuracy.

adaptive timestepping↗

Jensen-Feynman approach to the statistics of interacting electrons

Faussurier et al. [Phys. Rev. E 65, 016403 (2001)] proposed to use a variational principle relying on Jensen-Feynman (or Gibbs-Bogoliubov) inequality in order to optimize the accounting for two-particle interactions in the calculation of canonical partition functions. It consists of a decomposition into a reference electron system and a first-order correction. The procedure appears to be very efficient in order to evaluate the free energy and the orbital populations. In this work, we present numerical applications of the method and propose to extend it using a reference energy which includes the interaction between two electrons inside a given orbital. This is possible, thanks to our efficient recursion relation for the calculation of partition functions. We also show that a linear reference energy, however, is usually sufficient to achieve a good precision and that the most promising way to improve the approach of Faussurier et al. is to apply Jensen's inequality to a more convenient convex function.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hybrid stochastic simulation of reaction-diffusion systems with slow and fast dynamics

In this paper, we present a novel hybrid method to simulate discrete stochastic reaction-diffusion models arising in biochemical signaling pathways. We study moderately stiff systems, for which we can partition each reaction or diffusion channel into either a slow or fast subset, based on its propensity. Numerical approaches missing this distinction are often limited with respect to computational run time or approximation quality. We design an approximate scheme that remedies these pitfalls by using a new blending strategy of the well-established inhomogeneous stochastic simulation algorithm and the tau-leaping simulation method. The advantages of our hybrid simulation algorithm are demonstrated on three benchmarking systems, with special focus on approximation accuracy and efficiency.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Automated problem scheduling and reduction of synchronization delay effects

It is anticipated that in order to make effective use of many future high performance architectures, programs will have to exhibit at least a medium grained parallelism. A framework is presented for partitioning very sparse triangular systems of linear equations that is designed to produce favorable preformance results in a wide variety of parallel architectures. Efficient methods for solving these systems are of interest because: (1) they provide a useful model problem for use in exploring heuristics for the aggregation, mapping and scheduling of relatively fine grained computations whose data dependencies are specified by directed acrylic graphs, and (2) because such efficient methods can find direct application in the development of parallel algorithms for scientific computation. Simple expressions are derived that describe how to schedule computational work with varying degrees of granularity. The Encore Multimax was used as a hardware simulator to investigate the performance effects of using the partitioning techniques presented in shared memory architectures with varying relative synchronization costs.

Saltz, Joel H.↗

Estimating fractional sky cover from spectral measurements

A ratio method for estimating cloud fractional cover from spectral radiation measurements has been developed. It is based on spectral characteristics of clouds and clear-sky aerosols to partition sky fraction. As illustrated in sensitivity study and demonstrated in real measurements, the transmittance ratio at selected wavelengths is insensitive to solar zenith angle and major atmospheric gaseous absorption. With a localized baseline procedure, retrievals of this ratio method are independent of absolute calibration and weakly sensitive to changes of cloud and aerosol optical properties, and thus substantially reduce the retrieval uncertainty. The uncertainty of this ratio method, estimated through sensitivity study and intercomparison, is less than 10%. With globally deployed narrowband radiometers, this simple ratio method will substantially enhance current capability of monitoring cloud fractional cover in large geographic distribution.

54 ENVIRONMENTAL SCIENCES↗

A one-loop test of the near-AdS 2 /near-CFT 1 correspondence

We analyze quantum fluctuations around black hole solutions to the Jackiw-Teitelboim model. We use harmonic analysis on Euclidean AdS 2 to show that the logarithmic corrections to the partition function are determined entirely by quadratic holomorphic differentials, even when conformal symmetry is broken and harmonic modes are no longer true zero modes. Our quantum-corrected partition function agrees precisely with the SYK result. We argue that our effective quantum field theory methods and results generalize to other theories of two-dimensional dilaton gravity.

2D Gravity↗

A new approach to the generalization of Planck’s law of black-body radiation

Highlights: A new approximation approach to generalized Planck’s radiation law has been developed. Average energy of radiation derived using the nonextensive partition function. The spectral energy density and spectral radiance have been computed. The present approach has been compared with approximate schemes and the exact method. Deviations of present approach and AA and FA schemes from exact result computed. -- Abstract: In this study, Planck’s law of black-body radiation has been modified within the framework of nonextensive statistical mechanics. The average energy of radiation has been derived by introducing the nonextensive partition function in the statistical relation of internal energy. The spectral energy density and spectral radiance have also been computed. The derived expression has been compared with the earlier developed approximate schemes (i.e. asymptotic approach and factorization approach) and with the recently obtained exact result. We utilize the exact and approximate Stefan–Boltzmann laws in order to compare with the new approach introduced here.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Recursive Partitioning Analysis Index Is Predictive for Overall Survival in Patients Undergoing Spine Stereotactic Body Radiation Therapy for Spinal Metastases

Purpose: To generate a prognostic index using recursive partitioning analysis (RPA) for patients undergoing spine stereotactic body radiation therapy (sSBRT) for spinal metastases (sMet). Methods and Materials: From an institutional review board-approved database, 174 patients were treated for sMet with sSBRT between February 2006 and August 2009. Median dose was 14 Gy (range, 8-24 Gy), typically in a single fraction (range, 1-5). Kaplan-Meier analysis was performed to detect any correlation between survival and histology. Histologies were divided into favorable (breast and prostate), radioresistant (renal cell, melanoma and sarcoma), and other (all other histologies). RPA was performed to identify any association of the following variables with overall survival (OS) following sSBRT: histology, gender, age, Karnofsky performance status (KPS), control of primary, extraosseous metastases, time from primary diagnosis (TPD), dose of sSBRT ({<=}14 Gy vs. >14 Gy), extent of spine disease (epidural only, bone and epidural, bone only), upfront or salvage treatment, presence of paraspinal extension, and previous surgery. Results: Median follow-up was 8.9 months. Median OS time from sSBRT was 10.7 months. Median OS intervals for favorable histologies were 14 months, 11.2 months for radioresistant histologies, and 7.3 months for other histologies (p = 0.02). RPA analysis resulted in three classes (p < 0.0001). Class 1 was defined as TPD of >30 months and KPS of >70; Class 2 was TPD of >30 months and KPS of {<=}70 or a TPD of {<=}30 months and age <70 years old; Class 3 was TPD of {<=}30 months and age {>=}70 years old. Median OS was 21.1 months for Class 1 (n = 59), 8.7 months for Class 2 (n = 104), and 2.4 months for Class 3 (n = 11). Conclusion: sSBRT patients treated for sMet have a wide variability in OS. We developed an RPA classification system that is predictive of OS. While many patients are treated for palliation of pain or to avoid symptomatic progression, this index may be used to predict which patients may benefit most from sSBRT.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Mesh-free data transfer algorithms for partitioned multiphysics problems: Conservation, accuracy, and parallelism

In this study we analyze and extend mesh-free algorithms for three-dimensional data transfer problems in partitioned multiphysics simulations. We first provide a direct comparison between a mesh-based weighted residual method using the common-refinement scheme and two mesh-free algorithms leveraging compactly supported radial basis functions: one using a spline interpolation and one using a moving least square reconstruction. Through the comparison we assess both the conservation and accuracy of the data transfer obtained from each of the methods. We do so for a varying set of geometries with and without curvature and sharp features and for functions with and without smoothness and with varying gradients. Our results show that the mesh-based and mesh-free algorithms are complementary with cases where each was demonstrated to perform better than the other. We then focus on the mesh-free methods by developing a set of algorithms to parallelize them based on sparse linear algebra techniques. This includes a discussion of fast parallel radius searching in point clouds and restructuring the interpolation algorithms to leverage data structures and linear algebra services designed for large distributed computing environments. The scalability of our new algorithms is demonstrated on a leadership class computing facility using a set of basic scaling studies. Finally, these scaling studies show that for problems with reasonable load balance, our new algorithms for both spline interpolation and moving least square reconstruction demonstrate both strong and weak scalability using more than 100,000 MPI processes with billions of degrees of freedom in the data transfer operation.

97 MATHEMATICS AND COMPUTING↗

Efficiently sampling conformations and pathways using the concurrent adaptive sampling (CAS) algorithm

Molecular dynamics (MD) simulations are useful in obtaining thermodynamic and kinetic properties of bio-molecules but are limited by the timescale barrier, i.e., we may be unable to efficiently obtain properties because we need to run microseconds or longer simulations using femtoseconds time steps. While there are several existing methods to overcome this timescale barrier and efficiently sample thermodynamic and/or kinetic properties, problems remain in regard to being able to sample un- known systems, deal with high-dimensional space of collective variables, and focus the computational effort on slow timescales. Hence, in this work, a new sampling method, called the “Concurrent Adaptive Sampling (CAS) algorithm,” has been developed to tackle these three issues and efficiently obtain conformations and pathways. The method is not constrained to use only one or two collective variables, unlike most reaction coordinate-dependent methods. Instead, it can use a large number of collective vari- ables and uses macrostates (a partition of the collective variable space) to enhance the sampling. The exploration is done by running a large number of short simula- tions, and a clustering technique is used to accelerate the sampling. In this paper, we introduce the new methodology and show results from two-dimensional models and bio-molecules, such as penta-alanine and triazine polymer

59 BASIC BIOLOGICAL SCIENCES↗

Hamiltonian thermodynamics of d-dimensional (d{>=}4) Reissner-Nordstroem-anti-de Sitter black holes with spherical, planar, and hyperbolic topology

The Hamiltonian thermodynamics formalism is applied to the general d-dimensional Reissner-Nordstroem-anti-de Sitter black hole with spherical, planar, and hyperbolic horizon topology. After writing its action and performing a Legendre transformation, surface terms are added in order to guarantee a well-defined variational principle with which to obtain sensible equations of motion, and also to allow later on the thermodynamical analysis. Then a Kuchar canonical transformation is done, which changes from the metric canonical coordinates to the physical parameters coordinates. Again, a well-defined variational principle is guaranteed through boundary terms. These terms influence the falloff conditions of the variables and at the same time the form of the new Lagrange multipliers. Reduction to the true degrees of freedom is performed, which are the conserved mass and charge of the black hole. Upon quantization a Lorentzian partition function Z is written for the grand canonical ensemble, where the temperature T and the electric potential {phi} are fixed at infinity. After imposing Euclidean boundary conditions on the partition function, the respective effective action I{sub *}, and thus the thermodynamical partition function, is determined for any dimension d and topology k. This is a quite general action. Several previous results can be then condensed in our single general formula for the effective action I{sub *}. Phase transitions are studied for the spherical case, and it is shown that all the other topologies have no phase transitions. A parallel with the Bose-Einstein condensation can be established. Finally, the expected values of energy, charge, and entropy are determined for the black hole solution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reduced order modelling for dynamic simulations: LDRD feasibility study final report

This feasibility study (12-FS-007) investigated the current state-of-the-art for the construction of reduced order models (ROMs) from dynamic PDE-based simulations. One novel result of was the demonstration of a time-partitioned ROM for the advection-diffusion equation that achieved high accuracy with a small ROM size. The time-domain of a model PDE was partitioned and a fixed-size ROM was tuned to each subdomain resulting in an effective method for achieving an efficient and accurate ROM for a dynamic problem. This LDRD also investigated the construction ROMs for simulations that utilize overlapping grids. In this case, it was found that weighting the discrete inner product in a manner that approximates the continuous inner product yields a significantly more accurate ROM. This project demonstrated the feasibility of applying reduced order models to complex PDE-based simulation tools and explored the benefits of adaptive ROM techniques. The results of the work led to an Exploratory Research LDRD, funded for FY13, that will focus on the development of composite adaptive reduced order models suitable for use with a number of LLNL applications.

97 MATHEMATICS AND COMPUTING↗

Parallel implicit unstructured grid Euler solvers

A mesh-vertex finite volume scheme for solving the Euler equations on triangular unstructured meshes is implemented on an MIMD (multiple instruction/multiple data stream) parallel computer. An explicit four-stage Runge-Kutta scheme is used to solve two-dimensional flow problems. A family of implicit schemes is also developed to solve these problems, where the linear system that arises at each time step is solved by a preconditioned GMRES algorithm. Two partitioning strategies are employed, one that partitions triangles and the other that partitions vertices. The choice of the preconditioner in a distributed memory setting is discussed. All the methods are compared both in terms of elapsed times and convergence rates. It is shown that the implicit schemes offer adequate parallelism at the expense of minimal sequential overhead. The use of a global coarse grid to further minimize this overhead is also investigated. The schemes are implemented on a distributed memory parallel computer, the iPSC/860.

Venkatakrishnan, V.↗

Multilevel algorithms for nonlinear optimization

Multidisciplinary design optimization (MDO) gives rise to nonlinear optimization problems characterized by a large number of constraints that naturally occur in blocks. We propose a class of multilevel optimization methods motivated by the structure and number of constraints and by the expense of the derivative computations for MDO. The algorithms are an extension to the nonlinear programming problem of the successful class of local Brown-Brent algorithms for nonlinear equations. Our extensions allow the user to partition constraints into arbitrary blocks to fit the application, and they separately process each block and the objective function, restricted to certain subspaces. The methods use trust regions as a globalization strategy, and they have been shown to be globally convergent under reasonable assumptions. The multilevel algorithms can be applied to all classes of MDO formulations. Multilevel algorithms for solving nonlinear systems of equations are a special case of the multilevel optimization methods. In this case, they can be viewed as a trust-region globalization of the Brown-Brent class.

Alexandrov, Natalia↗

Use of networked workstations for parallel nonlinear structural dynamic simulations of rotating bladed-disk assemblies

The principal objective of this research is to investigate, develop and demonstrate coarse-grained, parallel-processing strategies for nonlinear dynamic simulations for rotating bladed-disk assemblies. The parallel -processing strategies addressed include numerical algorithms for parallel nonlinear solutions and techniques to effect load balancing among processors. The parallel environment employed is a distributed-memory, coarse-grained one consisting of networked workstations. A parallel explicit time integration method has been implemented for transient nonlinear solutions of rotationg bladed-disk assemblies. Automatic domain partitioning techniques have been investigated for load balancing among processors. Advanced computing environments, data structures and interactive computer graphics all contribute to an integrated parallel finite element analysis system to facilitate more efficient and powerful dynamic simulations.

Hsieh, Shang-Hsien↗

A Robust Parallel Distributed State Estimation for Large Scale Distribution Systems

The growing need and interest in real-time monitoring of large distribution networks motivated by the rapid population of renewable sources, EVs and etc. demand a computationally efficient state estimation framework. Furthermore, this paper presents an improved computational framework for implementing a robust state estimator using a multi-core processor. The main contribution of the paper is the proposed computational framework along with two partitioning strategies which enable fast and robust state estimation for large scale radial and/or meshed distribution systems. Formulation of the proposed method and its implementation are described in detail. Performance of the estimator is tested by simulations first using a small 84-bus radial distribution system. Then the method’s scalability is demonstrated by simulations on two very large scale distribution networks one configured radially and the other meshed each containing over 12,500 buses.

42 ENGINEERING↗