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 991 records · Page 55

A 2D/1D coupling neutron transport method based on the matrix MOC and NEM methods

A new 2D/1D coupling method based on the matrix MOC method (MMOC) and nodal expansion method (NEM) is proposed for solving the three-dimensional heterogeneous neutron transport problem. The MMOC method, used for radial two-dimensional calculation, constructs a response matrix between source and flux with only one sweep and then solves the linear system by using the restarted GMRES algorithm instead of the traditional trajectory sweeping process during within-group iteration for angular flux update. Long characteristics are generated by using the customization of commercial software AutoCAD. A one-dimensional diffusion calculation is carried out in the axial direction by employing the NEM method. The 2D and ID solutions are coupled through the transverse leakage items. The 3D CMFD method is used to ensure the global neutron balance and adjust the different convergence properties of the radial and axial solvers. A computational code is developed based on these theories. Two benchmarks are calculated to verify the coupling method and the code. It is observed that the corresponding numerical results agree well with references, which indicates that the new method is capable of solving the 3D heterogeneous neutron transport problem directly. (authors)

97 MATHEMATICS AND COMPUTING↗

A Fast Butterfly-Compressed Hadamard–Babich Integrator for High-Frequency Helmholtz Equations in Inhomogeneous Media with Arbitrary Sources

Here we present a butterfly-compressed representation of the Hadamard-Babich (HB) ansatz for the Green's function of the high-frequency Helmholtz equation in smooth inhomogeneous media. For a computational domain discretized with Nv discretization cells, the proposed algorithm first solves and tabulates the phase and HB coefficients via eikonal and transport equations with observation points and point sources located at the Chebyshev nodes using a set of much coarser computation grids, and then butterfly compresses the resulting HB interactions from all Nv cell centers to each other. The overall CPU time and memory requirement scale as O(Nv log2 Nv) for any bounded two-dimensional (2D) domains with arbitrary excitation sources. A direct extension of this scheme to bounded 3D domains yields an O(Nv4/3) CPU complexity, which can be further reduced to quasi-linear complexities with proposed remedies. The scheme can also efficiently handle scattering problems involving inclusions in inhomogeneous media. Although the current construction of our HB integrator does not accommodate caustics, the resulting HB integrator itself can be applied to certain sources, such as concave-shaped sources, to produce caustic effects. Compared to finite-difference frequency domain methods, the proposed HB integrator is free of numerical dispersion and requires fewer discretization points per wavelength. As a result, it can solve wave propagation problems well beyond the capability of existing solvers. Remarkably, the proposed scheme can accurately model wave propagation in 2D domains with 640 wavelengths per direction and in 3D domains with 54 wavelengths per direction on a state-of-the-art supercomputer at Lawrence Berkeley National Laboratory.

Hadamard--Babich ansatz↗

Design-Space Exploration for Inverse-Design of Wind Turbine Blades Using Data-Driven Methods

The state-of-the-practice aerodynamic design methods for wind turbine blades is typically based on Blade-Element Momentum (BEM) theory using a pre-designed frozen family of airfoils. The airfoils are themselves typically designed using panel methods. The design of the next-generation of large flexible rotors will need to capture the non-linear aerodynamics and three-dimensional flow to reduce the levelized cost of wind energy. Data-driven methods for aerodynamic design using data generated by computational fluid dynamics offer an attractive alternative to BEM-based methods that captures the non-linear aerodynamics of the component airfoils as well as the root and tip sections. In this work, we develop and demonstrate a framework to "smartly" explore the relevant design space in combination with an appropriate automated CFD pipeline to evaluate the aerodynamics of each design. The design-space exploration framework uses appropriate perturbations to the airfoil shape and induction profile from a baseline shape in combination with the inverse-design using BEM. The resulting designs are evaluated using an automated CFD pipeline using the in-house CFD solver framework "Mercury". We perform verification and validation to establish the capability of the Mercury framework to predict the aerodynamic performance of wind turbines. The CFD simulation of the perturbed blade shapes are optimized to restart from the converged baseline simulation to reduce the computational time. Finally, we demonstrate the design-space exploration technique for the design of the outboard section and the full rotor using perturbations to the shape and operating conditions of the NREL 5-MW turbine.

aerodynamic design methods↗

Nanoparticle diffusion in sheared cellular blood flow

