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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Networked Microgrids Optimization

This project is mainly about the operation optimization of three networked microgrids (MG), including centralized optimization and distributed optimization. The alternating direction method of multipliers (ADMM) algorithm is used for distributed optimization. In the distribution network considered here, there is a Distribution Management system (DMS) as the system coordinator and several networked microgrids. In grid-connected mode, power could be imported or exported at the distribution substation bus according to the utility rate, and the exchanged power at point of common coupling (PCC) of any microgrid has a limitation. In islanded mode, the power imports/exports at the distribution substation are zero. In both grid-connected and islanded mode, the distribution substation is taken as a slack bus with fixed voltage magnitude.

Chen, Yang [Oak Ridge National Laboratory (ORNL), ↗
DOE OSTI2026

Overlapping Schwarz Methods Are Not Anisotropy‐Robust Multigrid Smoothers

We analyze overlapping multiplicative Schwarz methods as smoothers in the geometric multigrid solution of two-dimensional anisotropic diffusion problems. For diffusion equations, it is well known that the smoothing properties of point-wise smoothers, such as Gauss Seidel, rapidly deteriorate as the strength of anisotropy increases. On the other hand, global smoothers based on line smoothing are known to generally provide good smoothing for diffusion problems, independent of the anisotropy strength. Here, a natural question is whether global methods are really necessary to achieve good smoothing in such problems, or whether it can be obtained with locally overlapping block smoothers using sufficiently large blocks and overlap. Through local Fourier analysis and careful numerical experimentation, we show that global methods are indeed necessary to achieve anisotropy-robust smoothing. Specifically, for any fixed block size bounded sufficiently far away from the global domain size, we find that the smoothing properties of overlapping multiplicative Schwarz rapidly deteriorate with increasing anisotropy, irrespective of the amount of overlap between blocks. Moreover, our results indicate that anisotropy-robust smoothing requires blocks of diameter 𝒪⁡(𝜖 −1/2 ) for anisotropy ratio 𝜖 ∈(0,1] .

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Statistics of base polytopes in F-theory

We propose a new statistical ensemble of toric bases for elliptic Calabi-Yaus used in F-theory models, by focusing on only the convex hull of the base, i.e., the base polytope. This physically motivated coarse-graining greatly simplifies the combinatorial complexity of the part of the 4d F-theory landscape with toric bases. We develop a Monte Carlo approach that randomly samples the base polytopes within fixed boxes, with proper statistical weights. We first apply the algorithm to the set of 2d base polytopes, generating an enlarged set of toric 2d bases that include certain types of codimension-two (4,6) points, and we validate our approach against exact numbers. We then explore the set of 3d base polytopes which fit in a set of “maximal” 3d boxes, and estimate the total number of inequivalent 3d base polytopes to be 10 85 –10 90 . We provide statistical data such as the distribution of non-Higgsable gauge groups on these bases. Amusingly, a similar method can also be applied to generate reflexive polytopes in various dimensions. In both the reflexive and base polytope cases, the number of relevant polytopes obeys a Gaussian distribution as a function of the number of vertices, which can be understood in terms of other results on random polytopes in the math literature.

Differential and algebraic geometry↗
DOE OSTI2021

Photoelectron spectra of early 3 d -transition metal dioxide molecular anions from GW calculations

Photoelectron spectra of early 3 d -transition metal dioxide anions, Sc O 2 - , Ti O 2 - , V O 2 - , Cr O 2 - , and Mn O 2 - , are calculated using semilocal and hybrid density functional theory (DFT) and many-body perturbation theory within the GW approximation using one-shot perturbative and eigenvalue self-consistent formalisms. Different levels of theory are compared with each other and with available photoelectron spectra. We show that one-shot GW with a PBE0 starting point ( G 0 W 0 @PBE0) consistently provides very good agreement for all experimentally measured binding energies (within 0.1 eV–0.2 eV or less). We attribute this to the success of PBE0 in mitigating self-interaction error and providing good quasiparticle wave functions, which renders a first-order perturbative GW correction effective. One-shot GW calculations with a Perdew–Burke–Ernzerhof (PBE) starting point do poorly in predicting electron removal energies by underbinding orbitals with typical errors near 1.5 eV. A higher exact exchange amount of 50% in the DFT starting point of one-shot GW does not provide very good agreement with experiment by overbinding orbitals with typical errors near 0.5 eV. While not as accurate as G 0 W 0 @PBE0, the G -only eigenvalue self-consistent GW scheme with W fixed to the PBE level provides a reasonably predictive level of theory (typical errors near 0.3 eV) to describe photoelectron spectra of these 3 d -transition metal dioxide anions. Adding eigenvalue self-consistency also in W , on the other hand, worsens the agreement with experiment overall. Overall, our findings on the performance of various GW methods are discussed in the context of our previous studies on other transition metal oxide molecular systems.

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

Machine learning changes the rules for flux limiters

Learning to integrate non-linear equations from highly resolved direct numerical simulations has seen recent interest for reducing the computational load for fluid simulations. Here, we focus on determining a flux-limiter for shock capturing methods. Focusing on flux limiters provides a specific plug-and-play component for existing numerical methods. Since their introduction, an array of flux limiters has been designed. Using the coarse-grained Burgers' equation, we show that flux-limiters may be rank-ordered in terms of their log-error relative to high-resolution data. We then develop a theory to find an optimal flux-limiter and present flux-limiters that outperform others tested for integrating Burgers' equation on lattices with [Formula: see text], and 2x, 3x, 4x, and 8x coarse-grainings. We train a continuous piecewise linear limiter by minimizing the mean-squared misfit to six-grid point segments of high-resolution data, averaged over all segments. While flux limiters are generally designed to have an output of φ(r) = 1 at a flux ratio of r = 1, our limiters are not bound by this rule and yet produce a smaller error than standard limiters. Here we find that our machine learned limiters have distinctive features that may provide new rules-of-thumb for the development of improved limiters. Additionally, we use our theory to learn flux-limiters that outperform standard limiters across a range of values (as opposed to at a specific fixed value) of coarse-graining, number of discretized bins, and diffusion parameter. This demonstrates the ability to produce flux limiters that should be more broadly useful than standard limiters for general applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Superspin renormalization and slow relaxation in random spin systems

We develop an excited-state real-space renormalization group (RSRG-X) formalism to describe the dynamics of conserved densities in randomly interacting spin-12 systems. Our formalism is suitable for systems with U(1) and Z2 symmetries, and we apply it to chains of randomly positioned spins with dipolar XX+YY interactions, as arise in Rydberg quantum simulators and other platforms. The formalism generates a sequence of effective Hamiltonians that provide approximate descriptions for dynamics on successively smaller energy scales. These effective Hamiltonians involve “superspins”: two-level collective degrees of freedom constructed from (anti)aligned microscopic spins. Conserved densities can then be understood as relaxing via coherent collective spin flips. For the well-studied simpler case of randomly interacting nearest-neighbor XX+YY chains, the superspins reduce to single spins. Our formalism also leads to a numerical method capable of simulating the dynamics up to an otherwise inaccessible combination of large system size and late time. Focusing on disorder-averaged infinite-temperature autocorrelation functions, in particular the spin survival probability Sp¯(t), we demonstrate quantitative agreement between our algorithm and exact diagonalization (ED) at low but nonzero frequencies. Such agreement holds for chains with nearest-neighbor, next-nearest-neighbor, and long-range dipolar interactions. Our results indicate decay of Sp¯(t) slower than any power law and feature no significant deviation from the ∼1/ln2(t) asymptote expected from the infinite-randomness fixed-point of the nearest-neighbor model. We also apply the RSRG-X formalism to two-dimensional long-range systems of moderate size and find slow late-time decay of Sp¯(t).

Zhao, Yi J↗
DOE OSTI2020

On The Use of Sectional Techniques for the Solution of Depolymerization Population Balances: Results on a Discrete-Continuous Mesh

To study the discrete bond-breaking phenomena of depolymerization, the use of a fully continuous Population Balance Equation (PBE) is inadequate to embody all the inherent characteristics of the process, thus resulting in the need for a discrete-continuous mesh. In this work, the performance of the three most state-of-the-art sectional techniques, i.e. the fixed pivot technique (FPT), cell average technique (CAT) and finite volume scheme (FVS) in approximating discrete depolymerization using discrete-continuous PBEs was extensively compared and evaluated. The solutions from these three methods show different accuracy depending on the breakage mechanisms. For chain-end scission, the FPT and the CAT satisfactorily predict the population densities and moments whereas the FVS fails to predict the population densities but preserves the zeroth and the first moments. In the application of a discrete-continuous model, we identified a previously-not-reported issue of a precipitous drop in the number density at the boundary of discrete and continuous region specifically for chain-end scission. We successfully fixed this problem by employing the alterations proposed in this paper, to the particle allocation functions at the boundary points. For random scission, all three sectional techniques predict the population densities and moments to a high degree of accuracy, even at a very coarse mesh, through the use of our new stoichiometric kernel which is able to closely approximate the inherently discrete bond-breaking depolymerization process. The assessments in this present work intends to provide a clear-cut direction to efficient and economical modelling of depolymerization processes.

Ahamed, Firnaaz↗
DOE OSTI2020

Three-dimensional potential energy surfaces of ArNO ($\tilde{X}$ 2 Π)

Until now, the potential energy surfaces (PESs) of the ArNO complex found in the literature were two-dimensional, with the NO interatomic distance being fixed. In this work, we present the first accurate three-dimensional ground state X 2 Π PESs (both A ' and A ") of ArNO computed at the CCSD(T)/CBS level of theory. The equilibrium geometries and the well depths ( D e ) are compared to several other electronic structure methods. We found that using the multireference method, MRCI-F12 makes the surfaces much shallower (by 25%) and the depth of the surfaces does not agree with experimental data. The explicitly correlated coupled-cluster method underestimates the well depth as well. Analytic representations for both A ' and A " surfaces were fit to 4380 ab initio points to within 2.71 cm -1 .A three-dimensional Numerov propagator method in Delves coordinates is used to compute the bound state spectrum up to J tot = 6.5. The recommended dissociation energies are D 0 = 97.2 cm -1 for the adiabatic ground state and D e = 133.7 (128.1) cm -1 for A ' ( A ")

36 MATERIALS SCIENCE↗
DOE OSTI2020

State preparation and measurement in a quantum simulation of the $O(\mathrm{3})$ sigma model

Recently, Singh and Chandrasekharan [Phys. Rev. D 100, 054505 (2019)] showed that fixed points of the nonlinear O ( 3 ) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. In a paper by the NuQS Collaboration [Phys. Rev. Lett. 123, 090501 (2019)], the proposal is made to simulate such field theories on a quantum computer using the universal properties of a similar model. In this paper, following that direction, we demonstrate how to prepare the ground state of the model from Singh and Chandrasekharan and measure a dynamical quantity of interest, the O ( 3 ) Noether charge, on a quantum computer. In particular, we apply Trotter methods to obtain results for the complexity of adiabatic ground state preparation in both the weak-coupling and quantum-critical regimes and use shadow tomography to measure the dynamics of local observables. Finally, we then present and analyze a quantum algorithm based on nonunitary randomized simulation methods that may yield an approach suitable for intermediate-term noisy quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Real-Time Detection of Charge Jumps in Superconducting Qubits with a Convolutional Neural Network

Ionizing radiation from cosmic rays and gammas can induce discontinuous jumps in the environmental charge of superconducting qubits (charge jumps), causing correlated errors that challenge fault-tolerant quantum computing while simultaneously providing a detection signature for quantum sensing applications. Current detection methods operate offline, introducing latency incompatible with in-the-loop qubit control. In this paper, an online detector of charge jumps for superconducting qubits, based on a dilated causal convolutional neural network (DCCNN) designed for in-the-loop deployment on the Quantum Instrumentation Control Kit (QICK) platform, is presented. The network is trained on synthetic Ramsey tomography scans generated from qubit templates measured at the Northwestern Experimental Underground Site (NEXUS) at Fermilab, and translated to FPGA firmware via hls4ml with ap_fixed$\langle 16,6 \rangle$ quantization, reaching a per-inference latency of $6.19 μ$s on the Zynq UltraScale+ RFSoC ZCU216. At this operating point the DCCNN matches the detection efficiency of the established offline $χ^2$ algorithm ($0.843 \pm 0.022$ vs. $0.866 \pm 0.020$ on $|Δq| \in [0.1, 0.5] e$ at matched false-positive rate), while requiring no per-qubit hyperparameter tuning. This shifts charge-jump detection from a post-hoc diagnostic to a control-loop primitive, enabling adaptive protocols that respond to radiation-induced events in situ, with applications to quantum-computing error mitigation and to the use of superconducting qubits as particle detectors.

Gaytan-Villarreal, Daniel [Carnegie Mellon U.]↗
DOE OSTI2026

Comparison of URANS and LES predictions for the open phase of the OECD NEA CSNI fluid structure interaction CFD benchmark

The OECD NEA CSNI WGAMA CFD Task Group ran a benchmark in 2020 and 2021 to assess the predictive capabilities of coupled fluid structure interaction (FSI) CFD analysis methods. This paper presents the predictions made for the open phase of the benchmark using URANS and LES turbulence modelling approaches, and a comparison of the results to the experimental data. The benchmark comprised a channel containing two inline cylinders in cross-flow. The cylinders were fixed at one end, free at the other, and had measured resonant frequencies and damping properties. The URANS modelling used ANSYS Fluent 2-way coupled to ANSYS Mechanical. The LES modelling used Nek5000, 1-way coupled to Diablo. Comparisons with cross-channel velocity profiles are presented, both for the mean flow and its RMS. Comparisons are also made to the frequency spectra for point measurements of fluid velocity and pressure, and for the accelerations of the free end of each cylinder. URANS predicts the average velocity profiles relatively well, and is able to predict the velocity and acceleration spectra at the shedding frequency. However, the frequency content at the 4th harmonic of the shedding frequency is low in the URANS flow fields, and so does not excite accelerations at the resonant frequency of the cylinders. LES makes better predictions of the average profiles, and the velocity spectra agree well at both the shedding frequency and at higher frequencies. In conclusion, the 1-way coupled LES results show good agreement for acceleration spectra.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

The Cosmological Bootstrap: Spinning correlators from symmetries and factorization

We extend the cosmological bootstrap to correlators involving massless spinning particles, focusing on spin-1 and spin-2. In de Sitter space, these correlators are constrained both by symmetries and by locality. In particular, the de Sitter isometries become conformal symmetries on the future boundary of the spacetime, which are reflected in a set of Ward identities that the boundary correlators must satisfy. We solve these Ward identities by acting with weight-shifting operators on scalar seed solutions. Using this weight-shifting approach, we derive three- and four-point correlators of massless spin-1 and spin-2 fields with conformally coupled scalars. Four-point functions arising from tree-level exchange are singular in particular kinematic configurations, and the coefficients of these singularities satisfy certain factorization properties. We show that in many cases these factorization limits fix the structure of the correlators uniquely, without having to solve the conformal Ward identities. The additional constraint of locality for massless spinning particles manifests itself as current conservation on the boundary. We find that the four-point functions only satisfy current conservation if the s, t, and u-channels are related to each other, leading to nontrivial constraints on the couplings between the conserved currents and other operators in the theory. For spin-1 currents this implies charge conservation, while for spin-2 currents we recover the equivalence principle from a purely boundary perspective. For multiple spin-1 fields, we recover the structure of Yang--Mills theory. Finally, we apply our methods to slow-roll inflation and derive a few phenomenologically relevant scalar-tensor three-point functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Coupled cluster benchmarks of large noncovalent complexes: The L7 dataset as well as DNA–ellipticine and buckycatcher–fullerene

In this work, benchmark binding energies for dispersion-bound complexes in the L7 dataset, the DNA–ellipticine intercalation complex, and the buckycatcher–C60 complex with 120 heavy atoms using a focal-point method based on the canonical form of second-order Møller−Plesset theory (MP2) and the domain based local pair natural orbital scheme for the coupled cluster with single, double, and perturbative triple excitations [CCSD(T)] extrapolated to the complete basis set (CBS) limit are reported. This work allows for increased confidence given the agreement with respect to values recently obtained using the local natural orbital CCSD(T) for L7 and the canonical CCSD(T)/CBS result for the coronene dimer (C2C2PD). Therefore, these results can be considered pushing the CCSD(T)/CBS binding benchmark to the hundred-atom scale. The disagreements between the two state-of-the-art methods, CCSD(T) and fixed-node diffusion Monte Carlo, are substantial with at least 2.0 (∼10%), 1.9 (∼5%), and 10.3 kcal/mol (∼25%) differences for C2C2PD in L7, DNA–ellipticine, and buckycatcher–C60, respectively. Such sizable discrepancy above “chemical accuracy” for large noncovalent complexes indicates how challenging it is to obtain benchmark binding interactions for systems beyond small molecules, although the three up-to-date density functionals, PBE0+D4, ωB97M-V, and B97M-V, agree better with CCSD(T) for these large systems. In addition to reporting these values, different basis sets and various CBS extrapolation parameters for Hartree–Fock and MP2 correlation energies were tested for the first time in large noncovalent complexes with the goal of providing some indications toward optimal cost effective routes to approach the CBS limit without substantial loss in quality.

Ballesteros, Francisco (ORCID:0000000325732307)↗
DOE OSTI2024

An Accelerated Clip Algorithm for Unstructured Meshes: A Batch-Driven Approach

The clip technique is a popular method for visualizing complex structures and phenomena within 3D unstructured meshes. Meshes can be clipped by specifying a scalar isovalue to produce an output unstructured mesh with its external surface as the isovalue. Similar to isocontouring, the clipping process relies on scalar data associated with the mesh points, including scalar data generated by implicit functions such as planes, boxes, and spheres, which facilitates the visualization of results interior to the grid. In this paper, we introduce a novel batch-driven parallel algorithm based on a sequential clip algorithm designed for high-quality results in partial volume extraction. Our algorithm comprises five passes, each progressively processing data to generate the resulting clipped unstructured mesh. The novelty lies in the use of fixed-size batches of points and cells, which enable rapid workload trimming and parallel processing, leading to a significantly improved memory footprint and run-time performance compared to the original version. On a 32-core CPU, the proposed batch-driven parallel algorithm demonstrates a run-time speed-up of up to 32.6x and a memory footprint reduction of up to 4.37x compared to the existing sequential algorithm. The software is currently available under an open-source license in the VTK visualization system.

Tsalikis, Spiros↗
DOE OSTI2024

On the connection between least squares, regularization, and classical shadows

Classical shadows (CS) offer a resource-efficient means to estimate quantum observables, circumventing the need for exhaustive state tomography. Here, we clarify and explore the connection between CS techniques and least squares (LS) and regularized least squares (RLS) methods commonly used in machine learning and data analysis. By formal identification of LS and RLS ``shadows'' completely analogous to those in CS---namely, point estimators calculated from the empirical frequencies of single measurements---we show that both RLS and CS can be viewed as regularizers for the underdetermined regime, replacing the pseudoinverse with invertible alternatives. Through numerical simulations, we evaluate RLS and CS from three distinct angles: the tradeoff in bias and variance, mismatch between the expected and actual measurement distributions, and the interplay between the number of measurements and number of shots per measurement. Compared to CS, RLS attains lower variance at the expense of bias, is robust to distribution mismatch, and is more sensitive to the number of shots for a fixed number of state copies---differences that can be understood from the distinct approaches taken to regularization. Conceptually, our integration of LS, RLS, and CS under a unifying ``shadow'' umbrella aids in advancing the overall picture of CS techniques, while practically our results highlight the tradeoffs intrinsic to these measurement approaches, illuminating the circumstances under which either RLS or CS would be preferred, such as unverified randomness for the former or unbiased estimation for the latter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Toward Better Understanding of Microphysical Processes and Resulting Precipitation Physics: A Merger Of Observations and Cloud Models (Final Report)

A large database of global disdrometer observations and a diverse set of simulations from the Regional Atmospheric Modeling System (RAMS) were compared using principal component analysis (PCA) in order to better understand warm and ice-based precipitation processes. The analysis demonstrated that six distinct precipitation groups (PGs) with common characteristics were revealed in both the observations and model simulations. These PGs were defined by similar co-variability of rain parameters. However, the model showed large concentrations of drops with a given size compared to the observations. Detailed investigations determined the parameterization of drop breakup was forcing the drops to an equilibrium size with a stronger constraint than was indicated by the observations. A series of sensitivity studies permutating the rain shape parameter in the RAMS 2-moment bulk scheme demonstrated how the assumed shape of the rain distribution influences the microphysics as well as precipitation characteristics. Results were compared to the same simulations performed with a bin microphysics scheme where the rain shape parameter is freely evolving. In the bin scheme, a wide range of shape parameters were found, with horizontal and vertical variability, in addition to being a function of storm lifetime. The results of this study highlight the limitations of a fixed assumed rain distribution in 2-moment microphysics schemes. Model simulations were used to probe the microphysical origins of the six PGs. Rain budgets from a supercell case showed that several of the groups hypothesized to be associated with strong ice microphysical processes had significant contributions from melting hail, but the complexity of ice and warm-rain processes in the supercell precluded definitive determination of microphysical origins for many of the PGs. A case study from the Mid-latitude Continental Convection and Clouds Experiment (MC3E) compared the model PGs to disdrometer observations, and demonstrated the spatial and temporal variability of the PGs which is not possible from disdrometer point measurements alone. The analyses performed during this project demonstrated how statistical analysis can provide a robust method for comparing model simulations and observations, which ultimately resulted identification of limitations in some current microphysics parameterizations as well as insights into precipitation variability which ultimately benefits both observations and modeling efforts.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Follow the power—pathways to steady-state tokamak reactors

Abstract Diagramming pathways of dimensionless power is a potent method for extrapolating between operating points on present-day tokamaks and future burning plasma devices. The heat transport power, current drive power, H-mode threshold power and other ‘plasma physics’ powers can be expressed in dimensionally correct (or normalized) form as Pa 3/4 , where P is the power and a is the plasma minor radius, with the relative gyroradius ( ρ * ) dependence ranging from gyro-Bohm-like for transport ( P a 3 / 4 ∝ ρ * − 3 / 2 ), Bohm-like for current drive ( P a 3 / 4 ∝ ρ * − 5 / 2 ) and worse than Bohm-like for H-mode threshold ( P a 3 / 4 ∝ ρ * − 3 ). The D–T fusion power cannot be normalized in the same fashion since it is governed by nuclear physics, but at fixed B T it scales like P a 3 / 4 ∝ ρ * − 9 / 2 . Other ‘mixed physics’ powers can be incorporated into the dimensionless power framework by holding B T fixed in the same manner. Diagramming these dimensionless powers vs ρ * shows how the pathway to a steady-state reactor can be optimized relative to various operational boundaries. Using a steady-state hybrid discharge with β N = 3.2 from DIII-D as the starting point, a multi-parameter optimization finds an attractive pathway to steady-state operation on ITER using 76 MW of current drive power (fusion gain of Q fus = 8), along with a pathway to Q fus = 20 in a JET-sized steady-state reactor with B T = 10 T.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Adaptive Activation Functions Accelerate Convergence in Deep and Physics-informed Neural Networks

We employ adaptive activation functions for regression in deep and physics-informed neural networks (PINNs) to approximate smooth and discontinuous functions as well as solutions of linear and nonlinear partial differential equations. In particular, we solve the nonlinear Klein-Gordon equation, which has smooth solutions, the nonlinear Burgers equation, which can admit high gradient solutions, and the Helmholtz equation. We introduce a scalable hyper-parameter in the activation function, which can be optimized to achieve best performance of the network as it changes dynamically the topology of the loss function involved in the optimization process. The adaptive activation function has better learning capabilities than the traditional one (fixed activation) as it improves greatly the convergence rate, especially at early training, as well as the solution accuracy. To better understand the learning process, we plot the neural network solution in the frequency domain to examine how the network captures successively different frequency bands present in the solution. We consider both forward problems, where the approximate solutions are obtained, as well as inverse problems, where parameters involved in the governing equation are identified. Our simulation results show that the proposed method is a very simple and effective approach to increase the efficiency, robustness and accuracy of the neural network approximation of nonlinear functions as well as solutions of partial differential equations, especially for forward problems. We theoretically prove that in the proposed method, gradient descent algorithms are not attracted to suboptimal critical points or local minima.

machine leaning, Bad minima, Inverse problems, Phy↗