Search NASA⌕ Search

SEARCH · Search NASA

Results for “Unstructured”

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 1,513 records · Page 84

Impacts of Sea‐Level Rise on Hypoxia and Phytoplankton Production in Chesapeake Bay: Model Prediction and Assessment

In this study, the influence of sea-level rise (SLR) on seasonal hypoxia and phytoplankton production in Chesapeake Bay is investigated using a 3D unstructured grid model. Three SLR scenarios (0.17, 0.5, and 1.0 m) were conducted from 1991 to 1995. Results show that the summer hypoxic volume (HV) increases about 2%, 8%, and 16%, respectively, for these three scenarios, compared with Base Scenario. The contributions of physical and biological processes on the increase in the HV were analyzed. With the projected SLR, enhanced gravitational circulation transports more oxygen-rich water in the bottom layer from the mouth. However, the pycnocline moves upwards along with increasing water depth, which largely prolongs the time for dissolved oxygen (DO) to be transported to the bottom. The altered physical processes contribute greatly to a larger HV bay-wide. Besides, SLR increases the whole Bay phytoplankton production, with a larger increase in shallow areas (e.g., 53% in areas with depth <1 m under SLR of 0.5 m). Enhanced light availability is suggested to be the major driver of blooming phytoplankton under SLR in shallow areas. While increased DO production over the euphotic zone is mostly released to the atmosphere and transported downstream, the increase in settled organic matter greatly promotes DO consumption in the water column. The increased respiration is another major cause of the HV increase besides the physical contributions.

54 ENVIRONMENTAL SCIENCES↗

Wassersplines for Neural Vector Field-Controlled Animation

Much of computer-generated animation is created by manipulating meshes with rigs. While this approach works well for animating articulated objects like animals, it has limited flexibility for animating less structured free-form objects. Here we introduce Wassersplines, a novel trajectory inference method for animating unstructured densities based on recent advances in continuous normalizing flows and optimal transport. The key idea is to train a neurally-parameterized velocity field that represents the motion between keyframes. Trajectories are then computed by advecting keyframes through the velocity field. We solve an additional Wasserstein barycenter interpolation problem to guarantee strict adherence to keyframes. Our tool can stylize trajectories through a variety of PDE-based regularizers to create different visual effects. We demonstrate our tool on various keyframe interpolation problems to produce temporally-coherent animations without meshing or rigging.

97 MATHEMATICS AND COMPUTING↗

Coalescence Prevention Algorithm for Level Set Method

An algorithm to prevent or delay bubble coalescence for the level set (LS) method is presented. This novel algorithm uses the LS method field to detect when bubbles are in close proximity, indicating a potential coalescence event, and applies a repellent force to simulate the unresolved liquid drainage force. The model is introduced by locally modifying the surface tension force near the liquid film drainage area. The algorithm can also simulate the liquid drainage time of the thin film by controlling the length of time the increased surface tension has been applied. Thus, a new method of modeling bubble coalescence has been developed. Several test cases were designed to demonstrate the capabilities of the algorithm. The simulations, including a mesh study, confirmed the abilities to identify and prevent coalescence as well as implement the time tracking portion, with an additional 10–25% computational cost. Ongoing tests aim to verify the algorithm's functionality for simulations with different flow conditions, a ranging number of bubbles, and both structured and unstructured computational mesh types. Specifically, a bubble rising toward a free surface provides a test of performance and demonstrates the ability to consistently prevent coalescence. In addition, a two bubble case and a seven bubble case provide a more complex demonstration of how the algorithm performs for larger simulations. These cases are compared to much more expensive simulations capable of resolving the liquid film drainage (through very high local mesh resolution) to investigate how the algorithm replicates the liquid film drainage process.

Engineering↗

Optimization of deterministic transport parameters for the calculation of the dose distribution around a high dose-rate {sup 192}Ir brachytherapy source

