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 253 records · Page 14

Method for programming a flash memory

A method of programming a flash memory is described. The method includes partitioning a flash memory into a first group having a first level of write-protection, a second group having a second level of write-protection, and a third group having a third level of write-protection. The write-protection of the second and third groups is disabled using an installation adapter. The third group is programmed using a Software Installation Device.

97 MATHEMATICS AND COMPUTING↗

Parallel performance optimizations on unstructured mesh-based simulations

This paper addresses two key parallelization challenges the unstructured mesh-based ocean modeling code, MPAS-Ocean, which uses a mesh based on Voronoi tessellations: (1) load imbalance across processes, and (2) unstructured data access patterns, that inhibit intra- and inter-node performance. Our work analyzes the load imbalance due to naive partitioning of the mesh, and develops methods to generate mesh partitioning with better load balance and reduced communication. Furthermore, we present methods that minimize both inter- and intranode data movement and maximize data reuse. Our techniques include predictive ordering of data elements for higher cache efficiency, as well as communication reduction approaches. We present detailed performance data when running on thousands of cores using the Cray XC30 supercomputer and show that our optimization strategies can exceed the original performance by over 2×. Additionally, many of these solutions can be broadly applied to a wide variety of unstructured grid-based computations.

97 MATHEMATICS AND COMPUTING↗

Computing partition functions in the one-clean-qubit model

We present a method to approximate partition functions of quantum systems using mixed-state quantum computation. For positive-semidefinite Hamiltonians, our method has an expected running-time that is almost linear in [M/( ε rel Z )] 2 , where M is the dimension of the quantum system, Z is the partition function, and ε rel is the relative precision. It is based on approximations of the exponential operator as linear combinations of certain operators related to block-encoding of Hamiltonians or Hamiltonian evolutions. The trace of each operator is estimated using a standard algorithm in the one-clean-qubit model. For large values of Z , our method may run faster than exact classical methods, whose complexities are polynomial in M . We also prove that a version of the partition function estimation problem within additive error is complete for the so-called DQC1 complexity class, suggesting that our method provides a superpolynomial speedup for certain parameter values. Overall, to attain a desired relative precision, we develop a classical procedure based on a sequence of approximations within predetermined additive errors that may be of independent interest.

97 MATHEMATICS AND COMPUTING↗

Partition-of-unity finite-element method for large scale quantum molecular dynamics on massively parallel computational platforms

Over the course of the past two decades, quantum mechanical calculations have emerged as a key component of modern materials research. However, the solution of the required quantum mechanical equations is a formidable task and this has severely limited the range of materials systems which can be investigated by such accurate, quantum mechanical means. The current state of the art for large-scale quantum simulations is the planewave (PW) method, as implemented in now ubiquitous VASP, ABINIT, and QBox codes, among many others. However, since the PW method uses a global Fourier basis, with strictly uniform resolution at all points in space, and in which every basis function overlaps every other at every point, it suffers from substantial inefficiencies in calculations involving atoms with localized states, such as first-row and transition-metal atoms, and requires substantial nonlocal communications in parallel implementations, placing critical limits on scalability. In recent years, real-space methods such as finite-differences (FD) and finite-elements (FE) have been developed to address these deficiencies by reformulating the required quantum mechanical equations in a strictly local representation. However, while addressing both resolution and parallel-communications problems, such local real-space approaches have been plagued by one key disadvantage relative to planewaves: excessive degrees of freedom (grid points, basis functions) needed to achieve the required accuracies. And so, despite critical limitations, the PW method remains the standard today. In this work, we show for the first time that this key remaining disadvantage of real-space methods can in fact be overcome: by building known atomic physics into the solution process using modern partition-of-unity (PU) techniques in finite element analysis. Indeed, our results show order-of-magnitude reductions in basis size relative to state-of-the-art planewave based methods. The method developed here is completely general, applicable to any crystal symmetry and to both metals and insulators alike. We have developed and implemented a full self-consistent Kohn-Sham method, including both total energies and forces for molecular dynamics, and developed a full MPI parallel implementation for large-scale calculations. We have applied the method to the gamut of physical systems, from simple insulating systems with light atoms to complex d- and f-electron systems, requiring large numbers of atomic-orbital enrichments. In every case, the new PU FE method attained the required accuracies with substantially fewer degrees of freedom, typically by an order of magnitude or more, than the current state-of-the-art PW method. Finally, our initial MPI implementation has shown excellent parallel scaling of the most time-critical parts of the code up to 1728 processors, with clear indications of what will be required to achieve comparable scaling for the rest. Having shown that the key remaining disadvantage of real-space methods can in fact be overcome, the work has attracted significant attention: with sixteen invited talks, both domestic and international, so far; two papers published and another in preparation; and three new university and/or national laboratory collaborations, securing external funding to pursue a number of related research directions. Having demonstrated the proof of principle, work now centers on the necessary extensions and optimizations required to bring the prototype method and code delivered here to production applications.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A simplified approach to calculate atomic partition functions in plasmas

