Search NASA⌕ Search

SEARCH · Search NASA

Results for “RELAXATION METHOD”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

A multigrid waveform relaxation method for solving the poroelasticity equations

In this work, a multigrid waveform relaxation method is proposed for solving a collocated finite difference discretization of the linear Biot’s model. This gives rise to the first space–time multigrid solver for poroelasticity equations in the literature. The waveform relaxation iteration is based on a point-wise Vanka smoother that couples the pressure variable at a grid-point with the displacements around it. A semi-algebraic mode analysis is proposed to theoretically analyze the convergence of the multigrid waveform relaxation algorithm. This analysis is novel since it combines the semi-algebraic analysis, suitable for parabolic problems, with the non-standard analysis for overlapping smoothers. The practical utility of the method is illustrated through several numerical experiments in one and two dimensions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Force field preconditioned ab initio structure relaxation method

We present a general method to accelerate ab initio atomic structural relaxations. In this method, the conjugate gradient ab initio relaxation is preconditioned by a force field relaxation. This force field is constructed on-the-flight with the information of the ab initio forces and the current atomic configuration. At each ab initio relaxation step, the so-constructed force field is used to prerelax the system, with the relaxation direction as the preconditioned direction for the ab initio conjugated gradient method. The force field model and its parameters are rather general making this method applicable for a wide range of systems commonly used in material simulations. We report more than 80 different systems have been tested representing different cases in material simulations. Across the board, we find accelerations mostly over a factor of 2 and for some large systems with a factor of 6 ~ 9 . There is no case where the relaxation becomes worse. The code and lib for this method are provided, which can be used as a plugin in a standard ab initio atomic relaxation code.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2018

Compact finite difference relaxation method for chaotic and hyperchaotic initial value systems

In this paper, we present a new application of higher order compact finite differences to solve nonlinear initial value problems exhibiting chaotic behaviour. The method involves dividing the domain of the problem into multiple sub-domains, with each sub-domain integrated using higher order compact finite difference schemes. The nonlinearity is dealt using a Gauss–Seidel-like relaxation. The method is, therefore, referred to as the multi-domain compact finite difference relaxation method (MD-CFDRM). In this new application, the MD-CFDRM is used to solve famous chaotic systems and hyperchaotic systems. The main advantage of the new approach is that it offers better accuracy on coarser grids which significantly improves the computational speed of the method. The results are compared with spectral-based multi-domain method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A Single Compartment Relaxed Eddy Accumulation Method

The relaxed eddy accumulation (REA) method is a widely-known technique that measures turbulent fluxes of scalar quantities. The REA technique has been used to measure turbulent fluxes of various compounds, such as methane, ethene, propene, butene, isoprene, nitrous oxides, ozone, and others. The REA method requires the accumulation of scalar concentrations in two separate compartments that conditionally sample updrafts and downdraft events. It is demonstrated here that the assumptions behind the conventional or two-compartment REA approach allow for one-compartment sampling, therefore called a one compartment or 1-C-REA approach, thereby expanding its operational utility. The one-compartment sampling method is tested across various land cover types and atmospheric stability conditions, and it is found that the one-compartment REA can provide results comparable to those determined from conventional two-compartment REA. This finding enables rapid expansion and practical utility of REA in studies of surface-atmosphere exchanges, interactions, and feedbacks.

Banerjee, T.↗
DOE OSTI2023

Halted-pendulum Relaxation: Application to White Dwarf Binary Initial Data