Using a multiscale blood flow solver, the complete diffusion tensor of nanoparticles (NPs) in sheared cellular blood flow is calculated over a wide range of shear rate and haematocrit. In the short-time regime, NPs exhibit anomalous dispersive behaviors under high shear and high haematocrit due to the transient elongation and alignment of the red blood cells (RBCs). In the long-time regime, the NP diffusion tensor features high anisotropy. Particularly, there exists a critical shear rate ( ${\sim}100~\text{s}^{-1}$ ) around which the shear-rate dependence of the diffusivity tensor changes from linear to nonlinear scale. Above the critical shear rate, the cross-stream diffusivity terms vary sublinearly with shear rate, while the longitudinal term varies superlinearly. The dependence on haematocrit is linear in general except at high shear rates, where a sublinear scale is found for the vorticity term and a quadratic scale for the longitudinal term. Through analysis of the suspension microstructure and numerical experiments, the nonlinear haemorheological dependence of the NP diffusion tensor is attributed to the streamwise elongation and cross-stream contraction of RBCs under high shear, quantified by a capillary number. The RBC size is shown to be the characteristic length scale affecting the RBC-enhanced shear-induced diffusion (RESID), while the NP submicrometre size exhibits negligible influence on the RESID. Based on the observed scaling behaviours, empirical correlations are proposed to bridge the NP diffusion tensor to specific shear rate and haematocrit. As a result, the characterized NP diffusion tensor provides a constitutive relation that can lead to more effective continuum models to tackle large-scale NP biotransport applications.

60 APPLIED LIFE SCIENCES↗

Integrated Transmission-Distribution Multi-Period Switching for Wildfire Risk Mitigation: Improving Speed and Scalability with Distributed Optimization: Preprint

With increasingly severe wildfire conditions driven by climate change, utilities must manage the risk of wildfire ignitions from electric power lines. During "public safety power shutoff'" events, utilities de-energize power lines to reduce wildfire ignition risk, which may result in load shedding. Distributed energy resources provide flexibility that can help support the system to reduce load shedding when lines are de-energized. We investigate a coordinated transmission-distribution optimization problem that balances wildfire risk mitigation and load shedding. We model distribution systems that include battery energy storage systems which may support loads when transmission lines are de-energized. This multi-period integrated transmission-distribution optimal switching problem jointly optimizes line switching decisions, the generators' setpoints, load shedding, and the batteries' states of charge, resulting in significant computational challenges. To improve scalability, we decompose the problem over both space and time and apply a distributed optimization algorithm. Using a large-scale synthetic California test case with realistic distribution models and real wildfire risk data, we show that distributed optimization can solve large-scale multi-period switching problems that are otherwise intractable for centralized solvers. We also discuss challenges and future directions for improving the distributed algorithm's convergence performance as the number of time periods increases.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Multistage mixed precision iterative refinement

Abstract Low precision arithmetic, in particular half precision (16‐bit) floating point arithmetic, is now available in commercial hardware. Using lower precision can offer significant savings in computation and communication costs with proportional savings in energy. Motivated by this, there has been a renewed interest in mixed precision iterative refinement schemes for solving linear systems , and new variants of GMRES‐based iterative refinement have been developed. Each particular variant with a given combination of precisions leads to different condition number‐based constraints for convergence of the backward and forward errors, and each has different performance costs. The constraints for convergence given in the literature are, as an artifact of the analyses, often overly strict in practice, and thus could lead a user to select a more expensive variant when a less expensive one would have sufficed. In this work, we develop a multistage mixed precision iterative refinement solver which aims to combine existing mixed precision approaches to balance performance and accuracy and improve usability. For a user‐specified initial combination of precisions, the algorithm begins with the least expensive approach and convergence is monitored via inexpensive computations with quantities produced during the iteration. If slow convergence or divergence is detected using particular stopping criteria, the algorithm switches to use a more expensive, but more reliable variant. A novel aspect of our approach is that, unlike existing implementations, our algorithm first attempts to use “stronger” GMRES‐based solvers for the solution update before resorting to increasing the precision(s). In some scenarios, this can avoid the need to refactorize the matrix in higher precision. We perform extensive numerical experiments on a variety of random dense problems and problems from real applications which confirm the benefits of the multistage approach.

Oktay, Eda↗

A self-consistent electrostatic electrified shallow water model for charged liquid surface dynamics

The dynamics of an electrified liquid surface are investigated using a shallow water model that is self-consistently coupled with an electrostatic solver. To account for the spatiotemporal variation of a curved liquid surface, the electric field on curved surfaces is calculated by solving a two-dimensional electrostatic equation using the weighted least squares (WLSQ) interpolation method. First, the WLSQ implementation is verified with analytical theory obtained from a Laplace solution assuming a half-cylinder liquid surface profile. Then, the coupled electrified shallow water model is used to study the instability of liquid surface perturbation as a function of the potential drop between an electrode and conducting liquid, surface tension, and gravity. We present a linear dispersion theory of liquid surface instability for long-wavelength perturbations, including the effects of liquid viscosity. Furthermore, the effects of multiple sinusoidal surface perturbations on the electrified liquid surface instability are investigated.