A simplified method to calculate the electronic partition functions and the corresponding thermodynamic properties of atomic species is presented and applied to C(I) up to C(VI) ions. The method consists in reducing the complex structure of an atom to three lumped levels. The ground level of the lumped model describes the ground term of the real atom, while the second lumped level represents the low lying states and the last one groups all the other atomic levels. It is also shown that for the purpose of thermodynamic function calculation, the energy and the statistical weight of the upper lumped level, describing high-lying excited atomic states, can be satisfactorily approximated by an analytic hydrogenlike formula. The results of the simplified method are in good agreement with those obtained by direct summation over a complete set (i.e., including all possible terms and configurations below a given cutoff energy) of atomic energy levels. The method can be generalized to include more lumped levels in order to improve the accuracy.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Replica symmetry breaking for the integrable two-site Sachdev–Ye–Kitaev model

We analyze a two-body non-Hermitian two-site Sachdev–Ye–Kitaev (SYK) model with the couplings of one site complex conjugated to the other site. This model, with no explicit coupling between the sites, shows an infinite number of second-order phase transitions, which is a consequence of the factorization of the partition function into a product over Matsubara frequencies. We calculate the quenched free energy in two different ways: first in terms of the single-particle energies and second by solving the Schwinger–Dyson equations of the two-site model. The first calculation can be done entirely in terms of a one-site model. The conjugate replica enters due to non-analyticities when Matsubara frequencies enter the spectral support of the coupling matrix. The second calculation is based on the replica trick of the two-site partition function. Both methods give the same result. The free-fermion partition function can also be rephrased as a matrix model for the coupling matrix. Up to minor details, this model is the random matrix model that describes the chiral phase transition of QCD, and the order parameter of the two-body model corresponds to the chiral condensate of QCD. Comparing to the corresponding four-body model, we are able to determine which features of the free energy are due to the chaotic nature of the four-body model. The high-temperature phase of both models is entropy dominated, and in both cases, the free energy is determined by the spectral density. The chaotic four-body SYK model has a low-temperature phase whose free energy is almost temperature-independent, signaling an effective gap of the theory even though the actual spectrum does not exhibit a gap. On the other hand, the low-temperature free energy of the two-body SYK model is not flat; in fact, it oscillates to arbitrarily low temperature. This indicates a less desirable feature that the entropy of the two-body model is not always positive in the low-temperature phase, which most likely is a consequence of the non-hermiticity.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Partition functions with spin in AdS2 via quasinormal mode methods

We extend the results of [1], computing one loop partition functions for massive fields with spin half in AdS 2 using the quasinormal mode method proposed by Denef, Hartnoll, and Sachdev [2]. We find the finite representations of SO(2,1) for spin zero and spin half, consisting of a highest weight state |hi and descendants with non-unitary values of h. These finite representations capture the poles and zeroes of the one loop determinants. Together with the asymptotic behavior of the partition functions (which can be easily computed using a large mass heat kernel expansion), these are sufficient to determine the full answer for the one loop determinants. We also discuss extensions to higher dimensional AdS 2n and higher spins.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Modeling curved interfaces without element‐partitioning in the extended finite element method

