Search NASA⌕ Search

SEARCH · Search NASA

Results for “CONNECT algorithm”

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 739 records · Page 41
All sourcesNASA NTRSDOE OSTI
NASA NTRS1997

Parallel adaptive mesh refinement techniques for plasticity problems

The accurate modeling of the nonlinear properties of materials can be computationally expensive. Parallel computing offers an attractive way for solving such problems; however, the efficient use of these systems requires the vertical integration of a number of very different software components, we explore the solution of two- and three-dimensional, small-strain plasticity problems. We consider a finite-element formulation of the problem with adaptive refinement of an unstructured mesh to accurately model plastic transition zones. We present a framework for the parallel implementation of such complex algorithms. This framework, using libraries from the SUMAA3d project, allows a user to build a parallel finite-element application without writing any parallel code. To demonstrate the effectiveness of this approach on widely varying parallel architectures, we present experimental results from an IBM SP parallel computer and an ATM-connected network of Sun UltraSparc workstations. The results detail the parallel performance of the computational phases of the application during the process while the material is incrementally loaded.

Barry, W. J.↗
NASA NTRS2022

Robustness of Vegetation Optical Depth Retrievals Based on L-Band Global Radiometry

Microwave vegetation optical depth (VOD) and soil moisture (SM) can be simultaneously retrieved based on L-band radiometry with polarization information. VOD is indicative of the vegetation water content (VWC) because it captures the extinction of land surface emission. If the connectivity of VOD to VWC is robust, the pair of VWC-SM observations can be viable bases for understanding soil–plant–atmosphere water relations, providing new perspectives on ecosystem science. Simultaneous SM–VOD retrievals are feasible by inverting the τ−ω model with two independent datasets in dual-channel algorithms. However, given correlated satellite vertical and horizontal brightness temperatures (TBs; TB v and TB h ), an ill-posed inverse problem arises where TB errors result in high uncertainties of retrievals. In this study, we apply the degrees-of-information (DoI) metric and propose a signal-to-noise ratio (SNR) metric to assess the “retrievability” of VOD given the Soil Moisture Active Passive (SMAP) TB v –TB h linear dependence. The application of these metrics allows determining where the VOD retrievals are robust and reliable. This is a necessary step in supporting the applications of VOD in ecology and hydrology. Results show that regions with mainly nonwoody vegetation have the best potential for VOD retrievals, though regularization is necessary. We then assess VOD time variations from two regularization products that reduce the impact of underdetermined inversions: the L3 dual-channel algorithm (L3-DCA) and the multitemporal dual-channel algorithm (MTDCA), which constrain VOD time dynamics with and without using a priori VOD climatology, respectively. Though they both reduce noise, especially in the VOD retrievals, they result in differences in VOD seasonal amplitude and coupling to SM at high frequencies as we outline here.

Microwave↗
DOE OSTI2021

Dynamic P-Q Capability and Abnormal Operation Analysis of a Wind Turbine with Doubly-Fed Induction Generator

After several accidents occurred in wind farms in the United States and around the world, the subsynchronous oscillation (SSO) issues in grid-connected wind farms have gained serious attention. Particularly, these issues have caused significant challenges to wind turbines with a doubly fed induction generator (DFIG) because it is connected to the grid via both its stator and rotor paths. Traditionally, a P-Q capability chart is utilized to assure the safe operation boundary for a synchronous generator. But the energy conversion characteristics of a DFIG wind turbine are completely different. A critical factor to affect the reliable operation of a DFIG wind turbine is the rated current and pulse-width modulation (PWM) saturation constraints of its power converters. These constraint conditions can be affected by the wind turbine rotating speed and grid conditions. However, a detailed study of DFIG P-Q capability from these perspectives has not been conducted, which has hindered adequate understanding of many abnormal wind turbine operations reported in the literature and the development of advanced control technologies to overcome the challenges. The proposed study in this paper considers vector control implementation to DFIG power electronic converters in the dq reference frame, and the models and algorithms developed for the P-Q capability study have addressed specific DFIG power converter constraints that are different from those of a traditional synchronous generator. The paper especially focuses on exploring the dynamic natures of DFIG P-Q capability under uncertain and variable conditions to explore the root causes of many abnormal operations of DFIG wind turbines reported in the literature. The proposed study is validated through an electromagnetic transient simulation model of a grid-connected DFIG wind turbine. The proposed study has the potential to lead to the development of new DFIG control technologies that can help overcome the challenges for many abnormal operations of DFIG wind turbines.

