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 271 records · Page 15

The approximate second order coupled-cluster method based on a size-consistent Brillouin–Wigner partitioning

We present a variant of the approximate second order coupled-cluster method (CC2) with a two-parameter size-consistent Brillouin–Wigner (BW-s) partitioning instead of a Møller–Plesset (MP) partitioning for the unperturbed Hamiltonian, which we refer to as BWs-CC2. The computational complexity of this model scales identically to CC2 with molecular size. Conventional CC2 and its regularized BWs-CC2 variants, as well as conventional MP2 and two of its regularized BW-s2 variants, were assessed on a 535 element database spanning thermochemistry, non-covalent interactions, barrier heights, and isomerization energies. To ensure a well-defined model chemistry, the assessment was performed using internally stable spin-polarized Hartree–Fock (HF) orbitals in the finite aug-cc-pVQZ basis without counterpoise corrections. As a result of using stable orbitals, contrary to conventional wisdom, we find that CC2 substantially outperforms MP2 on molecules with significantly spin contaminated reference orbitals without a significant increase in error on systems with a spin-pure reference, showing the value of its single substitutions. While no single choice of regularization parameters can be optimal for all datasets, we find that BWs-CC2 generally outperforms both CC2 and BW-s2 with a single judicious parameter choice. Additional tests on dipole moments and bond lengths of diatomics provide further support for the utility of this choice. Furthermore, the main outliers and poorest performing cases are associated with large amounts of spin-contamination in the HF reference, which is indicative of systems with either strong correlation or extensive artificial symmetry breaking. Overall, these findings argue that the perception of the quality of the CC2 ground state should be reevaluated and that it can be further improved upon by the soundly based BWs-CC2 variant with the recommended parameter choice.

Correlation energy↗

Data-parallel lower-upper relaxation method for reacting flows

The implicit lower-upper symmetric Gauss-Seidel (LU-SGS) method of Yoon and Jameson is modified for use on massively parallel computers. The method has been implemented on the Thinking Machines CM-5 and the MasPar MP-1 and MP-2, where large percentages of the theoretical peak floating point performance are obtained. It is shown that the new data-parallel LU relaxation method has better convergence properties than the original method for two different inviscid compressible flow simulations. The convergence is also improved for five-species reacting air computations. The performance of the method on various partitions of the CM-5 and on the MasPar computers is discussed. The new method shows promise for the efficient simulation of very large perfect gas and reacting flows.

Candler, Graham V.↗

Strainrange partitioning behavior of the nickel-base superalloys, Rene 80 and 100

A study has been made to assess the ability of the method of Strainrange Partitioning (SRP) to both correlate and predict high-temperature low-cycle fatigue lives of nickel-base superalloys for gas turbine applications. SRP is shown to correlate the cyclic lives of the baseline tests to within factors of nearly two. The partitioned strainrage versus life relationships for uncoated Rene 80 and cast IN 100 have also been determined from the ductility normalized-strainrange partitioning equations. These were used to predict the cyclic lives of the baseline tests. Predicted and observed cyclic lives agreed to within factors of nearly three. The life predictability of the method is also verified for cast IN 100 by applying the baseline results to the cyclic-life prediction of a series of complex strain-cycling tests with multiple hold periods at constant strain. It is concluded that the method of SRP can correlate and predict the cyclic lives of laboratory specimens of the nickel-base superalloys evaluated in this program.

Halford, G. R.↗

Time-independent hybrid enrichment for finite element solution of transient conduction–radiation in diffusive grey media

We investigate the effectiveness of the partition-of-unity finite element method for transient conduction–radiation problems in diffusive grey media. The governing equations consist of a semi-linear transient heat equation for the temperature field and a stationary diffusion approximation to the radiation in grey media. The coupled equations are integrated in time using a semi-implicit method in the finite element framework. We show that for the considered problems, a combination of hyperbolic and exponential enrichment functions based on an approximation of the boundary layer leads to improved accuracy compared to the conventional finite element method. It is illustrated that this approach can be more efficient than using h adaptivity to increase the accuracy of the finite element method near the boundary walls. The performance of the proposed partition-of-unity method is analyzed on several test examples for transient conduction–radiation problems in two space dimensions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Programming in a proposed 9X distributed Ada