The goal of this work was to calculate the dose distribution around a high dose-rate {sup 192}Ir brachytherapy source using a multi-group discrete ordinates code and then to compare the results with a Monte Carlo calculated dose distribution. The unstructured tetrahedral mesh discrete ordinates code Attila version 6.1.1 was used to calculate the photon kerma rate distribution in water around the Nucletron microSelectron mHDRv2 source. MCNPX 2.5.c was used to compute the Monte Carlo water photon kerma rate distribution. Two hundred million histories were simulated, resulting in standard errors of the mean of less than 3% overall. The number of energy groups, S{sub n} (angular order), P{sub n} (scattering order), and mesh elements were varied in addition to the method of analytic ray tracing to assess their effects on the deterministic solution. Water photon kerma rate matrices were exported from both codes into an in-house data analysis software. This software quantified the percent dose difference distribution, the number of points within {+-}3% and {+-}5%, and the mean percent difference between the two codes. The data demonstrated that a 5 energy-group cross-section set calculated results to within 0.5% of a 15 group cross-section set. S{sub 12} was sufficient to resolve the solution in angle. P{sub 2} expansion of the scattering cross-section was necessary to compute accurate distributions. A computational mesh with 55 064 tetrahedral elements in a 30 cm diameter phantom resolved the solution spatially. An efficiency factor of 110 with the above parameters was realized in comparison to MC methods. The Attila code provided an accurate and efficient solution of the Boltzmann transport equation for the mHDRv2 source.

61 RADIATION PROTECTION AND DOSIMETRY↗

SU-E-T-544: A Radiation Oncology-Specific Multi-Institutional Federated Database: Initial Implementation

Purpose: To implement a common database structure and user-friendly web-browser based data collection tools across several medical institutions to better support evidence-based clinical decision making and comparative effectiveness research through shared outcomes data. Methods: A consortium of four academic medical centers agreed to implement a federated database, known as Oncospace. Initial implementation has addressed issues of differences between institutions in workflow and types and breadth of structured information captured. This requires coordination of data collection from departmental oncology information systems (OIS), treatment planning systems, and hospital electronic medical records in order to include as much as possible the multi-disciplinary clinical data associated with a patients care. Results: The original database schema was well-designed and required only minor changes to meet institution-specific data requirements. Mobile browser interfaces for data entry and review for both the OIS and the Oncospace database were tailored for the workflow of individual institutions. Federation of database queries--the ultimate goal of the project--was tested using artificial patient data. The tests serve as proof-of-principle that the system as a whole--from data collection and entry to providing responses to research queries of the federated database--was viable. The resolution of inter-institutional use of patient data for research is still not completed. Conclusions: The migration from unstructured data mainly in the form of notes and documents to searchable, structured data is difficult. Making the transition requires cooperation of many groups within the department and can be greatly facilitated by using the structured data to improve clinical processes and workflow. The original database schema design is critical to providing enough flexibility for multi-institutional use to improve each institution s ability to study outcomes, determine best practices, and support research. The project has demonstrated the feasibility of deploying a federated database environment for research purposes to multiple institutions.

60 APPLIED LIFE SCIENCES↗

RNA structures and dynamics with Å resolution revealed by x-ray free-electron lasers

RNA macromolecules, like proteins, fold to assume shapes that are intimately connected to their broadly recognized biological functions; however, because of their high charge and dynamic nature, RNA structures are far more challenging to determine. We introduce an approach that exploits the high brilliance of x-ray free-electron laser sources to reveal the formation and ready identification of angstrom-scale features in structured and unstructured RNAs. Previously unrecognized structural signatures of RNA secondary and tertiary structures are identified through wide-angle solution scattering experiments. With millisecond time resolution, we observe an RNA fold from a dynamically varying single strand through a base-paired intermediate to assume a triple-helix conformation. While the backbone orchestrates the folding, the final structure is locked in by base stacking. This method may help to rapidly characterize and identify structural elements in nucleic acids in both equilibrium and time-resolved experiments.

