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 577 records · Page 32

A Mixed integer linear programming‐based distributed energy management for networked microgrids considering network operational objectives and constraints

Abstract Mixed integer linear programming (MILP)–based distributed energy management for networked microgrids embedded modern distribution systems is proposed. Considering the diverse ownership of microgrids, distributed energy resources (DERs) that interface directly with utilities and responsive loads, an alternating direction method of multipliers–based distributed framework was formulated for the scheduling of networked microgrids embedded modern distribution systems by adjusting nodal price signals iteratively. In addition, to make the formulated optimization problems resolvable through more accessible and popular MILP solvers, different linearisation techniques were employed to transform the nonlinear terms into linear or mixed integer linear formats. The proposed MILP‐based distributed method preserves all participants' autonomy (e.g., microgrids, DERs that interface directly with utilities and responsive loads), while incentivising them to actively participate in the distribution system operation with price signals. The proposed method is validated with results of numerical simulation using a modern distribution system consisting of multiple networked microgrids, DERs that interface directly with utilities, as well as responsive loads.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Linear source approximation in CASMO5

A Linear Source (LS) approximation has been implemented in the two-dimensional Method of Characteristics (MOC) transport solver in a prototype version of CASMO5. The LS approximation, which relies on the computation of trajectory-based spatial moments over source regions to obtain the linear source expansion coefficients, improves the solution accuracy relative to the 'flat' or constant source approximation. In addition, the LS formulation is capable of treating arbitrarily-shaped source regions and is compatible with standard Coarse-Mesh Finite Difference (CMFD) acceleration. Numerical tests presented in this paper for the C5G7 MOX benchmark show that, for comparable accuracy with respect to the reference solution, the LS approximation can reduce the run time by a factor of four and the memory requirements by a factor often relative to the FS scheme. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Impurities in a non-axisymmetric plasma. Transport and effect on bootstrap current

Impurities cause radiation losses and plasma dilution, and in stellarator plasmas the neoclassical ambipolar radial electric field is often unfavorable for avoiding strong impurity peaking. In this work we use a new continuum drift-kinetic solver, the SFINCS code (the Stellarator Fokker-Planck Iterative Neoclassical Conservative Solver) [M. Landreman et al., Phys. Plasmas 21 (2014) 042503] which employs the full linearized Fokker-Planck-Landau operator, to calculate neoclassical impurity transport coefficients for a Wendelstein 7-X (W7-X) magnetic configuration. We compare SFINCS calculations with theoretical asymptotes in the high collisionality limit. We observe and explain a 1/nu-scaling of the inter-species radial transport coefficient at low collisionality, arising due to the field term in the inter-species collision operator, and which is not found with simplified collision models even when momentum correction is applied. However, this type of scaling disappears if a radial electric field is present. We use SFINCS to analyze how the impurity content affects the neoclassical impurity dynamics and the bootstrap current. We show that a change in plasma effective charge Z eff of order unity can affect the bootstrap current enough to cause a deviation in the divertor strike point locations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Scalable domain decomposition solvers for stochastic PDEs in high performance computing

Stochastic spectral finite element models of practical engineering systems may involve solutions of linear systems or linearized systems for non-linear problems with billions of unknowns. For stochastic modeling, it is therefore essential to design robust, parallel and scalable algorithms that can efficiently utilize high-performance computing to tackle such large-scale systems. Domain decomposition based iterative solvers can handle such systems. And though these algorithms exhibit excellent scalabilities, significant algorithmic and implementational challenges exist to extend them to solve extreme-scale stochastic systems using emerging computing platforms. Intrusive polynomial chaos expansion based domain decomposition algorithms are extended here to concurrently handle high resolution in both spatial and stochastic domains using an in-house implementation. Sparse iterative solvers with efficient preconditioners are employed to solve the resulting global and subdomain level local systems through multi-level iterative solvers. We also use parallel sparse matrix–vector operations to reduce the floating-point operations and memory requirements. Numerical and parallel scalabilities of these algorithms are presented for the diffusion equation having spatially varying diffusion coefficient modeled by a non-Gaussian stochastic process. Scalability of the solvers with respect to the number of random variables is also investigated.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An MILP-Based Distributed Energy Management for Coordination of Networked Microgrids