The studies of the proposed Ada 9X constructs for distribution, now referred to as AdaPT are reported. The goals for this time period were to revise the chosen example scenario and to begin studying about how the proposed constructs might be implemented. The example scenario chosen is the Submarine Combat Information Center (CIC) developed by IBM for the Navy. The specification provided by IBM was preliminary and had several deficiencies. To address these problems, some changes to the scenario specification were made. Some of the more important changes include: (1) addition of a system database management function; (2) addition of a fourth processing unit to the standard resources; (3) addition of an operator console interface function; and (4) removal of the time synchronization function. To implement the CIC scenario in AdaPT, the decided strategy were publics, partitions, and nodes. The principle purpose for implementing the CIC scenario was to demonstrate how the AdaPT constructs interact with the program structure. While considering ways that the AdaPt constructs might be translated to Ada 83, it was observed that the partition construct could reasonably be modeled as an abstract data type. Although this gives a useful method of modeling partitions, it does not at all address the configuration aspects on the node construct.

Waldrop, Raymond S.↗

Strainrange partitioning behavior of the nickel-base superalloys, Rene 80 and IN-100

A study was made to assess the ability of the method of strainrange partitioning (SRP) to both correlate and predict high temperature, low cycle fatigue lives of nickel-base superalloys for gas turbine applications. Baseline data from strain-controlled, low cycle fatigue tests were expressed in terms of the PP, PC, CP, and CC partitioned inelastic strainrange versus life relationships for coated and uncoated Rene' 80 at 1000 C, Gatorized (creep-formed)IN 100 at 760 C, and cast IN 100 at 925 C. The SRP is shown to correlate the cyclic lives of the baseline tests to within factors of nearly two. The partitioned strainrange versus life relationships for uncoated Rene' 80 and cast IN 100 were also determined from the ductility normalized-strainrange partitioning equations. These were used to predict the cyclic lives of the baseline tests. Predicted and observed cyclic lives agreed to within factors of nearly three.

Halford, G. R.↗

A nested dissection approach to sparse matrix partitioning for parallel computations.

We consider how to distribute sparse matrices among processes to reduce communication costs in parallel sparse matrix computations, specifically, sparse matrix-vector multiplication. Our main contributions are: (i) an exact graph model for communication with general (two-dimensional) matrix distribution, and (ii) a recursive partitioning algorithm based on nested dissection (substructuring). We show that the communication volume is closely linked to vertex separators. We have implemented our algorithm using hypergraph partitioning software to enable a fair comparison with existing methods. We present numerical results for sparse matrices from several application areas, with up to 9 million nonzeros. The results show that our new approach is superior to traditional 1d partitioning and comparable to a current leading partitioning method, the finegrain hypergraph method, in terms of communication volume. Our nested dissection method has two advantages over the fine-grain method: it is faster to compute, and the resulting distribution requires fewer communication messages.

97 MATHEMATICS AND COMPUTING↗

A Novel Approach to Quantum Circuit Partitioning

Quantum synthesis presents an effective method of circuit optimization, but scales exponentially with the number of qubits in the circuit. This problem can be addressed by partitioning the circuit into blocks with a limited number of qubits. Existing partitioning algorithms make large trade-offs to achieve either high speed or quality. We propose a method of circuit partitioning which is competitive with existing algorithms for both metrics. The proposed method is compared with two existing methods across common circuit architectures, matching an exhaustive solution in performance and a fast solution on time.

Clark, Joseph↗

Root-cubing and general root-powering methods for finding the zeros of polynomials

Mathematical analysis technique generalizes a root squaring and root cubing method into a general root powering method. The introduction of partitioned polynomials into this general root powering method simplifies the coding of the polynomial transformations into input data suitable for processing by computer. The method includes analytic functions.

Bareiss, E. H.↗

Exploiting Geometric Partitioning in Task Mapping for Parallel Computes

We present a new method for mapping applications' MPI tasks to cores of a parallel computer such that applications' communication time is reduced. We address the case of sparse node allocation, where the nodes assigned to a job are not necessarily located in a contiguous block nor within close proximity to each other in the network, although our methods generalize to contiguous allocations as well. The goal is to assign tasks to cores so that interdependent tasks are performed by "nearby' cores, thus lowering the distance messages must travel, the amount of congestion in the network, and the overall cost of communication. Our new method applies a geometric partitioning algorithm to both the tasks and the processors, and assigns task parts to the corresponding processor parts. We also present a number of algorithmic optimizations that exploit specific features of the network or application. We show that, for the structured finite difference mini-application MiniGhost, our mapping methods reduced communication time up to 75% relative to MiniGhost's default mapping on 128K cores of a Cray XK7 with sparse allocation. For the atmospheric modeling code E3SM/HOMME, our methods reduced communication time up to 31% on 32K cores of an IBM BlueGene/Q with contiguous allocation.

97 MATHEMATICS AND COMPUTING↗

A comparative study of interface reconstruction methods for multi-material ALE simulations