59 BASIC BIOLOGICAL SCIENCES↗

Crystal Structure of the Eukaryotic Strong Inward-Rectifier K[superscript +] Channel Kir2.2 at 3.1 Å Resolution

Inward-rectifier potassium (K{sup +}) channels conduct K{sup +} ions most efficiently in one direction, into the cell. Kir2 channels control the resting membrane voltage in many electrically excitable cells, and heritable mutations cause periodic paralysis and cardiac arrhythmia. We present the crystal structure of Kir2.2 from chicken, which, excluding the unstructured amino and carboxyl termini, is 90% identical to human Kir2.2. Crystals containing rubidium (Rb{sup +}), strontium (Sr{sup 2+}), and europium (Eu{sup 3+}) reveal binding sites along the ion conduction pathway that are both conductive and inhibitory. The sites correlate with extensive electrophysiological data and provide a structural basis for understanding rectification. The channel's extracellular surface, with large structured turrets and an unusual selectivity filter entryway, might explain the relative insensitivity of eukaryotic inward rectifiers to toxins. These same surface features also suggest a possible approach to the development of inhibitory agents specific to each member of the inward-rectifier K{sup +} channel family.

36 MATERIALS SCIENCE↗

Upscaling of Mixed Finite Element Discretization Problems by the Spectral AMGe Method

Here, we propose two multilevel spectral techniques for constructing coarse discretization spaces for saddle-point problems corresponding to PDEs involving a divergence constraint, with a focus on mixed finite element discretizations of scalar self-adjoint second order elliptic equations on general unstructured grids. We use element agglomeration algebraic multigrid (AMGe), which employs coarse elements that can have nonstandard shape since they are agglomerates of fine-grid elements. The coarse basis associated with each agglomerated coarse element is constructed by solving local eigenvalue problems and local mixed finite element problems. This construction leads to stable upscaled coarse spaces and guarantees the inf-sup compatibility of the upscaled discretization. Also, the approximation properties of these upscaled spaces improve by adding more local eigenfunctions to the coarse spaces. The higher accuracy comes at the cost of additional computational effort, as the sparsity of the resulting upscaled coarse discretization (referred to as operator complexity) deteriorates when we introduce additional functions in the coarse space. We also provide an efficient solver for the coarse (upscaled) saddle-point system by employing hybridization, which leads to a symmetric positive definite (s.p.d.) reduced system for the Lagrange multipliers, and to solve the latter s.p.d. system, we use our previously developed spectral AMGe solver. Numerical experiments, in both two and three dimensions, are provided to illustrate the efficiency of the proposed upscaling technique.

97 MATHEMATICS AND COMPUTING↗

Unified Geometric Multigrid Algorithm for Hybridized High-Order Finite Element Methods

In this paper, we consider a standard elliptic partial differential equation and propose a geometric multigrid algorithm based on Dirichlet-to-Neumann (DtN) maps for hybridized high-order finite element methods. The proposed unified approach is applicable to any locally conservative hybridized finite element method including multinumerics with different hybridized methods in different parts of the domain. For these methods, the linear system involves only the unknowns residing on the mesh skeleton, and constructing intergrid transfer operators is therefore not trivial. The key to our geometric multigrid algorithm is the physics-based energy-preserving intergrid transfer operators which depend only on the fine scale DtN maps. Thanks to these operators, we completely avoid upscaling of parameters and no information regarding subgrid physics is explicitly required on coarse meshes. Moreover, our algorithm is agglomeration-based and can straightforwardly handle unstructured meshes. We perform extensive numerical studies with hybridized mixed methods, hybridized discontinuous Galerkin methods, weak Galerkin methods, and hybridized versions of interior penalty discontinuous Galerkin methods on a range of elliptic problems including subsurface flow through highly heterogeneous porous media. We compare the performance of different smoothers and analyze the effect of stabilization parameters on the scalability of the multigrid algorithm.

97 MATHEMATICS AND COMPUTING↗

