Search NASA⌕ Search

SEARCH · Search NASA

Results for “topology analysis”

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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
NASA NTRS1983

Acceleration of convergence of vector sequences

A general approach to the construction of convergence acceleration methods for vector sequence is proposed. Using this approach, one can generate some known methods, such as the minimal polynomial extrapolation, the reduced rank extrapolation, and the topological epsilon algorithm, and also some new ones. Some of the new methods are easier to implement than the known methods and are observed to have similar numerical properties. The convergence analysis of these new methods is carried out, and it is shown that they are especially suitable for accelerating the convergence of vector sequences that are obtained when one solves linear systems of equations iteratively. A stability analysis is also given, and numerical examples are provided. The convergence and stability properties of the topological epsilon algorithm are likewise given.

Sidi, A.↗
NASA NTRS1986

Acceleration of convergence of vector sequences

A general approach to the construction of convergence acceleration methods for vector sequence is proposed. Using this approach, one can generate some known methods, such as the minimal polynomial extrapolation, the reduced rank extrapolation, and the topological epsilon algorithm, and also some new ones. Some of the new methods are easier to implement than the known methods and are observed to have similar numerical properties. The convergence analysis of these new methods is carried out, and it is shown that they are especially suitable for accelerating the convergence of vector sequences that are obtained when one solves linear systems of equations iterative. A stability analysis is also given, and numerical examples are provided. The convergence and stability properties of the topological epsilon algorithm are likewise given.

Sidi, A.↗
DOE OSTI2023

A Data Processing Pipeline for Socio-Technical Network Analysis [Slides]

With the rapid adoption of emerging technologies, there is a need to catalog and model sociotechnical interdependencies that have been historically used to influence the operation of Critical Infrastructure networks including the impacts of mergers and acquisitions, hostile takeovers, and foreign investment. Our research intends to address this need with two primary contributions. First, we have developed a data curation and processing pipeline to generate sociotechnical networks extracted from a variety of data sources including SEC filings and infrastructure asset databases. The pipeline, implemented in Apache Airflow, extracts and normalizes the representation of entities and relations, specified within ontologies. Second, networks produced by our pipeline enable the development of graph-theoretic metrics that consider the properties of network components in addition to its topology. Measures of network complexity, such as degree distribution, reachability analyses, temporal analysis, and community detection may be adapted to indicate adversarial organizational influence. Our intent is to provide an extensible, machine-actionable approach to quickly communicate such models, reproduce previous results, and adapt them to new, unanticipated situations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Reply to: Low-frequency quantum oscillations in LaRhIn 5 : Dirac point or nodal line?

We thank G.P. Mikitik and Yu.V. Sharlai for contributing this note and the cordial exchange about it. First and foremost, we note that the aim of our paper is to report a methodology to diagnose topological (semi)metals using magnetic quantum oscillations. Thus far, such diagnosis has been based on the phase offset of quantum oscillations, which is extracted from a “Landau fan plot”. A thorough analysis of the Onsager–Lifshitz–Roth quantization rules has shown that the famous π-phase shift can equally well arise from orbital or spin magnetic moments in topologically trivial systems with strong spin-orbit coupling or small effective masses. Therefore, the “Landau fan plot” does not by itself constitute a proof of a topologically nontrivial Fermi surface. In the paper at hand, we report an improved analysis method that exploits the strong energy dependence of the effective mass in linearly dispersing bands. This leads to a characteristic temperature dependence of the oscillation frequency which is a strong indicator of nontrivial topology, even for multi-band metals with complex Fermi surfaces. Three materials, Cd 3 As 2 , Bi 2 O 2 Se and LaRhIn5 served as test cases for this method. Linear band dispersions were detected for Cd 3 As 2 , as well as the F ≈ 7 T pocket in LaRhIn 5 .

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Extracting Topological Orders of Generalized Pauli Stabilizer Codes in Two Dimensions

In this paper, we introduce an algorithm for extracting topological data from translation invariant generalized Pauli stabilizer codes in two-dimensional systems, focusing on the analysis of anyon excitations and string operators. The algorithm applies to Z d qudits, including instances where d is a nonprime number. This capability allows the identification of topological orders that differ from the Z d toric codes. It extends our understanding beyond the established theorem that Pauli stabilizer codes for Z p qudits (with p being a prime) are equivalent to finite copies of Z p toric codes and trivial stabilizers. The algorithm is designed to determine all anyons and their string operators, enabling the computation of their fusion rules, topological spins, and braiding statistics. The method converts the identification of topological orders into computational tasks, including Gaussian elimination, the Hermite normal form, and the Smith normal form of truncated Laurent polynomials. Furthermore, the algorithm provides a systematic approach for studying quantum error-correcting codes. We apply it to various codes, such as self-dual CSS quantum codes modified from the two-dimensional honeycomb color code and non-CSS quantum codes that contain the double semion topological order or the six-semion topological order. Published by the American Physical Society 2024

