Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear solver”

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,045 records · Page 58

Experimental validation of deterministic Acuros XB algorithm for IMRT and VMAT dose calculations with the Radiological Physics Center's head and neck phantom

Purpose: The purpose of this study was to verify the dosimetric performance of Acuros XB (AXB), a grid-based Boltzmann solver, in intensity-modulated radiation therapy (IMRT) and volumetric-modulated arc therapy (VMAT). Methods: The Radiological Physics Center (RPC) head and neck (H and N) phantom was used for all calculations and measurements in this study. Clinically equivalent IMRT and VMAT plans were created on the RPC H and N phantom in the Eclipse treatment planning system (version 10.0) by using RPC dose prescription specifications. The dose distributions were calculated with two different algorithms, AXB 11.0.03 and anisotropic analytical algorithm (AAA) 10.0.24. Two dose report modes of AXB were recorded: dose-to-medium in medium (D{sub m,m}) and dose-to-water in medium (D{sub w,m}). Each treatment plan was delivered to the RPC phantom three times for reproducibility by using a Varian Clinac iX linear accelerator. Absolute point dose and planar dose were measured with thermoluminescent dosimeters (TLDs) and GafChromic registered EBT2 film, respectively. Profile comparison and 2D gamma analysis were used to quantify the agreement between the film measurements and the calculated dose distributions from both AXB and AAA. The computation times for AAA and AXB were also evaluated. Results: Good agreement was observed between measured doses and those calculated with AAA or AXB. Both AAA and AXB calculated doses within 5% of TLD measurements in both the IMRT and VMAT plans. Results of AXB{sub Dm,m} (0.1% to 3.6%) were slightly better than AAA (0.2% to 4.6%) or AXB{sub Dw,m} (0.3% to 5.1%). The gamma analysis for both AAA and AXB met the RPC 7%/4 mm criteria (over 90% passed), whereas AXB{sub Dm,m} met 5%/3 mm criteria in most cases. AAA was 2 to 3 times faster than AXB for IMRT, whereas AXB was 4-6 times faster than AAA for VMAT. Conclusions: AXB was found to be satisfactorily accurate when compared to measurements in the RPC H and N phantom. Compared with AAA, AXB results were equal to or better than those obtained with film measurements for IMRT and VMAT plans. The AXB{sub Dm,m} reporting mode was found to be closer to TLD and film measurements than was the AXB{sub Dw,m} mode. AXB calculation time was found to be significantly shorter (x 4) than AAA for VMAT.

61 RADIATION PROTECTION AND DOSIMETRY↗

Computational Algorithms for Unit Commitment with AC Power Flows (Final Report)

Security-constrained unit commitment (SCUC) is a key component in power system operations. When AC power flow constraints are considered in the SCUC model (AC-SCUC), the problem becomes extremely difficult due to its discrete and non-convex nature, as described in “Grid Optimization Competition Challenge 3 Problem Formulation (GOCC)”. There are four main challenges: (i) Discrete decisions regarding unit online/offline status and start-up/shut-down procedures for every single unit. The number of discrete decision variables increases considerably when a system integrates multiple generators; (ii) Configuration-based combined-cycle formulations, and multi-commodity models that include ramping products, spin/non-spin products, and regulation up/down products. The combined-cycle units introduce additional discrete decision variables and auxiliary service products further complicate the model by connecting multi-commodity products’ continuous and discrete variables; (iii) SCUC models with AC power flow constraints are far more complex due to massive bilinear terms in the large-scale nonlinear power balance equations. The nonlinear power balance equations are further complicated by the discrete step control variables of shunts; (iv) N − 1 contingency analysis. The size of the model increases linearly with the number of contingencies considered, greatly increasing the size of the optimization model. Accordingly, there is an emergent need to develop a robust algorithm capable of deriving a high-quality solution in a short time and passing through contingency tests simultaneously. In this project, we explore innovative techniques to address this challenging problem by integrating advanced polyhedral theory, approximation methods, relaxation strategies, decomposition techniques, and parallel computing. Each technique approaches the problem from a different perspective, leveraging its specific strengths to tackle distinct challenges. Each individual method has demonstrated its effectiveness in the PI’s previous research. Their integration is expected to significantly reduce the computational time required to solve the proposed complex problem. Successful completion of this project has the potential to transform the industry by enhancing optimization solvers capable of handling large-scale day-ahead energy market clearing models within strict time constraints, while incorporating AC power flow constraints. This advancement will lead to reduced overall generation costs and, consequently, increased social welfare.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Industrial Compositional Streamline Simulation for Efficient and Accurate Prediction of Gas Injection and WAG Processes

