Search NASA⌕ Search

SEARCH · Search NASA

Results for “hypercube”

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 127 records · Page 7

Evaluating large scale aqueous organic redox flow battery performance with a hybrid numerical and machine learning framework

Aqueous organic redox flow battery (AORFB) is a promising cost-competitive technology for large-scale energy storage. Among existing work, the dihydroxyphenazine (DHP)-based AORFB has demonstrated high energy density and low-capacity degradation in 10 cm$^2$ cells during lab tests. However, its commercial-scale performance in more complex environments remains unknown, posing a barrier to commercialization. To address this gap, this work presents a comprehensive performance evaluation of a 780 cm$^2$ DHP-based AORFB by combining a physics-based numerical model, machine learning (ML)-based surrogate models, and ML-derived sensitivity quantification. Specifically, we first select 12 key battery parameters that include 10 physicochemical and 2 operation quantities, then select 6 performance metrics that include energy efficiency (EE), discharging capacity, charging energy, and power losses due to concentration, activation, and ohmic over-potentials. With such selection, 12800 combinations of the 12 parameters are subsequently generated using the Latin Hypercube Sampling method. Such combinations, together with 38 pre-defined State of Charge, are then integrated to a validated AORFB model developed in COMSOL to compute the performance metrics. With both input parameters and performance metrics, 60 deep neural network (DNN) surrogate models are then trained to approximate the relationship between the 10 physicochemical quantities and 6 performance metrics at each flow rate and current density. Sensitivity scores are then calculated based on the DNN models. Two additional sensitivity analysis tools, i.e., MARS, and SHAP, are also used to cross-validate the sensitivity scores from the DNN. The results demonstrate that 1) the standard potential ranks first in controlling EE and charging energy, 2) the membrane conductivity is most critical for power loss and EE, and 3) specific area and reaction rate control activation power loss.

25 ENERGY STORAGE↗

Systems Analysis of Biomass and Coal Co-firing Power Plants with Deep Carbon Capture Toward Net-zero Emissions