Summary In this paper, we model holes and material interfaces (weak discontinuities) in two‐dimensional linear elastic continua using the extended finite element method on higher‐order (spectral) finite element meshes. Arbitrary parametric curves such as rational Bézier curves and cubic Hermite curves are adopted in conjunction with the level set method to represent curved interfaces. Efficient computation of weak form integrals with polynomial integrands is realized via the homogeneous numerical integration scheme—a method that uses Euler's homogeneous function theorem and Stokes' theorem to reduce integration to the boundary of the domain. Numerical integration on cut elements requires the evaluation of a one‐dimensional integral over a parametric curve, and hence, the need to partition curved elements is eliminated. To improve stiffness matrix conditioning, ghost penalty stabilization and the Jacobi preconditioner are used. For material interface problems, we develop an enrichment function that captures weak discontinuities on spectral meshes. Taken together, we show through numerical experiments that these advances deliver optimal algebraic rates of convergence with h ‐refinement ( p =1,2,…,5) and exponential rates of convergence with p ‐refinement ( p =1,2,…,7) for elastostatic problems with holes and material inclusions on Cartesian p th‐order spectral finite element meshes.

Chin, Eric B.↗

[Determination of six main components in compound theophylline tablet by convolution curve method after prior separation by column partition chromatography]

On a partition chromatographic column in which the support is Kieselguhr and the stationary phase is sulfuric acid solution (2 mol/L), three components of compound theophylline tablet were simultaneously eluted by chloroform and three other components were simultaneously eluted by ammonia-saturated chloroform. The two mixtures were determined by computer-aided convolution curve method separately. The corresponding average recovery and relative standard deviation of the six components were as follows: 101.6, 1.46% for caffeine; 99.7, 0.10% for phenacetin; 100.9, 1.31% for phenobarbitone; 100.2, 0.81% for theophylline; 99.9, 0.81% for theobromine and 100.8, 0.48% for aminopyrine.

NASA Program Flight↗

Performance and Reliability of Bonded Interfaces for High-temperature Packaging: Annual Progress Report

As maximum device temperatures approach 200 °Celsius, continuous operation, sintered silver materials promise to maintain bonds at these high temperatures without excessive degradation rates. A detailed characterization of the thermal performance and reliability of sintered silver materials and processes has been initiated for the next year. Future steps in crack modeling include efforts to simulate crack propagation directly using the extended finite element method (X-FEM), a numerical technique that uses the partition of unity method for modeling discontinuities such as cracks in a system.

30 DIRECT ENERGY CONVERSION↗

High-order partitioned spectral deferred correction solvers for multiphysics problems

We present an arbitrarily high-order, conditionally stable, partitioned spectral deferred correction (SDC) method for solving multiphysics problems using a sequence of pre-existing single-physics solvers. This method extends the work in [1], [2], which used implicit-explicit Runge-Kutta methods (IMEX) to build high-order, partitioned multiphysics solvers. We consider a generic multiphysics problem modeled as a system of coupled ordinary differential equations (ODEs), coupled through coupling terms that can depend on the state of each subsystem; therefore the method applies to both a semi-discretized system of partial differential equations (PDEs) or problems naturally modeled as coupled systems of ODEs. The sufficient conditions to build arbitrarily high-order partitioned SDC schemes are derived. Based on these conditions, various of partitioned SDC schemes are designed. The stability of the first-order partitioned SDC scheme is analyzed in detail on a coupled, linear model problem. We show that the scheme is conditionally stable, and under conditions on the coupling strength, the scheme can be unconditionally stable. We demonstrate the performance of the proposed partitioned solvers on several classes of multiphysics problems with moderate coupling strength. They include a stiff linear system of ODEs, advection-diffusion-reaction systems, and fluid-structure interaction problems with both incompressible and compressible flows, where we verify the design order of the SDC schemes and study various stability properties. We also directly compare the accuracy, stability, and cost of the proposed partitioned SDC solver with the partitioned IMEX method in [1], [2] on this suite of test problems. The results suggest that the high-order partitioned SDC solvers are more robust than the partitioned IMEX solvers for the numerical examples considered in this work, while the IMEX methods require fewer implicit solves.

97 MATHEMATICS AND COMPUTING↗

Programmable partitioning for high-performance coherence domains in a multiprocessor system