An MILP-based distributed energy management for the coordination of networked microgrids is proposed in this paper. Multiple microgrids and the utility grid are coordinated through iteratively adjusted price signals. Based on the price signals received, the microgrid controllers (MCs) and distribution management system (DMS) update their schedules separately. Then, the price signals are updated according to the generation–load mismatch and distributed to MCs and DMS for the next iteration. The iteration continues until the generation–load mismatch is small enough, i.e., the generation and load are balanced under agreed price signals. Through the proposed distributed energy management, various microgrids and the utility grid with different economic, resilient, emission and socio-economic objectives are coordinated with generation–load balance guaranteed and the microgrid customers’ privacy preserved. In particular, a piecewise linearization technique is employed to approximate the augmented Lagrange term in the alternating direction method of multipliers (ADMM) algorithm. Thus, the subproblems are transformed into mixed integer linear programming (MILP) problems and efficiently solved by open-source MILP solvers, which would accelerate the adoption and deployment of microgrids and promote clean energy. The proposed MILP-based distributed energy management is demonstrated through various case studies on a networked microgrids test system with three microgrids.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Navier-Stokes Solvers and Generalizations for Reacting Flow Problems

This is an overview of our accomplishments during the final term of this grant (1 September 2008 -- 30 June 2012). These fall mainly into three categories: fast algorithms for linear eigenvalue problems; solution algorithms and modeling methods for partial differential equations with uncertain coefficients; and preconditioning methods and solvers for models of computational fluid dynamics (CFD).

97 MATHEMATICS AND COMPUTING↗

Decreasing the temporal complexity for nonlinear, implicit reduced-order models by forecasting

Implicit numerical integration of nonlinear ODEs requires solving a system of nonlinear algebraic equations at each time step. Each of these systems is often solved by a Newton-like method, which incurs a sequence of linear-system solves. Most model-reduction techniques for nonlinear ODEs exploit knowledge of system's spatial behavior to reduce the computational complexity of each linear-system solve. However, the number of linear-system solves for the reduced-order simulation often remains roughly the same as that for the full-order simulation. We propose exploiting knowledge of the model's temporal behavior to (1) forecast the unknown variable of the reduced-order system of nonlinear equations at future time steps, and (2) use this forecast as an initial guess for the Newton-like solver during the reduced-order-model simulation. To compute the forecast, we propose using the Gappy POD technique. As a result, the goal is to generate an accurate initial guess so that the Newton solver requires many fewer iterations to converge, thereby decreasing the number of linear-system solves in the reduced-order-model simulation.

97 MATHEMATICS AND COMPUTING↗

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↗

Convective Raman amplification of light pulses causing kinetic inflation in inertial fusion plasmas

We perform 1D particle-in-cell (PIC) simulations using OSIRIS, which model a short-duration ({approx}500{omega}{sub 0}{sup -1} FWHM) scattered light seed pulse in the presence of a constant counter-propagating pump laser with an intensity far below the absolute instability threshold. The seed undergoes linear convective Raman amplification and dominates over fluctuations due to particle discreteness. Our simulation results are in good agreement with results from a coupled-mode solver when we take into account special relativity and the use of finite size PIC simulation particles. We present linear gain spectra including both effects. Extending the PIC simulations past when the seed exits the simulation domain reveals bursts of large-amplitude scattering in many cases, which does not occur in simulations without the seed pulse. These bursts can have amplitudes several times greater than the amplified seed pulse, and we demonstrate that this large-amplitude scattering is the result of kinetic inflation by examining trapped particle orbits. This large-amplitude scattering is caused by the seed modifying the distribution function earlier in the simulation. We perform some simulations with longer duration seeds, which lead to parts of the seeds undergoing kinetic inflation and reaching amplitudes several times more than the steady-state linear theory results. Simulations with continuous seeds demonstrate that the onset of inflation depends on seed wavelength and incident intensity, and we observe oscillations in the reflectivity at a frequency equal to the difference between the seed frequency and the frequency at which the inflationary stimulated Raman scattering grows.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Scaled ILU Smoothers for Navier-Stokes Pressure Projection

