Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Flow routing”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRS2020

Intercomparison of surface meltwater routing models for the Greenland ice sheet and influence on subglacial effective pressures

Each summer, large volumes of surface meltwater drain off the Greenland ice sheet (GrIS) surface through moulins to the bed, impacting subglacial hydrology and ice flow dynamics. Supraglacial surface routing delays may propagate to englacial and subglacial hydrologic systems, requiring accurate assessment to correctly estimate subglacial effective pressures. We compare hourly supraglacial moulin discharge simulations from three surface meltwater routing models – the synthetic unit hydrograph (SUH), the bare-ice component of surface routing and lake filling (SRLF), and the rescaled width function (RWF) – for four internally drained catchments on the southwestern Greenland ice sheet surface. The routing models are forced identically using surface runoff from the Modèle Atmosphérique Régionale regional climate model (RCM). For each catchment, simulated moulin hydrographs are input to the SHAKTI subglacial hydrologic model to simulate diurnally varying subglacial effective-pressure variations in the vicinity of a single moulin. Overall, all three routing models produce more realistic moulin discharges than simply using RCM runoff outputs without surface routing but produce significant differences in peak moulin discharge and time to peak. In particular, the RWF yields later, smaller peak moulin discharges than the SUH or SRLF due to its representation of slow interfluve flow between supraglacial meltwater channels, and it can readily accommodate the seasonal evolution of supraglacial stream and river networks. Differences among the three routing models are reflected in a series of simple idealized subglacial hydrology simulations that yield different diurnal effective-pressure amplitudes; however, the supraglacial hydrologic system acts as short-term storage for surface meltwater, and the temporal mean effective pressure is relatively consistent across routing models.

Kang Yang↗
NASA NTRS1994

Continental-scale river flow in climate models

The hydrologic cycle is a major part of the global climate system. There is an atmospheric flux of water from the ocean surface to the continents. The cycle is closed by return flow in rivers. In this paper a river routing model is developed to use with grid box climate models for the whole earth. The routing model needs an algorithm for the river mass flow and a river direction file, which has been compiled for 4 deg x 5 deg and 2 deg x 2.5 deg resolutions. River basins are defined by the direction files. The river flow leaving each grid box depends on river and lake mass, downstream distance, and an effective flow speed that depends on topography. As input the routing model uses monthly land source runoff from a 5-yr simulation of the NASA/GISS atmospheric climate model (Hansen et al.). The land source runoff from the 4 deg x 5 deg resolution model is quartered onto a 2 deg x 2.5 deg grid, and the effect of grid resolution is examined. Monthly flow at the mouth of the world's major rivers is compared with observations, and a global error function for river flow is used to evaluate the routing model and its sensitivity to physical parameters. Three basinwide parameters are introduced: the river length weighted by source runoff, the turnover rate, and the basinwide speed. Although the values of these parameters depend on the resolution at which the rivers are defined, the values should converge as the grid resolution becomes finer. When the routing scheme described here is coupled with a climate model's source runoff, it provides the basis for closing the hydrologic cycle in coupled atmosphere-ocean models by realistically allowing water to return to the ocean at the correct location and with the proper magnitude and timing.

Miller, James R.↗
DOE OSTI2023

Non-unimodal and non-concave relationships in the network Macroscopic Fundamental Diagram caused by hierarchical streets

Unimodal, concave relationships between average network productivity and accumulation or density aggregated across spatially compact regions of urban networks—so called network Macroscopic Fundamental Diagrams (MFDs)—have recently been shown to exist on homogeneous street networks. When present, MFD relationships facilitate the modeling of traffic congestion at a regional level and have led to the development of various regional traffic control strategies. However, real street networks are not homogeneous—they generally have a hierarchical structure where some streets (e.g., arterials) promote higher mobility than others (e.g., local roads). Here, this paper examines how the presence of hierarchical roadway structures may potentially cause non-unimodal patterns in a network's MFD. These are observed using three types of tools: analytical models of simple network structures, simulations of various idealized roadway networks, and empirical data. The impacts of street hierarchy depend on how vehicles use different roadway types to move within the network; i.e., their routing strategy. The findings suggest that the presence of roadway hierarchies may lead to MFDs that have non-unimodal or non-concave patterns on the free-flow branch when vehicles route themselves according to user equilibrium principles, which is closest to what would be observed in realistic situations. Such patterns are contrary to what is traditionally assumed in most MFD-based modeling frameworks. However, the unimodal and concave MFD should be expected under system optimal routing conditions that maximize network productivity for a given traffic state.