A multiprocessor computing system and a method of logically partitioning a multiprocessor computing system are disclosed. The multiprocessor computing system comprises a multitude of processing units, and a multitude of snoop units. Each of the processing units includes a local cache, and the snoop units are provided for supporting cache coherency in the multiprocessor system. Each of the snoop units is connected to a respective one of the processing units and to all of the other snoop units. The multiprocessor computing system further includes a partitioning system for using the snoop units to partition the multitude of processing units into a plurality of independent, memory-consistent, adjustable-size processing groups. Preferably, when the processor units are partitioned into these processing groups, the partitioning system also configures the snoop units to maintain cache coherency within each of said groups.

97 MATHEMATICS AND COMPUTING↗

SU-D-207B-05: Robust Intra-Tumor Partitioning to Identify High-Risk Subregions for Prognosis in Lung Cancer

Purpose: To develop an intra-tumor partitioning framework for identifying high-risk subregions from 18F-fluorodeoxyglucose positron emission tomography (FDG-PET) and CT imaging, and to test whether tumor burden associated with the high-risk subregions is prognostic of outcomes in lung cancer. Methods: In this institutional review board-approved retrospective study, we analyzed the pre-treatment FDG-PET and CT scans of 44 lung cancer patients treated with radiotherapy. A novel, intra-tumor partitioning method was developed based on a two-stage clustering process: first at patient-level, each tumor was over-segmented into many superpixels by k-means clustering of integrated PET and CT images; next, tumor subregions were identified by merging previously defined superpixels via population-level hierarchical clustering. The volume associated with each of the subregions was evaluated using Kaplan-Meier analysis regarding its prognostic capability in predicting overall survival (OS) and out-of-field progression (OFP). Results: Three spatially distinct subregions were identified within each tumor, which were highly robust to uncertainty in PET/CT co-registration. Among these, the volume of the most metabolically active and metabolically heterogeneous solid component of the tumor was predictive of OS and OFP on the entire cohort, with a concordance index or CI = 0.66–0.67. When restricting the analysis to patients with stage III disease (n = 32), the same subregion achieved an even higher CI = 0.75 (HR = 3.93, logrank p = 0.002) for predicting OS, and a CI = 0.76 (HR = 4.84, logrank p = 0.002) for predicting OFP. In comparison, conventional imaging markers including tumor volume, SUVmax and MTV50 were not predictive of OS or OFP, with CI mostly below 0.60 (p < 0.001). Conclusion: We propose a robust intra-tumor partitioning method to identify clinically relevant, high-risk subregions in lung cancer. We envision that this approach will be applicable to identifying useful imaging biomarkers in many cancer types.

60 APPLIED LIFE SCIENCES↗

Robust Intratumor Partitioning to Identify High-Risk Subregions in Lung Cancer: A Pilot Study

Purpose: To develop an intratumor partitioning framework for identifying high-risk subregions from {sup 18}F-fluorodeoxyglucose positron emission tomography (FDG-PET) and computed tomography (CT) imaging and to test whether tumor burden associated with the high-risk subregions is prognostic of outcomes in lung cancer. Methods and Materials: In this institutional review board–approved retrospective study, we analyzed the pretreatment FDG-PET and CT scans of 44 lung cancer patients treated with radiation therapy. A novel, intratumor partitioning method was developed, based on a 2-stage clustering process: first at the patient level, each tumor was over-segmented into many superpixels by k-means clustering of integrated PET and CT images; next, tumor subregions were identified by merging previously defined superpixels via population-level hierarchical clustering. The volume associated with each of the subregions was evaluated using Kaplan-Meier analysis regarding its prognostic capability in predicting overall survival (OS) and out-of-field progression (OFP). Results: Three spatially distinct subregions were identified within each tumor that were highly robust to uncertainty in PET/CT co-registration. Among these, the volume of the most metabolically active and metabolically heterogeneous solid component of the tumor was predictive of OS and OFP on the entire cohort, with a concordance index or CI of 0.66-0.67. When restricting the analysis to patients with stage III disease (n=32), the same subregion achieved an even higher CI of 0.75 (hazard ratio 3.93, log-rank P=.002) for predicting OS, and a CI of 0.76 (hazard ratio 4.84, log-rank P=.002) for predicting OFP. In comparison, conventional imaging markers, including tumor volume, maximum standardized uptake value, and metabolic tumor volume using threshold of 50% standardized uptake value maximum, were not predictive of OS or OFP, with CI mostly below 0.60 (log-rank P>.05). Conclusion: We propose a robust intratumor partitioning method to identify clinically relevant, high-risk subregions in lung cancer. We envision that this approach will be applicable to identifying useful imaging biomarkers in many cancer types.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A Novel Coarsening Method for Scalable and Efficient Mesh Generation