Achieving a net-zero emission economy in the United States requires integrating diverse low-carbon and negative-emission technologies into the existing fossil fuel-dominant power fleet. Potential technologies from the low-carbon portfolio include renewable power, fossil power with carbon capture and storage (CCS), bioenergy with CCS (BECCS), and direct air capture (DAC). Renewable power is a clean energy source but has to pair with costly battery storage to provide dispatchable electricity. Fossil power with CCS offers dispatchable electricity yet still relies on DAC to offset residual emissions, even when deploying deep CCS with more than 90% CO2 capture. Coal-biomass co-firing with CCS, a subset of BECCS, is a reliable energy production technology that can be retrofitted from existing electricity generation units (EGUs). Power plant retrofit maximizes the use of the current U.S. coal power fleet without the need for large-scale deployment of new renewable power, battery storage, or DAC. Retrofitting coal-biomass co-firing with deep CCS in EGUs is a promising option, but not a universal solution. Biomass co-firing at a power plant introduces economic challenges and indirectly poses pressure on land and water resources. Meanwhile, retrofitting deep CCS affects plant efficiency and raises electricity generation costs. Overall, the technical feasibility and economic viability of plant retrofits vary across EGUs, as they are contingent upon the regional availability of biomass, unit-specific characteristics, site-specific fuel supply costs, and adjacent CO2 storage potential. Government incentives like 45Q can improve the retrofit viability, though the impact requires further quantification. A comprehensive analysis at the unit level is essential to address the question regarding the fate of the U.S. coal-fired electricity generation fleet toward the net-zero emission goal. This study conducts a systematic techno-economic-environmental assessment of EGUs to identify the viability of biomass co-firing and deep CCS retrofits in the U.S. coal-fired power fleet. Specifically, it characterizes the techno-economic performance of deep carbon capture, estimates life cycle greenhouse gas (GHG) emissions, and conducts a fleet-level assessment on retrofit viability. The key objectives are (1) to estimate the unit-specific performance and retrofitted cost under various biomass co-firing levels and CO2 capture rates; (2) to determine the possibility of reaching net-zero emission at the fleet level; (3) to quantify the cumulative capacities that are suitable for plant retrofits under current and future biomass supply scenarios; and (4) to improve the understanding of policy impacts on such retrofits to help the power sector’s transition to a net-zero economy. Techno-economic Model of Deep Carbon Capture. This study develops the performance and economic models for Monoethanolamine-based post-combustion CO2 capture at 95–99% capture rates. The process is simulated in Aspen Plus, analyzing the performance of carbon capture technology by varying the plant sizes, solvent lean loading, CO2 concentrations, and flue gas inlet temperature. Based on the key inputs and output parameters of CO2 capture, a reduced-order performance model of deep carbon capture is formulated. In addition, an engineering-economic model integrating the performance metrics is developed to estimate the capital as well as operation and maintenance (O&M) costs. Capital cost estimations follow the framework of the Integrated Environmental Control Model (IECM) and incorporate data regressions from three technical reports by IECM, the National Energy Technology Laboratory (NETL), and the National Renewable Energy Laboratory. The O&M cost estimation utilizes the actual inventory consumption rate and labor requirements. Both performance and cost models are embedded into IECM v13.0-beta, a fossil-fuel power plant modeling tool. Life Cycle Assessment of Power Plants. This study estimates the GHG emissions of power plants through life cycle assessment (LCA). The LCA scope includes fuel supply, combustion-based power generation, and CO2 transport and storage. The fuel-based life cycle module is designed following the framework of the NETL Unit Process Library and CO2U LCA Guidance Toolkit. The module is then incorporated into IECM v13.0-beta. The process-based LCA is applied to estimate the GHG emissions of coal and biomass supply, coal- and coal-biomass co-firing power plant operation, as well as CO2 pipeline transport and geographical sequestration. An uncertainty analysis is conducted to quantify the variability and uncertainty associated with the LCA using the Latin Hypercube Sampling (LHS) method. Fleet-level Assessment. This study evaluates the technical and economic feasibility of selected coal-fired EGUs, examines the role of tax credits in retrofit viability, and assesses the competitiveness of retrofitted units against other low-carbon options. Unit screening identifies EGUs for the study, focusing on new, efficient baseload units with air pollution controls. The power plant databases are then established to organize unit-specific information on performance and operating conditions from the relevant public databases. Biomass for co-firing retrofits is selected based on home and neighboring county availability, ensuring sustained operation with at least a 5% co-firing level. The CO2 storage site is determined by state-level storage potential, with ArcGIS Pro and NETL CO2 Saline Storage Cost Model used to identify the optimal balance between the nearest transport distances and affordable storage costs. The latest IECM v13.0-beta is then employed to configure and evaluate the eligible EGUs with or without the deployment of deep CCS and biomass co-firing. A supply curve is established to illustrate the cumulative installed capacity suitable for retrofits at different cost levels. A sensitivity analysis on tax credits for carbon sequestration is performed. Finally, a unit-level cost comparison is conducted among retrofitted plants, renewable power with battery storage, and abated fossil fuels with DAC. Expected Results. This study evaluates the technical, economic, and environmental metrics of each EGU across an array of CO2 capture rates and biomass co-firing level scenarios. Unit-level comparisons will identify critical factors influencing technical performance. The supply curves with and without tax incentives will provide insights into the impact of tax credits on biomass co-firing and CCS deployment. The cost comparisons with renewables and DAC-retrofit will assess the competitiveness of the retrofitted units. Life cycle emissions from each unit will be assessed to identify the scenarios under which net-zero emissions can be achieved. These analyses are expected to determine the total coal-fired capacity suitable for serving as a low-carbon energy source with or without tax incentives. The study results are novel in identifying optimal unit-specific strategies for producing carbon-neutral power, whether through retrofitting EGUs with deep CCS, biomass co-firing, DAC, or installing renewable power with battery. The findings will provide insight into nationwide efforts to ensure reliable, affordable, and low-carbon electricity. It also will inform investment decisions and policies in the deployment of deep carbon capture and negative emission technologies for a net-zero energy future.