17 WIND ENERGY↗
DOE OSTI2024

MiNAA: Microbiome Network Alignment Algorithm

A microbial network is a mathematical representation of a microbial community where nodes represent microbes and edges represent interactions. It is well-recognized that microbes are among the main drivers of biological phenotypes in soil, plants, and animals alike, and thus, their study has vast implications for soil, plant and human health. In particular, recognizing the microbial, environmental, and agricultural factors that drive plant and soil phenotypes is crucial to comprehend processes connected to plant and soil health, to identify global practices of sustainable agriculture, as well as to predict plant and soil responses to environmental perturbations such as climate change. The adaptability of microbes to thrive in every environment poses challenges for scientists who try to understand their communities. Indeed, two microbial communities with the exact same players can interact differently depending on the environmental conditions. It is thus desirable to identify commonalities and differences on two microbial networks, hence the need for computational tools that can match (or align) them.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Hybrid Dynamic Modeling of Smart Inverter

This letter proposes a novel hybrid method for assessing grid-connected three-phase converter interfaced resources (CIR) dynamics with the IEEE standard 1547-2018 grid support functions (GSFs), which blends physics and data-driven techniques. First, the letter derives an analytical model of a CIR to represent the internal physics and data-driven model (DDM) using a system identification algorithm to represent the rest of the dynamics, including the GSF. The derived hybrid model combines the analytical model of CIR and DDM, which balances accuracy and flexibility and is compared with the detailed switched model. Furthermore, the efficacy of the proposed approach to represent the advanced CIR dynamics is substantiated by power hardware-in-the-loop experiment data where real measurements from a commercial CIR are used to cross-validate the proposed approach. Furthermore, the results indicate that despite simple, the hybrid model accurately reproduces the dynamics of the detailed CIR model with an acceptable accuracy.

Data-driven model↗
DOE OSTI2024

Generalized Analytical Estimation of Sensitivity Matrices in Unbalanced Distribution Networks

Fast and accurate estimation of sensitivity matrices is significant for the enhancement of distribution system modeling and automation. Analytical estimations have mainly focused on voltage magnitude sensitivity to active/reactive power injections for unbalanced networks with Wye-connected loads and neglecting DERs' smart inverter functionality. Hence, this paper enhances the scope of analytical estimation of sensitivity matrices for unbalanced networks with 1- Φ, 2- Φ, and 3- Φ Delta/Wye-connected loads, DERs with smart inverter functionality, and substation/line step-voltage regulators (SVR). A composite bus model comprising of DER, Delta- and Wye-connected load is proposed to represent a generic distribution bus, which can be simplified to load, PV, or voltage-controlled bus as required. Furthermore, the proposed matrix-based analytical method consolidates voltage magnitude and angle sensitivity to active/reactive power injection and tap-position of all SVRs into a single algorithm. Extensive case studies on IEEE and EPRI networks show the accuracy and wide scope of the proposed algorithm compared to the existing benchmark method.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1984

NASA/MSFC ground experiment for large space structure control verification

Marshall Space Flight Center has developed a facility in which closed loop control of Large Space Structures (LSS) can be demonstrated and verified. The main objective of the facility is to verify LSS control system techniques so that on orbit performance can be ensured. The facility consists of an LSS test article which is connected to a payload mounting system that provides control torque commands. It is attached to a base excitation system which will simulate disturbances most likely to occur for Orbiter and DOD payloads. A control computer will contain the calibration software, the reference system, the alignment procedures, the telemetry software, and the control algorithms. The total system will be suspended in such a fashion that LSS test article has the characteristics common to all LSS.

Waites, H. B.↗
NASA NTRS1985

NASA/MSFC ground experiment for Large Space Structure control verification

NASA Marshall Space Flight Center has developed a facility in which closed loop control of Large Space Structures (LSS) can be demonstrated and verified. The main objective of the facility is to verify LSS control system techniques so that on-orbit performance can be ensured. The facility consists of an LSS test article which is connected to a payload mounting system that provides control torque commands. It is attached to a base excitation system which will simulate disturbances most likely to occur for Orbiter and DOD payloads. A control computer will contain the calibration software, the reference system, the alignment procedures, the telemetry software, and the control algorithms. The total system will be suspended in such a fashion that LSS test article has the characteristics common to all LSS.

Waites, H. B.↗
NASA NTRS1991

A biconjugate gradient type algorithm on massively parallel architectures