Incomplete LU (ILU) smoothers are effective in the algebraic multigrid (AMG) V-cycle for reducing high-frequency components of the error. However, the requisite direct triangular solves are comparatively slow on GPUs. Previous work has demonstrated the advantages of Jacobi iteration as an alternative to direct solution of these systems. Depending on the threshold and fill-level parameters chosen, the factors can be highly nonnormal and Jacobi is unlikely to converge in a low number of iterations. We demonstrate that row scaling can reduce the departure from normality, allowing us to replace the inherently sequential solve with a rapidly converging Richardson iteration. There are several advantages beyond the lower compute time. Scaling is performed locally for a diagonal block of the global matrix because it is applied directly to the factor. Further, an ILUT Schur complement smoother maintains a constant GMRES iteration count as the number of MPI ranks increases, and thus parallel strong-scaling is improved. Our algorithms have been incorporated into hypre, and we demonstrate improved time to solution for linear systems arising in the Nalu-Wind and PeleLM pressure solvers. For large problem sizes, GMRES+AMG executes at least five times faster when using iterative triangular solves compared with direct solves on massively parallel GPUs.

algebraic multigrid↗

Direct Estimation of Parameters in ODE Models Using WENDy: Weak-Form Estimation of Nonlinear Dynamics

Abstract We introduce the Weak-form Estimation of Nonlinear Dynamics (WENDy) method for estimating model parameters for non-linear systems of ODEs. Without relying on any numerical differential equation solvers, WENDy computes accurate estimates and is robust to large (biologically relevant) levels of measurement noise. For low dimensional systems with modest amounts of data, WENDy is competitive with conventional forward solver-based nonlinear least squares methods in terms of speed and accuracy. For both higher dimensional systems and stiff systems, WENDy is typically both faster (often by orders of magnitude) and more accurate than forward solver-based approaches. The core mathematical idea involves an efficient conversion of the strong form representation of a model to its weak form, and then solving a regression problem to perform parameter inference. The core statistical idea rests on the Errors-In-Variables framework, which necessitates the use of the iteratively reweighted least squares algorithm. Further improvements are obtained by using orthonormal test functions, created from a set of $$C^{\infty }$$ C ∞ bump functions of varying support sizes.We demonstrate the high robustness and computational efficiency by applying WENDy to estimate parameters in some common models from population biology, neuroscience, and biochemistry, including logistic growth, Lotka-Volterra, FitzHugh-Nagumo, Hindmarsh-Rose, and a Protein Transduction Benchmark model. Software and code for reproducing the examples is available at https://github.com/MathBioCU/WENDy .

97 MATHEMATICS AND COMPUTING↗

Approximate tensor-product preconditioners for very high order discontinuous Galerkin methods

In this study, we develop a new tensor-product based preconditioner for discontinuous Galerkin methods with polynomial degrees higher than those typically employed. This preconditioner uses an automatic, purely algebraic method to approximate the exact block Jacobi preconditioner by Kronecker products of several small, one-dimensional matrices. Traditional matrix-based preconditioners require O ( p 2d ) storage and O ( p 3d ) computational work, where p is the degree of basis polynomials used, and d is the spatial dimension. Our SVD-based tensor-product preconditioner requires O ( p d+1 ) storage, O ( p d+1 ) work in two spatial dimensions, and O ( p d+2 ) work in three spatial dimensions. Combined with a matrix-free Newton–Krylov solver, these preconditioners allow for the solution of DG systems in linear time in p per degree of freedom in 2D, and reduce the computational complexity from O ( p 9 ) to O ( p 5 ) in 3D. Numerical results are shown in 2D and 3D for the advection, Euler, and Navier–Stokes equations, using polynomials of degree up to p = 30. For many test cases, the preconditioner results in similar iteration counts when compared with the exact block Jacobi preconditioner, and performance is significantly improved for high polynomial degrees p .

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sampling frequency thresholds for the quantum advantage of the quantum approximate optimization algorithm

We compare the performance of the Quantum Approximate Optimization Algorithm (QAOA) with state-of-the-art classical solvers Gurobi and MQLib to solve the MaxCut problem on 3-regular graphs. We identify the minimum noiseless sampling frequency and depth p required for a quantum device to outperform classical algorithms. There is potential for quantum advantage on hundreds of qubits and moderate depth with a sampling frequency of 10 kHz. We observe, however, that classical heuristic solvers are capable of producing high-quality approximate solutions in linear time complexity. In order to match this quality for large graph sizes N, a quantum device must support depth p > 11. Additionally, multi-shot QAOA is not efficient on large graphs, indicating that QAOA p ≤ 11 does not scale with N. These results limit achieving quantum advantage for QAOA MaxCut on 3-regular graphs. Other problems, such as different graphs, weighted MaxCut, and 3-SAT, may be better suited for achieving quantum advantage on near-term quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Calculation of rf current drive in tokamaks