Gas-injection processes are widely and increasingly used for enhanced oil recovery (EOR). In the United States, for example, EOR production by gas injection accounts for approximately 45% of total EOR production and has tripled since 1986. The understanding of the multiphase, multicomponent flow taking place in any displacement process is essential for successful design of gas-injection projects. Due to complex reservoir geometry, reservoir fluid properties and phase behavior, the design of accurate and efficient numerical simulations for the multiphase, multicomponent flow governing these processes is nontrivial. In this work, we developed, implemented and tested a streamline based solver for gas injection processes that is computationally very attractive: as compared to traditional Eulerian solvers in use by industry it computes solutions with a computational speed orders of magnitude higher and a comparable accuracy provided that cross-flow effects do not dominate. We contributed to the development of compositional streamline solvers in three significant ways: improvement of the overall framework allowing improved streamline coverage and partial streamline tracing, amongst others; parallelization of the streamline code, which significantly improves wall clock time; and development of new compositional solvers that can be implemented along streamlines as well as in existing Eulerian codes used by industry. We designed several novel ideas in the streamline framework. First, we developed an adaptive streamline coverage algorithm. Adding streamlines locally can reduce computational costs by concentrating computational efforts where needed, and reduce mapping errors. Adapting streamline coverage effectively controls mass balance errors that mostly result from the mapping from streamlines to pressure grid. We also introduced the concept of partial streamlines: streamlines that do not necessarily start and/or end at wells. This allows more efficient coverage and avoids the redundant work generally done in the near-well regions. We improved the accuracy of the streamline simulator with a higher order mapping from pressure grid to streamlines that significantly reduces smoothing errors, and a Kriging algorithm is used to map from the streamlines to the background grid. The higher accuracy of the Kriging mapping means that it is not essential for grid blocks to be crossed by one or more streamlines. The higher accuracy comes at the price of increased computational costs, but allows coarser coverage and so does not generally increase the overall costs of the computations. To reduce errors associated with fixing the pressure field between pressure updates, we developed a higher order global time-stepping method that allows the use of larger global time steps. Third-order ENO schemes are suggested to propagate components along streamlines. Both in the two-phase and three-phase experiments these ENO schemes outperform other (higher order) upwind schemes. Application of the third order ENO scheme leads to overall computational savings because the computational grid used can be coarsened. Grid adaptivity along streamlines is implemented to allow sharp but efficient resolution of solution fronts at reduced computational costs when displacement fronts are sufficiently separated. A correction for Volume Change On Mixing (VCOM) is implemented that is very effective at handling this effect. Finally, a specialized gravity operator splitting method is proposed for use in compositional streamline methods that gives an effective correction of gravity segregation. A significant part of our effort went into the development of a parallelization strategy for streamline solvers on the next generation shared memory machines. We found in this work that the built-in dynamic scheduling strategies of OpenMP lead to parallel efficiencies that are comparable to optimal schedules obtained with customized explicit load balancing strategies as long as the ratio of number of streamlines to number of threads is sufficiently high, which is the case in real-field applications. This is an important result, as it eases the transition of serial to parallel streamline codes. The parallel speedup itself depends on the relative contribution of the tracing and mapping stages as compared to the solution of the transport equations along streamlines. As the physical complexity of the simulated 1D transport process increases, the contribution of the less efficient tracing and mapping stages is reduced and near-linear scalabilities can be obtained. Our work clearly shows that the owner approach, in which threads are assigned whole streamlines, is more attractive than a distributed model, in which streamline segments are assigned to threads, because it allows re-use of existing sequential code for the 1D streamline solves, also for implicit time-stepping algorithms.