Efficient Operator-Coarsening Multigrid Schemes for Local Discontinuous Galerkin Methods

An efficient hp-multigrid scheme is presented for local discontinuous Galerkin (LDG) discretizations of elliptic problems, formulated around the idea of separately coarsening the underlying discrete gradient and divergence operators. We show that traditional multigrid coarsening of the primal formulation leads to poor and suboptimal multigrid performance, whereas coarsening of the flux formulation leads to essentially optimal convergence and is equivalent to a purely geometric multigrid method. The resulting operator-coarsening schemes do not require the entire mesh hierarchy to be explicitly built, thereby obviating the need to compute quadrature rules, lifting operators, and other mesh-related quantities on coarse meshes. We show that good multigrid convergence rates are achieved in a variety of numerical tests on two-dimensional and three-dimensional uniform and adaptive Cartesian grids, as well as for curved domains using implicitly defined meshes and for multiphase elliptic interface problems with complex geometry. Extensions, e.g., to non-LDG discretizations and fully unstructured meshes, are briefly discussed.

97 MATHEMATICS AND COMPUTING↗

A New Semistructured Algebraic Multigrid Method

Multigrid methods are well suited to large massively parallel computer architectures because they are mathematically optimal and display good parallelization properties. Since current architecture trends are favoring regular compute patterns to achieve high performance, the ability to express structure has become much more important. The hypre software library provides high-performance multigrid preconditioners and solvers through conceptual interfaces, including a semistructured interface that describes matrices primarily in terms of stencils and logically structured grids. This paper presents a new semistructured algebraic multigrid (SSAMG) method built on this interface. The numerical convergence and performance of a CPU implementation of this method are evaluated for a set of semistructured problems. In conclusion, SSAMG achieves significantly better setup times than hypre’s unstructured AMG solvers and comparable convergence. In addition, the new method is capable of solving more complex problems than hypre’s structured solvers.

97 MATHEMATICS AND COMPUTING↗

Parallel Randomized Tucker Decomposition Algorithms

The Tucker tensor decomposition is a natural extension of the singular value decomposition (SVD) to multiway data. Here, we propose to accelerate Tucker tensor decomposition algorithms by using randomization and parallelization. We present two algorithms that scale to large data and many processors, significantly reduce both computation and communication cost compared to previous deterministic and randomized approaches, and obtain nearly the same approximation errors. The key idea in our algorithms is to perform randomized sketches with Kronecker-structured random matrices, which reduces computation compared to unstructured matrices and can be implemented using a fundamental tensor computational kernel. We provide probabilistic error analysis of our algorithms and implement a new parallel algorithm for the structured randomized sketch. Our experimental results demonstrate that our combination of randomization and parallelization achieves accurate Tucker decompositions much faster than alternative approaches. We observe up to a 16X speedup over the fastest deterministic parallel implementation on 3D simulation data.

Tucker decompositions↗

Scalable Multiphysics Block Preconditioning for Low Mach Number Compressible Resistive MHD with Application to Magnetic Confinement Fusion

This study investigates multiphysics block preconditioners that are critical in devising scalable Newton–Krylov iterative solvers for longer time-scale fully implicit fluid plasma models. The specific model of interest is the visco-resistive, low Mach number, compressible magnetohydrodynamics (MHD) model. This model describes the dynamics of conducting fluids in the presence of electromagnetic fields and can be used to study aspects of astrophysical phenomena, important science and technology applications, and basic plasma physics. The specific application of interest that motivates this study is the macroscopic simulation of longer time-scale stability and disruptions of magnetic confinement fusion devices, specifically the ITER Tokamak. The computational solution of the governing balance equations for mass, momentum, heat transfer, and magnetic induction for resistive MHD systems can be extremely challenging. These difficulties arise from both the strong nonlinear, nonsymmetric coupling of fluid and electromagnetic phenomena as well as the significant range of time and length scales that the interactions of these physical mechanisms produce. To handle the range of time and spatial scales of interest, a fully implicit unstructured variational multiscale finite element formulation is employed. For the scalable solution of the Newton linearized systems, fully coupled block preconditioners are designed to leverage algebraic multigrid subsolves. In conclusion, results are presented for the strong and weak scaling of the method as well as the robustness of these techniques for a large range of Lundquist numbers.