Capillary waves↗

Verification of Coupled Hydraulic Fracturing Simulators Using Laboratory-Scale Experiments

In this work, we aim to verify the predictions of the numerical simulators, which are used for designing field-scale hydraulic stimulation experiments. Although a strong theoretical understanding of this process has been gained over the past few decades, numerical predictions of fracture propagation in low-permeability rocks still remains a challenge. Against this background, we performed controlled laboratory-scale hydraulic fracturing experiments in granite samples, which not only provides high-quality experimental data but also a well-characterized experimental set-up. Using the experimental pressure responses and the final fracture sizes as benchmark, we compared the numerical predictions of two coupled hydraulic fracturing simulators—CSMP and GEOS. Both the simulators reproduced the experimental pressure behavior by implementing the physics of Linear Elastic Fracture Mechanics (LEFM) and lubrication theory within a reasonable degree of accuracy. The simulation results indicate that even in the very low-porosity (1–2 %) and low-permeability (10 -18 m 2 - 10 -19 m 2 ) crystalline rocks, which are usually the target of EGS, fluid-loss into the matrix and unsaturated flow impacts the formation breakdown pressure and the post-breakdown pressure trends. Therefore, underestimation of such parameters in numerical modeling can lead to significant underestimation of breakdown pressure. The simulation results also indicate the importance of implementing wellbore solvers for considering the effect of system compressibility and pressure drop due to friction in the injection line. The varying injection rate as a result of decompression at the instant of fracture initiation affects the fracture size, while the entry friction at the connection between the well and the initial notch may cause an increase in the measured breakdown pressure.

15 GEOTHERMAL ENERGY↗

Mechanisms for the convergence of time-parallelized, parareal turbulent plasma simulations

Parareal is a recent algorithm able to parallelize the time dimension in spite of its sequential nature. It has been applied to several linear and nonlinear problems and, very recently, to a simulation of fully-developed, two-dimensional drift wave turbulence. The mere fact that parareal works in such a turbulent regime is in itself somewhat unexpected, due to the characteristic sensitivity of turbulence to any change in initial conditions. This fundamental property of any turbulent system should render the iterative correction procedure characteristic of the parareal method inoperative, but this seems not to be the case. In addition, the choices that must be made to implement parareal (division of the temporal domain, election of the coarse solver and so on) are currently made using trial-and-error approaches. Here, we identify the mechanisms responsible for the convergence of parareal of these simulations of drift wave turbulence. We also investigate which conditions these mechanisms impose on any successful parareal implementation. The results reported here should be useful to guide future implementations of parareal within the much wider context of fully-developed fluid and plasma turbulent simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal Power Flow of Radial Networks and Its Variations: A Sequential Convex Optimization Approach

This paper proposes a sequential convex optimization method to solve broader classes of optimal power flow (OPF) problems over radial networks. The non-convex branch power flow equation is decomposed as a second-order cone inequality and a non-convex constraint involving the difference of two convex functions. Provided with an initial solution offered by an inexact second-order cone programming relaxation model, this approach solves a sequence of convexified penalization problems, where concave terms are approximated by linear functions and updated in each iteration. It could recover a feasible power flow solution, which usually appears to be very close, if not equal, to the global optimal one. Two variations of the OPF problem, in which non-cost related objectives are optimized subject to power flow constraints and the convex relaxation is generally inexact, are elaborated in detail. One is the maximum loadability problem, which is formulated as a special OPF problem that seeks the maximal distance to the boundary of power flow insolvability. The proposed method is shown to outperform commercial nonlinear solvers in terms of robustness and efficiency. The other is the bi-objective OPF problem. A non-parametric scalarization model is suggested, and is further reformulated as an extended OPF problem by convexifying the objective function. It provides a single trade-off solution without any subjective preference. The proposed computation framework also helps retrieve the Pareto front of the bi-objective OPF via the e-constraint method or the normal boundary intersection method. This paper also discusses extensions for OPF problems over meshed networks based on the semidefinite programming relaxation method.

bi-objective optimization↗

BDDC algorithms with deluxe scaling and adaptive selection of primal constraints for Raviart-Thomas vector fields

