Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear constraints”

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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Microstructural characterization of a star-linear polymer blend under shear flow by using rheo-SANS

We present an investigation into the dynamic relaxation mechanisms of a polybutadiene blend composed of a four-arm star (10 wt. %) and a linear polymer matrix in the presence of an applied shear flow. Our focus was the response of the star polymer, which cannot be unambiguously assessed via linear viscoelastic measurements since the signature of the star polymer can barely be detected due to the dominant contribution of the linear matrix. By utilizing small-angle neutron scattering (SANS) coupled with a Couette shear device and a deuterated matrix polymer, we investigated the dynamics of the minority star component of the blend. Our results confirm that the stars deform anisotropically with increasing shear rate. We have compared the SANS data with predictions from the well-established scattering adaptation of the state-of-the-art tube model for entangled linear polymer melts undergoing shear, i.e., Graham, Likhtman, Milner, and McLeish (GLaMM) approach, appropriately modified following earlier studies in order to apply to the star. This modified model, GLaMM-R, includes the physics necessary to understand stress relaxation in both the linear and nonlinear flow regimes, i.e., contour length fluctuations, constraint release, convective constraint release, and chain retraction. The full scattering signal is due to the minority star component and, although the contribution of the linear chains is hidden from the neutron scattering, they still influence the star polymer molecular dynamics, with the applied shear rate ranging from approximately 8 to 24 s –1 , below the inverse relaxation time of the linear component. This study provides another confirmation that the combination of rheology and neutron scattering is an indispensable tool for investigating the nonlinear dynamics of complex polymeric systems.

36 MATERIALS SCIENCE↗
NASA NTRSDate not supplied

Scheduling Position, Navigation and Time Service Requests from Non-dedicated Lunar Constellations

This paper presents a centralized scheduler that satisfies user requests for Position, Navigation, and Time (PNT) services from an ad-hoc, non-dedicated orbital constellation around the Moon. Traditional, dedicated GNSS networks provide service 24/7, which allows users to acquire localization services at-will. For ad-hoc networks, a coordinated schedule is needed to ensure Quality of Service (QoS) guarantees for user localization, while satisfying non-dedicated assets’ usage constraints. This scheduler bridges this coordination gap by leveraging Mixed Integer-Linear Programming (MILP) to schedule this “as-needed” localization service while respecting the constraints on each asset. In upcoming decades there is expected to be a substantial increase in Lunar missions. Many of these missions will feature low-cost surface assets near the moon’s polar regions and small-sat science missions in orbit. Most missions need PNT capabilities to ensure safe operations and meet their science objectives, but low-cost missions may not be able to support the large power, mass, and weight that a weak GNSS or DSN based navigation solution would entail. Asset localization has been demonstrated using a decentralized extended Kalman Filter (DEKF) in the previously presented Lunar Autonomous PNT System (LAPS). Within the LAPS simulation environment, a module has been developed to generate the coordinated user-asset schedules described above; this Service Scheduler Module (SSM) allows for complete end-to-end testing of the entire system. Within SSM, a user service request consists of a location on the Lunar surface, a cumulative service duration, and a window in which service must occur. SSM takes as input these requests and the LAPS-predicted positional degree of precision as the QoS for each available set of orbital assets. A simple, baseline MILP model is formulated to provide the highest-precision service balanced across all requests. To reflect the non-dedicated nature of the constellation, this baseline model is augmented with additional asset-specific load capacity constraints or availability constraints. The load capacity constraints limit total time spent providing service, and the availability constraints reflect blockout times or availability windows when the assets are not otherwise occupied. SSM outputs two schedules: the user schedule to indicate their service times and expected QoS, and a satellite schedule to be transmitted to the orbiting constellation, describing when each non-dedicated asset provides PNT service. SSM is predominantly implemented in MATLAB and allows the use of any MILP solver to generate the resulting schedules. This paper describes the SSM - LAPS interface, how the output of LAPS is used to construct the MILP, and how SSM provides user localization service while satisfying constraints. It will also demonstrate the tool’s flexibility for formulating schedules for the end user and the constellation, focusing on scenarios that match real-world proposed missions. It will detail how SSM can be used to compare the addition of load capacity constraints, satellite availability constraints, and QoS guarantees for the users. Finally, we describe how SSM can be used to support the design of the ad-hoc constellation itself. The resulting integrated capability will support the design of future ad-hoc Lunar PNT networks, enabling high-quality, low-cost Lunar exploration

