Search NASA⌕ Search

SEARCH · Search NASA

Results for “Newton Raphson”

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.

15 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Newton-Raphson AC Power Flow Convergence Based on Deep Learning Initialization and Homotopy Continuation

Power flow forms the basis of many power system studies. With the increased penetration of renewable energy, grid planners tend to perform multiple power flow simulations under various operating conditions and not just selected snapshots at peak or light load conditions. Getting a converged AC power flow (ACPF) case remains a significant challenge for grid planners especially in large power grid networks. This paper proposes a two-stage approach to improve Newton-Raphson ACPF convergence and was applied to a 6102 bus Electric Reliability Council of Texas (ERCOT) system. The first stage utilizes a deep learning-based initializer with data re-training. Here a deep neural network (DNN) initializer is developed to provide better initial voltage magnitude and angle guesses to aid in power flow convergence. This is because Newton-Raphson ACPF is quite sensitive to the initial conditions and bad initialization could lead to divergence. The DNN initializer includes a data re-training framework that improves the initializer's performance when faced with limited training data. The DNN initializer successfully solved 3,285 cases out of 3,899 non-converging dispatch and performed better than random forest and DC power flow initialization methods. ACPF cases not solved in this first stage are then passed through a hot-starting algorithm based on homotopy continuation with switched shunt control. The hot-starting algorithm successfully converged 416 cases out of the remaining 614 non-converging ACPF dispatch. In conclusion, the combined two-stage approach achieved a 94.9% success rate, by converging a total of 3,701 cases out of the initial 3,899 unsolved cases.

Deep learning↗
DOE OSTI2025

Enhancing ACPF Analysis: Integrating Newton-Raphson Method with Gradient Descent and Computational Graphs

This paper presents a new method for enhancing Alternating Current Power Flow (ACPF) analysis. The method integrates the Newton-Raphson (NR) method with Enhanced-Gradient Descent (GD) and computational graphs. The integration of renewable energy sources in power systems introduces variability and unpredictability, and this method addresses these challenges. It leverages the robustness of NR for accurate approximations and the flexibility of GD for handling variable conditions, all without requiring Jacobian matrix inversion. Furthermore, computational graphs provide a structured and visual framework that simplifies and systematizes the application of these methods. The goal of this fusion is to overcome the limitations of traditional ACPF methods and improve the resilience, adaptability, and efficiency of modern power grid analyses. We validate the effectiveness of our advanced algorithm through comprehensive testing on established IEEE benchmark systems. Furthermore, our findings demonstrate that our approach not only speeds up the convergence process but also ensures consistent performance across diverse system states, representing a significant advancement in power flow computation.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

A Machine Learning Initializer for Newton-Raphson AC Power Flow Convergence

Power flow computations are fundamental to many power system studies. Obtaining a converged power flow case is not a trivial task especially in large power grids due to the non-linear nature of the power flow equations. One key challenge is that the widely used Newton based power flow methods are sensitive to the initial voltage magnitude and angle estimates, and a bad initial estimate would lead to non-convergence. This paper addresses this challenge by developing a random-forest (RF) machine learning model to provide better initial voltage magnitude and angle estimates towards achieving power flow convergence. This method was implemented on a real ERCOT 6102 bus system under various operating conditions. By providing better Newton-Raphson initialization, the RF model precipitated the solution of 2,106 cases out of 3,899 non-converging dispatches. These cases could not be solved from flat start or by initialization with the voltage solution of a reference case. Finally, results obtained from the RF initializer performed better when compared with DC power flow initialization, Linear regression, and Decision Trees.

random forest↗
DOE OSTI2024

RESOLVING THE ELECTROCHEMICAL EQUATIONS OF A SOLID OXIDE FUEL CELL FOR USE IN TRANSIENT SIMULATION AND INTEGRATION INTO CYBER-PHYSICAL SYSTEMS