42 ENGINEERING↗
DOE OSTI2024

Redesigning large-scale multimodal transit networks with shared autonomous mobility services

Here, this study addresses a large-scale multimodal transit network design problem, with Shared Autonomous Mobility Services (SAMS) as both transit feeders and an origin-to-destination mode. The framework captures spatial demand and modal characteristics, considers intermodal transfers and express services, determines transit infrastructure investment and path flows, and generates transit routes. A system-optimal multimodal transit network is designed with minimum total door-to-door generalized costs of users and operators, satisfying transit origin-destination demand within a pre-set infrastructure budget. Firstly, the geography, demand, and modes in each zone are characterized with continuous approximation. The decisions of network link investment and multimodal path flows in zonal connection optimization are formulated as a minimum-cost multi-commodity network flow (MCNF) problem and solved efficiently with a mixed-integer linear programming (MILP) solver. Subsequently, the route generation problem is solved by expanding the MCNF formulation to minimize intramodal transfers. The model is illustrated through a set of experiments with the Chicago network comprised of 50 zones and seven modes, under three scenarios. The computational results present savings in traveler journey time and operator cost demonstrating the potential benefits of collaboration between multimodal transit systems and SAMS.

Autonomous vehicles↗
NASA NTRS2022

PAAV Concept Document

The Pathfinding for Airspace with Autonomous Vehicles (PAAV) Concept Document, version 1.0, lays out the key challenges and potential solutions for the use of uncrewed aircraft (UA) technology for future regional air cargo operations. The challenges and solutions described in this document were informed by communications with the UA industry community (e.g., RTCA, the Federal Aviation Administration, and regional air cargo business operators), as well as the PAAV team’s research activities during the last two years including four tabletop exercises, a human-in-the-loop simulation study, a numerical simulation study, a functional allocation study, and flight data analysis (Appendix A). This document first describes the expected operational context of PAAV (Section 2), such as the flight mission, baseline UAS components, nominal operations, m:N operations (i.e., "m" remote pilots per "N" aircraft), and off-nominal operations. This context sets the scope for the PAAV concept development work. PAAV concept development assumes that UA operations will be increasingly autonomous. Thus, near- and far-term assumptions are defined (Section 3). PAAV identified seven key challenges for UA operations (Section 4): - Flight route planning - Separation and flow management - Traffic pattern integration - Contingency management - Taxi, takeoff, and landing - m:N operations - Communications operations The following 13 potential solutions to these challenges are then described (Section 5): - Scalable communications architecture - Data link - Designated UAS corridors - Crew planning for m:N operations - Flight route optimization - Traffic load-level control - Trajectory solutions with data link - Automated hazard avoidance for m:N operations - Traffic pattern integration (TPI) tool - Standard lost command and control (C2) link (LC2L) procedures - Automated hazard avoidance under LC2L - Auto-taxi, auto-takeoff, and auto-land - Ground control station (GCS) user interface for m:N operations The document attempts to link each of these solutions to one or more of the challenge areas. Novel solutions involving numerous automation technologies are needed to mitigate traffic and airspace management challenges, especially for realizing m:N operations and ensuring safety under LC2L conditions. The purpose of this document is to help understand alternatives and tradeoffs among potential solutions and provide a foundation for a cohesive PAAV concept that will be described and refined in subsequent concept versions.

Unmanned aircraft, uncrewed aircraft, regional air↗
NASA NTRS2014

A Linear Programming Approach to Routing Control in Networks of Constrained Nonlinear Positive Systems with Concave Flow Rates

We consider control design for positive compartmental systems in which each compartment's outflow rate is described by a concave function of the amount of material in the compartment.We address the problem of determining the routing of material between compartments to satisfy time-varying state constraints while ensuring that material reaches its intended destination over a finite time horizon. We give sufficient conditions for the existence of a time-varying state-dependent routing strategy which ensures that the closed-loop system satisfies basic network properties of positivity, conservation and interconnection while ensuring that capacity constraints are satisfied, when possible, or adjusted if a solution cannot be found. These conditions are formulated as a linear programming problem. Instances of this linear programming problem can be solved iteratively to generate a solution to the finite horizon routing problem. Results are given for the application of this control design method to an example problem. Key words: linear programming; control of networks; positive systems; controller constraints and structure.