Swarm↗
DOE OSTI2021

Improving Resilience of Bus Bunching Holding Strategy through a Rolling Horizon Approach

Providing public transportation with quality service is critical to attracting more passengers to the system. However, high-demand routes are prone to the so-called bus bunching -- a tendency of buses to group as a consequence of variations in travel times and demands. Bus holding is applied to overcome this effect. In this study, we present a novel method for bus holding in which the control law is based only on the buses' position using a computationally efficient rolling horizon approach. The method uses similar inputs as linear control approaches while not increasing significantly the computational time. However, the method overcomes key a weakness of the linear control approach thanks to the explicit constraint handling that always ensures the control action effectiveness. Simulation experiments in a validation case and a model-specific for a bus rapid transit line in Curitiba, Brazil showed a reduced holding time and improved resilience, delivering more than 20% reduction in delay time accounting for the on-board and station delays.

33 ADVANCED PROPULSION SYSTEMS↗
NASA NTRS2000

Optimization of Car Body under Constraints of Noise, Vibration, and Harshness (NVH), and Crash

To be competitive on the today's market, cars have to be as light as possible while meeting the Noise, Vibration, and Harshness (NVH) requirements and conforming to Government-man dated crash survival regulations. The latter are difficult to meet because they involve very compute-intensive, nonlinear analysis, e.g., the code RADIOSS capable of simulation of the dynamics, and the geometrical and material nonlinearities of a thin-walled car structure in crash, would require over 12 days of elapsed time for a single design of a 390K elastic degrees of freedom model, if executed on a single processor of the state-of-the-art SGI Origin2000 computer. Of course, in optimization that crash analysis would have to be invoked many times. Needless to say, that has rendered such optimization intractable until now. The car finite element model is shown. The advent of computers that comprise large numbers of concurrently operating processors has created a new environment wherein the above optimization, and other engineering problems heretofore regarded as intractable may be solved. The procedure, shown, is a piecewise approximation based method and involves using a sensitivity based Taylor series approximation model for NVH and a polynomial response surface model for Crash. In that method the NVH constraints are evaluated using a finite element code (MSC/NASTRAN) that yields the constraint values and their derivatives with respect to design variables. The crash constraints are evaluated using the explicit code RADIOSS on the Origin 2000 operating on 256 processors simultaneously to generate data for a polynomial response surface in the design variable domain. The NVH constraints and their derivatives combined with the response surface for the crash constraints form an approximation to the system analysis (surrogate analysis) that enables a cycle of multidisciplinary optimization within move limits. In the inner loop, the NVH sensitivities are recomputed to update the NVH approximation model while keeping the Crash response surface constant. In every outer loop, the Crash response surface approximation is updated, including a gradual increase in the order of the response surface and the response surface extension in the direction of the search. In this optimization task, the NVH discipline has 30 design variables while the crash discipline has 20 design variables. A subset of these design variables (10) are common to both the NVH and crash disciplines. In order to construct a linear response surface for the Crash discipline constraints, a minimum of 21 design points would have to be analyzed using the RADIOSS code. On a single processor in Origin 2000 that amount of computing would require over 9 months! In this work, these runs were carried out concurrently on the Origin 2000 using multiple processors, ranging from 8 to 16, for each crash (RADIOSS) analysis. Another figure shows the wall time required for a single RADIOSS analysis using varying number of processors, as well as provides a comparison of 2 different common data placement procedures within the allotted memories for each analysis. The initial design is an infeasible design with NVH discipline Static Torsion constraint violations of over 10%. The final optimized design is a feasible design with a weight reduction of 15 kg compared to the initial design. This work demonstrates how advanced methodology for optimization combined with the technology of concurrent processing enables applications that until now were out of reach because of very long time-to-solution.

Kodiyalam, Srinivas↗
NASA NTRS2015

Utilization of the Deep Space Atomic Clock for Europa Gravitational Tide Recovery