Studying compact-star binaries and their mergers is integral to determining progenitors for observable transients. Today, compact-star mergers are typically studied via state-of-the-art computational fluid dynamics codes. One such numerical technique, smoothed particle hydrodynamics (SPH), is frequently chosen for its excellent mass, energy, and momentum conservation. The natural treatment of vacuum and the ability to represent highly irregular morphologies make SPH an excellent tool for the study of compact-star binaries and mergers. For many scenarios, including binary systems, the outcome of simulations is only as accurate as the initial conditions. For SPH, it is essential to ensure that the particles are distributed regularly, representing the initial density profile but without long-range correlations. Particle noise in the form of high-frequency local motion and low-frequency global dynamics must be damped out. Damping the latter can be as computationally intensive as the actual simulation. We discuss a new and straightforward relaxation method, halted-pendulum relaxation (HPR), to remove global oscillation modes of SPH particle configurations. In combination with effective external potentials representing gravitational and orbital forces, we show that HPR has an excellent performance in efficiently relaxing SPH particles to the desired density distribution and removing global oscillation modes. We compare the method to frequently used relaxation approaches and test it on a white dwarf binary model at its Roche-lobe overflow limit. We highlight the importance of our method in achieving accurate initial conditions and its effect on achieving circular orbits and realistic accretion rates when compared with other general relaxation methods.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Analysis of Niobium Electropolishing Using a Generalized Distribution of Relaxation Times Method

Using electrochemical impedance spectroscopy, we have devised a method of sensing the microscopic surface conditions on the surface of niobium as it is undergoing an electrochemical polishing (EP) treatment. The method uses electrochemical impedance spectroscopy (EIS) to gather information on the surface state of the electrode without disrupting the polishing reaction. The EIS data is analyzed using a so-called distribution of relaxation times (DRT) method. Using DRT, the EIS data can be deconvolved into discrete relaxation time peaks without any a priori knowledge of the electrode dynamics. By analyzing the relaxation time peaks, we are able to distinguish two distinct modes of the EP reaction. As the polishing voltage is increased, the electrode transitions from the low voltage EP mode, characterized by a single relaxation time peaks, to the high voltage EP mode, characterized by two relaxation time peaks. We theorize that this second peak is caused by the formation of an oxide layer on the electrode. We also find that this oxide induced peak transitions from to a negative relaxation time, which is indicative of a blocking electrode process. By analyzing EPed samples, we show that samples polished in the low voltage mode have significantly higher surface roughness due to grain etching and faceting. We find that the surface roughness of the samples only improves when the oxide film peak is present and in the negative relaxation time region. This shows that EIS combined with DRT analysis can be used to predict etching on EPed Nb. This method can also be performed before or during the EP, which could allow for adjustment of polishing parameters to guarantee a smooth cavity surface finish.

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

Advancing electrochemical impedance analysis through innovations in the distribution of relaxation times method

Electrochemical impedance spectroscopy (EIS) is a key tool across various scientific disciplines, including energy sciences, chemistry, and biology, enabling the analysis of electrochemical systems. However, conventional methods for interpreting EIS data are often complex and model dependent. The distribution of relaxation times (DRT) offers a non-parametric approach that simplifies the interpretation process by providing a timescale interpretation of EIS data. This article provides a comprehensive review of current methods for DRT inversion. Additionally, a survey of practitioners highlights key challenges in the field. Here, the findings underscore the need for standardized DRT analysis and benchmarks, as well as the development of automated analysis tools. These advancements would improve the usability and interpretability of EIS data. Ultimately, implementing these improvements could not only propel the field forward but also expand the application of DRT in scientific research by making it accessible to a broader range of researchers, including those without specialized expertise in programming or statistics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Fast meta-solvers for 3D complex-shape scatterers using neural operators trained on a non-scattering problem

Three-dimensional target identification using scattering techniques requires high accuracy solutions and very fast computations for real-time predictions in some critical applications. We first train a deep neural operator (DeepONet) to solve wave propagation problems described by the Helmholtz equation in a domain without scatterers but at different wavenumbers and with a complex absorbing boundary condition. We then design two classes of fast meta-solvers by combining DeepONet with either relaxation methods, such as Jacobi and Gauss-Seidel, or with Krylov methods, such as GMRES and BiCGStab, using the trunk basis of DeepONet as a coarse-scale preconditioner. We leverage the spectral bias of neural networks to account for the lower part of the spectrum in the error distribution while the upper part is handled inexpensively using relaxation methods or fine-scale preconditioners. The meta-solvers are then applied to solve scattering problems with different shape of scatterers, at no extra training cost. We first demonstrate that the resulting meta-solvers are shape-agnostic, fast, and robust, whereas the standard standalone solvers may even fail to converge without the DeepONet. We then apply both classes of meta-solvers to scattering from a submarine, a complex three-dimensional problem. We achieve very fast solutions, especially with the DeepONet-Krylov methods, which require orders of magnitude fewer iterations than any of the standalone solvers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Reducing the computational burden of a microgrid energy management system