02 PETROLEUM↗

Time-periodic steady-state solution of fluid-structure interaction and cardiac flow problems through multigrid-reduction-in-time

In this study, a time-periodic MGRIT algorithm is proposed as a means to reduce the time-to-solution of numerical algorithms by exploiting the time periodicity inherent to many applications in science and engineering. The time-periodic MGRIT algorithm is applied to a variety of linear and nonlinear single- and multiphysics problems that are periodic-in-time. It is demonstrated that the proposed parallel-in-time algorithm can obtain the same time-periodic steady-state solution as sequential time-stepping. It is shown that the required number of MGRIT iterations can be estimated a priori and that the new MGRIT variant can significantly and consistently reduce the time-to-solution compared to sequential time-stepping, irrespective of the number of dimensions, linear or nonlinear PDE models, single-physics or coupled problems and the employed computing resources. The numerical experiments demonstrate that the time-periodic MGRIT algorithm enables a greater level of parallelism yielding faster turnaround, and thus, facilitating more complex and more realistic problems to be solved.

97 MATHEMATICS AND COMPUTING↗

A Particle-in-Cell Method for Plasmas with a Generalized Momentum Formulation, Part II: Enforcing the Lorenz Gauge Condition

In a previous paper Christlieb et al. (A particle-in-cell method for plasmas with a generalized momentum formulation, part I: Model formulation, 2024), we developed a new particle-in-cell (PIC) method for the relativistic Vlasov–Maxwell system in which the electromagnetic fields and the equations of motion for the particles were cast in terms of scalar and vector potentials through a Hamiltonian formulation. This new method evolved the potentials under the Lorenz gauge using integral equation methods. New methods to construct spatial derivatives of the potentials that converge at the same rates as the fields were also presented. The new particle method was compared against standard explicit discretizations, including the well-known FDTD-PIC method, for a range of applications involving sheaths and particle beams. Here, this paper extends this new class of methods by focusing on the enforcement the Lorenz gauge condition in both exact and approximate forms using co-located meshes. A time-consistency property of the proposed field solver for the vector potential form of Maxwell’s equations is established, which is shown to preserve the equivalence between the semi-discrete Lorenz gauge condition and the analogous semi-discrete continuity equation. Using this property, we present three methods to enforce a semi-discrete gauge condition. The first method introduces an update for the continuity equation that is consistent with the discretization of the Lorenz gauge condition. Both the finite difference and spectral implementations satisfy this discrete gauge condition to machine precision. The second approach we propose enforces a semi-discrete continuity equation using the boundary integral solution to the field equations. The potential benefit of this approach is that it eliminates spatial derivatives that appear on the particle data, namely the current density, which is often calculated by linear combinations of low-order spline basis functions. This method is ideally suited to boundary integral equation methods that invert multi-dimensional operators without dimensional splitting techniques and will be the subject of future work. The third approach introduces a gauge correcting method that makes direct use of the gauge condition to modify the scalar potential and uses local maps for both the charge and current densities. This results in a gauge error, as the maps do not enforce the continuity equation. The vector potential coming from the current density is taken to be exact, and using the Lorenz gauge, we compute a correction to the scalar potential that makes the two potentials satisfy the gauge condition. This method also enforces the gauge condition to machine precision. We demonstrate two of the proposed methods in the context of periodic domains. Problems defined on bounded domains, including those with complex geometric features remain an ongoing effort. However, this work shows that it is possible to design computationally efficient methods that can effectively enforce the Lorenz gauge condition in a non-staggered PIC formulation.

97 MATHEMATICS AND COMPUTING↗

IMEX and exact sequence discretization of the multi-fluid plasma model