Estimation of Europa's gravitational tide can provide strong evidence of the existence of a subsurface liquid ocean. Due to limited close approach tracking data, a Europa flyby mission suffers strong coupling between the gravity solution quality and tracking data quantity and quality. This work explores utilizing Low Gain Antennas with the Deep Space Atomic Clock (DSAC) to provide abundant high accuracy uplink-only radiometric tracking data. DSAC's performance, expected to exhibit an Allan Deviation of less than 3e-15 at one day, provides long-term stability and accuracy on par with the Deep Space Network ground clocks, enabling one-way radiometric tracking data with accuracy equivalent to that of its two-way counterpart. The feasibility of uplink-only Doppler tracking via the coupling of LGAs and DSAC and the expected Doppler data quality are presented. Violations of the Kalman filter's linearization assumptions when state perturbations are included in the flyby analysis results in poor determination of the Europa gravitational tide parameters. B-plane targeting constraints are statistically determined, and a solution to the linearization issues via pre-flyby approach orbit determination is proposed and demonstrated.

Seubert, Jill↗
NASA NTRSDate not supplied

Angles-Only Robust Trajectory Optimization for NRHO Rendezvous

This study demonstrates a robust trajectory optimization approach for rendezvous and proximity operations with angles-only navigation measurements. Often, sensors that directly measure relative range and velocity require communication or coordination between the chaser and target vehicle and can have limiting pointing accuracy, mass, or power requirements compared to angle measurement sensors. Thus, the capability to perform a rendezvous with only angle measurements can be advantageous for vehicle design and to improve robustness to failures. However, the well studied limitation of angles-only navigation in measuring range results in large uncertainties in the navigation system that must be reduced with chaser vehicle thrust maneuvers to induce observability in range for the navigation filter. This analysis presents a trajectory optimization problem for a lunar ascent rendezvous during a crewed lunar mission in a Near-Rectilinear Halo Orbit (NRHO) that is limited to only angle measurements. The objective of this study is to show that an angles-only rendezvous is feasible in an NRHO and to present the sensitivity to an assortment of constraints generated from a systematic optimization process using linear covariance analysis and particle swarm optimization. Linearized NRHO dynamics and linearized relative targeting are applied to use linear covariance analysis to determine the expected delta-v and trajectory dispersions due to initial state uncertainty, sensor errors, maneuver execution errors, and unmodeled dynamics. The delta-v and trajectory dispersions are passed into a particle swarm optimization algorithm to find the optimized maneuver profile that minimizes fuel use while satisfying constraints such as free drift and underburn to 3-sigma certainty. The trajectory constraints including time available, desired final uncertainty, and initial uncertainty are varied to ascertain sensitivity and desirable engineering trades.

Linear Covariance Analysis↗
DOE OSTI2025

Cosmological constraints from the cross-correlation of DESI Luminous Red Galaxies with CMB lensing from Planck PR4 and ACT DR6

Here, we infer the growth of large scale structure over the redshift range 0.4 ≲ z ≲ 1 from the cross-correlation of spectroscopically calibrated Luminous Red Galaxies (LRGs) selected from the Dark Energy Spectroscopic Instrument (DESI) legacy imaging survey with CMB lensing maps reconstructed from the latest Planck and ACT data. We adopt a hybrid effective field theory (HEFT) model that robustly regulates the cosmological information obtainable from smaller scales, such that our cosmological constraints are reliably derived from the (predominantly) linear regime. We perform an extensive set of bandpower- and parameter-level systematics checks to ensure the robustness of our results and to characterize the uniformity of the LRG sample. We demonstrate that our results are stable to a wide range of modeling assumptions, finding excellent agreement with a linear theory analysis performed on a restricted range of scales. From a tomographic analysis of the four LRG photometric redshift bins we find that the rate of structure growth is consistent with ΛCDM with an overall amplitude that is ≃ 5-7% lower than predicted by primary CMB measurements with modest (∼ 2σ) statistical significance. From the combined analysis of all four bins and their cross-correlations with Planck we obtain S 8 = 0.765 ± 0.023, which is less discrepant with primary CMB measurements than previous DESI LRG cross Planck CMB lensing results. From the cross-correlation with ACT we obtain S 8 = 0.790 +0.024 -0.027 , while when jointly analyzing Planck and ACT we find S 8 = 0.775 +0.019 -0.022 from our data alone and σ 8 = 0.772 +0.020 -0.023 with the addition of BAO data. These constraints are consistent with the latest Planck primary CMB analyses at the ≃ 1.6-2.2σ level, and are in excellent agreement with galaxy lensing surveys.

