Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational tractability”

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 181 records · Page 10

Exploring the Universe with WISE and Cloud Computing

WISE is a recently-completed astronomical survey mission that has imaged the entire sky in four infrared wavelength bands. The large quantity of science images returned consists of 2,776,922 individual snapshots in various locations in each band which, along with ancillary data, totals around 110TB of raw, uncompressed data. Making the most use of this data requires advanced computing resources. I will discuss some initial attempts in the use of cloud computing to make this large problem tractable.

Benford, Dominic J.↗

A Model for Simulating the Response of Aluminum Honeycomb Structure to Transverse Loading

A 1-dimensional material model was developed for simulating the transverse (thickness-direction) loading and unloading response of aluminum honeycomb structure. The model was implemented as a user-defined material subroutine (UMAT) in the commercial finite element analysis code, ABAQUS(Registered TradeMark)/Standard. The UMAT has been applied to analyses for simulating quasi-static indentation tests on aluminum honeycomb-based sandwich plates. Comparison of analysis results with data from these experiments shows overall good agreement. Specifically, analyses of quasi-static indentation tests yielded accurate global specimen responses. Predicted residual indentation was also in reasonable agreement with measured values. Overall, this simple model does not involve a significant computational burden, which makes it more tractable to simulate other damage mechanisms in the same analysis.

Ratcliffe, James G.↗

Advances in Structure Prediction of Lanthanides and Actinides with Genetic Algorithms

Computationally guided materials discovery has advanced significantly in the past two decades. Recent developments of widely available genetic algorithm-based structure prediction software in the past 10+ years has led to increased use of this methodology in the discovery and design of new materials. Owing to the computational challenges of treating f-block elements and computationally expensive methods for structure prediction, the discovery of new phases of lanthanide and actinide materials has been particularly challenging. With advancements in the development of genetic algorithms for structure prediction and the continuing improvement of high-performance computing resources, genetic algorithms provide a tractable method to find new stable phases of materials at high pressure or to search a large phase space for unknown compounds. Genetic algorithms have already been applied to the successful identification of novel lanthanide and actinide materials, as well as the prediction of unusual material properties in new phases that make promising synthetic targets.

Shields, Ashley↗

Global Sensitivity Analysis Using the Ultra‐Low Resolution Energy Exascale Earth System Model

Abstract For decades, Arctic temperatures have increased twice as fast as average global temperatures. As a first step toward quantifying parametric uncertainty in Arctic climate, we performed a variance‐based global sensitivity analysis (GSA) using a fully coupled, ultra‐low resolution (ULR) configuration of version 1 of the U.S. Department of Energy's Energy Exascale Earth System Model (E3SMv1). Specifically, we quantified the sensitivity of six quantities of interests (QOIs), which characterize changes in Arctic climate over a 75 year period, to uncertainties in nine model parameters spanning the sea ice, atmosphere, and ocean components of E3SMv1. Sensitivity indices for each QOI were computed with a Gaussian process emulator using 139 random realizations of the random parameters and fixed preindustrial forcing. Uncertainties in the atmospheric parameters in the Cloud Layers Unified by Binormals (CLUBB) scheme were found to have the most impact on sea ice status and the larger Arctic climate. Our results demonstrate the importance of conducting sensitivity analyses with fully coupled climate models. The ULR configuration makes such studies computationally feasible today due to its low computational cost. When advances in computational power and modeling algorithms enable the tractable use of higher‐resolution models, our results will provide a baseline that can quantify the impact of model resolution on the accuracy of sensitivity indices. Moreover, the confidence intervals provided by our study, which we used to quantify the impact of the number of model evaluations on the accuracy of sensitivity estimates, have the potential to inform the computational resources needed for future sensitivity studies.

54 ENVIRONMENTAL SCIENCES↗

Fuzzy logic, neural networks, and soft computing