A major challenge with complex cyber-physical systems stems from long model computational time that creates a mismatch between the model system and the physical system. The numerical modeling of solid oxide fuel cells (SOFCs) presents particular challenges due to the highly coupled nature of the underlying equations and the multiphysics needed to fully resolve their behavior during a transient event. To this end current approaches revolve around splitting the computational efforts into resolving temperature effects and resolving electrochemical effects. Current methods employed for the transient simulation of an SOFC for implementation in the Hybrid Performance (HyPer) facility cyberphysical plant at the National Energy Technology Laboratory reveal a distinct need for accelerated results with a high degree of stability. To this aim, an investigation into the computational time for the code reveals that the underlying electrochemical algorithm takes an order of magnitude more time than its thermal counterpart and has a tendency to vary in terms of iteration time and as such a rework of the underlying system is proposed. The primary method for accelerated electrochemical algorithm solutions is to employ higher order root finding recipes for the resolution of the highly coupled electrochemical equations. This is done with the intention to reduce the overall number of subiterations necessary for resolving voltage, current density, and species concentration, properties of the fuel cell that are all directly coupled and require nested iterative approaches. The overall objective of this approach is an order of magnitude reduction in calculation time without sacrificing stability and increasing accuracy. Specific approaches involve using both bounded and unbounded techniques, such as the False Position method and the Secant method (or if applicable Newton-Raphson) respectively, the drawbacks being slower convergence for False Position and instability for the Secant or Newton-Raphson methods. Current preliminary results on simplified versions of the parent functions involved for electrochemical calculations indicate a reduction in computational steps by a factor of two for the secant method and a factor of three for Newton-Raphson. When implemented into new modified electrochemical algorithms, the results indicate a possible order of magnitude reduction in calculation time.

Arias, Jesus↗
DOE OSTI2024

Internship Work Report

I worked on two projects during my summer internship at Sandia. My official title was “Intern - Mission Tech Electrical Eng./Computer Eng.- R&D Undergraduate Summer.” I worked at the central location, which is Albuquerque, New Mexico. The department you are placed in at Sandia doesn’t always correspond to the people you will be working with. For example, I only directly worked with one person from my department this summer. On one of my projects, I worked with a diverse team of engineers from many different departments. On my other project, I mainly worked with two departments, as the project had two distinct parts. As mentioned earlier, I worked on two projects during my summer at Sandia. The first project focused on a lightweight embedded controller in an advanced FPGA System-on-Chip for radar signal processing applications. The term “controller” refers to a hardware device that directs the flow of data between two entities. An FPGA is a reprogrammable integrated circuit (as opposed to an integrated circuit with one purpose). An FPGA was used on this project so in order to protype various ideas for our System-on-Chip. My role on the project was to implement designs on the fabric of the FPGA and design a state machine (written in C) for the processor. My second project was also heavily involved with embedded systems but had a different application. It focused on using a Newton-Raphson control algorithm to stabilize an inverted pendulum using a novel microcontroller. The pendulum dynamics were derived, and it was successfully simulated in MATLAB. I worked on integrating the microcontroller with the inverted pendulum machinery, and converting the Newton-Raphson control algorithm from MATLAB into C. The inverted pendulum was successfully stabilized using a simple PID controller and industry-standard microcontroller. The project is still ongoing, and the team is gearing up for more tests using the novel Newton-Raphson control algorithm and novel microcontroller

42 ENGINEERING↗
DOE OSTI2025

Hierarchical Network Partitioning for Solution of Potential-Driven, Steady-State Nonlinear Network Flow Equations