cosmological parameters from LSS↗
DOE OSTI2022

Rapid Load Transition for Integrated Solid Oxide Fuel Cell - Gas Turbine (SOFC-GT) Energy Systems: A Demonstration of the Potential for Grid Response

Rapid load transition is an essential requirement for integrated energy systems to maintain grid resilience as more renewable resources are added to the grid. Integrated solid oxide fuel cell - gas turbine (SOFC-GT) systems can provide high efficiency and low carbon emissions over a broad range of turndown. These hybrids also have the potential to enable rapid grid response. The challenge has been to demonstrate effective control strategies to manage load transitions. In the present study, a load transition of ~50% was achieved in 10 s using a novel but simple strategy. Power demand on the SOFC and the GT were ramped down concurrently. During this transition, the SOFC anode fuel was manipulated to maintain SOFC fuel utilization while the cathode inlet air flow and temperature were also manipulated to thermally protect the SOFC. This study was conducted using the Hybrid Performance (Hyper) facility at the National Energy Technology Laboratory (NETL) in a co-simulation environment with the Idaho National Laboratory (INL)'s grid-simulation. The load ramping strategy was tested using a hardware-based cyber-physical simulation methodology. The results demonstrate a high-fidelity representation of SOFC-GT hybrid dynamics and validation of the control strategy. Thermal and electrochemical transients indicated that the SOFC was well protected during rapid load turndown without violating operability constraints. This demonstration revealed the non-linear nature of tightly coupled SOFC-GT system components, especially the non-linear response of SOFC cathode air flow and inlet temperature controls. These results highlight the needs and challenges in developing adaptive automatic controls for autonomous rapid load transitions. This work demonstrates that SOFC-GT hybrids are a viable option to provide the fast-ramping characteristics essential to accommodate high levels of variable renewable power while maintaining grid resilience, reliability, and environmental performance. The results also demonstrate the utility of co-simulation in advancing the tightly-coupled integrated energy systems needed to meet goals for zero-carbon power generation.

DIRECT ENERGY CONVERSION,POWER TRANSMISSION AND DI↗
NASA NTRS2011

Chance-Constrained Guidance With Non-Convex Constraints

Missions to small bodies, such as comets or asteroids, require autonomous guidance for descent to these small bodies. Such guidance is made challenging by uncertainty in the position and velocity of the spacecraft, as well as the uncertainty in the gravitational field around the small body. In addition, the requirement to avoid collision with the asteroid represents a non-convex constraint that means finding the optimal guidance trajectory, in general, is intractable. In this innovation, a new approach is proposed for chance-constrained optimal guidance with non-convex constraints. Chance-constrained guidance takes into account uncertainty so that the probability of collision is below a specified threshold. In this approach, a new bounding method has been developed to obtain a set of decomposed chance constraints that is a sufficient condition of the original chance constraint. The decomposition of the chance constraint enables its efficient evaluation, as well as the application of the branch and bound method. Branch and bound enables non-convex problems to be solved efficiently to global optimality. Considering the problem of finite-horizon robust optimal control of dynamic systems under Gaussian-distributed stochastic uncertainty, with state and control constraints, a discrete-time, continuous-state linear dynamics model is assumed. Gaussian-distributed stochastic uncertainty is a more natural model for exogenous disturbances such as wind gusts and turbulence than the previously studied set-bounded models. However, with stochastic uncertainty, it is often impossible to guarantee that state constraints are satisfied, because there is typically a non-zero probability of having a disturbance that is large enough to push the state out of the feasible region. An effective framework to address robustness with stochastic uncertainty is optimization with chance constraints. These require that the probability of violating the state constraints (i.e., the probability of failure) is below a user-specified bound known as the risk bound. An example problem is to drive a car to a destination as fast as possible while limiting the probability of an accident to 10(exp -7). This framework allows users to trade conservatism against performance by choosing the risk bound. The more risk the user accepts, the better performance they can expect.

FROM↗
DOE OSTI2020

Sparse Dense and Compact Linearizations of the AC OPF (Online Supplement)