The past few years have witnessed a rapid growth of interest in a cluster of modes of modeling and computation which may be described collectively as soft computing. The distinguishing characteristic of soft computing is that its primary aims are to achieve tractability, robustness, low cost, and high MIQ (machine intelligence quotient) through an exploitation of the tolerance for imprecision and uncertainty. Thus, in soft computing what is usually sought is an approximate solution to a precisely formulated problem or, more typically, an approximate solution to an imprecisely formulated problem. A simple case in point is the problem of parking a car. Generally, humans can park a car rather easily because the final position of the car is not specified exactly. If it were specified to within, say, a few millimeters and a fraction of a degree, it would take hours or days of maneuvering and precise measurements of distance and angular position to solve the problem. What this simple example points to is the fact that, in general, high precision carries a high cost. The challenge, then, is to exploit the tolerance for imprecision by devising methods of computation which lead to an acceptable solution at low cost. By its nature, soft computing is much closer to human reasoning than the traditional modes of computation. At this juncture, the major components of soft computing are fuzzy logic (FL), neural network theory (NN), and probabilistic reasoning techniques (PR), including genetic algorithms, chaos theory, and part of learning theory. Increasingly, these techniques are used in combination to achieve significant improvement in performance and adaptability. Among the important application areas for soft computing are control systems, expert systems, data compression techniques, image processing, and decision support systems. It may be argued that it is soft computing, rather than the traditional hard computing, that should be viewed as the foundation for artificial intelligence. In the years ahead, this may well become a widely held position.

Zadeh, Lofti A.↗

MAGE: Alleviating Uncertainty in Real-Time Decision-Making as a Function of Problem Complexity

In this paper, we discuss a critical aspect of uncertainty in the operation of complex systems, such as the future air traffic: the ability of agents in the system to arrive at satisfactory decisions and the attendant actions as a function of problem complexity. Intuitively, when the problem complexity is manageable, given an appropriate decision problem formulation and solution tools, an agent (computational or human) has no trouble arriving at a solution that yields good outcomes for the agent and the system. Growing problem complexity results in progressively larger computational problems that may yield suboptimal solutions or even be intractable within required time limits or at all. We propose a measurable representation of complexity in terms of problem tractability and quality of solutions. We also propose a computational scheme, MAGE (Monitor, Anticipate, Guide, Evolve), for detecting approaching transitions from efficient decision-making states to inefficient to unsafe ones, so that operations based on decision-making can be reconfigured to forestall unfavorable transitions, returning to efficient modes when complexity diminishes. Maintaining tractable complexity reduces the uncertainty in the outcomes of decision-making. We describe the general scheme, an outline of MAGE applied to managing airspace complexity, and initial examples of investigating the tractability of problem-solving schemes.

complexity management↗

Quantum embedding theories to simulate condensed systems on quantum computers.

Quantum computers hold promise to improve the efficiency of quantum simulations of materials and to enable the investigation of systems and properties that are more complex than tractable at present on classical architectures. Here, we discuss computational frameworks to carry out electronic structure calculations of solids on noisy intermediate-scale quantum computers using embedding theories, and we give examples for a specific class of materials, that is, solid materials hosting spin defects. These are promising systems to build future quantum technologies, such as quantum computers, quantum sensors and quantum communication devices. Although quantum simulations on quantum architectures are in their infancy, promising results for realistic systems appear to be within reach.

Vorwerk, Christian↗

Scalable Techniques for Stochastic Power Flow Problems (Final Report)

The proposed research focuses on developing scalable algorithms for two-stage security-constrained OPF problems with AC power flow constraints, a class of problems complicated by (i) scale arising from a scenario representation; and (ii) the presence of nonlinearity, nonconvexity, and possibly second-stage discreteness or complementarity. Unfortunately, most existing solvers cannot contend with both challenges simultaneously; accordingly, the proposed research focuses on developing solution techniques that can both scale with the number of scenarios and contend with nonconvexity and second-stage complementarity. We consider three avenues for addressing such problems: (i) Variable sample-size SQP (VS-SQP) methods that combine sparse Quasi-Newton updates with a scalable variance-reduced stochastic gradient scheme for stochastic QP subproblems, allowing for contending with second-stage complementarity via regularization; (ii) Variable sample-size stochastic Interior-point (VS-sIP) schemes that propose a sampling-based regularized (to allow for contending with complementarity) interior-point schemes in which a Schur-complement technique is employed for decomposing the Newton direction computation step; (iii) Variable sample-size tractable ADMM (VS-tADMM) schemes combine variable sample-sizes with carefully designed techniques for resolving each of the nonconvex updates (by leveraging the QCQP structures). We intend to compare the three schemes using performance profiles in terms of solution quality, scalability, etc. and then select one scheme which will then be developed and further refined in Python for purposes of the GO competition.

42 ENGINEERING↗

A non-linear programming approach to the computer-aided design of regulators using a linear-quadratic formulation

A design technique is proposed for linear regulators in which a feedback controller of fixed structure is chosen to minimize an integral quadratic objective function subject to the satisfaction of integral quadratic constraint functions. Application of a non-linear programming algorithm to this mathematically tractable formulation results in an efficient and useful computer-aided design tool. Particular attention is paid to computational efficiency and various recommendations are made. Two design examples illustrate the flexibility of the approach and highlight the special insight afforded to the designer.