Positive Systems↗
DOE OSTI2022

Advances in hexagon mesh-based flow direction modeling

Watershed delineation and flow direction representation are the foundations of streamflow routing in spatially distributed hydrologic modeling. A recent study showed that hexagon-based watershed discretization has several advantages compared to the traditional Cartesian (latitude–longitude) discretization, such as uniform connectivity and compatibility with other Earth system model components based on unstructured mesh systems (e.g., oceanic models). Despite these advantages, hexagon-based discretization has not been widely adopted by the current generation of hydrologic models. One major reason is that there is no existing model that can delineate hexagon-based watersheds while maintaining accurate representations of flow direction across various spatial resolutions. In this study, we explored approaches such as spatial resampling and hybrid breaching-filling stream burning techniques to improve watershed delineation and flow direction representation using a newly developed hexagonal mesh watershed delineation model (HexWatershed). We applied these improvements to the Columbia River basin and performed 16 simulations with different configurations. The results show that (1) spatial resampling modulates flow direction around headwaters and provides an opportunity to extract subgrid information; and (2) stream burning corrects the flow directions in mountainous areas with complex terrain features.

58 GEOSCIENCES↗
NASA NTRS2015

Exploring Management of Arrival Spacing Using Route Extensions with Terminal Spacing Tools

Airports with shared runway operations between arrivals and departures can experience severe departure gridlock and delays during a heavy arrival push due to insufficient gaps in the arrival stream for aircraft to depart. The problem is accentuated in situations when a large gap in the arrival spacing has to be created at the last minute due to wake vortex separation requirements. At LaGuardia airport, wake vortex separation problems arise when a heavy jet, such as a B757, departing on Runway 31 needs additional spacing between arrivals on Runway 22. A standard solution for controllers in many airports in situations such as this is to extend the downwind leg of arrival aircraft to create extra space between the arrivals. The question addressed in this paper is how such route extensions would work with terminal scheduling operations, namely (1) the automated Terminal Sequencing and Spacing (TSS) tools and (2) a new scheduling tool which increases the availability of gaps for departure aircraft (Departure Sensitive Arrival Spacing or DSAS). In a simulated LaGuardia airport (LGA) Terminal Radar Approach Control (TRACON) airspace, two new RNAV arrival routes were created along with extensions to these routes. The arrival route from the south had a downwind leg extension near the airport in the final sector. The arrival route from the north had an extension in a feeder sector further from the airport. An exploratory one-hour run with the route extensions was compared to an hour run without the extensions. Topics included in the paper are 1) how the route extensions were developed, 2) a procedure outlining how the aircraft could be scheduled to the extensions and who would do it, and 3) the results of the exploratory run compared to the original run without the extensions. The results indicated that the extended downwind leg route helped to create a B757 departure gap in the middle of a packed arrival stream, resulting in a reduction of 11 minutes in average wait time for the B757s, but at a cost of increased controller self-reported workload from low to moderate.

time based flow management↗
NASA NTRS1990

Wave-interactions in supersonic and hypersonic flows

Work completed under the current grant comprises the start of a theoretical and computational attack on the subharmonic route to secondary instabilities in compressible flows. The total flow field in this problem is made up of the following components: (1) a steady streamwise mean boundary layer flow which depends only on the normal space component y; (2) a two-dimensional time dependent T-S wave which moves with wavespeed c and has no spanwise dependence; and (3) a fully three-dimensional, time dependent T-S wave whose streamwise wavenumber is half of the streamwise wavenumber associated with the two-dimensional T-S wave in b. If a frame of reference is adopted which moves with the wavespeed c of the 2-D T-S wave, the time dependence of this portion of the flow can be eliminated. The effective steady mean flow in this problem is now the sum of the original parallel steady mean flow and the initial 2-D T-S instability. Dependence on the streamwise coordinate x in this mean flow can be extracted by assuming normal mode expansions involving complex exponentials and the streamwise wavenumber a. However, it is important to note that, because this is a wave-wave interaction problem, unlike the usual linear instability case, both the complex exponential, and its complex conjugate, must be retained in describing the 2-D T-S wave. The role of the perturbation to the steady mean flow is now played by the 3-D time dependent T-S wave. In treating this wave, normal modes in the streamwise and spanwise directions and time may be used. Consistent with the subharmonic nature of this transition route, the streamwise wavenumber is a/2, and complex conjugates of the complex exponential must be employed. This is not the case with the modes giving z and t dependence with wavespeed o and spanwise wavenumber B as the effective mean flow quantities are independent of z and their time dependence is accounted for by the moving frame of reference. Consequently, the wave-wave interaction which will produce mean flow modification occurs only through the streamwise exponentials.

