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 397 records · Page 22

An analytically enriched finite element method for cohesive crack modeling.

Meaningful computational investigations of many solid mechanics problems require accurate characterization of material behavior through failure. A recent approach to fracture modeling has combined the partition of unity finite element method (PUFEM) with cohesive zone models. Extension of the PUFEM to address crack propagation is often referred to as the extended finite element method (XFEM). In the PUFEM, the displacement field is enriched to improve the local approximation. Most XFEM studies have used simplified enrichment functions (e.g., generalized Heaviside functions) to represent the strong discontinuity but have lacked an analytical basis to represent the displacement gradients in the vicinity of the cohesive crack. As such, the mesh had to be sufficiently fine for the FEM basis functions to capture these gradients.In this study enrichment functions based upon two analytical investigations of the cohesive crack problem are examined. These functions have the potential of representing displacement gradients in the vicinity of the cohesive crack with a relatively coarse mesh and allow the crack to incrementally advance across each element. Key aspects of the corresponding numerical formulation are summarized. Analysis results for simple model problems are presented to evaluate if quasi-static crack propagation can be accurately followed with the proposed formulation. A standard finite element solution with interface elements is used to provide the accurate reference solution, so the model problems are limited to a straight, mode I crack in plane stress. Except for the cohesive zone, the material model for the problems is homogenous, isotropic linear elasticity. The effects of mesh refinement, mesh orientation, and enrichment schemes that enrich a larger region around the cohesive crack are considered in the study. Propagation of the cohesive zone tip and crack tip, time variation of the cohesive zone length, and crack profiles are presented. The analysis results indicate that the enrichment functions based upon the asymptotic solutions can accurately track the cohesive crack propagation independent of mesh orientation. Example problems incorporating enrichment functions for mode II kinematics are also presented. The results yield acceptable crack paths compared with experimental studies. The applicability of the enrichment functions to problems with anisotropy, large strains, and inelasticity is the subject of ongoing studies. Preliminary results for a contrived orthotropic elastic material reflect a decrease in accuracy with increased orthotropy but do not preclude their application to this class of problems.

36 MATERIALS SCIENCE↗

Normal modes in thermal AdS via the Selberg zeta function

The heat kernel and quasinormal mode methods of computing 1-loop partition functions of spin s s fields on hyperbolic quotient spacetimes \mathbb{H}^{3}/\mathbb{Z} ℍ 3 / ℤ are related via the Selberg zeta function. We extend that analysis to thermal \text{AdS}_{2n+1} AdS 2 n + 1 backgrounds, with quotient structure \mathbb{H}^{2n+1}/\mathbb{Z} ℍ 2 n + 1 / ℤ . Specifically, we demonstrate the zeros of the Selberg function encode the normal mode frequencies of spin fields upon removal of non-square-integrable modes. With this information we construct the 1-loop partition functions for symmetric transverse traceless tensors in terms of the Selberg zeta function and find exact agreement with the heat kernel method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Identifying Differential Equations in Fourier Domain (FourierIdent)

We investigate identifying differential equations in the frequency domain. Fourier analysis is an important tool in theoretical analysis and numerical solvers of differential equations, yet there is limited work in exploring this connection in the identification of differential equations. This paper aims to identify the underlying differential equation in the frequency domain, from a given single realization of the differential equation perturbed by noise. Such setting imposes difficulties which are different from other identification methods where computation is carried out in the physical domain. We propose several ways to mitigate the challenges arising from noise in data and large differences in the magnitudes of frequency responses. The main takeaways are that identifying differential equations solely in the frequency domain is challenging, the method we propose is based on a form of domain partitions in the frequency domain, and this method shows benefits for complex data even with high level of noise. We introduce a Fourier feature denoising, and define the meaningful data region and the core regions of features to reduce the effect of noise in the frequency domain and to enhance the accuracy in coefficient identification. The proposed method is tested on various differential equations with linear, nonlinear, and high-order derivative feature terms, and shows advantages on complex data with many frequency modes, even under high level of noise.

97 MATHEMATICS AND COMPUTING↗

Contingency Analysis Based on Partitioned and Parallel Holomorphic Embedding