The biconjugate gradient (BCG) method is the natural generalization of the classical conjugate gradient algorithm for Hermitian positive definite matrices to general non-Hermitian linear systems. Unfortunately, the original BCG algorithm is susceptible to possible breakdowns and numerical instabilities. Recently, Freund and Nachtigal have proposed a novel BCG type approach, the quasi-minimal residual method (QMR), which overcomes the problems of BCG. Here, an implementation is presented of QMR based on an s-step version of the nonsymmetric look-ahead Lanczos algorithm. The main feature of the s-step Lanczos algorithm is that, in general, all inner products, except for one, can be computed in parallel at the end of each block; this is unlike the other standard Lanczos process where inner products are generated sequentially. The resulting implementation of QMR is particularly attractive on massively parallel SIMD architectures, such as the Connection Machine.

Freund, Roland W.↗
NASA NTRS2008

A Data Type for Efficient Representation of Other Data Types

A self-organizing, monomorphic data type denoted a sequence has been conceived to address certain concerns that arise in programming parallel computers. A sequence in the present sense can be regarded abstractly as a vector, set, bag, queue, or other construct. Heretofore, in programming a parallel computer, it has been necessary for the programmer to state explicitly, at the outset, what parts of the program and the underlying data structures must be represented in parallel form. Not only is this requirement not optimal from the perspective of implementation; it entails an additional requirement that the programmer have intimate understanding of the underlying parallel structure. The present sequence data type overcomes both the implementation and parallel structure obstacles. In so doing, the sequence data type provides unified means by which the programmer can represent a data structure for natural and automatic decomposition to a parallel computing architecture. Sequences exhibit the behavioral and structural characteristics of vectors, but the underlying representations are automatically synthesized from combinations of programmers advice and execution use metrics. Sequences can vary bidirectionally between sparseness and density, making them excellent choices for many kinds of algorithms. The novelty and benefit of this behavior lies in the fact that it can relieve programmers of the details of implementations. The creation of a sequence enables decoupling of a conceptual representation from an implementation. The underlying representation of a sequence is a hybrid of representations composed of vectors, linked lists, connected blocks, and hash tables. The internal structure of a sequence can automatically change from time to time on the basis of how it is being used. Those portions of a sequence where elements have not been added or removed can be as efficient as vectors. As elements are inserted and removed in a given portion, then different methods are utilized to provide both an access and memory strategy that is optimized for that portion and the use to which it is put.

James, Mark↗
NASA NTRS2003

Compact Interconnection Networks Based on Quantum Dots

Architectures that would exploit the distinct characteristics of quantum-dot cellular automata (QCA) have been proposed for digital communication networks that connect advanced digital computing circuits. In comparison with networks of wires in conventional very-large-scale integrated (VLSI) circuitry, the networks according to the proposed architectures would be more compact. The proposed architectures would make it possible to implement complex interconnection schemes that are required for some advanced parallel-computing algorithms and that are difficult (and in many cases impractical) to implement in VLSI circuitry. The difficulty of implementation in VLSI and the major potential advantage afforded by QCA were described previously in Implementing Permutation Matrices by Use of Quantum Dots (NPO-20801), NASA Tech Briefs, Vol. 25, No. 10 (October 2001), page 42. To recapitulate: Wherever two wires in a conventional VLSI circuit cross each other and are required not to be in electrical contact with each other, there must be a layer of electrical insulation between them. This, in turn, makes it necessary to resort to a noncoplanar and possibly a multilayer design, which can be complex, expensive, and even impractical. As a result, much of the cost of designing VLSI circuits is associated with minimization of data routing and assignment of layers to minimize crossing of wires. Heretofore, these considerations have impeded the development of VLSI circuitry to implement complex, advanced interconnection schemes. On the other hand, with suitable design and under suitable operating conditions, QCA-based signal paths can be allowed to cross each other in the same plane without adverse effect. In principle, this characteristic could be exploited to design compact, coplanar, simple (relative to VLSI) QCA-based networks to implement complex, advanced interconnection schemes. The proposed architectures require two advances in QCA-based circuitry beyond basic QCA-based binary-signal wires described in the cited prior article. One of these advances would be the development of QCA-based wires capable of bidirectional transmission of signals. The other advance would be the development of QCA circuits capable of high-impedance state outputs. The high-impedance states would be utilized along with the 0- and 1-state outputs of QCA.

Fijany, Amir↗
DOE OSTI2026