Lakin, William D.↗
NASA NTRS2011

Traffic Flow Management Wrap-Up

Traffic Flow Management involves the scheduling and routing of air traffic subject to airport and airspace capacity constraints, and the efficient use of available airspace. Significant challenges in this area include: (1) weather integration and forecasting, (2) accounting for user preferences in the Traffic Flow Management decision making process, and (3) understanding and mitigating the environmental impacts of air traffic on the environment. To address these challenges, researchers in the Traffic Flow Management area are developing modeling, simulation and optimization techniques to route and schedule air traffic flights and flows while accommodating user preferences, accounting for system uncertainties and considering the environmental impacts of aviation. This presentation will highlight some of the major challenges facing researchers in this domain, while also showcasing recent innovations designed to address these challenges.

Grabbe, Shon↗
DOE OSTI2026

Data Fusion for the Development of a Multimodal Freight Transload Facilities Dataset in the U.S.

To withstand the growing demand of commodity volume and its strain on the transportation infrastructure, it is necessary to identify the flow of commodities by route and mode. However, a national multimodal freight routing model does not exist for the U.S. The development of such model requires multiple building blocks, such as virtual representations of roadway, railway, and waterway networks, transload facilities (TFs), and access/egress links. Most of these blocks have a robust database in the U.S., except for the TFs. Here, this paper presents the fusion of dispersed and heterogeneous representations of multimodal TFs into a single, comprehensive, geospatial freight TF dataset. The TF dataset is derived from several sources, including the U.S. Army Corps of Engineers Master Docks Plus, the National Transportation Atlas Database, the Intermodal Association of North America, industry publications, and other public information. First, individual datasets were queried and reconciled. A geocoding/reverse geocoding process was applied to get the best street address and latitude/longitude location for each terminal. Then, duplicate terminals were identified by a fuzzy match algorithm based on terminal name and location, and removed. Validation was performed by visual inspection of random facilities. The main contributions of this work are: a publicly available version of the TF dataset, including facility location and multimodal transfer capability of 9,003 facilities, and an enterprise-version with the same facilities but including commodity handling capabilities. The main purpose of developing the TF dataset is to inform multimodal routing algorithms. The proposed TF dataset allows for credibly modeling the multimodal transfer of commodities within shipment routes.

Commodity Routing↗
DOE OSTI2026

Truck Platooning Performance with ADAS and Onboard Camera Data Describing Traffic Interactions

This project was part of the Characterizing Behaviors and Capabilities for Emerging Connected and Automated Vehicle Technologies, Sensors, and Connectivity project. The National Laboratory of the Rockies partnered with Cummins Inc. to collect data from Class 8 tractor trailer combinations in platoon (cooperative adaptive cruise control) operations on public roads in southern Indiana. Data collected include J1939 CAN bus, radar, intervehicle position, and video data. The video data could not be shared in the raw form, so they were processed to extract information on the other vehicles on the road, their relative positions, and intrusion events. This information was then columnized for modeling use and further enhanced by appending road information including road type, speed limit, altitude, and grade. The test route included free-flowing traffic, highway interchanges, and construction zones, as well as low-, medium-, and high-grade sections. Individual test conditions varied by day, with advanced driver-assistance system (ADAS) features engaged or disengaged and different combined vehicle masses tested in addition to uncontrolled variables such as weather and traffic interactions.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
NASA NTRS1992

The VLBA correlator: Real-time in the distributed era