In the steady-state contingency analysis, the traditional Newton-Raphson method suffers from non-convergence issues when solving post-outage power flow problems, which hinders the integrity and accuracy of security assessment. In this paper, we propose a novel robust contingency analysis approach based on holomorphic embedding (HE). Here, the HE-based simulator provides theoretical convergence guarantee, which is desirable because it avoids the influence of numerical issues and provides a credible security assessment conclusion. In addition, based on the multi-area characteristics of real-world power systems, a partitioned HE (PHE) method is proposed with an interfacebased partitioning of HE formulation. The PHE method does not undermine the numerical robustness of HE and significantly reduces the computation burden in large-scale contingency analysis. The PHE method is further enhanced by parallel or distributed computation to become parallel PHE (P2HE). Tests on a 458-bus system, a synthetic 419-bus system and a large-scale 21447-bus system demonstrate the advantages of the proposed methods in robustness and efficiency.

42 ENGINEERING↗

Choosing the best partition of the output from a large-scale simulation

Data partitioning becomes necessary when a large-scale simulation produces more data than can be feasibly stored. The goal is to partition the data, typically so that every element belongs to one and only one partition, and store summary information about the partition, either a representative value plus an estimate of the error or a distribution. Once the partitions are determined and the summary information stored, the raw data is discarded. This process can be performed in-situ; meaning while the simulation is running. When creating the partitions there are many decisions that researchers must make. For instance, how to determine once an adequate number of partitions have been created, how are the partitions created with respect to dividing the data, or how many variables should be considered simultaneously. In addition, decisions must be made for how to summarize the information within each partition. Because of the combinatorial number of possible ways to partition and summarize the data, a method of comparing the different possibilities will help guide researchers into choosing a good partitioning and summarization scheme for their application.

97 MATHEMATICS AND COMPUTING↗

Three Dimensional Sector Design with Optimal Number of Sectors

The concept of dynamic sector design suggests a strategic approach to ease air traffic congestion, which is predicted to become a serious problem in the national airspace system by 2025. Considerable research has been conducted to address the sectorization problem. In previous work, an approach that combines the Voronoi diagrams, Genetic Algorithms (GA), and the iterative deepening algorithm was proposed. However, as originally formulated, the number of sectors used was predefined and only two-dimensional partitions were allowed, which constrained the method's ability to achieve good designs. The current work extends the earlier Voronoi-based method by treating the number of sectors as an additional decision variable, allowing 3D partitions, and developing more comprehensive costs.

Xue, Min↗

Semi-implicit time integration of atmospheric flows with characteristic-based flux partitioning

Here, this paper presents a characteristic-based flux partitioning for the semi-implicit time integration of atmospheric flows. Nonhydrostatic models require the solution of the compressible Euler equations. The acoustic time scale is significantly faster than the advective scale, yet it is typically not relevant to atmospheric and weather phenomena. The acoustic and advective components of the hyperbolic flux are separated in the characteristic space. High-order, conservative additive Runge-Kutta methods are applied to the partitioned equations so that the acoustic component is integrated in time implicitly with an unconditionally stable method, while the advective component is integrated explicitly. The time step of the overall algorithm is thus determined by the advective scale. Benchmark flow problems are used to demonstrate the accuracy, stability, and convergence of the proposed algorithm. The computational cost of the partitioned semi-implicit approach is compared with that of explicit time integration.

54 ENVIRONMENTAL SCIENCES↗

A Tale of Two Trimers from Two Different Worlds: A COF-Inspired Synthetic Strategy for Pore-Space Partitioning of MOFs