97 MATHEMATICS AND COMPUTING↗

Structural characterization of the model amphipathic peptide Ac-LKKLLKLLKKLLKL-NH2 in aqueous solution and with 2,2,2-trifluoroethanol and 1,1,1,3,3,3-hexafluoroisopropanol

Short-chain amphiphilic peptides are promising components in the new generation of engineered biomaterials with many potential applications. The 14-residue leucine-lysine peptide Ac-LKKLLKLLKKLLKL-NH2 (LKα) is one such amphiphilic peptide. The periodic distribution of hydrophobic and hydrophilic amino acid residues in the sequence of LKα has been shown to promote α-helix formation in an ionic environment and at high peptide concentrations (> ~0.5 mM, no salt). Here, circular dichroism (CD) and nuclear magnetic resonance (NMR) spectroscopy is used to demonstrate that LKα, in the absence of salt and at concentrations < 0.5 mM, readily adopts a helical structure in the presence of the structure stabilizing agents 2,2,2-trifluoroethanol (TFE) and 1,1,1,3,3,3-hexafluoroisopropanol (HFIP). Maximal helical character, as monitored by negative bands with double minima at 222 and 208-210 nm in the CD spectrum, was observed in 20% TFE and 10% HFIP (volume percent). The helical character suggested by the CD data was corroborated with amide to alpha proton, long range, 1HN(i) to 1Hα(i-3) NOEs characteristic of an α-helical structure. In unbuffered water in the absence of a flouronated alcohol and at low peptide concentrations, LKα was essentially unstructured in solution. These observations confirm that LKα has a predisposition to adopt a helical structure that may be maximized with minimal amounts of fluorinated alcohol. This characterization of the structural and physical properties of LKα will assist the design of future biomaterials containing amphiphilic peptides.

biomaterials↗

Session Introduction: Graph Representations and Algorithms in Biomedicine

Connectivity is a fundamental property of biological systems: on the cellular level, proteins interact with each other to form protein-protein interaction networks (PPIs); on the organism level, neurons are arranged in a network; and on a community-level, species can have complex relationships with one another that drive the development and balance of an ecosystem. Graphs, representations of systems consisting of entities as vertices and their connections as edges, are a useful structure to characterize many such systems. Such models can be used to understand biological systems that naturally have a network structure, including PPIs, biological neurons, and ecosystems. In today’s information age, graph representations and algorithms (often in combination with machine learning techniques) are used to organize massive amounts of related data, much of which may be heterogeneous or unstructured, and identify patterns that represent novel biological insights. PSB’s 2023 session “Graph Representations and algorithms in Biomedicine,” encompasses modern developments in graph theory and its applications to various fields of biomedicine. This session includes a wide range of research - knowledge graphs built from text-mined health data, heterogeneous networks using multi-omic databases, and graphs refined to represent uncertainty or improve memory usage.

Chrisman, Brianna S.↗

Efficient Scheduling of Recursive Control Flow on GPUs

Graphics processing units (GPUs) have rapidly emerged as a very significant player in high performance computing. Single instruction multiple thread (SIMT) pipelines are typically used in GPUs to exploit parallelism and maximize performance. Although support for unstructured control flow has been included in GPUs, efficiently managing thread divergence for arbitrary parallel programs remains a critical challenge. In this paper, we focus on the problem of supporting recursion in modern GPUs. We design and comparatively evaluate various algorithms to manage thread divergence encountered in recursive programs. The results improve upon traditional post-dominator based reconvergence mechanisms designed to handle thread divergence due to control flow within a procedure.

GPUs↗