The correlator is the signal processing engine of the Very Long Baseline Array (VLBA). Radio signals are recorded on special wideband (128 Mb/s) digital recorders at the 10 telescopes, with sampling times controlled by hydrogen maser clocks. The magnetic tapes are shipped to the Array Operations Center in Socorro, New Mexico, where they are played back simultaneously into the correlator. Real-time software and firmware controls the playback drives to achieve synchronization, compute models of the wavefront delay, control the numerous modules of the correlator, and record FITS files of the fringe visibilities at the back-end of the correlator. In addition to the more than 3000 custom VLSI chips which handle the massive data flow of the signal processing, the correlator contains a total of more than 100 programmable computers, 8-, 16- and 32-bit CPUs. Code is downloaded into front-end CPU's dependent on operating mode. Low-level code is assembly language, high-level code is C running under a RT OS. We use VxWorks on Motorola MVME147 CPU's. Code development is on a complex of SPARC workstations connected to the RT CPU's by Ethernet. The overall management of the correlation process is dependent on a database management system. We use Ingres running on a Sparcstation-2. We transfer logging information from the database of the VLBA Monitor and Control System to our database using Ingres/NET. Job scripts are computed and are transferred to the real-time computers using NFS, and correlation job execution logs and status flow back by the route. Operator status and control displays use windows on workstations, interfaced to the real-time processes by network protocols. The extensive network protocol support provided by VxWorks is invaluable. The VLBA Correlator's dependence on network protocols is an example of the radical transformation of the real-time world over the past five years. Real-time is becoming more like conventional computing. Paradoxically, 'conventional' computing is also adopting practices from the real-time world: semaphores, shared memory, light-weight threads, and concurrency. This appears to be a convergence of thinking.

Wells, D. C.↗
NASA NTRS2006

Agent Reward Shaping for Alleviating Traffic Congestion

Traffic congestion problems provide a unique environment to study how multi-agent systems promote desired system level behavior. What is particularly interesting in this class of problems is that no individual action is intrinsically "bad" for the system but that combinations of actions among agents lead to undesirable outcomes, As a consequence, agents need to learn how to coordinate their actions with those of other agents, rather than learn a particular set of "good" actions. This problem is ubiquitous in various traffic problems, including selecting departure times for commuters, routes for airlines, and paths for data routers. In this paper we present a multi-agent approach to two traffic problems, where far each driver, an agent selects the most suitable action using reinforcement learning. The agent rewards are based on concepts from collectives and aim to provide the agents with rewards that are both easy to learn and that if learned, lead to good system level behavior. In the first problem, we study how agents learn the best departure times of drivers in a daily commuting environment and how following those departure times alleviates congestion. In the second problem, we study how agents learn to select desirable routes to improve traffic flow and minimize delays for. all drivers.. In both sets of experiments,. agents using collective-based rewards produced near optimal performance (93-96% of optimal) whereas agents using system rewards (63-68%) barely outperformed random action selection (62-64%) and agents using local rewards (48-72%) performed worse than random in some instances.

Tumer, Kagan↗
NASA NTRS2005

Remotely Operated Aircraft (ROA) Impact on the National Airspace System (NAS) Work Package: Automation Impacts of ROA's in the NAS

The purpose of this document is to analyze the impact of Remotely Operated Aircraft (ROA) operations on current and planned Air Traffic Control (ATC) automation systems in the En Route, Terminal, and Traffic Flow Management domains. The operational aspects of ROA flight, while similar, are not entirely identical to their manned counterparts and may not have been considered within the time-horizons of the automation tools. This analysis was performed to determine if flight characteristics of ROAs would be compatible with current and future NAS automation tools. Improvements to existing systems / processes are recommended that would give Air Traffic Controllers an indication that a particular aircraft is an ROA and modifications to IFR flight plan processing algorithms and / or designation of airspace where an ROA will be operating for long periods of time.

Source record↗
NASA NTRS2005

Long-Range Emergency Preemption of Traffic Lights