Here, a BDDC domain decomposition preconditioner is defined by a coarse component, expressed in terms of primal constraints, a weighted average across the interface between the subdomains, and local components given in terms of solvers of local subdomain problems. BDDC methods for vector field problems discretized with Raviart-Thomas finite elements are introduced. The methods are based on a new type of weighted average an adaptive selection of primal constraints developed to deal with coefficients with high contrast even inside individual subdomains. For problems with very many subdomains, a third level of the preconditioner is introduced. Assuming that the subdomains are all built from elements of a coarse triangulation of the given domain, and that in each subdomain the material parameters are consistent, one obtains a bound for the preconditioned linear system's condition number which is independent of the values and jumps of these parameters across the subdomains' interface. Numerical experiments, using the PETSc library, are also presented which support the theory and show the algorithms' effectiveness even for problems not covered by the theory. Also included are experiments with Brezzi-Douglas-Marini finite-element approximations.

97 MATHEMATICS AND COMPUTING↗

TAS: 89 0227: TAS Recovery Act - Optimization and Control of Electric Power Systems: ARRA

The name SuperOPF is used to refer several projects, problem formulations and soft-ware tools intended to extend, improve and re-define some of the standard methods of optimizing electric power systems. Our work included applying primal-dual interior point methods to standard AC optimal power flow problems of large size, as well as extensions of this problem to include co-optimization of multiple scenarios. The original SuperOPF problem formulation was based on co-optimizing a base scenario along with multiple post-contingency scenarios, where all AC power flow models and constraints are enforced for each, to find optimal energy contracts, endogenously determined locational reserves and appropriate nodal energy prices for a single period optimal power flow problem with uncertainty. This led to example non-linear programming problems on the order of 1 million constraints and half a million variables. The second generation SuperOPF formulation extends this by adding multiple periods and multiple base scenarios per period. It also incorporates additional variables and constraints to model load following reserves, ramping costs, and storage resources. A third generation of the multi-period SuperOPF, adds both integer variables and a receding horizon framework in which the problem type is more challenging (mixed integer), the size is even larger, and it must be solved more frequently, pushing the limits of currently available algorithms and solvers. The consideration of transient stability constraints in optimal power flow (OPF) problems has become increasingly important in modern power systems. Transient stability constrained OPF (TSCOPF) is a nonlinear optimization problem subject to a set of algebraic and differential equations. Solving a TSCOPF problem can be challenging due to (i) the differential-equation constraints in an optimization problem, (ii) the lack of a true analytical expression for transient stability in OPF. To handle the dynamics in TSCOPF, the set of differential equations can be approximated or converted into equivalent algebraic equations before they are included in an OPF formulation. In Chapter 4, a rigorous evaluation of using a predefined and fixed threshold for rotor angles as a mean to determine transient stability of the system is developed. TSCOPF can be modeled as a large-scale nonlinear programming problem including the constraints of differential-algebraic equations (DAE). Solving a TSCOPF problem can be challenging due to (i) the differential-equation constraints in an optimization problem, (ii) the lack of a true analytical expression for transient stability constraint in OPF. Unfortunately, even the current best TSCOPF solvers still suffer from the curse of dimensionality and unacceptable computational time, especially for large-scale power systems with multiple contingencies. In chapter 5, thse issues will be addressed and a new method to incorporate the transient stability constraints will be presented.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Acausality-driven instabilities in relativistic viscous hydrodynamics

We investigate non-linear instabilities stemming from superluminal propagation of information in Israel-Stewart-like models of relativistic viscous fluid dynamics. In relativity, the characteristic speed of propagation of information, $w$, and the speed of the fluid, $v$, allow us to differentiate between regimes of the hydrodynamic equations that are acausal but stable ($w>1$), unstable ($v^{2} w^{2} \geq 1$), and covariantly ill-posed ($w^{2} \leq 0$). As an analytical benchmark, we present a new solution that illustrates these distinct regimes. We compare this analytical solution to the result of a numerical relativistic viscous fluid dynamics solver, and confirm that the analytical result can be recovered numerically in the stable regime, whether causal or acausal. The onset of numerical instabilities is further found to occur in the regime predicted by the analytical solution.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Comparison of depth-averaged concentration and bed load flux sediment transport models of dam-break flow

