Search NASA⌕ Search

SEARCH · Search NASA

Results for “complex computing”

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,423 records · Page 79

Computational engine structural analysis

A significant research activity at the NASA Lewis Research Center is the computational simulation of complex multidisciplinary engine structural problems. This simulation is performed using computational engine structural analysis (CESA) which consists of integrated multidisciplinary computer codes in conjunction with computer post-processing for problem-specific application. A variety of the computational simulations of specific cases are described in some detail in this paper. These case studies include: (1) aeroelastic behavior of bladed rotors, (2) high velocity impact of fan blades, (3) blade-loss transient response, (4) rotor/stator/squeeze-film/bearing interaction, (5) blade-fragment/rotor-burst containment, and (6) structural behavior of advanced swept turboprops. These representative case studies are selected to demonstrate the breath of the problems analyzed and the role of the computer including post-processing and graphical display of voluminous output data.

Chamis, C. C.↗

Development of numerical methods for overset grids with applications for the integrated Space Shuttle vehicle

Algorithms and computer code developments were performed for the overset grid approach to solving computational fluid dynamics problems. The techniques developed are applicable to compressible Navier-Stokes flow for any general complex configurations. The computer codes developed were tested on different complex configurations with the Space Shuttle launch vehicle configuration as the primary test bed. General, efficient and user-friendly codes were produced for grid generation, flow solution and force and moment computation.

Chan, William M.↗

Radiation Belt Remediation: A Complex Engineered System (RBR-ACES) (Institutional Computing Report)

We have performed the simulation campaigns in support of LDRD-DR project Radiation Belt Remediation: A Complex Engineered System (RBR-ACES). This project involves modeling wave generation and wave propagation in plasma environment and studying the effect of waves on the distribution of high energy electrons with the focus on electrons appeared after a high-altitude nuclear explosion (HANE). One of the major goal of this research is strong validation of the numerical models with laboratory experiments and space-based experiments and observations.

42 ENGINEERING↗

Workflows Community Summit: Tightening the Integration between Computing Facilities and Scientific Workflows