The solution of potential-driven steady-state flow in large networks is a task which manifests in various engineering applications, such as transport of natural gas or water through pipeline networks. The resultant system of nonlinear equations depends on the network topology, and in general, there is no numerical algorithm that offers guaranteed convergence to the solution (assuming a solution exists). Some methods offer guarantees in cases where the network topology satisfies certain assumptions, but these methods fail for larger networks. On the other hand, the Newton-Raphson algorithm offers a convergence guarantee if the starting point lies close to the (unknown) solution. It would be advantageous to compute the solution of the large nonlinear system through the solution of smaller nonlinear sub-systems wherein the solution algorithms (Newton-Raphson or otherwise) are more likely to succeed. Here, this letter proposes and describes such a procedure, a hierarchical network partitioning algorithm that enables the solution of large nonlinear systems corresponding to potential-driven steady-state network flow equations.

42 ENGINEERING↗
DOE OSTI2025

An eigenvalue-based method for computing the relaxed pressure in compressible multiphase flow with N phases

The modeling of compressible multiphase flows is a decades-old area of study with many applications across various fields. Many of these application areas use stiff pressure relaxation. This process involves the solution of a nonlinear system with N + 1 equations and N + 1 unknowns, where N is the number of phases. The resolution of this system with general equations of state (EOSs) is difficult. Furthermore, nonlinear systems can admit multiple solutions, and current solution methods do not address this possibility. Very recently, a thermodynamic relaxation method was introduced, which effectively maps a relatively simple predictor equation of state onto a more complex target equation of state. In this context, the target EOSs are the chosen EOSs for the thermodynamic model. Furthermore, this thermodynamic relaxation has the benefit of simplifying the stiff pressure relaxation system of equations. In this article, we show this system reduces to a polynomial of degree N, which can be recast as an eigenvalue problem through the use of the associated companion matrix. We show that although this eigenvalue method is generally less efficient than Newton–Raphson iteration, it does not suffer from convergence issues and finds all N roots of the polynomial. Hence, the method provides a fail-safe for root-finding iterative methods and a way to address the issue of multiple solutions to the nonlinear system of equations in stiff pressure relaxation.

Eigenvalue algorithm↗
DOE OSTI2025

Orbit-averaging and deposition accuracy for runaway electron beams in hybrid kinetic-MHD simulations of the runaway plateau

We develop a new procedure that combines the kinetic orbit runaway electron code (KORC) and the NIMROD extended-magnetohydrodynamic code to simulate runaway electrons (REs) in the post-disruption plateau. KORC integrates guiding-center orbits, with a barycentric-based binary search strategy providing initial guesses for the Newton–Raphson logical-to-physical coordinate inversion, ensuring reliable particle-to-mesh mapping in NIMROD, whose fields remain static for the present study. Samples are drawn in accord with experimental parallel current profiles of RE beams during the plateau phase. Deposition in NIMROD is verified through comparison with a Python-based finite-element code that ensures periodicity in the poloidal direction and continuity at the magnetic axis. Accurate representation of near-axis fields requires finer mesh resolution to prevent under- and overshoots in current density from orbit inaccuracies. Yet, at a fixed particle count, increasing mesh resolution amplifies statistical noise in the deposited fields. An orbit-averaging method accumulates partial current deposits over multiple kinetic steps and reduces the statistical noise with little added computational cost. By coupling kinetic routines from KORC directly into the NIMROD codebase, these developments lay essential groundwork for future self-consistent KORC–NIMROD coupling.

Algorithms and data structure↗
DOE OSTI2024

Large-scale harmonic balance simulations with Krylov subspace and preconditioner recycling

The multi-harmonic balance method combined with numerical continuation provides an efficient framework to compute a family of time-periodic solutions, or response curves, for large-scale, nonlinear mechanical systems. The predictor and corrector steps repeatedly solve a sequence of linear systems that scale by the model size and number of harmonics in the assumed Fourier series approximation. In this paper, a novel Newton–Krylov iterative method is embedded within the multi-harmonic balance and continuation algorithm to efficiently compute the approximate solutions from the sequence of linear systems that arise during the prediction and correction steps. Further, the method recycles, or reuses, both the preconditioner and the Krylov subspace generated by previous linear systems in the solution sequence. A delayed frequency preconditioner refactorizes the preconditioner only when the performance of the iterative solver deteriorates. The GCRO-DR iterative solver recycles a subset of harmonic Ritz vectors to initialize the solution subspace for the next linear system in the sequence. The performance of the iterative solver is demonstrated on two exemplars with contact-type nonlinearities and benchmarked against a direct solver with traditional Newton–Raphson iterations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A direct-adjoint approach for material point model calibration with application to plasticity