Biomass Co-firing↗

An extensible perturbed parameter ensemble for the Community Atmosphere Model version 6

This paper documents the methodology and preliminary results from a perturbed parameter ensemble (PPE) technique, where multiple parameters are varied simultaneously and the parameter values are determined with Latin hypercube sampling. This is done with the Community Atmosphere Model version 6 (CAM6), the atmospheric component of the Community Earth System Model version 2 (CESM2). We apply the PPE method to CESM2–CAM6 to understand climate sensitivity to atmospheric physics parameters. The initial simulations vary 45 parameters in the microphysics, convection, turbulence and aerosol schemes with 263 ensemble members. These atmospheric parameters are typically the most uncertain in many climate models. Control simulations and targeted simulations to understand climate forcing due to aerosols and fast climate feedbacks are analyzed. The use of various emulators is explored in the multi-dimensional space mapping input parameters to output metrics. Parameter impacts on various model outputs, such as radiation, cloud and aerosol properties, are evaluated. Machine learning is also used to probe optimal parameter values against observations. Our findings show that PPE is a valuable tool for climate uncertainty analysis. Furthermore, by varying many parameters simultaneously, we find that many different combinations of parameter values can produce results consistent with observations, and thus careful analysis of tuning is important. The CESM2–CAM6 PPE is publicly available and extensible to other configurations to address questions of other model processes in the atmosphere and other model components (e.g., coupling to the land surface).

54 ENVIRONMENTAL SCIENCES↗

Finite elements and the method of conjugate gradients on a concurrent processor

An algorithm for the iterative solution of finite element problems on a concurrent processor is presented. The method of conjugate gradients is used to solve the system of matrix equations, which is distributed among the processors of a MIMD computer according to an element-based spatial decomposition. This algorithm is implemented in a two-dimensional elastostatics program on the Caltech Hypercube concurrent processor. The results of tests on up to 32 processors show nearly linear concurrent speedup, with efficiencies over 90% for sufficiently large problems.

Lyzenga, G. A.↗

NASA image-based geological expert system development project for hyperspectral image analysis

The NASA image-based geological expert system was applied to analyze remotely sensed hyperspectral image data. The major objective is for geologists to identify the earth surface mineral properties directly from the airborne and spaceborne imaging spectrometer data. With certain constraints, it is shown that the system can identify correctly different classes of mineral. It has the built-in learning paradigm to enhance the confidence factor of mineral identification. A very powerful natural language system was incorporated as the user-friendly front end, and the concurrent processing efficiency of the frame-based knowledge representation in the hypercube microsupercomputer simulation was tested.

Chiou, W. C., Sr.↗

The science of computing - Parallel computation

Although parallel computation architectures have been known for computers since the 1920s, it was only in the 1970s that microelectronic components technologies advanced to the point where it became feasible to incorporate multiple processors in one machine. Concommitantly, the development of algorithms for parallel processing also lagged due to hardware limitations. The speed of computing with solid-state chips is limited by gate switching delays. The physical limit implies that a 1 Gflop operational speed is the maximum for sequential processors. A computer recently introduced features a 'hypercube' architecture with 128 processors connected in networks at 5, 6 or 7 points per grid, depending on the design choice. Its computing speed rivals that of supercomputers, but at a fraction of the cost. The added speed with less hardware is due to parallel processing, which utilizes algorithms representing different parts of an equation that can be broken into simpler statements and processed simultaneously. Present, highly developed computer languages like FORTRAN, PASCAL, COBOL, etc., rely on sequential instructions. Thus, increased emphasis will now be directed at parallel processing algorithms to exploit the new architectures.

Denning, P. J.↗

A partitioning strategy for nonuniform problems on multiprocessors