Physics↗
NASA NTRS2008

Cammp Team

The International Space Station (ISS) Configuration Analysis Modeling and Mass Properties (CAMMP) Team is presenting a demo of certain CAMMP capabilities at a Booz Allen Hamilton conference in San Antonio. The team will be showing pictures of low fidelity, simplified ISS models, but no dimensions or technical data. The presentation will include a brief description of the contract and task, description and picture of the Topology, description of Generic Ground Rules and Constraints (GGR&C), description of Stage Analysis with constraints applied, and wrap up with description of other tasks such as Special Studies, Cable Routing, etc. The models include conceptual Crew Exploration Vehicle (CEV) and Lunar Lander images and animations created for promotional purposes, which are based entirely on public domain conceptual images from public NASA web sites and publicly available magazine articles and are not based on any actual designs, measurements, or 3D models. Conceptual Mars rover and lander are completely conceptual and are not based on any NASA designs or data. The demonstration includes High Fidelity Computer Aided Design (CAD) models of ISS provided by the ISS 3D CAD Team which will be used in a visual display to demonstrate the capabilities of the Teamcenter Visualization software. The demonstration will include 3D views of the CAD models including random measurements that will be taken to demonstrate the measurement tool. A 3D PDF file will be demonstrated of the Blue Book fidelity assembly complete model with no vehicles attached. The 3D zoom and rotation will be displayed as well as random measurements from the measurement tool. The External Configuration Analysis and Tracking Tool (ExCATT) Microsoft Access Database will be demonstrated to show its capabilities to organize and track hardware on ISS. The data included will be part numbers, serial numbers, historical, current, and future locations, of external hardware components on station. It includes dates of all external ISS events and flights and the associated hardware changes for each event. The hardware location information does not always reveal the exact location of the hardware, only the general location. In some cases the location is a module or carrier, in other cases it is a WIF socket, handrail, or attach point. Only small portions of the data will be displayed for demonstration purposes.

Evertt, Shonn F.↗
NASA NTRS2010

Magnetic Topology of Coronal Hole Linkages

In recent work, Antiochos and coworkers argued that the boundary between the open and closed field regions on the Sun can be extremely complex with narrow corridors of open ux connecting seemingly disconnected coronal holes from the main polar holes, and that these corridors may be the sources of the slow solar wind. We examine, in detail, the topology of such magnetic configurations using an analytical source surface model that allows for analysis of the eld with arbitrary resolution. Our analysis reveals three important new results: First, a coronal hole boundary can join stably to the separatrix boundary of a parasitic polarity region. Second, a single parasitic polarity region can produce multiple null points in the corona and, more important, separator lines connecting these points. Such topologies are extremely favorable for magnetic reconnection, because it can now occur over the entire length of the separators rather than being con ned to a small region around the nulls. Finally, the coronal holes are not connected by an open- eld corridor of finite width, but instead are linked by a singular line that coincides with the separatrix footprint of the parasitic polarity. We investigate how the topological features described above evolve in response to motion of the parasitic polarity region. The implications of our results for the sources of the slow solar wind and for coronal and heliospheric observations are discussed.

Titov, V. S.↗
NASA NTRS1998

A Geometry Based Infra-Structure for Computational Analysis and Design