Here, this paper proposes a new approach for the calibration of material parameters in local elastoplastic constitutive models. The calibration is posed as a constrained optimization problem, where the constitutive model evolution equations for a single material point serve as constraints. The objective function quantifies the mismatch between the stress predicted by the model and corresponding experimental measurements. To improve calibration efficiency, a novel direct-adjoint approach is presented to compute the Hessian of the objective function, which enables the use of second-order optimization algorithms. Automatic differentiation is used for gradient and Hessian computations. Two numerical examples are employed to validate the Hessian matrices and to demonstrate that the Newton–Raphson algorithm consistently outperforms gradient-based algorithms such as L-BFGS-B.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Poromechanical cohesive interface element with combined Mode I-II cohesive zone elastoplasticity for simulating fracture in fluid-saturated porous media

A combined Mode I-II cohesive zone (CZ) elasto-plastic constitutive model, and a two-dimensional (2D) cohesive interface element (CIE) are formulated and implemented at small strain within an ABAQUS User Element (UEL) for simulating 2D crack nucleation and propagation in fluid-saturated porous media. Here, the CZ model mitigates problems of convergence for the global Newton-Raphson solver within ABAQUS, which when combined with a viscous stabilization procedure allows for simulation of post-peak response under load control for coupled poromechanical finite element analysis, such as concrete gravity dam stability analysis. Verification examples are presented, along with a more complex ambient limestone-concrete wedge fracture experiment, water-pressurized concrete wedge experiment, and concrete gravity dam stability analyses. A calibration procedure for estimating the CZ parameters is demonstrated with the limestone-concrete wedge fracture process. For the water-pressurized concrete wedge fracture experiment it is shown that the inherent time-dependence of the poromechanical CIE analysis provides a good match with experimental force versus displacement results at various crack mouth opening rates, yet misses the pore water pressure evolution ahead of the crack tip propagation. This is likely a result of the concrete being partially-saturated in the experiment, whereas the finite element analysis assumes fully water saturated concrete. For the concrete gravity dam analysis, it is shown that base crack opening and associated water uplift pressure leads to a reduced Factor of Safety, which is confirmed by separate analytical calculations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

PowerModelsGAT-AI: Physics-Informed Graph Attention for Multi-System Power Flow With Continual Learning

Solving the alternating current power flow equations in real time is essential for secure grid operation, yet classical Newton–Raphson solvers can be slow under stressed conditions. Existing graph neural networks for power flow are typically trained on a single system and often degrade on different systems. We present PowerModelsGAT-AI, a physics-informed graph attention network that predicts bus voltages and generator injections. The model uses bus-type-aware masking to handle different bus types and balances multiple loss terms, including a power-mismatch penalty, using learned weights. We evaluate the model on 14 benchmark systems (4 to 6,470 buses) and train a unified model on 13 of these under contingency conditions with up to two branch outages, achieving an average normalized mean absolute error of 0.89% for voltage magnitudes and R 2 >0.99 for voltage angles. We also show continual learning: when adapting a base model to a new 1,354-bus system, standard fine-tuning causes severe forgetting with error increases exceeding 1000% on base systems, while our experience replay and elastic weight consolidation strategy keeps error increases below 2% and in some cases improves base-system performance. Interpretability analysis shows that learned attention weights correlate with physical branch parameters (susceptance: r=0.38 ; thermal limits: r=0.22 ), and feature importance analysis supports that the model captures established power flow relationships.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Mitigating Voltage Instability in the Saudi Grid for a Decarbonized, Fully Solar Power System