This paper presents numerical simulations of dam-break flow over a movable bed. Two different mathematical models were compared: a fully coupled formulation of shallow water equations with erosion and deposition terms (a depth-averaged concentration flux model), and shallow water equations with a fully coupled Exner equation (a bed load flux model). Both models were discretized using the cell-centered finite volume method, and a second-order Godunov-type scheme was used to solve the equations. The numerical flux was calculated using a Harten, Lax, and van Leer approximate Riemann solver with the contact wave restored (HLLC). A novel slope source term treatment that considers the density change was introduced to the depth-averaged concentration flux model to obtain higher-order accuracy. A source term that accounts for the sediment flux was added to the bed load flux model to reflect the influence of sediment movement on the momentum of the water. In a one-dimensional test case, a sensitivity study on different model parameters was carried out. For the depth-averaged concentration flux model, Manning's coefficient and sediment porosity values showed an almost linear relationship with the bottom change, and for the bed load flux model, the sediment porosity was identified as the most sensitive parameter. The capabilities and limitations of both model concepts are demonstrated in a benchmark experimental test case dealing with dam-break flow over variable bed topography.

58 GEOSCIENCES↗

Three dimensional finite element methods: Their role in the design of DC accelerator systems

High Voltage Engineering has designed, built and tested a 2 MV dual irradiation system that will be applied for radiation damage studies and ion beam material modification. The system consists of two independent accelerators which support simultaneous proton and electron irradiation (energy range 100 keV - 2 MeV) of target sizes of up to 300 Multiplication-Sign 300 mm{sup 2}. Three dimensional finite element methods were used in the design of various parts of the system. The electrostatic solver was used to quantify essential parameters of the solid-state power supply generating the DC high voltage. The magnetostatic solver and ray tracing were used to optimize the electron/ion beam transport. Close agreement between design and measurements of the accelerator characteristics as well as beam performance indicate the usefulness of three dimensional finite element methods during accelerator system design.

36 MATERIALS SCIENCE↗

A modified priority list-based MILP method for solving large-scale unit commitment problems

This paper studies the typical pattern of unit commitment (UC) results in terms of generator’s cost and capacity. A method is then proposed to combine a modified priority list technique with mixed integer linear programming (MILP) for UC problem. The proposed method consists of two steps. At the first step, a portion of generators are predetermined to be online or offline within a look-ahead period (e.g., a week), based on the demand curve and generator priority order. For the generators whose on/off status is predetermined, at the second step, the corresponding binary variables are removed from the UC MILP problem over the operational planning horizon (e.g., 24 hours). With a number of binary variables removed, the resulted problem can be solved much faster using the off-the-shelf MILP solvers, based on the branch-and-bound algorithm. In the modified priority list method, scale factors are designed to adjust the tradeoff between solution speed and level of optimality. It is found that the proposed method can significantly speed up the UC problem with minor compromise in optimality by selecting appropriate scale factors.

Ke, Xinda↗

KKT Preconditioners for PDE-Constrained Optimization with the Helmholtz Equation

This paper considers preconditioners for the linear systems that arise from optimal control and inverse problems involving the Helmholtz equation. Specifically, we explore an all-at-once approach. The main contribution centers on the analysis of two block preconditioners. Variations of these preconditioners have been proposed and analyzed in prior works for optimal control problems where the underlying partial differential equation is a Laplace-like operator. In this paper, we extend some of the prior convergence results to Helmholtz-based optimization applications. Our analysis examines situations where control variables and observations are restricted to subregions of the computational domain. We prove that solver convergence rates do not deteriorate as the mesh is refined or as the wavenumber increases. More specifically, for one of the preconditioners we prove accelerated convergence as the wavenumber increases. Additionally, in situations where the control and observation subregions are disjoint, we observe that solver convergence rates have a weak dependence on the regularization parameter. We give a partial analysis of this behavior. We illustrate the performance of the preconditioners on control problems motivated by acoustic testing.

97 MATHEMATICS AND COMPUTING↗

A Quantum Approach for Implementing Fixed-Point Arithmetic in Solving Ordinary Differential Equations

Differential equations (DEs) serve as fundamental tools in mathematical modeling across scientific disciplines, yet classical numerical solvers face limitations with large-scale or computationally intensive problems. This study explores a quantum-inspired approach to solving DEs, combining quantum- inspired techniques with classical methods. It focuses on fixed- point arithmetic on quantum circuits, utilizing basic quantum gates to manipulate DE solutions. We expand upon the techniques introduced by Zanger et al. [Quantum, 5, 502 (2021)] by offering a precise computation for a fixed-point signed multiplication scheme, while also presenting a quantum circuit capable of executing the fixed-point division algorithm. We demonstrate the feasibility of our approach through the simulation of a linear Ordinary Differential Equation (ODE), where initial conditions and parameters are encoded into quantum circuits using fixed- point representation. By executing sequences of quantum gates mimicking numerical integration steps, we obtain approximate solutions to the ODE with specified fixed-point precision.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