The toroidal plasma current is a key parameter for controlling MHD stability and fusion performances in tokamaks. Among the various methods for driving current, rf waves are a flexible and powerful tool. Therefore, their role in the design and optimization of advanced scenarios is considerable. The universal ray-tracing code C3PO coupled with the fully implicit linearized 3-D bounce-averaged relativistic electron Fokker-Planck solver LUKE is an illustration of the present day effort for performing fast and realistic calculations of the rf driven plasma current. The versatility of this tool is highlighted by simulations concerning the lower hybrid and electron cyclotron waves.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Cosmic structure strikes back: The elimination of vector-mediated nonstandard interaction models as a mechanism for sterile neutrino dark matter production

We revisit sterile neutrino production enabled by nonstandard interactions (NSIs) among active neutrinos mediated by new bosons. We focus on vector mediators, including neutrinophilic, gauged 𝐿 𝜇 −𝐿 𝜏 , and 𝐵−𝐿 realizations, that modify in-medium dispersion and scattering, thereby altering the active-sterile conversion history. Building on a novel production framework with NSI thermal potentials and collision integrals, we compute nonthermal phase-space distributions across sterile neutrino mixing and NSI parameters and map each point to an equivalent thermal warm dark matter particle mass 𝑚 th via linear theory transfer function fitting with the cosmological structure formation Boltzmann solver. This enables a direct reinterpretation of state-of-the-art structure formation limits from Milky Way satellites, strong lensing, and the Lyman-𝛼 forest. These limits, in conjunction with x-ray decay searches, as well as results from a wide variety of particle physics experiments allow for a more complete examination of these models. We find that these vector-mediated models are ruled out when the full combination of current constraints, listed above, are taken into account. NSI scalar-mediated models and models with low reheating temperatures remain viable.

cosmology↗

Iterated Discontinuity Factors Based on Reference Outgoing Currents for Discontinuous Finite Element Diffusion

We present a novel formulation for iteratively computing Discontinuity Factors (DF) designed to reproduce reference partial outgoing currents at the interface between macro-regions using Discontinuous Galerkin Finite Elements to solve the multigroup neutron diffusion equation. Similarly, an expression for the boundary coefficients (BCf) is proposed to match the partial outgoing current at vacuum boundaries. Upon convergence, macro-region averaged reaction and leakage rates are preserved. In addition, we consider a source-free steady-state problem depending on the DFs. The existence of a non-trivial solution is due to the non-linearity of the problem. This form greatly simplifies the implementation within Rattlesnake and efficiently converges by updating the DFs and BCfs at every linear iteration of the Preconditioned Jacobian-Free Newton-Krylov solver. The main challenge then lies in determining an appropriate scaling factor to ensure that the initial values for the DFs and BCfs are not too far from their converged value. While this factor does not change the final solution, it has the potential to significantly affect convergence, for purely numerical reasons. An expression based on the reference fission source integral is proposed and satisfying results are presented for problems and compared to Superhomogénéisation (SPH) results with both reflecting and vacuum boundary conditions.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Elk: A New MOOSE Framework Application for Radio-frequency Electromagnetics

A new tool in-development for general electromagnetic (EM) simulation for modeling radio-frequency (rf) systems is presented. The primary motivation for development of this tool is to leverage the flexibility and high-performance-computing capability of the Multiphysics Object-Oriented Simulation Environment (MOOSE) Framework developed by Idaho National Laboratory (INL) for complex EM problems. A MOOSE application (or MOOSE App) enables the end user to create a fully-functional simulation scenario without needing explicit knowledge of the underlying finite-element weak form implementation. MOOSE combines the libMesh library and the PetSc suite as the finite element and solver libraries, giving a robust platform for solving highly non-linear, coupled sets of PDEs such as those found in EM and plasma physics problems. Initial validation efforts have included standard waveguide and antenna benchmarks with the current focus being field validation against the well-known capacitively-coupled GEC Reference Cell (GEC-CCP). The results of this effort will be outlined and discussed. Future work plans including cold-plasma rf wave propagation studies and coupling to the plasma fluid MOOSE App, Zapdos [Lindsay et al 2016 J. Phys. D: Appl. Phys. 49 235204], will also be discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