Multi-fluid plasma models, where an electron fluid is modeled in addition to multiple ion and neutral species as well as the full set of Maxwell's equations, are useful for representing physics beyond the scope of classic MHD. This advantage presents challenges in appropriately dealing with electron dynamics and electromagnetic behavior characterized by the plasma and cyclotron frequencies and the speed of light. For physical systems, such as those near the MHD asymptotic regime, this requirement drastically increases runtimes for explicit time integration even though resolving fast dynamics may not be critical for accuracy. Implicit time integration methods, with efficient solvers, can help to step over fast time-scales that constrain stability, but do not strongly influence accuracy. As an extension, Implicit-explicit (IMEX) schemes provide an additional mechanism to choose which dynamics are evolved using an expensive implicit solve or resolved using a fast explicit solve. In this study, in addition to IMEX methods we also consider a physics compatible exact sequence spatial discretization. Here, this combines nodal bases (H-Grad) for fluid dynamics with a set of vector bases (H-Curl and H-Div) for Maxwell's equations. This discretization allows for multi-fluid plasma modeling without violating Gauss' laws for the electric and magnetic fields. This initial study presents a discussion of the major elements of this formulation and focuses on demonstrating accuracy in the linear wave regime and in the MHD limit for both a visco-resistive and a dispersive ideal MHD problem.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Numerical discreteness errors in multispecies cosmological N -body simulations

ABSTRACT We present a detailed analysis of numerical discreteness errors in two-species, gravity-only, cosmological simulations using the density power spectrum as a diagnostic probe. In a simple set-up where both species are initialized with the same total matter transfer function, biased growth of power forms on small scales when the solver force resolution is finer than the mean interparticle separation. The artificial bias is more severe when individual density and velocity transfer functions are applied. In particular, significant large-scale offsets in power are measured between simulations with conventional offset grid initial conditions when compared against converged high-resolution results where the force resolution scale is matched to the interparticle separation. These offsets persist even when the cosmology is chosen so that the two particle species have the same mass, indicating that the error is sourced from discreteness in the total matter field as opposed to unequal particle mass. We further investigate two mitigation strategies to address discreteness errors: the frozen potential method and softened interspecies short-range forces. The former evolves particles under the approximately ‘frozen’ total matter potential in linear theory at early times, while the latter filters cross-species gravitational interactions on small scales in low-density regions. By modelling closer to the continuum limit, both mitigation strategies demonstrate considerable reductions in large-scale power spectrum offsets.

79 ASTRONOMY AND ASTROPHYSICS↗

Novel Geometric Operations for Linear Programming

This report summarizes the work performed under the project "Linear Programming in Strongly Polynomial Time." Linear programming (LP) is a classic combinatorial optimization problem heavily used directly and as an enabling subroutine in integer programming (IP). Specifically IP is the same as LP except that some solution variables must take integer values (e.g. to represent yes/no decisions). Together LP and IP have many applications in resource allocation including general logistics, and infrastructure design and vulnerability analysis. The project was motivated by the PI's recent success developing methods to efficiently sample Voronoi vertices (essentially finding nearest neighbors in high-dimensional point sets) in arbitrary dimension. His method seems applicable to exploring the high-dimensional convex feasible space of an LP problem. Although the project did not provably find a strongly-polynomial algorithm, it explored multiple algorithm classes. The new medial simplex algorithms may still lead to solvers with improved provable complexity. We describe medial simplex algorithms and some relevant structural/complexity results. We also designed a novel parallel LP algorithm based on our geometric insights and implemented it in the Spoke-LP code. A major part of the computational step is many independent vector dot products. Our parallel algorithm distributes the problem constraints across processors. Current commercial and high-quality free LP solvers require all problem details to fit onto a single processor or multicore. Our new algorithm might enable the solution of problems too large for any current LP solvers. We describe our new algorithm, give preliminary proof-of-concept experiments, and describe a new generator for arbitrarily large LP instances.

97 MATHEMATICS AND COMPUTING↗

ColDICE: A parallel Vlasov–Poisson solver using moving adaptive simplicial tessellation