The computational steps traditionally taken for most engineering analysis suites (computational fluid dynamics (CFD), structural analysis, heat transfer and etc.) are: (1) Surface Generation -- usually by employing a Computer Assisted Design (CAD) system; (2) Grid Generation -- preparing the volume for the simulation; (3) Flow Solver -- producing the results at the specified operational point; (4) Post-processing Visualization -- interactively attempting to understand the results. For structural analysis, integrated systems can be obtained from a number of commercial vendors. These vendors couple directly to a number of CAD systems and are executed from within the CAD Graphical User Interface (GUI). It should be noted that the structural analysis problem is more tractable than CFD; there are fewer mesh topologies used and the grids are not as fine (this problem space does not have the length scaling issues of fluids). For CFD, these steps have worked well in the past for simple steady-state simulations at the expense of much user interaction. The data was transmitted between phases via files. In most cases, the output from a CAD system could go to Initial Graphics Exchange Specification (IGES) or Standard Exchange Program (STEP) files. The output from Grid Generators and Solvers do not really have standards though there are a couple of file formats that can be used for a subset of the gridding (i.e. PLOT3D data formats). The user would have to patch up the data or translate from one format to another to move to the next step. Sometimes this could take days. Specifically the problems with this procedure are:(1) File based -- Information flows from one step to the next via data files with formats specified for that procedure. File standards, when they exist, are wholly inadequate. For example, geometry from CAD systems (transmitted via IGES files) is defined as disjoint surfaces and curves (as well as masses of other information of no interest for the Grid Generator). This is particularly onerous for modern CAD systems based on solid modeling. The part was a proper solid and in the translation to IGES has lost this important characteristic. STEP is another standard for CAD data that exists and supports the concept of a solid. The problem with STEP is that a solid modeling geometry kernel is required to query and manipulate the data within this type of file. (2) 'Good' Geometry. A bottleneck in getting results from a solver is the construction of proper geometry to be fed to the grid generator. With 'good' geometry a grid can be constructed in tens of minutes (even with a complex configuration) using unstructured techniques. Adroit multi-block methods are not far behind. This means that a million node steady-state solution can be computed on the order of hours (using current high performance computers) starting from this 'good' geometry. Unfortunately, the geometry usually transmitted from the CAD system is not 'good' in the grid generator sense. The grid generator needs smooth closed solid geometry. It can take a week (or more) of interaction with the CAD output (sometimes by hand) before the process can begin. One way Communication. (3) One-way Communication -- All information travels on from one phase to the next. This makes procedures like node adaptation difficult when attempting to add or move nodes that sit on bounding surfaces (when the actual surface data has been lost after the grid generation phase). Until this process can be automated, more complex problems such as multi-disciplinary analysis or using the above procedure for design becomes prohibitive. There is also no way to easily deal with this system in a modular manner. One can only replace the grid generator, for example, if the software reads and writes the same files. Instead of the serial approach to analysis as described above, CAPRI takes a geometry centric approach. This makes the actual geometry (not a discretized version) accessible to all phases of the analysis. The connection to the geometry is made through an Application Programming Interface (API) and NOT a file system. This API isolates the top-level applications (grid generators, solvers and visualization components) from the geometry engine. Also this allows the replacement of one geometry kernel with another, without effecting these top-level applications. For example, if UniGraphics is used as the CAD package then Parasolid (UG's own geometry engine) can be used for all geometric queries so that no solid geometry information is lost in a translation. This is much better than STEP because when the data is queried, the same software is executed as used in the CAD system. Therefore, one analyzes the exact part that is in the CAD system. CAPRI uses the same idea as the commercial structural analysis codes but does not specify control. Software components of the CAD system are used, but the analysis suite, not the CAD operator, specifies the control of the software session. This also means that the license issues (may be) minimized and individuals need not have to know how to operate a CAD system in order to run the suite.

Haimes, Robert↗
DOE OSTI2024

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Search for Electron Neutrinos in Multiple Topologies with the MicroBooNE Experiment

This note presents the status of the measurement of electron neutrinos from the Fermilab Booster Neutrino Beamline (BNB) with the MicroBooNE experiment. The analysis is aimed at investigating the nature of the low energy excess of electromagnetic activity observed by the MiniBooNE experiment. The $ν_e$ event selection relies on topological and calorimetric information to characterise particles produced in these interactions, leveraging the Pandora multi-algorithm reconstruction framework as well as custom particle identification and pattern recognition tools. Results presented in this note use 5.88 × 10 20 protons on target of data collected between 2015 and 2018. These include the performance of particle identification tools for $\mu/p$ and $e/\gamma$ separation, along with electromagnetic shower calibration with the largest sample of $\pi^0$ events measured on argon. Progress towards the completion of this analysis is shown through the measurement of high-energy charged-current $ν_e$ interactions and their kinematic distributions using both inclusive (1eX) and exclusive (1$e$0$p$0$\pi$ and 1$e$N$p$0$\pi$) channels. Measurements of charged-current $ν_µ$ interactions aimed at constraining flux and cross-section systematic uncertainties are also shown. We present the analysis’ preliminary sensitivity of an electron-like signal hypothesis to the MiniBooNE excess which includes flux, cross-section, and detector systematic uncertainties.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Planar thermal Hall effect of topological bosons in the Kitaev magnet α-RuCl 3

The honeycomb magnet α-RuCl 3 has attracted considerable interest because it is proximate to the Kitaev Hamiltonian whose excitations are Majoranas and vortices. The thermal Hall conductivity κ xy of Majorana fermions is predicted to be half-quantized. Half-quantization of κxy/T (T, temperature) was recently reported, but this observation has proven difficult to reproduce. Here, we report detailed measurements of κ xy on α-RuCl3 with the magnetic field B ∥ a (zigzag axis). In our experiment, κ xy /T is observed to be strongly temperature dependent between 0.5 and 10 K. We show that its temperature profile matches the distinct form expected for topological bosonic modes in a Chern-insulator-like model. Our analysis yields magnon band energies in agreement with spectroscopic experiments. At high B, the spin excitations evolve into magnon-like modes with a Chern number of ~1. In conclusion, the bosonic character is incompatible with half-quantization of κ xy /T.

36 MATERIALS SCIENCE↗
DOE OSTI2022

A Mountaintop View Requires Minimal Sorting: A Faster Contour Tree Algorithm

Consider a scalar field f : M → R, where M is a triangulated simplicial mesh in R d . A level set, or contour, at value v is a connected component of f –1 (v). As v is changed, these contours change topology, merge into each other, or split. Contour trees are concise representations of f that track this contour behavior. The vertices of these trees are the critical points of f, where the gradient is zero. The edges represent changes in the topology of contours. It is a fundamental data structure in data analysis and visualization, and there is significant previous work (both theoretical and practical) on algorithms for constructing contour trees. Suppose M has n vertices, N facets, and t critical points. A classic result of Carr, Snoeyink, and Axen (2000) gives an algorithm that takes O(n log n+Nα(N)) time (where α(·) is the inverse Ackermann function). A further improvement to O(t log t + N) time was given by Chiang et al. All these algorithms involve a global sort of the critical points, a significant computational bottleneck. Unfortunately, lower bounds of Ω(t log t) also exist. We present the first algorithm that can avoid the global sort and has a refined time complexity that depends on the contour tree structure. Intuitively, if the tree is short and fat, we get significant improvements in running time. For a partition of the contour tree into a set of descending paths, P, our algorithm runs in O($\Sigma$ pϵP |p| log |p| + tα(t) + N). This is at most O(t log D + N), where D is the diameter of the contour tree. Moreover, it is O(tα(t) + N) for balanced trees, a significant improvement over the previous complexity. Our algorithm requires numerous ideas: partitioning the contour tree into join and split trees, a local growing procedure to iteratively build contour trees, and the use of heavy path decompositions for the time complexity analysis. There is a crucial use of a family of binomial heaps to maintain priorities, ensuring that any comparison made is between comparable nodes of the contour tree. We also prove lower bounds showing that the $\Sigma$ pϵP |p| log |p| complexity is inherent to computing contour trees.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Constructing Regulatory Networks to Compare Axenic and Interspecies Microbial Gene Transcription

In this preliminary study, we constructed gene regulatory networks (GRNs) from transcriptional expression data of axenic and interspecies microbial cultures with the goal of predicting how cocultivation affected greenhouse gas respiration by these species. The specific strains of Methylotuvimicrobium alkaliphilum 20Z, a methylotroph, and Cyanobacterium stanieri HL-69, a phototroph, were chosen for their viability in industrial bioprocessing. We ranked directed interactions between gene pairs based on the ability of the input gene to predict the expression of a target gene relative to their transcriptomes. While we were able to identify topological differences between conditions, our initial findings require validation through experimental analysis and further modeling. We aimed to develop a systematic thresholding approach to optimize the accuracy of our networks. We filtered out trial networks separately from top gene interactions of the scored rankings. Parameters of unfiltered and filtered networks were used to test and develop thresholding approaches. Knee point detection of edge weight distributions was explored as an approach for separating significant interactions from insignificant interactions in unfiltered networks. While knee detection failed to produce analogous networks for broad cross-condition comparisons, the results informed us about the proportions of significant edges present in unfiltered networks. We also calculated the average mean degree for nodes in a selection of trial networks to find a thresholding value characteristic to all groups. While we did not reach a definitive conclusion, we gained insight into the coregulatory structures of our groups and made critical evaluations of systematic methods for filtering networks. We recommend an iterative process for the inference of GRNs, where the most significant results from preliminary explorations are used to improve the efficiency with which regulatory motifs are chosen for experimental characterization. Experimental results can then inform the framework of adjusted models to improve broad interpretations of GRNs.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1985

Deformation of the heliospheric current sheet

A kinematic analysis of the previously neglected effect of velocity inhomogeneity on the topology of the heliospheric current sheet in a radially flowing solar wind shows how the originally smooth current sheet becomes 'ruffled'. In the highly idealized case of a totally uniform, radial, steady solar wind, the shape of the current sheet is independent of distance from the sun. However, the real solar wind is inhomogeneous; the velocity varies from point to point along the current sheet, causing a distortion in the current sheet of progressively greater amplitude with increasing distance from the sun. This is true even for purely radial flow. Significant and observable distortion is produced by relatively small gradients in velocity; thus to predict or understand the shape of the heliospheric current sheet it is essential to know the solar wind in which the current sheet is embedded. Examples are given of mild velocity gradients which demonstrate the principles, the magnitude, and the character of the effect; deformation of the actual heliospheric current sheet in the highly variable solar wind is expected to be of far greater amplitude and complexity than in the simplified, tutorial examples. A new expression for the inclination of the current sheet as a function of velocity inhomogeneity and distance from the sun that is easily applied to the interpretation of solar wind data is also derived.

Suess, S. T.↗
NASA NTRS1996

Multiresolution and Explicit Methods for Vector Field Analysis and Visualization

We first report on our current progress in the area of explicit methods for tangent curve computation. The basic idea of this method is to decompose the domain into a collection of triangles (or tetrahedra) and assume linear variation of the vector field over each cell. With this assumption, the equations which define a tangent curve become a system of linear, constant coefficient ODE's which can be solved explicitly. There are five different representation of the solution depending on the eigenvalues of the Jacobian. The analysis of these five cases is somewhat similar to the phase plane analysis often associate with critical point classification within the context of topological methods, but it is not exactly the same. There are some critical differences. Moving from one cell to the next as a tangent curve is tracked, requires the computation of the exit point which is an intersection of the solution of the constant coefficient ODE and the edge of a triangle. There are two possible approaches to this root computation problem. We can express the tangent curve into parametric form and substitute into an implicit form for the edge or we can express the edge in parametric form and substitute in an implicit form of the tangent curve. Normally the solution of a system of ODE's is given in parametric form and so the first approach is the most accessible and straightforward. The second approach requires the 'implicitization' of these parametric curves. The implicitization of parametric curves can often be rather difficult, but in this case we have been successful and have been able to develop algorithms and subsequent computer programs for both approaches. We will give these details along with some comparisons in a forthcoming research paper on this topic.

Source record↗
NASA NTRS2007

Discrete Data Transfer Technique for Fluid-Structure Interaction

This paper presents a general three-dimensional algorithm for data transfer between dissimilar meshes. The algorithm is suitable for applications of fluid-structure interaction and other high-fidelity multidisciplinary analysis and optimization. Because the algorithm is independent of the mesh topology, we can treat structured and unstructured meshes in the same manner. The algorithm is fast and accurate for transfer of scalar or vector fields between dissimilar surface meshes. The algorithm is also applicable for the integration of a scalar field (e.g., coefficients of pressure) on one mesh and injection of the resulting vectors (e.g., force vectors) onto another mesh. The author has implemented the algorithm in a C++ computer code. This paper contains a complete formulation of the algorithm with a few selected results.

Samareh, Jamshid A.↗
NASA NTRS2016

Verification of Triple Modular Redundancy (TMR) Insertion for Reliable and Trusted Systems

We propose a method for TMR insertion verification that satisfies the process for reliable and trusted systems. If a system is expected to be protected using TMR, improper insertion can jeopardize the reliability and security of the system. Due to the complexity of the verification process, there are currently no available techniques that can provide complete and reliable confirmation of TMR insertion. This manuscript addresses the challenge of confirming that TMR has been inserted without corruption of functionality and with correct application of the expected TMR topology. The proposed verification method combines the usage of existing formal analysis tools with a novel search-detect-and-verify tool. Field programmable gate array (FPGA),Triple Modular Redundancy (TMR),Verification, Trust, Reliability,

Trust↗
DOE OSTI2021

Origins of electronic bands in the antiferromagnetic topological insulator MnBi 2 Te 4

Despite the rapid progress in understanding the first intrinsic magnetic topological insulator MnBi 2 Te 4 , its electronic structure remains a topic under debates. In this work, we perform a thorough spectroscopic investigation into the electronic structure of MnBi 2 Te 4 via laser-based angle-resolved photoemission spectroscopy. Through quantitative analysis, we estimate an upper bound of 3 meV for the gap size of the topological surface state. Furthermore, our circular dichroism measurements reveal band chiralities for both the topological surface state and quasi-2D bands, which can be well reproduced in a band hybridization model. A numerical simulation of energy-momentum dispersions based on a four-band model with an additional step potential near the surface provides a promising explanation for the origin of the quasi-2D bands. Our study represents a solid step forward in reconciling the existing controversies in the electronic structure of MnBi 2 Te 4 , and provides an important framework to understand the electronic structures of other relevant topological materials MnBi 2n Te 3n+1 .

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