Generalized Power Flow Model of an Extra High-Power Multi-Terminal HVdc Transmission Grid with Parallel-Connected and Voltage-Stacked Converters

To increase power transfer capacity of high-voltage direct current (HVdc) transmission, a new extra high-power HVdc architecture with multiple standard modular multilevel converters (MMCs) per substation has recently been introduced. This paper proposes a power flow model for a multi-terminal HVdc (MTdc) grid with this innovative substation architecture. The proposed MTdc model can be integrated seamlessly with existing ac-dc power flow algorithms with minimal modifications. The model is applicable to various MTdc grid types and topologies, different numbers of dc buses, dc lines, and MMCs per substation, along with diverse control parameters. In addition, it accurately captures both balanced and unbalanced operations of the MTdc grid. The proposed model is verified using a 5-terminal bipole MTdc grid that spans 4 areas in the Eastern Interconnection system of the USA. The numerical solutions obtained from unified and sequential ac-dc power flow algorithms under different operating conditions closely match the time-domain simulation results in PSCAD, validating the accuracy and versatility of the proposed MTdc power flow model.

Nguyen, Quan H.↗
NASA NTRS1981

Army/NASA small turboshaft engine digital controls research program

The emphasis of a program to conduct digital controls research for small turboshaft engines is on engine test evaluation of advanced control logic using a flexible microprocessor based digital control system designed specifically for research on advanced control logic. Control software is stored in programmable memory. New control algorithms may be stored in a floppy disk and loaded directly into memory. This feature facilitates comparative evaluation of different advanced control modes. The central processor in the digital control is an Intel 8086 16 bit microprocessor. Control software is programmed in assembly language. Software checkout is accomplished prior to engine test by connecting the digital control to a real time hybrid computer simulation of the engine. The engine currently installed in the facility has a hydromechanical control modified to allow electrohydraulic fuel metering and VG actuation by the digital control. Simulation results are presented which show that the modern control reduces the transient rotor speed droop caused by unanticipated load changes such as cyclic pitch or wind gust transients.

Sellers, J. F.↗
NASA NTRS1990

Efficient algorithms for dilated mappings of binary trees

The problem is addressed to find a 1-1 mapping of the vertices of a binary tree onto those of a target binary tree such that the son of a node on the first binary tree is mapped onto a descendent of the image of that node in the second binary tree. There are two natural measures of the cost of this mapping, namely the dilation cost, i.e., the maximum distance in the target binary tree between the images of vertices that are adjacent in the original tree. The other measure, expansion cost, is defined as the number of extra nodes/edges to be added to the target binary tree in order to ensure a 1-1 mapping. An efficient algorithm to find a mapping of one binary tree onto another is described. It is shown that it is possible to minimize one cost of mapping at the expense of the other. This problem arises when designing pipelined arithmetic logic units (ALU) for special purpose computers. The pipeline is composed of ALU chips connected in the form of a binary tree. The operands to the pipeline can be supplied to the leaf nodes of the binary tree which then process and pass the results up to their parents. The final result is available at the root. As each new application may require a distinct nesting of operations, it is useful to be able to find a good mapping of a new binary tree over existing ALU tree. Another problem arises if every distinct required binary tree is known beforehand. Here it is useful to hardwire the pipeline in the form of a minimal supertree that contains all required binary trees.

Iqbal, M. Ashraf↗
NASA NTRS2019

Cluster Analysis of Spectroscopic Line Profiles and EUV Emission in RMHD Simulations and Observations of the Solar Atmosphere

Spatially-resolved observations from the IRIS, SDO/AIA, and other space mission and ground-based telescopes, coupled with realistic 3D RMHD simulations, are a powerful tool for analysis of processes in the solar atmosphere. To better understand the dynamical and thermodynamic properties in the simulation data and their connection to observations, it is essential to determine similarities in the behaviors of the synthesized and observed emission. However, the complexity of observational data and physical processes makes comparison of observations and modeling results difficult. In this work, we show the initial results of application of K-Means clustering (unsupervised machine learning) algorithm to two different problems: 1) recognition of the typical spectroscopic line profiles observed by IRIS during solar flares and their typical dynamic behavior; 2) recognition of shocks and heating events in synthetic AIA emission data obtained from StellarBox quiet-Sun simulations. The average silhouette width technique for the KMeans algorithm is utilized in different ways to obtain optimal numbers of clusters. We discuss application of the emission clustering to visualizations of the computational volume, understanding its evolutionary trends and behavior patterns, and inversion (reconstruction) of physical properties of the solar atmosphere from synthesizes emission data.