This document is an online supplement for Sparse, Dense, and Compact Linearizations of the AC OPF. Here we present complete derivations of the formulations examined, details of the lazy constraint algorithm, and full computational results supporting Sparse, Dense, and Compact Linearizations of the AC OPF.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1984

Gain optimization with non-linear controls

An algorithm has been developed for the analysis and design of controls for non-linear systems. The technical approach is to use statistical linearization to model the non-linear dynamics of a system by a quasi-Gaussian model. A covariance analysis is performed to determine the behavior of the dynamical system and a quadratic cost function. Expressions for the cost function and its derivatives are determined so that numerical optimization techniques can be applied to determine optimal feedback laws. The primary application for this paper is centered about the design of controls for nominally linear systems but where the controls are saturated or limited by fixed constraints. The analysis is general, however, and numerical computation requires only that the specific non-linearity be considered in the analysis.

Slater, G. L.↗
NASA NTRS2016

Parallel Aircraft Trajectory Optimization with Analytic Derivatives

Trajectory optimization is an integral component for the design of aerospace vehicles, but emerging aircraft technologies have introduced new demands on trajectory analysis that current tools are not well suited to address. Designing aircraft with technologies such as hybrid electric propulsion and morphing wings requires consideration of the operational behavior as well as the physical design characteristics of the aircraft. The addition of operational variables can dramatically increase the number of design variables which motivates the use of gradient based optimization with analytic derivatives to solve the larger optimization problems. In this work we develop an aircraft trajectory analysis tool using a Legendre-Gauss-Lobatto based collocation scheme, providing analytic derivatives via the OpenMDAO multidisciplinary optimization framework. This collocation method uses an implicit time integration scheme that provides a high degree of sparsity and thus several potential options for parallelization. The performance of the new implementation was investigated via a series of single and multi-trajectory optimizations using a combination of parallel computing and constraint aggregation. The computational performance results show that in order to take full advantage of the sparsity in the problem it is vital to parallelize both the non-linear analysis evaluations and the derivative computations themselves. The constraint aggregation results showed a significant numerical challenge due to difficulty in achieving tight convergence tolerances. Overall, the results demonstrate the value of applying analytic derivatives to trajectory optimization problems and lay the foundation for future application of this collocation based method to the design of aircraft with where operational scheduling of technologies is key to achieving good performance.

aircraft↗
NASA NTRS1988

A study of the use of linear programming techniques to improve the performance in design optimization problems

This project has two objectives. The first is to determine whether linear programming techniques can improve performance when handling design optimization problems with a large number of design variables and constraints relative to the feasible directions algorithm. The second purpose is to determine whether using the Kreisselmeier-Steinhauser (KS) function to replace the constraints with one constraint will reduce the cost of total optimization. Comparisons are made using solutions obtained with linear and non-linear methods. The results indicate that there is no cost saving using the linear method or in using the KS function to replace constraints.

Young, Katherine C.↗
DOE OSTI2026

Algebraic Multigrid with Filtering: An Efficient Preconditioner for Interior Point Methods in Large-Scale Contact Mechanics Optimization

Large-scale contact mechanics simulations are crucial in many engineering fields such as structural design and manufacturing. In the frictionless case, contact can be modeled by minimizing an energy functional; however, these problems are often nonlinear, nonconvex, and increasingly difficult to solve as mesh resolution increases. In this work, we employ a Newton-based interior-point (IP) filter line-search method, an effective approach for large-scale constrained optimization. While this method converges rapidly, each iteration requires solving a large saddle-point linear system that becomes ill-conditioned as the optimization process converges, largely due to IP treatment of the contact constraints. Such ill-conditioning can hinder solver scalability and increase iteration counts with mesh refinement. Here, to address this, we introduce a novel preconditioner, algebraic multigrid with filtering (AMGF), tailored to the Schur complement of the saddle-point system. Building on the classical AMG solver, commonly used for elasticity, we augment it with a specialized subspace correction that filters near null space components introduced by contact interface constraints. Through theoretical analysis and numerical experiments on a range of linear and nonlinear contact problems, we demonstrate that the proposed solver achieves mesh independent convergence and maintains robustness against the ill-conditioning that notoriously plagues IP methods. These results indicate that AMGF makes contact mechanics simulations more tractable and broadens the applicability of Newton-based IP methods in challenging engineering scenarios. More broadly, AMGF is well suited for problems, optimization or otherwise, where solver performance is limited by a low-dimensional subspace, such as those arising from localized constraints, interface conditions, or model heterogeneities. This makes the method widely applicable beyond contact mechanics and constrained optimization.

