Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “fixed point 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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Application of Artificial Neural Network Model for Optimized Control of Condenser Water Temperature Set-Point in a Chilled Water System

Here, in this study, real-time predictive control and optimization model based on an ANN (artificial neural network) was developed to evaluate the cooling energy saving performance of the optimized control of CndWT (condenser water temperature). For this purpose, the difference in TCEC (total cooling energy consumption) between the conventional control strategy when the CndWT produced by the cooling tower is fixed and the optimized control strategy when real-time control of the CndWT through the optimal ANN model is applied was compared and analyzed. For the modeling of the building to be simulated, the co-simulation of EnergyPlus and MATLAB was built through the middleware Building Controls Virtual Test Bed. For the prediction of TCEC, an ANN model was developed through MATLAB's neural network toolbox. The model accuracy of the ANN was examined through Cv(RMSE) index and as a result, Cv(RMSE) of the optimized ANN model turned out to be approximately 25 %. More importantly, the predictive control technique was able to save TCEC by 5.6 % compared to the conventional control method constantly fixing CndWT set-point to 30 °C. These results showed that the CndWT needs to be dynamically controlled using artificial intelligence technique such as ANN model and that significant energy savings were achievable compared to the conventional fixed control.

42 ENGINEERING↗
DOE OSTI2025

Fully Homomorphic Encryption

This code implements a Fully Homomorphic Encryption (FHE) system, enabling secure computation on encrypted data without requiring decryption. It supports encryption, decryption, and homomorphic operations like matrix multiplication and addition. This code is adaptable for integrating FHE into linear-time invariant (LTI) systems, including digital control and filtering. With proper configuration from subject matter expertise, encrypted system parameters and signals can be manipulated to perform tasks like state updates, output calculations, and convolution in the encrypted domain. By preserving the structure of LTI systems while ensuring privacy, the framework facilitates secure applications in areas such as autonomous systems, signal processing, and industrial automation. The code initializes the encryption system using parameters provided in the env dictionary. These parameters include the ciphertext modulus, key dimension, plaintext fixed-point scaling factor, and noise bound. During initialization, a secret key is generated, which is essential for encrypting and decrypting data securely. The modular design allows users to tailor these parameters to specific use cases or security requirements. The code implements multiple cryptographic schemes. The learning with errors (LWE) encryption method encodes cleartext message to their plaintext fixed-point representation then encrypted into ciphertext space with additive noise. This noise ensures the security of the scheme, relying on the computational hardness of the LWE problem. The code also includes the Gentry-Sahai-Waters (GSW) scheme based off the LWE problem. Homomorphic matrix multiplication is performed between the LWE and GSW to encrypted data. This is achieved using a decomposition function on the LWE ciphertext during the multiplication operation. For higher-dimensional data, the code includes a method to encrypt entire matrices (GSWMat) using GSW encryption. These encrypted matrices can then be used for homomorphic matrix multiplications (MatMult). The decryption function uses the secret key to recover the original plaintext, removing the added noise and scaling that was originally applied during encryption.