Fleming, P.↗

Systems, methods and apparatus for generation and verification of policies in autonomic computing systems

Described herein is a method that produces fully (mathematically) tractable development of policies for autonomic systems from requirements through to code generation. This method is illustrated through an example showing how user formulated policies can be translated into a formal mode which can then be converted to code. The requirements-based programming method described provides faster, higher quality development and maintenance of autonomic systems based on user formulation of policies.Further, the systems, methods and apparatus described herein provide a way of analyzing policies for autonomic systems and facilities the generation of provably correct implementations automatically, which in turn provides reduced development time, reduced testing requirements, guarantees of correctness of the implementation with respect to the policies specified at the outset, and provides a higher degree of confidence that the policies are both complete and reasonable. The ability to specify the policy for the management of a system and then automatically generate an equivalent implementation greatly improves the quality of software, the survivability of future missions, in particular when the system will operate untended in very remote environments, and greatly reduces development lead times and costs.

Hinchey, Michael G.↗

An application of nonlinear programming to the design of regulators of a linear-quadratic formulation

A design technique is proposed for linear regulators in which a feedback controller of fixed structure is chosen to minimize an integral quadratic objective function subject to the satisfaction of integral quadratic constraint functions. Application of a nonlinear programming algorithm to this mathematically tractable formulation results in an efficient and useful computer aided design tool. Particular attention is paid to computational efficiency and various recommendations are made. Two design examples illustrate the flexibility of the approach and highlight the special insight afforded to the designer. One concerns helicopter longitudinal dynamics and the other the flight dynamics of an aerodynamically unstable aircraft.

Fleming, P.↗

Generation of dynamo magnetic fields in protoplanetary and other astrophysical accretion disks

A computational method for treating the generation of dynamo magnetic fields in astrophysical disks is presented. The numerical difficulty of handling the boundary condition at infinity in the cylindrical disk geometry is overcome by embedding the disk in a spherical computational space and matching the solutions to analytically tractable spherical functions in the surrounding space. The lowest lying dynamo normal modes for a 'thick' astrophysical disk are calculated. The generated modes found are all oscillatory and spatially localized. Tha potential implications of the results for the properties of dynamo magnetic fields in real astrophysical disks are discussed.

Stepinski, T. F.↗

Geomagnetic Cutoff Rigidity Computer Program: Theory, Software Description and Example

The access of charged particles to the earth from space through the geomagnetic field has been of interest since the discovery of the cosmic radiation. The early cosmic ray measurements found that cosmic ray intensity was ordered by the magnetic latitude and the concept of cutoff rigidity was developed. The pioneering work of Stoermer resulted in the theory of particle motion in the geomagnetic field, but the fundamental mathematical equations developed have 'no solution in closed form'. This difficulty has forced researchers to use the 'brute force' technique of numerical integration of individual trajectories to ascertain the behavior of trajectory families or groups. This requires that many of the trajectories must be traced in order to determine what energy (or rigidity) a charged particle must have to penetrate the magnetic field and arrive at a specified position. It turned out the cutoff rigidity was not a simple quantity but had many unanticipated complexities that required many hundreds if not thousands of individual trajectory calculations to solve. The accurate calculation of particle trajectories in the earth's magnetic field is a fundamental problem that limited the efficient utilization of cosmic ray measurements during the early years of cosmic ray research. As the power of computers has improved over the decades, the numerical integration procedure has grown more tractable, and magnetic field models of increasing accuracy and complexity have been utilized. This report is documentation of a general FORTRAN computer program to trace the trajectory of a charged particle of a specified rigidity from a specified position and direction through a model of the geomagnetic field.

Smart, D. F.↗

Geomechanical response due to nonisothermal fluid injection into a reservoir

The geomechanical response of a porous reservoir due to injection of fluid can result from a complex interplay between the changes in porepressure and temperature near the wellbore. As a result, predictions are usually made using either simplified analytical models, which may apply unrealistic assumptions in order to produce a tractable model, or detailed numerical simulations that can be computationally expensive.

58 GEOSCIENCES↗

Wind turbine blade design with airfoil shape control using invertible neural networks