Mathematics and Computing↗
NASA NTRS1992

Structural optimization for joined-wing synthesis

The differences between fully stressed and minimum-weight joined-wing structures are identified, and these differences are quantified in terms of weight, stress, and direct operating cost. A numerical optimization method and a fully stressed design method are used to design joined-wing structures. Both methods determine the sizes of 204 structural members, satisfying 1020 stress constraints and five buckling constraints. Monotonic splines are shown to be a very effective way of linking spanwise distributions of material to a few design variables. Both linear and nonlinear analyses are employed to formulate the buckling constraints. With a constraint on buckling, the fully stressed design is shown to be very similar to the minimum-weight structure. It is suggested that a fully stressed design method based on nonlinear analysis is adequate for an aircraft optimization study.

Gallman, John W.↗
DOE OSTI2024

Shortest path network interdiction with asymmetric uncertainty

Abstract This paper considers an extension of the shortest path network interdiction problem that incorporates robustness to account for parameter uncertainty. The shortest path interdiction problem is a game of two players with conflicting agendas and capabilities: an evader, who traverses the arcs of a network from a source node to a sink node using a path of shortest length, and an interdictor, who maximizes the length of the evader's shortest path by interdicting arcs on the network. It is usually assumed that the parameters defining the network are known exactly by both players. We consider the situation where the evader assumes the nominal parameter values while the interdictor uses robust optimization techniques to account for parameter uncertainty or sensor degradation. We formulate this problem as a nonlinear mixed‐integer semi‐infinite bilevel program and show that it can be converted into a mixed‐integer linear program with a second order cone constraint. We use random geometric networks and transportation networks to perform computational studies and demonstrate the unique decision strategies that our variant produces. Solving the shortest path interdiction problem with asymmetric uncertainty protects the interdictor from investing in a strategy that hinges on key interdictions performing as promised. It also provides an alternate strategy that mitigates the risk of these worst‐case possibilities.

Punla‐Green, She'ifa Z.↗
DOE OSTI2021

Quantum space, quantum time, and relativistic quantum mechanics

We treat space and time as bona fide quantum degrees of freedom on an equal footing in Hilbert space. Motivated by considerations in quantum gravity, we focus on a paradigm dealing with linear, first-order Hamiltonian and momentum constraints that lead to emergent features of temporal and spatial translations. Unlike the conventional treatment, we show that Klein-Gordon and Dirac equations in relativistic quantum mechanics can be unified in our paradigm by applying relativistic dispersion relations to eigenvalues rather than treating them as operator-valued equations. With time and space being treated on an equal footing in Hilbert space, we show symmetry transformations to be implemented by unitary basis changes in Hilbert space, giving them a stronger quantum mechanical footing. Global symmetries, such as Lorentz transformations, modify the decomposition of Hilbert space; and local symmetries, such as U(1) gauge symmetry are diagonal in coordinate basis and do not alter the decomposition of Hilbert space. Here, we briefly discuss extensions of this paradigm to quantum field theory and quantum gravity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

A cancellation problem in hybrid particle-in-cell schemes due to finite particle size

The quasi-neutral hybrid particle-in-cell algorithm with kinetic ions and fluid electrons is a popular model to study multi-scale problems in laboratory, space, and astrophysical plasmas. Here, it is shown that the different spatial discretizations of ions as finite-spatial-size particles and electrons as a grid-based fluid can lead to significant numerical wave dispersion errors in the long wavelength limit (kd i «1, where k is the wavenumber and di is the ion skin-depth). The problem occurs when high-order particle-grid interpolations, or grid-based smoothing, spreads the electric field experienced by the ions across multiple spatial cells and leads to inexact cancellation of electric field terms in the total (ion + electron) momentum equation. Practical requirements on the mesh spacing Δx/d i are suggested to bound these errors from above. The accuracy impact of not respecting these resolution constraints is shown for a non-linear shock problem.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