A forwarding system could prove beneficial as an addition to an electronic communication-and-control system that automatically modifies the switching of traffic lights to give priority to emergency vehicles. A system to which the forwarding system could be added could be any of a variety of emergency traffic-signal-preemption systems: these include systems now used in some municipalities as well as advanced developmental systems described in several NASA Tech Briefs articles in recent years. Because of a variety of physical and design limitations, emergency traffic-signal- preemption systems now in use are often limited in range to only one intersection at a time: in a typical system, only the next, closest intersection is preempted for an emergency vehicle. Simulations of gridlock have shown that such systems offer minimal advantages and can even cause additional delays. In analogy to what happens in fluid dynamics, the forwarding system insures that flow at a given location is sustained by guaranteeing downstream flow along the predicted route (typically a main artery) and intersecting routes (typically, side streets). In simplest terms, the forwarding system starts by taking note of any preemption issued by the preemption system to which it has been added. The forwarding system predicts which other intersections could be encountered by the emergency vehicle downstream of the newly preempted intersection. The system then forwards preemption triggers to those intersections. Beyond affording a right of way for the emergency vehicle at every intersection that lies ahead along any likely route from the current position of the vehicle, the forwarding system also affords the benefit of clearing congested roads far ahead of the vehicle. In a metropolitan environment with heavy road traffic, forwarding of preemption triggers could greatly enhance the performance of a pre-existing preemption system.

Bachelder, Aaron↗
NASA NTRSDate not supplied

Harmonized Sentinel-1 SAR Global River Geometry and Inundation Database

Satellite-based observations on river geometries are sporadic in time, space, or both. Most satellite-based surface water maps, river widths, water surface elevations (WSE), slopes, and bathymetry are asynchronized in time and space. The current configuration of satellites such as Sentinel-6 measured the WSE but is missing the river width, slopes, and depths. To advance hydrological sciences research, there is a need to produce a harmonized time series of river geometry data of non-SWOT satellites in partnership with the upcoming SWOT mission. The SWOT satellite will measure river width, height, and slope but missing river depth measurements in space and time. Further, none of these current satellites measure the WSE, river width, and slopes synchronously. In this work, we use the Sentinel-1 SAR satellite data archive from 2015 to the present to create a global river width and surface water database at the reach scale. A modified version of the Sentinel SAR surface water classification algorithm from ASF is used to quantify the surface water extent on the stream approximately every six days (at the equator) at 10m spatial resolution globally. This 10m water mask is fed into a workflow to quantify the river widths, surface water inundations, slopes, and synthetic bathymetry in SWORD (SWOT River Database) stream networks. A Satellite HAND is used to address the cloud obscured surface water observations using a trained machine learning algorithm. We use WSE derived from the Global Water Monitor from NASA GSFC, Hydroweb from LEGOS, and ICESat-2 to harmonize the WSE observation. And Landsat-8/9 and Sentinel-2 water observations to fill the gaps in the Sentinel-1 SAR database. We use Congo River Basin as a test case where we have more than 500 radar altimetry-based WSE, continuous series of Sentinel-1, ICESat-2, Landsat-8/9, and Sentinel-2 observations. A Congo River hydrologic model is used to generate the streamflow discharge. The satellite observed river reaches are assimilated with the stream flows computed by the routing models. And the downstream reaches in the river network without satellite observations get optimized for discharge/river geometry at each observation cycle. Our final product is a harmonized river geometry dataset (reach's water extent, WSE, slope, synthetic bathymetry) for Congo Basin's SWORD reaches.

Chandana Gangodagamage↗
NASA NTRS1988

Domain decomposition methods for the parallel computation of reacting flows

Domain decomposition is a natural route to parallel computing for partial differential equation solvers. Subdomains of which the original domain of definition is comprised are assigned to independent processors at the price of periodic coordination between processors to compute global parameters and maintain the requisite degree of continuity of the solution at the subdomain interfaces. In the domain-decomposed solution of steady multidimensional systems of PDEs by finite difference methods using a pseudo-transient version of Newton iteration, the only portion of the computation which generally stands in the way of efficient parallelization is the solution of the large, sparse linear systems arising at each Newton step. For some Jacobian matrices drawn from an actual two-dimensional reacting flow problem, comparisons are made between relaxation-based linear solvers and also preconditioned iterative methods of Conjugate Gradient and Chebyshev type, focusing attention on both iteration count and global inner product count. The generalized minimum residual method with block-ILU preconditioning is judged the best serial method among those considered, and parallel numerical experiments on the Encore Multimax demonstrate for it approximately 10-fold speedup on 16 processors.

Keyes, David E.↗