Scientific workflows are used almost universally across science domains for solving complex and largescale computing and data analysis problems. The importance of workflows is highlighted by the fact that they have underpinned some of the most significant discoveries of the past decades. Many of these workflows have significant computational, storage, and communication demands, and thus must execute on a range of large-scale computer systems, from local clusters to public clouds and upcoming exascale HPC platforms. Managing these executions is often a significant undertaking, requiring a sophisticated and versatile software infrastructure. Historically, infrastructures for workflow execution consisted of complex, integrated systems, developed in-house by workflow practitioners with strong dependencies on a range of legacy technologies—even including sets of ad hoc scripts. Due to the increasing need to support workflows, dedicated workflow systems were developed to provide abstractions for creating, executing, and adapting workflows conveniently and efficiently while ensuring portability. While these efforts are all worthwhile individually, there are now hundreds of independent workflow systems. These workflow systems are created and used by thousands of researchers and developers, leading to a rapidly growing corpus of workflows research publications. The resulting workflow system technology landscape is fragmented, which may present significant barriers for future workflow users due to many seemingly comparable, yet usually mutually incompatible, systems that exist. In order to tackle some of the challenges described above, the DOE-funded ExaWorks and NSF-funded WorkflowsRI projects have organized in 2021 a series of events entitled the “Workflows Community Summit”. The third edition of the “Workflows Community Summit” explored workflows challenges and opportunities from the perspective of computing centers and facilities. This third summit builds on two prior summits (https://workflowsri.org/summits) that (i) established a high level vision for workflows research; and (ii) explored technical approaches for realizing that vision. The third summit brought together a small group of facilities representatives with the aim to understand how workflows are currently being used at each facility, how facilities would like to interact with workflow developers and users, how workflows fit with facility roadmaps, and what opportunities there are for tighter integration between facilities and workflows. This report documents and organizes the wealth of information provided by the participants before, during, and after the summit.

97 MATHEMATICS AND COMPUTING↗

Data flow modeling techniques

There have been a number of simulation packages developed for the purpose of designing, testing and validating computer systems, digital systems and software systems. Complex analytical tools based on Markov and semi-Markov processes have been designed to estimate the reliability and performance of simulated systems. Petri nets have received wide acceptance for modeling complex and highly parallel computers. In this research data flow models for computer systems are investigated. Data flow models can be used to simulate both software and hardware in a uniform manner. Data flow simulation techniques provide the computer systems designer with a CAD environment which enables highly parallel complex systems to be defined, evaluated at all levels and finally implemented in either hardware or software. Inherent in data flow concept is the hierarchical handling of complex systems. In this paper we will describe how data flow can be used to model computer system.

Kavi, K. M.↗

Frontiers in Scientific Workflows: Pervasive Integration With High-Performance Computing

Herein we address the increasing complexity of scientific workflows in the context of high-performance computing (HPC) and their associated need for robust, adaptable, and flexible computational support systems. We explore five key trends as well as future challenges and opportunities for scientific workflows and HPC technologies.

97 MATHEMATICS AND COMPUTING↗

Impacts of hydrogen bonding interactions with Np(v/vi)O 2 Cl 4 complexes: vibrational spectroscopy, redox behavior, and computational analysis

The neptunyl (Np(V)O 2 + /Np(VI)O 2 2+ ) cation is the dominant form of 237 Np in acidic aqueous solutions and the stability of the Np(V) and Np(VI) species is driven by the specific chemical constituents present in the system. Hydrogen bonding with the oxo group may impact the stability of these species, but there is limited understanding of how these intermolecular interactions influence the behavior of both solution and solid-state species. In the current study, we systematically evaluate the interactions between the neptunyl tetrachloride species and hydrogen donors in coordination complexes and in the related aqueous solutions. Both Np(V) compounds (N 2 C 4 H 12 ) 2 [Np(V)O 2 Cl 4 ]Cl (Np(V)pipz) and (NOC 4 H 10 ) 3 [Np(V)O 2 Cl 4 ] (Np(V)morph) exhibit directional hydrogen bonding to the neptunyl oxo group while Np(VI) compounds (NC 5 H 6 ) 2 [Np(VI)O 2 Cl 4 ] (Np(VI)pyr) and (NOC 4 H 10 ) 4 [Np(VI)O 2 Cl 4 ]·2Cl (Np(VI)morph) assemble via halogen interactions. Here, the Raman spectra of the solid-state phases indicate the activation of vibrational bands when there is asymmetry of the neptunyl bond, while these spectral features are not observed within the related solution phase spectra. Density functional theory calculations of the Np(V)pipz system suggest that activation of the ν 3 asymmetric stretch and other combination modes lead to additional complexity within the solid-state spectra. Electrochemical analyses of complexes in the solution phases are consistent with the results of the crystallization experiments as the voltammetric potentials of Np(V)/Np(VI) complexes in the presence of protonated heterocycles differ from the potentials of pure Np(V) and may correlate with the hydrogen bonding interactions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A composite structured/unstructured-mesh Euler method for complex airfoil shapes

A general two-dimensional Euler zonal method has been developed for computing flows about complex airfoil geometries such as multielement and iced airfoils. The method utilizes a composite structured and unstructured grid generated using conformal mapping and Delaunay triangulation, respectively. The finite-volume Euler method is then modified to couple solutions in the zones with structured and unstructured grids. Solutions about an iced airfoil and a multielement airfoil are given as examples of applications of the scheme.

Hefazi, H.↗

Efficient computation of inviscid flow fields around complex configurations using a multiblock multigrid method

The applicability of a multigrid technique to block-structured, body-fitted meshes is examined focusing on three different strategies. In the first strategy data are exchanged between blocks in each stage of a five-stage Runge-Kutta time-stepping scheme which keeps a possible time lag between blocks to a minimum, but requires a large amount of I/O operations and storage. The second strategy is based on performing a complete Runge-Kutta cycle within a block before switching to the next. In the third strategy both a complete Runge-Kutta cycle and the residual evaluation for the restriction operator are done within a block, allowing a minimum of I/O and storage. The inviscid flow around a wing-body/engine-pylon configuration was computed on a mesh consisting of 11 computational blocks. It was found that both the first and the second strategies delivered converged results, but the third failed due to larger time lag between blocks.

Rossow, C.-C.↗

Modeling Distributed Computing Infrastructures for HEP Applications

Predicting the performance of various infrastructure design options in complex federated infrastructures with computing sites distributed over a wide area network that support a plethora of users and workflows, such as the Worldwide LHC Computing Grid (WLCG), is not trivial. Due to the complexity and size of these infrastructures, it is not feasible to deploy experimental test-beds at large scales merely for the purpose of comparing and evaluating alternate designs. An alternative is to study the behaviours of these systems using simulation. This approach has been used successfully in the past to identify efficient and practical infrastructure designs for High Energy Physics (HEP). A prominent example is the Monarc simulation framework, which was used to study the initial structure of the WLCG. New simulation capabilities are needed to simulate large-scale heterogeneous computing systems with complex networks, data access and caching patterns. A modern tool to simulate HEP workloads that execute on distributed computing infrastructures based on the SimGrid and WRENCH simulation frameworks is outlined. Studies of its accuracy and scalability are presented using HEP as a case-study. Hypothetical adjustments to prevailing computing architectures in HEP are studied providing insights into the dynamics of a part of the WLCG and candidates for improvements.

Horzela, Maximilian↗

Foldy: An open-source web application for interactive protein structure analysis

Foldy is a cloud-based application that allows non-computational biologists to easily utilize advanced AI-based structural biology tools, including AlphaFold and DiffDock. With many deployment options, it can be employed by individuals, labs, universities, and companies in the cloud without requiring hardware resources, but it can also be configured to utilize locally available computers. Foldy enables scientists to predict the structure of proteins and complexes up to 6000 amino acids with AlphaFold, visualize Pfam annotations, and dock ligands with AutoDock Vina and DiffDock. In our manuscript, we detail Foldy’s interface design, deployment strategies, and optimization for various user scenarios. We demonstrate its application through case studies including rational enzyme design and analyzing proteins with domains of unknown function. Furthermore, we compare Foldy’s interface and management capabilities with other open and closed source tools in the field, illustrating its practicality in managing complex data and computation tasks. Our manuscript underlines the benefits of Foldy as a day-to-day tool for life science researchers, and shows how Foldy can make modern tools more accessible and efficient.

59 BASIC BIOLOGICAL SCIENCES↗

Quantifying the binding strength of salicylaldoxime–uranyl complexes relative to competing salicylaldoxime–transition metal ion complexes in aqueous solution: a combined experimental and computational study

Here, the design of new ligands and investigation of UO 2 2+ complexations are an essential aspect of reducing the cost of extracting uranium from seawater, improving the sorption efficiency for uranium and the selectivity for uranium over competing ions (such as the transition metal cations). The binding strengths of salicylaldoxime–UO 2 2+ complexes were quantified for the first time and compared with the binding strengths of salicylic acid–UO 2 2+ and representative amidoxime–UO 2 2+ complexes. We found that the binding strengths of salicylaldoxime–UO 2 2+ complexes are ~2–4 log β 2 units greater in magnitude than their corresponding salicylic acid–UO 2 2+ and representative amidoxime–UO 2 2+ complexes; moreover, the selectivity of salicylaldoxime towards the UO 2 2+ cation over competing Cu 2+ and Fe 3+ cations is far greater than those reported for salicylic acid and glutarimidedioxime in the literature. The higher UO 2 2+ selectivity can likely be attributed to the different coordination modes observed for salicylaldoxime–UO 2 2+ and salicylaldoxime–transition metal complexes. Density functional theory calculations indicate that salicylaldoxime can coordinate with UO 2 2+ as a dianion species formed by η 2 coordination of the aldoximate and monodentate binding of the phenolate group. In contrast, salicylaldoxime coordinates with transition metal cations as a monoanion species via a chelate formed between phenolate and the oxime N; the complexes are stabilized via hydrogen bonding interactions between the oxime OH group and phenolate. By coupling the experimentally determined thermodynamic constants and the results of theoretical computations, we are able to derive a number of ligand design principles to further improve the UO 2 2+ cation affinity, and thus further increase the selectivity of salicylaldoxime derivatives.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Designing a Framework for Solving Multiobjective Simulation Optimization Problems

Multiobjective simulation optimization (MOSO) problems are optimization problems with multiple conflicting objectives, where evaluation of at least one of the objectives depends on a black-box numerical code or real-world experiment, which we refer to as a simulation. Whereas an extensive body of research is dedicated to developing new algorithms and methods for solving these and related problems, it is challenging and time-consuming to integrate these techniques into real-world production-ready solvers. This is partly because of the diversity and complexity of modern state-of-the-art MOSO algorithms and methods and partly because of the complexity and specificity of many real-world problems and their corresponding computing environments. The complexity of this problem is only compounded when introducing potentially complex and/or domain-specific surrogate-modeling techniques, problem formulations, design spaces, and data acquisition functions. Here, this paper carefully surveys the current state of the art in MOSO algorithms, techniques, and solvers, as well as problem types and computational environments where MOSO is commonly applied. We then present several key challenges in the design of a parallel multiobjective simulation optimization framework (ParMOO) and how they have been addressed. Finally, we provide two case studies demonstrating how customized ParMOO solvers can be quickly built and deployed to solve real-world MOSO problems.

engineering design optimization↗

Availability Assessment Based Case-Sensitive Power System Restoration Strategy

Increasingly frequent severe weather events in recent years threaten the security of power systems and result in major power outages throughout the world. The development of reasonable power system restoration (PSR) solutions is therefore urgently needed to speed up the recovery of the power supply while at the same time steering clear of vulnerable and risky equipment. This paper aims to develop a case-sensitive PSR model for power transmission systems that can adjust restoration solutions according to the evaluated availability of outage equipment in specific blackout scenarios and weather conditions. A novel PSR model that integrates the startup of generating units, formulation of the restoration network, renewable energy sources, and availability assessment of devices is proposed. A reformulated model is also proposed to relieve the computational burden of complex PSR problems. The availability of outage equipment is comprehensively assessed based on historical operating records, fault diagnosis results, and weather conditions. The assessed availability results are sensitive to the characteristics of real blackout cases and will support system operators generate case-sensitive PSR solutions while mitigating the vulnerable equipment. The feasibility and effectiveness of the proposed PSR model and its reformulations are verified through case studies.

availability assessment↗

Focused Belief Measures for Uncertainty Quantification in High Performance Semantic Analysis

In web-scale semantic data analytics there is a great need for methods which aggregate uncertainty claims, on the one hand respecting the information provided as accurately as possible, while on the other still being tractable. Traditional statistical methods are more robust, but only represent distributional, additive uncertainty. Generalized information theory methods, including fuzzy systems and Dempster-Shafer (DS) evidence theory, represent multiple forms of uncertainty, but are computationally and methodologically difficult. We require methods which provide an effective balance between the complete representation of the full complexity of uncertainty claims in their interaction, while satisfying the needs of both computational complexity and human cognition. Here we build on J{\o}sang's subjective logic to posit methods in focused belief measures (FBMs), where a full DS structure is focused to a single event. The resulting ternary logical structure is posited to be able to capture the minimal amount of generalized complexity needed at a maximum of computational efficiency. We demonstrate the efficacy of this approach in a web ingest experiment over the 2012 Billion Triple dataset from the Semantic Web Challenge.

belief↗

Mathematical and Computational Tools for Predictive Simulation of Complex Coupled Systems under Uncertainty

Methods and algorithms are developed to enable the accurate analysis of problems that exhibit interacting physical processes with uncertainties. These uncertainties can pertain either to each of the physical processes or to the manner in which they depend on each others. These problems are cast within a polynomial chaos framework and their solution then involves either solving a large system of algebraic equations or a high dimensional numerical quadrature. In both cases, the curse of dimensionality is manifested. Procedures are developed for the efficient evaluation of the resulting linear equations that advantage of the block sparse structure of these equations, resulting in a block recursive Schur complement construction. In addition, embedded quadratures are constructed that permit the evaluation of very high-dimensional integrals using low-dimensional quadratures adapted to particular quantities of interest. The low-dimensional integration is carried out in a transformed measure space in which the quantity of interest is low-dimensional. Finally, a procedure is also developed to discover a low-dimensional manifold, embedded in the initial high-dimensional one, in which scalar quantities of interest exist. This approach permits the functional expression of the reduced space in terms of the original space, thus permitting cross-scale sensitivity analysis.

97 MATHEMATICS AND COMPUTING↗

Algebraic grid generation for complex geometries

An efficient computer program called GRID2D/3D has been developed to generate single and composite grid systems within geometrically complex two- and three-dimensional (2D and 3D) spatial domains that can deform with time. GRID2D/3D generates single grid systems by using algebraic grid generation methods based on transfinite interpolation. The distribution of grid points within the spatial domain is controlled by stretching functions and grid lines can intersect boundaries of the spatial domain orthogonally. GRID2D/3D generates composite grid systems by patching together two or more single grid systems. The patching can be discontinuous or continuous. For 2D spatial domains the boundary curves are constructed by using either cubic or tension spline interpolation. For 3D spatial domains the boundary surfaces are constructed by using a new technique, developed in this study, referred to as 3D bidirectional Hermite interpolation.

Shih, T. I.-P.↗

GRID2D/3D: A computer program for generating grid systems in complex-shaped two- and three-dimensional spatial domains. Part 1: Theory and method

An efficient computer program, called GRID2D/3D was developed to generate single and composite grid systems within geometrically complex two- and three-dimensional (2- and 3-D) spatial domains that can deform with time. GRID2D/3D generates single grid systems by using algebraic grid generation methods based on transfinite interpolation in which the distribution of grid points within the spatial domain is controlled by stretching functions. All single grid systems generated by GRID2D/3D can have grid lines that are continuous and differentiable everywhere up to the second-order. Also, grid lines can intersect boundaries of the spatial domain orthogonally. GRID2D/3D generates composite grid systems by patching together two or more single grid systems. The patching can be discontinuous or continuous. For continuous composite grid systems, the grid lines are continuous and differentiable everywhere up to the second-order except at interfaces where different single grid systems meet. At interfaces where different single grid systems meet, the grid lines are only differentiable up to the first-order. For 2-D spatial domains, the boundary curves are described by using either cubic or tension spline interpolation. For 3-D spatial domains, the boundary surfaces are described by using either linear Coon's interpolation, bi-hyperbolic spline interpolation, or a new technique referred to as 3-D bi-directional Hermite interpolation. Since grid systems generated by algebraic methods can have grid lines that overlap one another, GRID2D/3D contains a graphics package for evaluating the grid systems generated. With the graphics package, the user can generate grid systems in an interactive manner with the grid generation part of GRID2D/3D. GRID2D/3D is written in FORTRAN 77 and can be run on any IBM PC, XT, or AT compatible computer. In order to use GRID2D/3D on workstations or mainframe computers, some minor modifications must be made in the graphics part of the program; no modifications are needed in the grid generation part of the program. This technical memorandum describes the theory and method used in GRID2D/3D.

Shih, T. I.-P.↗