Lately, solar photovoltaic (PV) has received significant interest due to its economic and environmental benefits. As the integration of renewable energy sources (RES) increases into existing power grids, challenges such as the decrease in short circuit ratio (SCR) are introduced. Here, this paper investigates a case study of the Saudi power grid, examining the voltage stability as the grid transitions from traditional power generation to 100% penetration of solar PV gradually. Moreover, the paper explores the relationship between the increase in solar penetration and the potential effects on the short circuit MVA (SCMVA), which could significantly impact the overall SCR of the system. To meet the North American Electric Reliability Corporation (NERC) recommendation of maintaining SCR at a particular level, synchronous condensers (SC)s were integrated into the grid. The effectiveness of utilizing SCs to maintain the system voltage at optimal levels in a fully solar grid is also considered. In addition, this paper covers the weak grid analysis via utilizing the Newton-Raphson load flow method, along with PV and QV curve analyses. The purpose behind that is to determine weak bus locations in need of voltage improvements, and to meet the amount of reactive power to be injected. Finally, the amount of power being delivered by SCs will be added progressively in three scenarios to show the enhancements on SCR more precisely.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

PISCES two-detector covariance matrix fit for the NOvA Experiment

NOvA is a long-baseline neutrino oscillation experiment with two functionally identical detectors: a Near Detector (ND) at Fermilab, placed 1 km from the neutrino source, and a Far Detector (FD) located 810 km away from the ND in Minnesota. NOvA's primary physics goals are the precise measurements of neutrino oscillation parameters $\theta_{23}$ and $\Delta m^2_{32}$ , determine the neutrino mass ordering, and constrain the value of $\delta_{CP}$, via the study of muon neutrino to electron neutrino oscillation. In the standard NOvA three-flavor analysis, oscillation parameters are extracted using an extrapolation technique in which the ND data constrain the FD prediction through a ratio method. While this allows for systematic uncertainties sharing the same effects in both detectors to cancel, it remains an FD-only fit and does not fully leverage the constraining power of the high-statistics ND. This analysis proposes a simultaneous ND+FD fit using the PISCES method. PISCES (Parameter Inference with Systematic Covariance and Exact Statistics) is a framework designed to support complex configurations such as a joint ND+FD fit. This allows PISCES to take full advantage of the ND data to directly constrain systematic uncertainties across all samples. In PISCES, systematic uncertainties are encoded in a fractional covariance matrix, and statistical uncertainties are handled with a Poisson likelihood, making the approach well suited for low-statistics samples. For interpretability, we further use a Newton–Raphson + PCA method to recover per-systematic pulls from the covariance formulation. This poster presents the full PISCES joint ND+FD fit for the NOvA three-flavor analysis, describes its implementation and evaluates its performance through extensive robustness tests and fake data studies. It also provides a comparison between the PISCES joint ND+FD results and the standard NOvA extrapolation method.

Rajaoalisoa, Miriama [Cincinnati U.] (ORCID:000000↗
DOE OSTI2025

An Early Investigation of the HHL Quantum Linear Solver for Scientific Applications

In this paper, we explore using the Harrow–Hassidim–Lloyd (HHL) algorithm to address scientific and engineering problems through quantum computing, utilizing the NWQSim simulation package on a high-performance computing platform. Focusing on domains such as power-grid management and climate projection, we demonstrate the correlations of the accuracy of quantum phase estimation, along with various properties of coefficient matrices, on the final solution and quantum resource cost in iterative and non-iterative numerical methods such as the Newton–Raphson method and finite difference method, as well as their impacts on quantum error correction costs using the Microsoft Azure Quantum resource estimator. We summarize the exponential resource cost from quantum phase estimation before and after quantum error correction and illustrate a potential way to reduce the demands on physical qubits. This work lays down a preliminary step for future investigations, urging a closer examination of quantum algorithms’ scalability and efficiency in domain applications.

hybrid software for QC-HPC↗