Lois, Roberts [Idaho National Laboratory (INL), Id↗
DOE OSTI2022

Adaptive Space-Time Methods for Large Scale Optimal Design

When modeling complex physical systems with advanced dynamics, such as shocks and singularities, many classic methods for solving partial differential equations can return inaccurate or unusable results. One way to resolve these complex dynamics is through r-adaptive refinement methods, in which a fixed number of mesh points are shifted to areas of high interest. The mesh refinement map can be found through the solution of the Monge-Ampére equation, a highly nonlinear partial differential equation. Due to its nonlinearity, the numerical solution of the Monge-Ampére equation is nontrivial and has previously required computationally expensive methods. In this report, we detail our novel optimization-based, multigrid-enabled solver for a low-order finite element approximation of the Monge-Ampére equation. This fast and scalable solver makes r-adaptive meshing more readily available for problems related to large-scale optimal design. Beyond mesh adaptivity, our report discusses additional applications where our fast solver for the Monge-Ampére equation could be easily applied.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Lagrangian–Eulerian multidensity topology optimization with the material point method

Abstract In this paper, a hybrid Lagrangian–Eulerian topology optimization (LETO) method is proposed to solve the elastic force equilibrium with the Material Point Method (MPM). LETO transfers density information from freely movable Lagrangian carrier particles to a fixed set of Eulerian quadrature points. This transfer is based on a smooth radial kernel involved in the compliance objective to avoid the artificial checkerboard pattern. The quadrature points act as MPM particles embedded in a lower‐resolution grid and enable a subcell multidensity resolution of intricate structures with a reduced computational cost. A quadrature‐level connectivity graph‐based method is adopted to avoid the artificial checkerboard issues commonly existing in multiresolution topology optimization methods. Numerical experiments are provided to demonstrate the efficacy of the proposed approach.

Li, Yue↗
DOE OSTI2024

Finite-size effects in periodic coupled cluster calculations

Here, we provide the first rigorous study of the finite-size error in the simplest and representative coupled cluster theory, namely the coupled cluster doubles (CCD) theory, for gapped periodic systems. Given exact Hartree-Fock orbitals and their corresponding orbital energies, we demonstrate that the correlation energy obtained from the approximate CCD method, after a finite number of fixed-point iterations over the amplitude equation, exhibits a finite-size error scaling as $\mathcal{O}(N^{-\frac{1}{3}}_k)$. Here $N_k$ is the number of discretization points in the Brillouin zone and characterizes the system size. Under additional assumptions ensuring the convergence of the fixed-point iterations, we demonstrate that the CCD correlation energy also exhibits a finite-size error scaling as $\mathcal{O}(N^{-\frac{1}{3}}_k)$. Our analysis shows that the dominant error lies in the coupled cluster amplitude calculation, and the convergence of the finite-size error in energy calculation can be boosted to $\mathcal{O}(N^{-1}_k)$ with accurate amplitudes. This also provides the first proof of the scaling of the finite-size error in the third order Møller-Plesset perturbation theory (MP3) for periodic systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A Particle-in-Cell Method for Plasmas with a Generalized Momentum Formulation, Part I: Model Formulation

Here, this paper formulates a new particle-in-cell method for the Vlasov–Maxwell system. Under the Lorenz gauge condition, Maxwell’s equations for the electromagnetic fields can be written as a collection of scalar and vector wave equations. The use of potentials for the fields motivates the adoption of a Hamiltonian formulation for particles that employs the generalized (conjugate) momentum. A notable advantage offered by the Hamiltonian formulation is the elimination of time derivatives in the Lorenz gauge formulation that are required by the standard Newton–Lorentz treatment of the particles. This allows the fields to retain the full time-accuracy guaranteed by the field solver. The resulting updates for particles require only knowledge of the fields and their spatial derivatives. An analytical method for constructing these spatial derivatives is presented that exploits the underlying integral solution used in the field solver for the wave equations. Moreover, these derivatives are demonstrated to converge at the same rate as the fields in both time and space. The Method of Lines Transpose field solver we consider in this work is globally first-order accurate in time and high-order accurate in space (e.g., fourth- and fifth-order) and belongs to a larger class of methods which are unconditionally stable, can address geometry, and leverage $\mathcal {O}(N)$ fast summation methods for efficiency. We demonstrate the method on several well-established benchmark problems on bounded domains, including a plasma sheath as well as a relativistic particle beam. The efficacy of the proposed formulation is established by comparing with a second-order accurate finite-difference time-domain method that employs a leapfrog time advance for particles and a charge conserving map suitable for bounded domains. The new method shows mesh-independent numerical heating properties even in cases where the plasma Debye length is smaller than the grid spacing. This is an important feature of the new method for problems defined on bounded domains, because it permits the use of coarser grids in space in the representation of the fields. Such a capability has significant implications for the simulation of plasmas in bounded domains with complex geometry, where the ratio between the largest and smallest cells can vary significantly. The use of high-order spatial approximations in the new method also means that fewer grid points are required in order to achieve a fixed accuracy. Our results also suggest that the new method can be used with fewer simulation particles per cell compared to the benchmark explicit method, which permits further computational savings.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Adaptive PID Gain Scheduling Control for Hydropower Turbine Using Neural CDE and Stochastic Distribution Shaping

This paper introduces a gain-scheduling PID controller design strategy for hydroturbine frequency control mode. This scheme first uses real data to learn the nonlinear dynamics of the hydroturbine using neural controlled differential equations and then perturbs the obtained nonlinear system at different equilibrium points, based on which a static output feedback adaptive dynamic programming algorithm is then used to optimize the PID gains for each equilibrium point. Moreover, a continuous-time version of stochastic distribution control is proposed to further fine-tune the optimized PID gains. Finally, the controller is obtained by implementing linear interpolation between the optimized PID control gains. The simulation results show that the proposed gain-scheduling PID controller can control a larger range of operation points compared with the given fixed PID controller and the baseline method. Compared with the given fixed PID controller, the proposed gain-scheduling PID controller can regulate hydroturbine frequency against disturbances induced by power-load variation with over 50% less overshoot for some operation points.

13 HYDRO ENERGY↗
DOE OSTI2024

Robust and Simple ADMM Penalty Parameter Selection

We present a new method for online selection of the penalty parameter for the alternating direction method of multipliers (ADMM) algorithm. ADMM is a widely used method for solving a range of optimization problems, including those that arise in signal and image processing. In its standard form, ADMM includes a scalar hyperparameter, known as the penalty parameter, which usually has to be tuned to achieve satisfactory empirical convergence. In this work, we develop a framework for analyzing the ADMM algorithm applied to a quadratic problem as an affine fixed point iteration. Using this framework, we develop a new method for automatically tuning the penalty parameter by detecting when it has become too large or small. We analyze this and several other methods with respect to their theoretical properties, i.e., robustness to problem transformations, and empirical performance on several optimization problems. Our proposed algorithm is based on a theoretical framework with clear, explicit assumptions and approximations, is theoretically covariant/invariant to problem transformations, is simple to implement, and exhibits competitive empirical performance.

42 ENGINEERING↗
DOE OSTI2022

Interaction-expansion inchworm Monte Carlo solver for lattice and impurity models

Multiorbital quantum impurity models with general interaction and hybridization terms appear in a wide range of applications, including embedding, quantum transport, and nanoscience. However, most quantum impurity solvers are restricted to a few impurity orbitals, discretized baths, diagonal hybridizations, or density-density interactions. We generalize the inchworm quantum Monte Carlo method to the interaction expansion, and we explore its application to typical single- and multiorbital problems encountered in investigations of impurity and lattice models. Our implementation generically outperforms bare and bold-line quantum Monte Carlo algorithms in the interaction expansion. For the systems studied here, our implementation remains inferior to the more specialized hybridization expansion and auxiliary field algorithms. So, the problem of convergence to unphysical fixed points, which hampers so-called bold-line methods, is not encountered in inchworm Monte Carlo.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Covariance matrices for variance-suppressed simulations

ABSTRACT Cosmological N-body simulations provide numerical predictions of the structure of the Universe against which to compare data from ongoing and future surveys, but the growing volume of the Universe mapped by surveys requires correspondingly lower statistical uncertainties in simulations, usually achieved by increasing simulation sizes at the expense of computational power. It was recently proposed to reduce simulation variance without incurring additional computational costs by adopting fixed-amplitude initial conditions. This method has been demonstrated not to introduce bias in various statistics, including the two-point statistics of galaxy samples typically used for extracting cosmological parameters from galaxy redshift survey data, but requires us to revisit current methods for estimating covariance matrices of clustering statistics for simulations. In this work, we find that it is not trivial to construct covariance matrices analytically for fixed-amplitude simulations, but we demonstrate that ezmock (Effective Zel’dovich approximation mock catalogue), the most efficient method for constructing mock catalogues with accurate two- and three-point statistics, provides reasonable covariance matrix estimates for such simulations. We further examine how the variance suppression obtained by amplitude-fixing depends on three-point clustering, small-scale clustering, and galaxy bias, and propose intuitive explanations for the effects we observe based on the ezmock bias model.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Accelerating self-consistent field iterations in Kohn-Sham density functional theory using a low-rank approximation of the dielectric matrix

We present an efficient preconditioning technique for accelerating the fixed-point iteration in real-space Kohn-Sham density functional theory (DFT) calculations. The preconditioner uses a low-rank approximation of the dielectric matrix (LRDM) based on Gâteaux derivatives of the residual of fixed-point iteration along appropriately chosen direction functions. We develop a computationally efficient method to evaluate these Gâteaux derivatives in conjunction with the Chebyshev filtered subspace iteration procedure, an approach widely used in large-scale Kohn-Sham DFT calculations. Further, we propose a variant of LRDM preconditioner based on adaptive accumulation of low-rank approximations from previous self-consistent field iterations, and also extend the LRDM preconditioner to spin-polarized Kohn-Sham DFT calculations. We demonstrate the robustness and efficiency of the LRDM preconditioner against other widely used preconditioners on a range of benchmark systems with sizes ranging from ~100 to 1100 atoms (~500–20,000 electrons). The benchmark systems include various combinations of metal-insulating-semiconducting heterogeneous material systems, nanoparticles with localized d orbitals near the Fermi energy, nanofilm with metal dopants, and magnetic systems. In all benchmark systems, the LRDM preconditioner converges robustly within 20–30 iterations. In contrast, other widely used preconditioners show slow convergence in many cases, as well as divergence of the fixed-point iteration in some cases. Lastly, we demonstrate the computational efficiency afforded by the LRDM method, with up to 3.4-fold reduction in computational cost for the total ground-state calculation compared to other preconditioners.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Closed-Form Solutions for the Equations of Motion of the Heavy Symmetrical Top with One Point Fixed

The equations of motion (EOM) for the heavy symmetrical top with one point fixed are highly nonlinear. The literature describes the numerical methods that are used to resolve this classical system, including modern tools, such as the Runge–Kutta fourth–order method. Finding the derivate of closed-form solutions for the EOM is more difficult and, as mentioned in the literature, discovering the solution is not always possible for all the EOM. Fortunately, a few examples are available that serve as a guide to move further in this topic. The purpose of this paper is to find a methodology that will produce the solutions for a given subset of EOMs that fulfill certain requisites. This paper summarizes the literature available on this topic and then follows with the derivation of the EOM using the Euler–Lagrange method. The Routhian method will be used to reduce the size of the expression, and it continues with the formulation of the classical cubic function, ƒ(u), through a novel process. The roots of ƒ(u) are of the utmost importance in finding the EOM closed-form solution, and once the final roots are selected, the general method that will produce the closed-form solutions is presented. Two sets of examples are included to show the validity of the process, and comparisons of the results from the closed-form solutions vs. the numerical results for these examples are shown.

Laos, Hector↗
DOE OSTI2025

One-shot learning for solution operators of partial differential equations

Learning and solving governing equations of a physical system, represented by partial differential equations (PDEs), from data is a central challenge in many areas of science and engineering. Traditional numerical methods can be computationally expensive for complex systems and require complete governing equations. Existing data-driven machine learning methods require large datasets to learn a surrogate solution operator, which could be impractical. Here, we propose a solution operator learning method that requires only one PDE solution, i.e., one-shot learning, along with suitable initial and boundary conditions. Leveraging the locality of derivatives, we define a local solution operator in small local domains, train it using a neural network, and use it to predict solutions of new input functions via mesh-based fixed-point iteration or meshfree neural-network based approaches. We test our method on various PDEs, complex geometries, and a practical spatial infection spread application, demonstrating its effectiveness and generalization capabilities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Detectors in weakly-coupled field theories

We initiate a study of asymptotic detector operators in weakly-coupled field theories. These operators describe measurements that can be performed at future null infinity in a collider experiment. In a conformal theory they can be identified with light-ray operators, and thus have a direct relation to the spectrum of the theory. After a general discussion of the underlying physical picture, we show how infrared divergences of general detector operators can be renormalized in perturbation theory, and how they give rise to detector anomalous dimensions. We discuss in detail how this renormalization can be performed at the intersections of the Regge trajectories where non-trivial mixing occurs, which is related to the poles in anomalous dimensions at special values of spin. Finally, we discuss novel horizontal trajectories in scalar theories and show how they contribute to correlation functions. Our calculations are done in the example of Φ 4 theory in d = 4 - ϵ dimensions, but the methods are applicable more broadly. At the Wilson-Fisher fixed point our results include an explicit expression for the Pomeron light-ray operator at two loops, as well as a prediction for the value of the Regge intercept at five loops.

47 OTHER INSTRUMENTATION↗
DOE OSTI2020

Cavity Swelling in Irradiated Materials

Cavity swelling, due to three-dimensional clustering of vacancies, is an undesirable isotropic volume expansion of materials under irradiation. This phenomenon occurs above stage-III recovery temperature where vacancies are mobile, between ~0.3–0.6 Tm where Tm is the absolute melting temperature. The primary mechanism for cavity swelling is “dislocation bias”, i.e., preferential absorption of interstitials by network dislocations, causing a vacancy supersaturation. Cavity swelling is highly temperature dependent and typically follows a bell-shaped curve with peak swelling occurring at an intermediate temperature. With increasing temperature, cavity size increases, and number density decreases logarithmically. With increasing dose, cavity swelling increases, but follows a hockey-stick type pattern, characterized by a low-swelling transient incubation period and then a steady-state regime. The incubation period, dominant in cavity nucleation, is dependent upon material’s chemistry and irradiation conditions such as dose rate/temperature. Cavity swelling increases linearly with dose in the steady-state regime, that is independent of chemistry and dose rate. This regime is dominated by cavity growth. Transmutation gases like He enhance cavity nucleation such that an early onset of cavity formation occurs. However, swelling magnitudes can be either increased or suppressed when He is present. Results in austenitic steels and Cu indicate that cavity swelling peaks at intermediate He/dpa ratios of ~10 appm He/dpa. The most effective method to mitigate cavity swelling is by increasing the fixed point-defect sink density, by promoting precipitation or dispersion strengthening.

Bhattacharya, Arunodaya↗
DOE OSTI2023

Infrared fixed point of the SU(3) gauge theory with 𝑁 𝑓 = 10 flavors

We use lattice simulations and the continuous renormalization group method, based on the gradient flow, to calculate the 𝛽 function and anomalous dimensions of the SU(3) gauge theory with 𝑁 𝑓 = 10 flavors of fermions in the fundamental representation. We employ several improvements to extend the range of available renormalized couplings, including the addition of heavy Pauli-Villars bosons to reduce cutoff effects and the combination of a range of gradient flow transformations. While in the weak coupling regime our result is consistent with those of earlier studies, our techniques allow us to study the system at much stronger couplings than previously possible. We find that the renormalization group 𝛽 function develops a zero, corresponding to an infrared-stable fixed point, at gradient-flow coupling 𝑔 2 = 15.0⁢(5). We also determine the mass and tensor anomalous dimensions: At the fixed point we find 𝛾 𝑚 ≃0.6, suggesting that this system might be deep inside the conformal window.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

A fast implicit solver for semiconductor models in one space dimension

Several different approaches are proposed for solving fully implicit discretizations of a simplified Boltzmann-Poisson system with a linear relaxation-type collision kernel. This system models the evolution of free electrons in semiconductor devices under a low-density assumption. At each implicit time step, the discretized system is formulated as a fixed-point problem, which can then be solved with a variety of methods. A key algorithmic component in all the approaches considered here is a recently developed sweeping algorithm for Vlasov-Poisson systems. A synthetic acceleration scheme has been implemented to accelerate the convergence of iterative solvers by using the solution to a drift-diffusion equation as a preconditioner. The performance of four iterative solvers and their accelerated variants has been compared on problems modeling semiconductor devices with various electron mean-free-path.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Closed-Form Solutions for the Equations of Motion of the Heavy Symmetrical Top with One Point Fixed

The Equations of Motion (EOM) for the Heavy Symmetrical Top with One Point Fixed are highly non-linear. The literature describes the numerical methods that are used to resolve this Classical system including modern tools i.e. the Runge-Kutta Fourth Order method. It is more difficult to derivate closed-form solutions for the EOM and as mentioned in the literature it is not always possible to find the close-form solution for all the EOM. Fortunately, there are a few examples available that will serve as a guide to move further on in this topic. It is the purpose of this paper to find a methodology that will produce the solutions for a given subset of EOM that fulfill certain requisites. The report is organized as follows: it starts with a very short summary of the literature available on this topic and quickly follows into the derivation of the EOM using the Euler-Lagrange method. The Routhian will be used to reduce the size of the expression. It continues with the formulation of the Classical cubic function (f(u)) through a novel process. The roots of f(u) are of the outmost importance to be able to find the EOM closed-form solution, and once the final roots are selected the general method that will produce the closed-form solutions is presented. Two sets of examples are included to show the validity of the process and comparisons of the results from the closed-form solutions vs. the numerical results for these examples are shown.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