The partitioning of a problem on a domain with unequal work estimates in different subddomains is considered in a way that balances the work load across multiple processors. Such a problem arises for example in solving partial differential equations using an adaptive method that places extra grid points in certain subregions of the domain. A binary decomposition of the domain is used to partition it into rectangles requiring equal computational effort. The communication costs of mapping this partitioning onto different microprocessors: a mesh-connected array, a tree machine and a hypercube is then studied. The communication cost expressions can be used to determine the optimal depth of the above partitioning.

Berger, M. J.↗

The Caltech Concurrent Computation Program - Project description

The Caltech Concurrent Computation Program wwhich studies basic issues in computational science is described. The research builds on initial work where novel concurrent hardware, the necessary systems software to use it and twenty significant scientific implementations running on the initial 32, 64, and 128 node hypercube machines have been constructed. A major goal of the program will be to extend this work into new disciplines and more complex algorithms including general packages that decompose arbitrary problems in major application areas. New high-performance concurrent processors with up to 1024-nodes, over a gigabyte of memory and multigigaflop performance are being constructed. The implementations cover a wide range of problems in areas such as high energy and astrophysics, condensed matter, chemical reactions, plasma physics, applied mathematics, geophysics, simulation, CAD for VLSI, graphics and image processing. The products of the research program include the concurrent algorithms, hardware, systems software, and complete program implementations.

Fox, G.↗

Finite elements and the method of conjugate gradients on a concurrent processor

An algorithm for the iterative solution of finite element problems on a concurrent processor is presented. The method of conjugate gradients is used to solve the system of matrix equations, which is distributed among the processors of a MIMD computer according to an element-based spatial decomposition. This algorithm is implemented in a two-dimensional elastostatics program on the Caltech Hypercube concurrent processor. The results of tests on up to 32 processors show nearly linear concurrent speedup, with efficiencies over 90 percent for sufficiently large problems.

Lyzenga, G. A.↗

Parallel Algorithm Solves Coupled Differential Equations

Numerical methods adapted to concurrent processing. Algorithm solves set of coupled partial differential equations by numerical integration. Adapted to run on hypercube computer, algorithm separates problem into smaller problems solved concurrently. Increase in computing speed with concurrent processing over that achievable with conventional sequential processing appreciable, especially for large problems.

Hayashi, A.↗

Algorithm implementation on the Navier-Stokes computer

The Navier-Stokes Computer is a multi-purpose parallel-processing supercomputer which is currently under development at Princeton University. It consists of multiple local memory parallel processors, called Nodes, which are interconnected in a hypercube network. Details of the procedures involved in implementing an algorithm on the Navier-Stokes computer are presented. The particular finite difference algorithm considered in this analysis was developed for simulation of laminar-turbulent transition in wall bounded shear flows. Projected timing results for implementing this algorithm indicate that operation rates in excess of 42 GFLOPS are feasible on a 128 Node machine.

Krist, Steven E.↗

Analysis of a parallelized nonlinear elliptic boundary value problem solver with application to reacting flows

A parallelized finite difference code based on the Newton method for systems of nonlinear elliptic boundary value problems in two dimensions is analyzed in terms of computational complexity and parallel efficiency. An approximate cost function depending on 15 dimensionless parameters is derived for algorithms based on stripwise and boxwise decompositions of the domain and a one-to-one assignment of the strip or box subdomains to processors. The sensitivity of the cost functions to the parameters is explored in regions of parameter space corresponding to model small-order systems with inexpensive function evaluations and also a coupled system of nineteen equations with very expensive function evaluations. The algorithm was implemented on the Intel Hypercube, and some experimental results for the model problems with stripwise decompositions are presented and compared with the theory. In the context of computational combustion problems, multiprocessors of either message-passing or shared-memory type may be employed with stripwise decompositions to realize speedup of O(n), where n is mesh resolution in one direction, for reasonable n.

Keyes, David E.↗

Two-dimensional nonsteady viscous flow simulation on the Navier-Stokes computer miniNode