Resolving numerically Vlasov–Poisson equations for initially cold systems can be reduced to following the evolution of a three-dimensional sheet evolving in six-dimensional phase-space. We describe a public parallel numerical algorithm consisting in representing the phase-space sheet with a conforming, self-adaptive simplicial tessellation of which the vertices follow the Lagrangian equations of motion. The algorithm is implemented both in six- and four-dimensional phase-space. Refinement of the tessellation mesh is performed using the bisection method and a local representation of the phase-space sheet at second order relying on additional tracers created when needed at runtime. In order to preserve in the best way the Hamiltonian nature of the system, refinement is anisotropic and constrained by measurements of local Poincaré invariants. Resolution of Poisson equation is performed using the fast Fourier method on a regular rectangular grid, similarly to particle in cells codes. To compute the density projected onto this grid, the intersection of the tessellation and the grid is calculated using the method of Franklin and Kankanhalli [65–67] generalised to linear order. As preliminary tests of the code, we study in four dimensional phase-space the evolution of an initially small patch in a chaotic potential and the cosmological collapse of a fluctuation composed of two sinusoidal waves. We also perform a “warm” dark matter simulation in six-dimensional phase-space that we use to check the parallel scaling of the code.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hybrid iterative approach for simulation of radio-frequency fields in plasma

In this work, a novel iterative approach for solving discretized linear wave equations in a frequency domain, which combines time evolution with iterative relaxation schemes, is presented. In this hybrid approach, each iteration cycle consists of evolution of electromagnetic (EM) fields in time over a specified number of field periods followed by several iterative relaxations. Provided that there is sufficient dissipation, both the time evolution and the iterative relaxations contribute to the convergence of the EM fields to the solution of the formulated full wave boundary value problem. Time evolution rapidly distributes EM fields, propagating with group velocity, over the simulation domain, while the iterative relaxations smooth the fields, reducing the numerical errors such that iteration cycles converge to a steady state solution, approximating the solution of the formulated problem. This approach is intended for large scale simulations which are beyond the capabilities of direct solvers presently used for solving wave equations in the frequency domain. Lastly, the technique is demonstrated for solving wave equations on a regular grid using a cold plasma dielectric model with collisions for 2D modeling of EM fields in tokamak in an electron cyclotron frequency range.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Space charge induced beam instability in periodic focusing channel

The transverse evolution of the envelope of an intense, unbunched ion beam in a linear periodic transport channel can be modeled for the approximation of linear self-fields by the Kapchinskij-Vladimirskij envelope equation. The envelope mismatched modes, or the second order even mode [I. Hofmann, Phys. Rew. E 57, 4713 (1998)], are the lowest order of resonance leading to collective instability that the designer should avoid, which suggests that an accelerator system should be established in the parameter region where the zero beam current phase advance σ{sub 0} less than 90°. In this paper, we systemically studied the resonance mechanisms which result in confluent resonance in quadrupole Focusing-Defocusing (FD) channel and parametric resonance in solenoid channel. We propose that the mismatch modes cannot be exactly separated in FD channel; if one mode is excited, there is always some contribution of the other. To verify the influence of the confluent resonance and parametric resonance, the 2D Poissons solver in the self-consistent particle-in-cell simulation code TOPOPIC is adopted to study the beam evolution in both channels. Our simulations results show that the emittance show significant growth both in the confluent resonance stop band and parametric resonance stop band. The influences of the higher order of resonance are also discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Discrete-Element and Material-Point Method (DEM and MPM) Based Solvers for Sustainable Technologies

We present the use of discrete element method (DEM) and material point method (MPM) in three relevant green technology applications that include biomass feedstock handling, lithium-ion battery manufacturing, and high-pressure reverse osmosis. Our open-source DEM and MPM solvers are developed using performance portable grid and particle management library, AMReX, thus enabling superior performance on NVIDIA and AMD GPUs with > 100 million particles. Our DEM solver resolves the motion of individual particles in a granular system and includes a bonded sphere method for modeling non-spherical particles along with Hertzian and liquid bridge-based contact models. We simulate highly variable biomass feedstock flows in large-scale hoppers for biofuel production and electrode calendering in battery manufacturing using DEM. Our simulations predict flow blockage in large scale biomass hoppers and electrode microstructure variations, thus providing valuable information for biofuel and battery manufacturers, respectively. The second half of the talk will be on MPM and its application towards pore resolved simulations of reverse osmosis membranes under compressive loads. We present a validation study of our MPM simulations with membrane microscopy imaging thus providing useful insights on membrane stability under high pressure conditions. We also present a spectral stability analysis of using linear hat, quadratic and cubic spline basis in MPM indicating regions of numerical stability.