In this paper, we propose a novel mesh coarsening method called brick coarsening method. The proposed method can be used in conjunction with any graph partitioners and scales to very large meshes. This method reduces problem space by decomposing the original mesh into fixed-size blocks of nodes called bricks, layered in a similar way to conventional brick laying, and then assigning each node of the original mesh to appropriate brick. Our experiments indicate that the proposed method scales to very large meshes while allowing simple RCB partitioner to produce higher-quality partitions with significantly less edge cuts. Our results further indicate that the proposed brick-coarsening method allows more complicated partitioners like PT-Scotch to scale to very large problem size while still maintaining good partitioning performance with relatively good edge-cut metric. Graph partitioning is an important problem that has many scientific and engineering applications in such areas as VLSI design, scientific computing, and resource management. Given a graph G = (V,E), where V is the set of vertices and E is the set of edges, (k-way) graph partitioning problem is to partition the vertices of the graph (V) into k disjoint groups such that each group contains roughly equal number of vertices and the number of edges connecting vertices in different groups is minimized. Graph partitioning plays a key role in large scientific computing, especially in mesh-based computations, as it is used as a tool to minimize the volume of communication and to ensure well-balanced load across computing nodes. The impact of graph partitioning on the reduction of communication can be easily seen, for example, in different iterative methods to solve a sparse system of linear equation. Here, a graph partitioning technique is applied to the matrix, which is basically a graph in which each edge is a non-zero entry in the matrix, to allocate groups of vertices to processors in such a way that many of matrix-vector multiplication can be performed locally on each processor and hence to minimize communication. Furthermore, a good graph partitioning scheme ensures the equal amount of computation performed on each processor. Graph partitioning is a well known NP-complete problem, and thus the most commonly used graph partitioning algorithms employ some forms of heuristics. These algorithms vary in terms of their complexity, partition generation time, and the quality of partitions, and they tend to trade off these factors. A significant challenge we are currently facing at the Lawrence Livermore National Laboratory is how to partition very large meshes on massive-size distributed memory machines like IBM BlueGene/P, where scalability becomes a big issue. For example, we have found that the ParMetis, a very popular graph partitioning tool, can only scale to 16K processors. An ideal graph partitioning method on such an environment should be fast and scale to very large meshes, while producing high quality partitions. This is an extremely challenging task, as to scale to that level, the partitioning algorithm should be simple and be able to produce partitions that minimize inter-processor communications and balance the load imposed on the processors. Our goals in this work are two-fold: (1) To develop a new scalable graph partitioning method with good load balancing and communication reduction capability. (2) To study the performance of the proposed partitioning method on very large parallel machines using actual data sets and compare the performance to that of existing methods. The proposed method achieves the desired scalability by reducing the mesh size. For this, it coarsens an input mesh into a smaller size mesh by coalescing the vertices and edges of the original mesh into a set of mega-vertices and mega-edges. A new coarsening method called brick algorithm is developed in this research. In the brick algorithm, the zones in a given mesh are first grouped into fixed size blocks called bricks. These brick are then laid in a way similar to conventional brick laying technique, which reduces the number of neighboring blocks each block needs to communicate. Contributions of this research are as follows: (1) We have developed a novel method that scales to a really large problem size while producing high quality mesh partitions; (2) We measured the performance and scalability of the proposed method on a machine of massive size using a set of actual large complex data sets, where we have scaled to a mesh with 110 million zones using our method. To the best of our knowledge, this is the largest complex mesh that a partitioning method is successfully applied to; and (3) We have shown that proposed method can reduce the number of edge cuts by as much as 65%.

97 MATHEMATICS AND COMPUTING↗

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. 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. The life predictability of the method was 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 was 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.↗

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↗