In this paper we compare the performance of different methods for reconstructing interfaces in multi-material compressible flow simulations. The methods compared are a material-order-dependent Volume-of-Fluid (VOF) method, a material-order-independent VOF method based on power diagram partitioning of cells and the Moment-of-Fluid method (MOF). We demonstrate that the MOF method provides the most accurate tracking of interfaces, followed by the VOF method with the right material ordering. The material-order-independent VOF method performs somewhat worse than the above two while the solutions with VOF using the wrong material order are considerably worse.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Application of strainrange partitioning to the prediction of creep-fatigue lives of AISI types 304 and 316 stainless steel

As a demonstration of the predictive capabilities of the method of Strainrange Partitioning, published high-temperature, low cycle, creep-fatigue test results on AISI Types 304 and 316 stainless steel were analyzed and calculated, cyclic lives compared with observed lives. Predicted lives agreed with observed lives within factors of two for 76 percent, factors of three for 93 percent, and factors of four for 98 percent of the laboratory tests analyzed. Agreement between observed and predicted lives is judged satisfactory considering that the data are associated with a number of variables (two alloys, several heats and heat treatments, a range of temperatures, different testing techniques, etc.) that are not directly accounted for in the calculations.

Saltsman, J. F.↗

Application of Strainrange Partitioning to the prediction of creep-fatigue lives of AISI Types 304 and 316 stainless steel

As a demonstration of the predictive capabilities of the method of Strainrange Partitioning, published high-temperature, low cycle, creep-fatigue test results on AISI Types 304 and 316 stainless steel were analyzed and calculated cyclic lives compared with observed lives. Predicted lives agreed with observed lives within factors of two for 76 percent, factors of three for 93 percent, and factors of four for 98 percent of the laboratory tests analyzed. Agreement between observed and predicted lives is judged satisfactory considering that the data are associated with a number of variables (two alloys, several heats and heat treatments, a range of temperatures, different testing techniques, etc.) that are not directly accounted for in the calculations.

Saltsman, J. F.↗

Use of strainrange partitioning to predict high temperature low-cycle fatigue life

The fundamental concepts of the strainrange partitioning approach to high temperature, low low-cycle fatigue are reviewed. Procedures are presented by which the partitioned strainrange versus life relationships for any material can be generated. Laboratory tests are suggested for further verifying the ability of the method of strainrange partitioning to predict life.

Hirschberg, M. H.↗

Generalized seismic analysis

There is a constant need to be able to solve for enforced motion of structures. Spacecraft need to be qualified for acceleration inputs. Truck cargoes need to be safeguarded from road mishaps. Office buildings need to withstand earthquake shocks. Marine machinery needs to be able to withstand hull shocks. All of these kinds of enforced motions are being grouped together under the heading of seismic inputs. Attempts have been made to cope with this problem over the years and they usually have ended up with some limiting or compromise conditions. The crudest approach was to limit the problem to acceleration occurring only at a base of a structure, constrained to be rigid. The analyst would assign arbitrarily outsized masses to base points. He would then calculate the magnitude of force to apply to the base mass (or masses) in order to produce the specified acceleration. He would of necessity have to sacrifice the determination of stresses in the vicinity of the base, because of the artificial nature of the input forces. The author followed the lead of John M. Biggs by using relative coordinates for a rigid base in a 1975 paper, and again in a 1981 paper . This method of relative coordinates was extended and made operational as DMAP ALTER packets to rigid formats 9, 10, 11, and 12 under contract N60921-82-C-0128. This method was presented at the twelfth NASTRAN Colloquium. Another analyst in the field developed a method that computed the forces from enforced motion then applied them as a forcing to the remaining unknowns after the knowns were partitioned off. The method was translated into DMAP ALTER's but was never made operational. All of this activity jelled into the current effort. Much thought was invested in working out ways to unshakle the analysis of enforced motions from the limitations that persisted.

Butler, Thomas G.↗

Using Graph Partitioning for Scalable Distributed Quantum Molecular Dynamics

The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several advanced algorithms relying on evaluations of matrix polynomials have been published in the literature for such simulations. We aim to use a special type of graph partitioning to efficiently parallelize these computations. For this, we create a graph representing the zero–nonzero structure of a thresholded density matrix, and partition that graph into several components. Each separate submatrix (corresponding to each subgraph) is then substituted into the matrix polynomial, and the result for the full matrix polynomial is reassembled at the end from the individual polynomials. This paper starts by introducing a rigorous definition as well as a mathematical justification of this partitioning problem. We assess the performance of several methods to compute graph partitions with respect to both the quality of the partitioning and their runtime.

97 MATHEMATICS AND COMPUTING↗