The needs of large-scale scientific computation are outpacing the growth in performance of mainframe supercomputers. In particular, problems in fluid mechanics involving complex flow simulations require far more speed and capacity than that provided by current and proposed Class VI supercomputers. To address this concern, the Navier-Stokes Computer (NSC) was developed. The NSC is a parallel-processing machine, comprised of individual Nodes, each comparable in performance to current supercomputers. The global architecture is that of a hypercube, and a 128-Node NSC has been designed. New architectural features, such as a reconfigurable many-function ALU pipeline and a multifunction memory-ALU switch, have provided the capability to efficiently implement a wide range of algorithms. Efficient algorithms typically involve numerically intensive tasks, which often include conditional operations. These operations may be efficiently implemented on the NSC without, in general, sacrificing vector-processing speed. To illustrate the architecture, programming, and several of the capabilities of the NSC, the simulation of two-dimensional, nonsteady viscous flows on a prototype Node, called the miniNode, is presented.

Nosenchuck, Daniel M.↗

A partitioning strategy for nonuniform problems on multiprocessors

The partitioning of a problem on a domain with unequal work estimates in different subdomains is considered in a way that balances the work load across multiple processors. Such a problem arises for example in solving partial differential equations using an adaptive method that places extra grid points in certain subregions of the domain. A binary decomposition of the domain is used to partition it into rectangles requiring equal computational effort. The communication costs of mapping this partitioning onto different microprocessors: a mesh-connected array, a tree machine and a hypercube is then studied. The communication cost expressions can be used to determine the optimal depth of the above partitioning.

Berger, Marsha J.↗

Simulations of transition and turbulence on the Navier-Stokes computer

The Navier-Stokes Computer (NSC) consists of multiple local memory parallel processors interconnected in a hypercube network. Efficient implementation of algorithms on the NSC thus requires the effective utilization of both the coarse and fine grain paralelism inherent in the architectural design. The basic approach to implementing an algorithm on the NSC is presented herein. The particular finite-difference algorithm considered was developed for performing transition and turbulence simulations by direct solution of the time-dependent incompressible Navier-Stokes equations. The suitability of this algorithm for performing simulations of the isotropic turbulence problem is verified from computations performed on a Cray 2. Projected timing results for the algorithm on the NSC itself are presented for both the isotropic turbulence and laminar turbulent transition problems.

Krist, S. E.↗

Experiences with serial and parallel algorithms for channel routing using simulated annealing

Two algorithms for channel routing using simulated annealing are presented. Simulated annealing is an optimization methodology which allows the solution process to back up out of local minima that may be encountered by inappropriate selections. By properly controlling the annealing process, it is very likely that the optimal solution to an NP-complete problem such as channel routing may be found. The algorithm presented proposes very relaxed restrictions on the types of allowable transformations, including overlapping nets. By freeing that restriction and controlling overlap situations with an appropriate cost function, the algorithm becomes very flexible and can be applied to many extensions of channel routing. The selection of the transformation utilizes a number of heuristics, still retaining the pseudorandom nature of simulated annealing. The algorithm was implemented as a serial program for a workstation, and a parallel program designed for a hypercube computer. The details of the serial implementation are presented, including many of the heuristics used and some of the resulting solutions.

Brouwer, Randall Jay↗

Networking and AI systems: Requirements and benefits

The price performance benefits of network systems is well documented. The ability to share expensive resources sold timesharing for mainframes, department clusters of minicomputers, and now local area networks of workstations and servers. In the process, other fundamental system requirements emerged. These have now been generalized with open system requirements for hardware, software, applications and tools. The ability to interconnect a variety of vendor products has led to a specification of interfaces that allow new techniques to extend existing systems for new and exciting applications. As an example of the message passing system, local area networks provide a testbed for many of the issues addressed by future concurrent architectures: synchronization, load balancing, fault tolerance and scalability. Gold Hill has been working with a number of vendors on distributed architectures that range from a network of workstations to a hypercube of microprocessors with distributed memory. Results from early applications are promising both for performance and scalability.

Source record↗