Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel methods”

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

DIVA/DeviceEditor v6.1.2

DIVA is an end-to-end DNA design and construction management platform that streamlines how researchers design, build, and receive sequence-verified DNA constructs. Through a web-based BioCAD interface (DeviceEditor), researchers independently design DNA constructs and submit them to a centralized queue with a single action. Designs progress transparently through standardized states which allow researchers to track status and access finished constructs via a central DNA repository. Submitted designs are reviewed by dedicated staff for feasibility and optimization, reducing costly failures and improving downstream execution. Automated DNA assembly software optimizes construction strategies by reusing existing parts where possible and sourcing synthetic DNA only when needed. Standardized, sequence-agnostic assembly methods enable many independent constructs to be built in parallel using lab automation, dramatically increasing throughput. High-throughput next-generation sequencing is used to verify construct accuracy, with flexible platforms selected based on task requirements. Throughout the process, detailed success and failure data are captured and analyzed, enabling continuous improvement of assembly protocols. Compared to traditional, manual DNA construction workflows, DIVA offers higher scalability, transparency, reproducibility, and data-driven optimization.

Plahar, Hector [Lawrence Berkeley National Laborat↗

Scalable Second Order Optimization for Machine Learning

Many machine learning (ML) training tasks are essentially optimization processes that would at first glance appear eminently parallelizable and scalable. However, effective acceleration of these tasks with scalable parallel hardware has proven to be elusive. While standard methods for machine learning, e.g., stochastic gradient descent (SGD) for DNNs, tend to be resource efficient, they appear to be fundamentally sequential in nature.

97 MATHEMATICS AND COMPUTING↗

Machine Committee Framework for Power Grid Disturbances Analysis Using Synchrophasors Data

Events detection is a key challenge in power grid frequency disturbances analysis. Accurate detection of events is crucial for situational awareness of the power system. In this paper, we study the problem of events detection in power grid frequency disturbance analysis using synchrophasors data streams. Current events detection approaches for power grid rely on individual detection algorithm. This study integrates some of the existing detection algorithms using the concept of machine committee to develop improved detection approaches for grid disturbance analysis. Specifically, we propose two algorithms—an Event Detection Machine Committee (EDMC) algorithm and a Change-Point Detection Machine Committee (CPDMC) algorithm. Both algorithms use parallel architecture to fuse detection knowledge of its individual methods to arrive at an overall output. The EDMC algorithm combines five individual event detection methods, while the CPDMC algorithm combines two change-point detection methods. Each method performs the detection task separately. The overall output of each algorithm is then computed using a voting strategy. The proposed algorithms are evaluated using three case studies of actual power grid disturbances. Compared with the individual results of the various detection methods, we found that the EDMC algorithm is a better fit for analyzing synchrophasors data; it improves the detection accuracy; and it is suitable for practical scenarios.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Fast and sensitive measurements of sub-3 nm particles using Condensation Particle Counters For Atmospheric Rapid Measurements (CPC FARM)

New particle formation (NPF) is the atmospheric process whereby gas molecules react and nucleate to form detectable particles. NPF has a strong impact on Earth's radiative balance as it produces roughly half of global cloud condensation nuclei. However, the time resolution and sensitivity of current instrumentation are inadequate in measuring the size distribution of sub-3 nm particles, the particles critical for understanding NPF. Here we present the Condensation Particle Counters For Atmospheric Rapid Measurements (CPC FARM), a method to measure the concentrations of freshly nucleated particles. The CPC FARM consists of five CPCs operating in parallel, each configured to operate at different detectable particle sizes between 1–3 nm. This study explores two methods to calculate the size distribution from the differential measurements across the CPC channels. The performance of both inversion methods was tested against the size distribution measured by a pair of stepping particle mobility sizers (SMPSs) during an ambient air sampling study in Pittsburgh, PA. Observational results indicate that the CPC FARM is more accurate with higher time resolution and sensitivity in the sub-3 nm range compared to the SMPS.

Cheng, Darren [Carnegie Mellon Univ., Pittsburgh, ↗

Variance reduction in Monte Carlo analysis of rarefied gas diffusion

The present analysis uses the Monte Carlo method to solve the problem of rarefied diffusion between parallel walls. The diffusing molecules are evaporated or emitted from one of two parallel walls and diffused through another molecular species. The analysis treats the diffusing molecule as undergoing a Markov random walk and the local macroscopic properties are found as the expected value of the random variable, the random walk payoff. By biasing the transition probabilities and changing the collision payoffs the expected Markov walk payoff is retained but its variance is reduced so that the M. C. result has a much smaller error.

Perlmutter, M.↗

On the inversion of block tridiagonals without storage constraints

A strategy was developed to permit trade-offs between the number of floating point operations required and the storage requirements for the solution of certain difference problems, such as block tridiagonal systems of equations. This is done by recomputing some intermediate results instead of storing them. Reducing the storage to the square root of the current requirement roughly doubles the number of computations. Reducing the storage more than this tends to make the number of computations prohibitively large. In theory, if m is the order of each sub-matrix in the block tridiagonal matrix, one can solve any linear system with only 5m(2) + 1 temporary storage cells. In many cases m is a constant and quite small. For example, in solving a factored form of the three-dimensional Navier-Stokes equations, the size m of the block tridiagonals is 5. This method lends itself to efficient use on computers with parallel processing or vector processing architectures. On these computers the larger number of floating point operations is more than offset by the decrease in I/O and the increased percentage of vector operations made possible by this algorithm.

Merriam, M. L.↗

On the factorization of block-tridiagonals without storage constraints

In many programs solving difference equations, problem size is restricted by the number of available memory cells. A strategy has been developed to permit trade-offs between the number of floating point operations required and storage requirements for the solution of certain problems such as block tridiagonal systems of equations. This is done by recomputing some intermediate results instead of storing them. Reducing the storage to the square root of the current requirement will roughly double the number of computations. In theory, if m is the order of each sub-matrix in the block tridiagonal matrix, one can solve any linear system with only 5 sq m + 1 temporary storage cells. This method lends itself to efficient use on computers with parallel processing or vector processing architectures. On these computers the larger number of floating point operations is more than offset by the decrease in I/O and the increased percentage of vector operations made possible by this algorithm.

Merriam, M. L.↗

Advances and trends in structures and dynamics; Proceedings of the Symposium, Washington, DC, October 22-25, 1984

Among the topics discussed are developments in structural engineering hardware and software, computation for fracture mechanics, trends in numerical analysis and parallel algorithms, mechanics of materials, advances in finite element methods, composite materials and structures, determinations of random motion and dynamic response, optimization theory, automotive tire modeling methods and contact problems, the damping and control of aircraft structures, and advanced structural applications. Specific topics covered include structural design expert systems, the evaluation of finite element system architectures, systolic arrays for finite element analyses, nonlinear finite element computations, hierarchical boundary elements, adaptive substructuring techniques in elastoplastic finite element analyses, automatic tracking of crack propagation, a theory of rate-dependent plasticity, the torsional stability of nonlinear eccentric structures, a computation method for fluid-structure interaction, the seismic analysis of three-dimensional soil-structure interaction, a stress analysis for a composite sandwich panel, toughness criterion identification for unidirectional composite laminates, the modeling of submerged cable dynamics, and damping synthesis for flexible spacecraft structures.

Noor, A. K.↗

Earth's compressional foreshock boundary revisited Observations by the ISEE 1 magnetometer

A 'solar foreshock coordinate' (SFC) system is introduced in which the positions of foreshock components can be collated with a minimum of assumptions about the physical processes involved. Location behind the interplanetary magnetic field (IMF) tangent surface to the bow shock and rotational symmetry around the solar wind flow (X) axis are the only presuppositions. The SFC system has been applied to over 300 observations of the boundary of the ULF compressional waves recorded by ISEE 1's magnetometer in 1978 and 1979. The boundary locations form a coherent pattern in the SFC frame. A selection of those cases for which the cone angle of the IMF was between 40 and 50 deg, corresponding to the average stream angle, yields a least square line whose mapping back to the solar ecliptic coordinates frame has slope of about 85 deg, very close to that of the tangent ULF boundary deduced earlier from more primitive methods with entirely different data sets. The line, being parallel to neither the IMF, the typical reflected beam, nor the shock, cannot be compatible with any model of wave production by beam-solar wind interaction that depends on uniform beam distribution or fixed growth rate. Rather, its tangency suggests the influence of a separate, escaping ion population.

Greenstadt, E. W.↗

Fast simulation techniques for switching converters

Techniques for simulating a switching converter are examined. The state equations for the equivalent circuits, which represent the switching converter, are presented and explained. The uses of the Newton-Raphson iteration, low ripple approximation, half-cycle symmetry, and discrete time equations to compute the interval durations are described. An example is presented in which these methods are illustrated by applying them to a parallel-loaded resonant inverter with three equivalent circuits for its continuous mode of operation.

King, Roger J.↗

Application of the p-version of the finite-element method to global-local problems

A brief survey is given of some recent developments in finite-element analysis technology which bear upon the three main research areas under consideration in this workshop: (1) analysis methods; (2) software testing and quality assurance; and (3) parallel processing. The variational principle incorporated in a finite-element computer program, together with a particular set of input data, determines the exact solution corresponding to that input data. Most finite-element analysis computer programs are based on the principle of virtual work. In the following, researchers consider only programs based on the principle of virtual work and denote the exact displacement vector field corresponding to some specific set of input data by vector u(EX). The exact solution vector u(EX) is independent of the design of the mesh or the choice of elements. Except for very simple problems, or specially constructed test problems, vector u(EX) is not known. Researchers perform a finite-element analysis (or any other numerical analysis) because they wish to make conclusions concerning the response of a physical system to certain imposed conditions, as if vector u(EX) were known.

Szabo, Barna A.↗

A block-based algorithm for the solution of compressible flows in rotor-stator combinations

A block-based solution algorithm is developed for the solution of compressible flows in rotor-stator combinations. The method allows concurrent solution of multiple solution blocks in parallel machines. It also allows a time averaged interaction at the stator-rotor interfaces. Numerical results are presented to illustrate the performance of the algorithm. The effect of the interaction between the stator and rotor is evaluated.

Akay, H. U.↗

A nonrecursive 'Order N' preconditioned conjugate gradient/range space formulation of MDOF dynamics

This paper addresses the requirements of present-day mechanical system simulations of algorithms that induce parallelism on a fine scale and of transient simulation methods which must be automatically load balancing for a wide collection of system topologies and hardware configurations. To this end, a combination range space/preconditioned conjugage gradient formulation of multidegree-of-freedon dynamics is developed, which, by employing regular ordering of the system connectivity graph, makes it possible to derive an extremely efficient preconditioner from the range space metric (as opposed to the system coefficient matrix). Because of the effectiveness of the preconditioner, the method can achieve performance rates that depend linearly on the number of substructures. The method, termed 'Order N' does not require the assembly of system mass or stiffness matrices, and is therefore amenable to implementation on work stations. Using this method, a 13-substructure model of the Space Station was constructed.

Kurdila, A. J.↗

Discrete ordinate solution of the radiative transfer equation in the 'polarization normal wave representation'

The transfer equations for normal waves in finite, inhomogeneous and plane-parallel magnetoactive media are solved using the discrete ordinate method. The physical process of absorption, emission, and multiple scattering are accounted for, and the medium may be forced both at the top and bottom boundary by anisotropic radiation as well as by internal anisotropic sources. The computational procedure is numerically stable for arbitrarily large optical depths, and the computer time is independent of optical thickness.

Kylling, A.↗

Heat transfer in a discrete-velocity gas

Heat transfer of a discrete-velocity gas composed of identical hard sphere molecules between two parallel plates is studied numerically. A finite-difference method recently developed by the authors is used for solving the discrete Boltzmann equations. The temperature distributions between the plates of temperature ratios 2.0 and 4.0, and the heat transfer of temperature ratio 4.0 are presented and are compared with results of other methods.

Inamuro, Takaji↗

Concerning the flow about ring-shaped cowlings of finite thickness Part I

It is shown how one may obtain, in a simple manner, the forms of ring-shaped bodies from existing tables of functions according to the customary method of superposition of flow due to singularities and parallel flow. A number of examples of the forms and pressure distributions of annular source bodies with and without hub body are given, and the inlet conditions of such ring-shaped cowlings are investigated. Furthermore, the annular bodies of finite length are indicated that correspond to Joukowsky profiles for the two-dimensional case. The examples are to give a basis for the design of cross-sectional forms of ring-shaped cowlings and a survey of the flows to be expected.

FLOW, INCOMPRESSIBLE↗

Parallel rendering

This article provides a broad introduction to the subject of parallel rendering, encompassing both hardware and software systems. The focus is on the underlying concepts and the issues which arise in the design of parallel rendering algorithms and systems. We examine the different types of parallelism and how they can be applied in rendering applications. Concepts from parallel computing, such as data decomposition, task granularity, scalability, and load balancing, are considered in relation to the rendering problem. We also explore concepts from computer graphics, such as coherence and projection, which have a significant impact on the structure of parallel rendering algorithms. Our survey covers a number of practical considerations as well, including the choice of architectural platform, communication and memory requirements, and the problem of image assembly and display. We illustrate the discussion with numerous examples from the parallel rendering literature, representing most of the principal rendering methods currently used in computer graphics.

Crockett, Thomas W.↗

Experimental testing using a remotely operated flap with a 2D high lift model

The problem of efficient wind tunnel testing for multi-element airfoils was first addressed by the author during a previous ASEE fellowship. A modern three element model with internal actuators to position a flap in two degrees of freedom was designed and later built. Some preliminary testing proved that the approach was viable. The purpose of this summer's work was to fully develop experimental methods including efficient data acquisition. The final goal is to develop dense data sets for both lift and drag measurements as a function of flap position for both take-off and landing configurations. The model has a span of 36 in. and chord of 18 in. and is currently being fitted for a 3 ft. x 4 ft. low speed wind tunnel. The flap was reworked to allow all pressure taps to function after initial tests showed two blocked ports. The serial method of obtaining pressures from the surface taps was found to be exceedingly slow so a new method using 12 pressure transducers and a 12 port parallel scanning valve were developed. A new automated data acquisition and control algorithm was developed using LabView software and a PC platform. Flow two-dimensionality is currently under investigation with boundary layer control by blowing; this was previously omitted for initial testing. By the end of the summer a detailed data set (uncorrected) consisting of lift coefficient versus flap position for the landing configuration should be available.

Landman, Drew↗