BIOMASS FUELS,MATHEMATICS AND COMPUTING↗

A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization

In this paper, we present a distributed-memory library for computations with dense structured matrices. A matrix is considered structured if its off-diagonal blocks can be approximated by a rank-deficient matrix with low numerical rank. Here, we use Hierarchically Semi-Separable (HSS) representations. Such matrices appear in many applications, for example, finite-element methods, boundary element methods, and so on. Exploiting this structure allows for fast solution of linear systems and/or fast computation of matrix-vector products, which are the two main building blocks of matrix computations. The compression algorithm that we use, that computes the HSS form of an input dense matrix, relies on randomized sampling with a novel adaptive sampling mechanism. We discuss the parallelization of this algorithm and also present the parallelization of structured matrix-vector product, structured factorization, and solution routines. The efficiency of the approach is demonstrated on large problems from different academic and industrial applications, on up to 8,000 cores. Finally, this work is part of a more global effort, the STRUctured Matrices PACKage (STRUMPACK) software package for computations with sparse and dense structured matrices. Hence, although useful on their own right, the routines also represent a step in the direction of a distributed-memory sparse solver.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

ReEDS Performance Improvement

The Regional Energy Deployment System (ReEDS) is an open-source, spatially explicit, long-term capacity expansion model for the bulk electric power system of the contiguous United States, encompassing multiple scenarios with technological and political assumptions (see https://github.com/NREL/ReEDS-2.0). With the increased needs for capabilities, higher temporal and spatial resolutions to model the evolution of the power system with modern technologies and low-carbon pathways, ReEDS' model solution times have increased significantly from 4-6 hours in 2018 to 18-48+ hours in 2023 . Also, the model size for commonly-run ReEDS scenarios reached 22 and 28 million equations and variables, respectively. These runtimes can be especially challenging under certain scenario settings (e.g., very high temporal or spatial resolution) or with limited computational power. In this presentation, we will discuss several methods we used to improve model runtime, including data preparation, model modification, and solver tuning. The implementation of these methods shrank the model size to 7.2 and 7.3 million equations and variables, respectively. Furthermore, this led to a 77% reduction in the model's run time for commonly-run ReEDS scenarios. We will discuss the process of identifying areas for solve time improvements and how the specific enhancements for the ReEDS model might be applied to other similar large-scale models.

ENERGY PLANNING, POLICY, AND ECONOMY,MATHEMATICS A↗

A coupled ordinates method for solution acceleration of rarefied gas dynamics simulations

Non-equilibrium rarefied flows are frequently encountered in a wide range of applications, including atmospheric re-entry vehicles, vacuum technology, and microscale devices. Rarefied flows at the microscale can be effectively modeled using the ellipsoidal statistical Bhatnagar–Gross–Krook (ESBGK) form of the Boltzmann kinetic equation. Numerical solutions of these equations are often based on the finite volume method (FVM) in physical space and the discrete ordinates method in velocity space. However, existing solvers use a sequential solution procedure wherein the velocity distribution functions are implicitly coupled in physical space, but are solved sequentially in velocity space. This leads to explicit coupling of the distribution function values in velocity space and slows down convergence in systems with low Knudsen numbers. Furthermore, this also makes it difficult to solve multiscale problems or problems in which there is a large range of Knudsen numbers. In this paper, we extend the coupled ordinates method (COMET), previously developed to study participating radiative heat transfer, to solve the ESBGK equations. In this method, at each cell in the physical domain, distribution function values for all velocity ordinates are solved simultaneously. This coupled solution is used as a relaxation sweep in a geometric multigrid method in the spatial domain. Enhancements to COMET to account for the non-linearity of the ESBGK equations, as well as the coupled implementation of boundary conditions, are presented. The methodology works well with arbitrary convex polyhedral meshes, and is shown to give significantly faster solutions than the conventional sequential solution procedure. Acceleration factors of 5–9 are obtained for low to moderate Knudsen numbers on single processor platforms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Aeroelastic oscillations of a cantilever with structural nonlinearities: theory and numerical simulation.

Our study details the derivation of the nonlinear equations of motion for the axial, biaxial bending and torsional vibrations of an aeroelastic cantilever undergoing rigid body (pitch) rotation at the base. The primary attenstion is focussed on the geometric nonlinearities of the system, whereby the aeroelastic load is modeled by the theory of linear quasisteady aerodynamics. This modelling effort is intended to mimic the wind-tunnel experimental setup at the Royal Military College of Canada. While the derivation closely follows the work of Hodges and Dowell [1] for rotor blades, this aeroelastic system contains new inertial terms which stem from the fundamentally different kinematics than those exhibited by helicopter or wind turbine blades. Using the Hamilton’s principle, a set of coupled nonlinear partial differential equations (PDEs) and an ordinary differential equation (ODE) are derived which describes the coupled axial-bending-bending-torsion-pitch motion of the aeroelastic cantilever with the pitch rotation. The finite dimensional approximation of the coupled system of PDEs are obtained using the Galerkin projection, leading to a coupled system of ODEs. Subsequently, these nonlinear ODEs are solved numerically using the built-in MATLAB implicit ODE solver and the associated numerical results are compared with those obtained using Houbolt’s method. It is demonstrated that the system undergoes coalescence flutter, leading to a limit cycle oscillation (LCO) due to coupling between the rigid body pitching mode and teh flexible mode arising from the flapwise bending motion.

42 ENGINEERING↗

Optimal Voltage Reference for Droop-Based DERs in Distribution Systems

Due to the newly issued standards on distributed energy resources (DERs), the droop-based operation modes (Q-V and P-V droops) become a requirement for all the interconnected DER units at the distribution level. Voltage references of the DER units can be assigned to improve the operational behavior of the distribution system in the smart grid context. This paper presents a novel formulation for optimally setting voltage reference of the droop-based DER units in distribution systems with the objective of minimizing the system ohmic loss. This problem is formulated as a mixed-integer quadratic convex optimization problem in MATLAB and solved by the MATLAB and CPLEX solvers. The IEEE 123-bus system and the EPRI test system Ckt5 are used to validate the proposed formulation. The result obtained from the proposed formulation is compared with the result of the original problem solved by the heuristic method. Based on the numerical study results, system loss can be reduced after the proposed voltage reference assignment. The computational expense of the new formulation is also much lower than that of the heuristic approach.

distributed energy resource integration↗

Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems

Challenging combinatorial optimization problems are ubiquitous in science and engineering. Several quantum methods for optimization have recently been developed, in different settings including both exact and approximate solvers. Addressing this field of research, this manuscript has three distinct purposes. First, we present an intuitive method for synthesizing and analyzing discrete (i.e., integer-based) optimization problems, wherein the problem and corresponding algorithmic primitives are expressed using a discrete quantum intermediate representation (DQIR) that is encoding-independent. This compact representation often allows for more efficient problem compilation, automated analyses of different encoding choices, easier interpretability, more complex runtime procedures, and richer programmability, as compared to previous approaches, which we demonstrate with a number of examples. Second, we perform numerical studies comparing several qubit encodings; the results exhibit a number of preliminary trends that help guide the choice of encoding for a particular set of hardware and a particular problem and algorithm. Our study includes problems related to graph coloring, the traveling salesperson problem, factory/machine scheduling, financial portfolio rebalancing, and integer linear programming. Third, we design low-depth graph-derived partial mixers (GDPMs) up to 16-level quantum variables, demonstrating that compact (binary) encodings are more amenable to QAOA than previously understood. We expect this toolkit of programming abstractions and low-level building blocks to aid in designing quantum algorithms for discrete combinatorial problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