The introduction of a symmetry- and size-matching pore-partitioning agent in the form of either a molecular ligand, such as 2,4,6-tri(4-pyridinyl)-1,3,5-triazine ( tpt ), or a metal-complex cluster, into the hexagonal channels of MIL-88/MOF-235-type (the acs net) to create pacs -type (partitioned acs ) crystalline porous materials is an effective strategy to develop high-performance gas adsorbents. We have developed here an integrated COF–MOF coassembly strategy as a new method for pore-space partitioning through the coassembly of [(M 3 (OH) 1- x (O) x (COO) 6 ] MOF-type and [B 3 O 3 (py) 3 ] COF-type trimers. With this strategy, the coordination-driven assembly of the acs framework occurred concurrently and synergistically with the COF-1-type condensation of pyridine-4-boronic acid into a C 3 -symmetric trimeric boroxine molecule. Furthermore, the resulting boroxine-based pacs materials exhibited dramatically enhanced gas-sorption properties as compared to nonpartitioned acs -type materials and are among the most efficient NH 3 -sorption materials

36 MATERIALS SCIENCE↗

A method for volumetric imaging in radiotherapy using single x-ray projection

Purpose: It is an intriguing problem to generate an instantaneous volumetric image based on the corresponding x-ray projection. The purpose of this study is to develop a new method to achieve this goal via a sparse learning approach. Methods: To extract motion information hidden in projection images, the authors partitioned a projection image into small rectangular patches. The authors utilized a sparse learning method to automatically select patches that have a high correlation with principal component analysis (PCA) coefficients of a lung motion model. A model that maps the patch intensity to the PCA coefficients was built along with the patch selection process. Based on this model, a measured projection can be used to predict the PCA coefficients, which are then further used to generate a motion vector field and hence a volumetric image. The authors have also proposed an intensity baseline correction method based on the partitioned projection, in which the first and the second moments of pixel intensities at a patch in a simulated projection image are matched with those in a measured one via a linear transformation. The proposed method has been validated in both simulated data and real phantom data. Results: The algorithm is able to identify patches that contain relevant motion information such as the diaphragm region. It is found that an intensity baseline correction step is important to remove the systematic error in the motion prediction. For the simulation case, the sparse learning model reduced the prediction error for the first PCA coefficient to 5%, compared to the 10% error when sparse learning was not used, and the 95th percentile error for the predicted motion vector was reduced from 2.40 to 0.92 mm. In the phantom case with a regular tumor motion, the predicted tumor trajectory was successfully reconstructed with a 0.82 mm error for tumor center localization compared to a 1.66 mm error without using the sparse learning method. When the tumor motion was driven by a real patient breathing signal with irregular periods and amplitudes, the average tumor center error was 0.6 mm. The algorithm robustness with respect to sparsity level, patch size, and presence or absence of diaphragm, as well as computation time, has also been studied. Conclusions: The authors have developed a new method that automatically identifies motion information from an x-ray projection, based on which a volumetric image is generated.

60 APPLIED LIFE SCIENCES↗

Design of multisample, multistep phase partitioning apparatus for use on Space Shuttle Spacelab, and Spacelab missions

Traditional separation techniques are inadequate for many new bioprocessing challenges. Innovative separation methods such as aqueous two phase partitioning are needed to perpetuate bioprocess commercialization. Aqueous two phase polymer partitioning systems provide a process for separating biological materials when combined with microgravity. An innovative space qualified apparatus developed for carrying out separations by partitioning in immiscible polymer systems under mirogravity conditions is described. The apparatus offers an innovative approach to low gravity bioseparations in general and phase partitioning in particular. These capabilities support NASA's interest in serving the biotechnology research community and providing quantitative data in the gravity dependent components of separation processes.

Deuser, Mark S.↗

Mesoscopic-microscopic spatial stochastic simulation with automatic system partitioning

The reaction-diffusion master equation (RDME) is a model that allows for efficient on-lattice simulation of spatially resolved stochastic chemical kinetics. Compared to off-lattice hard-sphere simulations with Brownian dynamics or Green’s function reaction dynamics, the RDME can be orders of magnitude faster if the lattice spacing can be chosen coarse enough. However, strongly diffusion-controlled reactions mandate a very fine mesh resolution for acceptable accuracy. It is common that reactions in the same model differ in their degree of diffusion control and therefore require different degrees of mesh resolution. This renders mesoscopic simulation inefficient for systems with multiscale properties. Mesoscopic-microscopic hybrid methods address this problem by resolving the most challenging reactions with a microscale, off-lattice simulation. However, all methods to date require manual partitioning of a system, effectively limiting their usefulness as “black-box” simulation codes. In this paper, we propose a hybrid simulation algorithm with automatic system partitioning based on indirect a priori error estimates. We demonstrate the accuracy and efficiency of the method on models of diffusion-controlled networks in 3D.

97 MATHEMATICS AND COMPUTING↗

Three Dimensional Sector Design with Optimal Number of Sectors

In the national airspace system, sectors get overloaded due to high traffic demand and inefficient airspace designs. Overloads can be eliminated in some cases by redesigning sector boundaries. This paper extends the Voronoi-based sector design method by automatically selecting the number of sectors, allowing three-dimensional partitions, and enforcing traffic pattern conformance. The method was used to design sectors at Fort-Worth and Indianapolis centers for current traffic scenarios. Results show that new designs can eliminate overloaded sectors, although not in all cases, reduce the number of necessary sectors, and conform to major traffic patterns. Overall, the new methodology produces enhanced and efficient sector designs.

Xue, Min↗

General field evaluation in high-order meshes on GPUs

Robust and scalable function evaluation at any arbitrary point in the finite/spectral element mesh is required for querying the partial differential equation solution at points of interest, comparison of solution between different meshes, and Lagrangian particle tracking. This is a challenging problem, particularly for high-order unstructured meshes partitioned in parallel with MPI, as it requires identifying the element that overlaps a given point and computing the corresponding reference space coordinates. Here, we present a robust and efficient technique for general field evaluation in large-scale high-order meshes with quadrilaterals and hexahedra. In the proposed method, a combination of globally partitioned and processor-local maps are used to first determine a list of candidate MPI ranks, and then locally candidate elements that could contain a given point. Next, element-wise bounding boxes further reduce the list of candidate elements. Finally, Newton’s method with trust region is used to determine the overlapping element and corresponding reference space coordinates. Since GPU-based architectures have become popular for accelerating computational analyses using meshes with tensor-product elements, specialized kernels have been developed to utilize the proposed methodology on GPUs. The method is also extended to enable general field evaluation on surface meshes. The paper concludes by demonstrating the use of the proposed method in various applications ranging from mesh-to-mesh transfer during r-adaptivity to Lagrangian particle tracking.

97 MATHEMATICS AND COMPUTING↗

Computing black hole partition functions from quasinormal modes

We propose a method of computing one-loop determinants in black hole space-times (with emphasis on asymptotically anti-de Sitter black holes) that may be used for numerics when completely-analytic results are unattainable. The method utilizes the expression for one-loop determinants in terms of quasinormal frequencies determined by Denef, Hartnoll and Sachdev in [1]. A numerical evaluation must face the fact that the sum over the quasinormal modes, indexed by momentum and overtone numbers, is divergent. A necessary ingredient is then a regularization scheme to handle the divergent contributions of individual fixed-momentum sectors to the partition function. To this end, we formulate an effective two-dimensional problem in which a natural refinement of standard heat kernel techniques can be used to account for contributions to the partition function at fixed momentum. We test our method in a concrete case by reproducing the scalar one-loop determinant in the BTZ black hole background. Furthermore, we then discuss the application of such techniques to more complicated spacetimes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A multiscale restriction-smoothed basis method for high contrast porous media represented on unstructured grids

A wide variety of multiscale methods have been proposed in the literature to reduce runtime and provide better scaling for the solution of Poisson-type equations modeling flow in porous media. We present a new multiscale restricted-smoothed basis (MsRSB) method that is designed to be applicable to both rectilinear grids and unstructured grids. Like many other multiscale methods, MsRSB relies on a coarse partition of the underlying fine grid and a set of local prolongation operators (multiscale basis functions) that map unknowns associated with the fine grid cells to unknowns associated with blocks in the coarse partition. These mappings are constructed by restricted smoothing: Starting from a constant, a localized iterative scheme is applied directly to the fine-scale discretization to compute prolongation operators that are consistent with the local properties of the differential operators. The resulting method has three main advantages: First of all, both the coarse and the fine grid can have general polyhedral geometry and unstructured topology. This means that partitions and good prolongation operators can easily be constructed for complex models involving high media contrasts and unstructured cell connections introduced by faults, pinch-outs, erosion, local grid refinement, etc. In particular, the coarse partition can be adapted to geological or flow-field properties represented on cells or faces to improve accuracy. Secondly, the method is accurate and robust when compared to existing multiscale methods and does not need expensive recomputation of local basis functions to account for transient behavior: Dynamic mobility changes are incorporated by continuing to iterate a few extra steps on existing basis functions. This way, the cost of updating the prolongation operators becomes proportional to the amount of change in fluid mobility and one reduces the need for expensive, tolerance-based updates. Finally, since the MsRSB method is formulated on top of a cell-centered, conservative, finite-volume method, it is applicable to any flow model in which one can isolate a pressure equation. Herein, we only discuss single and two-phase incompressible models. Compressible flow, e.g., as modeled by the black-oil equations, is discussed in a separate paper.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Partition Density Functionals: Theory and Applications. Final Technical Report

Partition Density Functional Theory is a method to calculate the energy and density of a molecule via self-consistent calculations on isolated fragments. At the start of this project, Partition Density Functional Theory (PDFT) had only been applied to one-dimensional model systems of non-interacting electrons. Its most appealing feature (the reason why PDFT was born in the first place) was that it allowed one to construct an internally-consistent Density Functional Theory (DFT) valid for non-integer electron numbers to be used in the context of Chemical Reactivity Theory. Many formal properties of the quantities entering the theory, such as partition potentials, were unknown when the project started. The connections with other fragment-based electronic structure methods, and especially with embedding theories, were unclear, and the potential of PDFT for fixing problems of approximate exchange-correlation functionals was unanticipated. Supported by grant DE-SC0005031, we made progress in developing, understanding, implementing, and applying PDFT. We discovered its potential for applications in situations where approximate DFT fails, such as when stretching bonds or when calculating the energy of weakly-interacting systems, both cases of importance for energy research applications. We extended PDFT in several directions (spin-densities, current densities, external electric and magnetic fields), and carried out many calculations on diatomic molecules and small clusters to test ideas for approximate non-additive functionals. As a result, we were able to propose physically-motivated fragment-density approximations for both covalent and weak bonds. Because many applications will increasingly benefit from efficient and accurate electronic-structure calculations via density-embedding techniques, the research results enabled by this grant should prove useful for addressing complex problems in a wide variety of fields, from chemistry to molecular biology and materials engineering.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Multicanonical sampling of the space of states of ℋ(2, n)-vector models

Problems of temperature behavior of specific heat are solved by the entropy simulation method for Ising models on a simple square lattice and a square spin ice (SSI) lattice with nearest neighbor interaction, models of hexagonal lattices with short-range (SR) dipole interaction, as well as with long-range (LR) dipole interaction and free boundary conditions, and models of spin quasilattices with finite interaction radius. It is established that systems of a finite number of Ising spins with LR dipole interaction can have unusual thermodynamic properties characterized by several specific-heat peaks in the absence of an external magnetic field. For a parallel multicanonical sampling method, optimal schemes are found empirically for partitioning the space of states into energy bands for Ising and SSI models, methods of concatenation and renormalization of histograms are discussed, and a flatness criterion of histograms is proposed. It is established that there is no phase transition in a model with nearest neighbor interaction on a hexagonal lattice, while the temperature behavior of specific heat exhibits singularity in the same model, in case of LR interaction. A spin quasilattice is found that exhibits a nonzero value of residual entropy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spectral partitioning with blends of eigenvectors

We report many common methods for data analysis rely on linear algebra. We provide new results connecting data analysis error to numerical accuracy in the context of spectral graph partitioning. We provide pointwise convergence guarantees so that spectral blends (linear combinations of eigenvectors) can be employed to solve data analysis problems with confidence in their accuracy. We apply this theory to an accessible model problem, the ring of cliques, by deriving the relevant eigenpairs and finding necessary and sufficient solver tolerances. Analysis of the ring of cliques provides an upper bound on eigensolver tolerances for graph partitioning problems. These results bridge the gap between linear algebra based data analysis methods and the convergence theory of iterative approximation methods. These results explain how the combinatorial structure of a problem can be recovered much faster than numerically accurate solutions to the associated linear algebra problem.

97 MATHEMATICS AND COMPUTING↗