Sadykov, Viacheslav↗
NASA NTRS2020

A Deformed Geometry Synthesis Technique for Determining Stacking and Cryogenically Induced Preloads for the Space Launch System

The Space Launch System (SLS) stacking and Core Stage (CS) fueling induce significant preloads that contribute to the liftoff pad separation “twang”. To accurately capture this, an approach is required that can replicate the physics of all SLS physical stacking steps, CS cryogenic shrinkage, associated geometric nonlinearities, and the transient behavior and decay of the preloads with changing boundary conditions as the vehicle separates from the pad. The Deformed Geometry Synthesis (DGS) approach presented here satisfies the above requirements. DGS determines induced preloads by modeling components in their deformed geometry states and then enforcing compatibility by closing the resulting “deadbands”. DGS seamlessly integrates into the multibody modal synthesis framework and does not require the use of artificial external loads to enforce preloads or post-processing steps to remove their influence. Since DGS iterates to solve for the deformed state inclusive of geometric nonlinearities, running linearized parametrics to exercise different potential orientations of ball jointed struts that connect the CS to Boosters for cryo-shrinkage analyses is entirely avoided. Relative to the transient behavior and decay of stacking and cryo-induced preloads with SLS liftoff pad separation, this is an area of considerable interest to the SLS program. To capture this in the most accurate way possible, DGS algorithms are designed to work with Henkel-Mar nonlinear pad separation algorithms which operate on the separating longitudinal and lateral degrees of freedom (DoFs) between the vehicle and the pad. As the separating DoFs release, in whatever manner as dictated by the interface geometries, interface loads and interface flexibilities as well as the external loading on the vehicle, the subject preloads generate a complex twang/decay time-trace as dictated by the physics of the problem. This paper presents DGS numerical verification against the closed-form solution for Timoshenko’s 3 ball-jointed strut preload problem. This problem is then extended by the authors to the geometric nonlinear case where DGS is compared to the Newton-Raphson solution of the nonlinear equations. Next, DGS is utilized to solve the SLS stacking and cryogenic shrinkage coupled loads analyses. Finally, Henkel-Mar pad separation simulations are executed that isolate the impact of the induced preloads’ twang and decay characteristics.

Space Launch System↗
DOE OSTI2021

Decision Tree Regression to Identify Representative Road Sections for Evaluating Performance of Connected and Automated Class 8 Tractors

Currently, connected and autonomous vehicle (CAV) technology is being developed for Class 8 tractor trucks aimed at improved safety and fuel economy and reduced CO2 emissions. Despite extensive efforts conducted across the world, the reported efficiency gains were varied from different research groups, raising concerns about the fidelity of models, the performance of control, and the effectiveness of the experimental validation. One root cause for this variation stems from the fact that the efficiency gain obtained from the CAV is sensitive to real-world conditions, including surrounding traffic and road grade. This study presents an approach aimed at identifying representative public road sections and facilitating CAV research from this perspective. By employing the decision tree regression (DTR) method to the Fleet DNA database, the most representative road sections can be identified. High-level metrics and detailed information of the derived road sections are also illustrated and discussed, which demonstrate their representativeness and the effectiveness of the approach. Meanwhile, the capability of this approach can be easily extended by integrating specific constraints into the DTR algorithm. As an example, a specific representative road section with an aggressive road grade profile was also provided via this approach.

27 ARPA - Advanced Research Projects Agency-Energy↗
DOE OSTI2020

Magneto-Structural Combined Dimensional and Topology Optimization of Interior Permanent Magnet Synchronous Machine Rotors

A magneto-structural combined dimensional and topology optimization approach for interior permanent magnet synchronous machine (IPMSM) rotor design is proposed using the Solid Isotropic Material Penalization (SIMP) density-based topology optimization method. This method optimizes the location and dimensions of the permanent magnets (PMs) embedded in the rotor, while simultaneously optimizing the lamination flux barriers using topology optimization.To allow for the location and dimensions of the PMs to change while retaining the same number of mesh elements and connectivity, the mesh must be deformed. Mesh deformation is accomplished using a Laplace smoothing technique. To increase the range of PM displacement and size changes, the non-PM areas of the rotor design domain are divided into sub-regions along whose boundaries the mesh nodes are redistributed also using a Laplace smoothing algorithm. Three examples of IPMSM rotor optimizations are presented to demonstrate the proposed approach.

33 ADVANCED PROPULSION SYSTEMS↗