Wind turbine blade design is a highly multidisciplinary process that involves aerodynamics, structures, controls, manufacturing, costs, and other considerations. More efficient blade designs can be found by controlling the airfoil cross-sectional shapes simultaneously with the bulk blade twist and chord distributions. Prior work has focused on incorporating panel-based aerodynamic solvers with a blade design framework to allow for airfoil shape control within the design loop in a tractable manner. Including higher fidelity aerodynamic solvers, such as computational fluid dynamics, makes the design problem computationally intractable. In this work, we couple an invertible neural network trained on high-fidelity airfoil aerodynamic data to a turbine design framework to enable the design of airfoil cross sections within a larger blade design problem. We detail the methodology of this coupled framework and showcase its efficacy by aerostructurally redesigning the IEA 15-MW reference wind turbine blade. The coupled approach reduces the cost of energy by 0.9% compared to a more conventional design approach. This work enables the inclusion of high-fidelity aerodynamic data earlier in the design process, reducing cycle time and increasing certainty in the performance of the optimal design.

17 WIND ENERGY↗

Density Functional Tight-Binding Enables Tractable Studies of Quantum Plasmonics

Routine investigations of plasmonic phenomena at the quantum level present a formidable computational challenge due to the large system sizes and ultrafast time scales involved. This Feature Article highlights the use of density functional tight-binding (DFTB), particularly its real-time time-dependent formulation (RT-TDDFTB), as a tractable approach to study plasmonic nanostructures from a quantum mechanical purview. We begin by outlining the theoretical framework and limitations of DFTB, emphasizing its efficiency in modeling systems with thousands of atoms over picosecond time scales. Applications of RT-TDDFTB are then explored in the context of optical absorption, nonlinear harmonic generation, and plasmon-mediated photocatalysis. We demonstrate how DFTB can reconcile classical and quantum descriptions of plasmonic behavior, capturing key phenomena such as size-dependent plasmon shifts and plasmon coupling in nanoparticle assemblies. Lastly, we showcase DFTB’s ability to model hot carrier generation and reaction dynamics in plasmon-driven H2 dissociation, underscoring its potential to model photocatalytic processes. Collectively, these studies establish DFTB as a powerful, yet computationally efficient tool to probe the emergent physics of materials at the limits of space and time.

Electrical energy↗

QASMTrans: A QASM Quantum Transpiler Framework for NISQ Devices

In quantum computing, transpilation plays a crucial role in converting high-level, machine-independent quantum circuits into circuits specially for a quantum device, considering factors such as basis gate set, topology, error profile, etc. Yet, the efficiency of transpilation remains a significant bottleneck, particularly when dealing with very large QASM level input files. In this paper, we present QASMTrans, a C++ based high-performance quantum transpiler framework that can demonstrate on average 50-100× speedups compared to the internal transpiler of Qiskit. Particularly, for large dense circuits such as ’uccsd n24’ and ’qft n320’ incorporating millions of gates, QASMTrans can successfully transpile in 69s and 31s, respectively, while Qiskit failed to finish in one hour. Using QASMTrans as the baseline, it becomes more feasible to explore much larger design space and impose more comprehensive compiler optimizations.

Hua, Fei↗

A Multiscale Progressive Failure Modeling Methodology for Composites that Includes Fiber Strength Stochastics

A multiscale modeling methodology was developed for continuous fiber composites that incorporates a statistical distribution of fiber strengths into coupled multiscale micromechanics/finite element (FE) analyses. A modified two-parameter Weibull cumulative distribution function, which accounts for the effect of fiber length on the probability of failure, was used to characterize the statistical distribution of fiber strengths. A parametric study using the NASA Micromechanics Analysis Code with the Generalized Method of Cells (MAC/GMC) was performed to assess the effect of variable fiber strengths on local composite failure within a repeating unit cell (RUC) and subsequent global failure. The NASA code FEAMAC and the ABAQUS finite element solver were used to analyze the progressive failure of a unidirectional SCS-6/TIMETAL 21S metal matrix composite tensile dogbone specimen at 650 degC. Multiscale progressive failure analyses were performed to quantify the effect of spatially varying fiber strengths on the RUC-averaged and global stress-strain responses and failure. The ultimate composite strengths and distribution of failure locations (predominately within the gage section) reasonably matched the experimentally observed failure behavior. The predicted composite failure behavior suggests that use of macroscale models that exploit global geometric symmetries are inappropriate for cases where the actual distribution of local fiber strengths displays no such symmetries. This issue has not received much attention in the literature. Moreover, the model discretization at a specific length scale can have a profound effect on the computational costs associated with multiscale simulations.models that yield accurate yet tractable results.

Generalized Method of Cells↗