As renewable technology advances and decreases in cost, microgrids are becoming an appealing means of distributed generation both for isolated communities and integrated with existing electrical grid systems. Due to their small size, however, microgrids may have financial limitations which preclude them from using commercial software to optimize control of their assets. Open-source optimization solvers are a viable alternative, but increase computation time. This work expands on a rolling horizon optimization framework for economic dispatch within an existing residential microgrid located in Hoover, Alabama. The microgrid has an open-source solver requirement and a need for quick solution time on a rolling horizon as opposed to a day-ahead commitment. We present a method of reducing integer variables by relaxation which completes two goals: reduction in computation time for real-time operations, and reduction in daily operational cost for the microgrid. Seasonal data for load and photovoltaic (PV) power was also collected from the microgrid to facilitate simulation testing. Computation time was successfully reduced using multiple variations of the relaxation method, while obtaining solution quality with operational cost similar to or better than the original model.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Query Relaxation for LLM-Generated SPARQL Queries over Building Knowledge Graphs

When Knowledge Graph (KG) queries fail to match a pattern in a KG, they return no results. Identifying the statements causing these failures is tedious, especially for LLM-generated queries, which tend to be longer and more complex than queries written by hand. Query relaxation addresses this by systematically loosening query constraints until results are recovered. To evaluate the effectiveness of query relaxation against LLM generated queries, we propose a two-stage relaxation method combining triple deletion and path relaxation and test it against 1,823 failed queries for building KGs.

Paul, Lazlo↗
DOE OSTI2021

Formulation of 8-moment plasma transport with application to the Nernst effect

8-moment plasma models using two different distribution functions are used to study the Nernst effect and heat transport in dense plasma. These models are presented in hyperbolic form in contrast to traditional parabolic systems derived from perturbing the distribution function, as in Braginskii [Rev. Plasma Phys. 1, 205 (1965)]. The hyperbolic moment formulation can be solved implicitly in time with straightforward and fast local solvers. The numerical implementation of 8-moment models with the relaxation method in the PERSEUS code is also presented. To test 8-moment PERSEUS compared to Braginskii’s transport equations, a verification test for the Nernst thermomagnetic wave by Velikovich et al. [Phys. Plasmas 26, 112702 (2019)] is performed that confirms the presence of the same physics, but with slight differences in the transport coefficients, which are tabulated in the limits of high and low magnetization.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Linear stability analysis via simulated annealing and accelerated relaxation

Simulated annealing (SA) is a kind of relaxation method for finding equilibria of Hamiltonian systems. A set of evolution equations is solved with SA, which is derived from the original Hamiltonian system so that the energy of the system changes monotonically while preserving Casimir invariants inherent to noncanonical Hamiltonian systems. The energy extremum reached by SA is an equilibrium. Since SA searches for an energy extremum, it can also be used for stability analysis when initiated from a state where a perturbation is added to an equilibrium. The procedure of the stability analysis is explained, and some examples are shown. Because the time evolution is computationally time consuming, efficient relaxation is necessary for SA to be practically useful. An acceleration method is developed by introducing time dependence in the symmetric kernel used in the double bracket, which is part of the SA formulation described here. An explicit formulation for low-beta reduced magnetohydrodynamics (MHD) in cylindrical geometry is presented. In conclusion, since SA for low-beta reduced MHD has two advection fields that relax, it is important to balance the orders of magnitude of these advection fields.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2019

Fluctuations and phase transitions of uniaxial and biaxial liquid crystals using a theoretically informed Monte Carlo and a Landau free energy density

In this work, we explore fluctuations during phase transitions of uniaxial and biaxial liquid crystals using a phenomenological free energy functional. We rely on a continuum-level description of the liquid crystal ordering with a tensorial parameter and a temperature dependent Landau polynomial expansion of the tensor's invariants. The free energy functional, over a three-dimensional periodic domain, is integrated with a Gaussian quadrature and minimized with a theoretically informed Monte Carlo method. We reconstruct analytical phase diagrams, following Landau and Doi 's notations, to verify that the free energy relaxation reaches the global minimum. Importantly, our relaxation method is able to follow the thermodynamic behavior provided by other non-phenomenological approaches; we predict the first order character of the isotropic-nematic transition, and we identify the uniaxial-biaxial transition as second order. Finally, we use a finite-size scaling method, using the nematic susceptibility, to calculate the transition temperatures for 4-Cyano-4'-pentylbiphenyl (5CB) and N-(4-methoxybenzylidene)-4-butylaniline (MBBA). Our results show good agreement with experimental values, thereby validating our minimization method. Our approach is an alternative towards the relaxation of temperature dependent continuum-level free energy functionals, in any geometry, and can incorporate complicated elastic and surface energy densities.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Composing preconditioners for multiphysics PDE systems with applications to Generalized MHD

New patch smoothers or relaxation techniques are developed for solving linear matrix equations coming from systems of discretized partial differential equations (PDEs). One key linear solver challenge for many PDE systems arises when the resulting discretization matrix has a near null space that has a large dimension, which can occur in generalized magnetohydrodynamic (GMHD) systems. Patch-based relaxation is highly effective for problems when the null space can be spanned by a basis of locally supported vectors. The patch-based relaxation methods that we develop can be used either within an algebraic multigrid (AMG) hierarchy or as stand-alone preconditioners. These patch-based relaxation techniques are a form of well-known overlapping Schwarz methods where the computational domain is covered with a series of overlapping sub-domains (or patches). Patch relaxation then corresponds to solving a set of independent linear systems associated with each patch. In the context of GMHD, we also reformulate the underlying discrete representation used to generate a suitable set of matrix equations. In general, deriving a discretization that accurately approximates the curl operator and the Hall term while also producing linear systems with physically meaningful near null space properties can be challenging. Unfortunately, many natural discretization choices lead to a near null space that includes non-physical oscillatory modes and where it is not possible to span the near null space with a minimal set of locally supported basis vectors. Further discretization research is needed to understand the resulting trade-offs between accuracy, stability, and ease in solving the associated linear systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Multigrid Reduction in Time for Chaotic and Hyperbolic Problems (Final Report)

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallel-in-time methods, with the most common method, parareal, diverging in many cases. The current state of-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, this work shall continue researching the directions from the current collaboration with Dr. Falgout, which are laid out in the work Toward Parallel in Time for Chaotic Dynamical Systems and showed the first known results of a parallel-in-time speedup for a chaotic problem. This work outlines two key improvements to XBraid for chaotic problems, the so-called “theta” and “delta-correction” methods. Here, these two improvements will be further researched and improved (including with a new relaxation method inspired by on Least Squares Shadowing (LSS)) and explored for more complicated problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

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↗
DOE OSTI2019

Propagating uncertainties in large-scale hemodynamics models via network uncertainty quantification and reduced-order modeling

Numerical simulations of the cardiovascular system are affected by uncertainties arising from a substantial lack of data related to the boundary conditions and the physical parameters of the mathematical models. Quantifying the impact of this uncertainty on the numerical results along the circulatory network is challenged by the complexity of both the morphology of the domain and the local dynamics. Here, we propose to integrate (i) the Transverse Enriched Pipe Element Methods (TEPEM) as a reduced-order model for effectively computing the 3D local hemodynamics; and (ii) a combination of uncertainty quantification via Polynomial Chaos Expansion and classical relaxation methods – called network uncertainty quantification (NetUQ) – for effectively propagating random variables that encode uncertainties throughout the networks. The findings demonstrate the computational effectiveness of computing the propagation of uncertainties in networks with nontrivial topology, including portions of the cerebral and the coronary systems.

97 MATHEMATICS AND COMPUTING↗