Search NASA⌕ Search

SEARCH · Search NASA

Results for “NONLINEAR MAPPING APPROXIMATOR”

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 55 records · Page 3

Data-Efficient Methods for Determining Flory–Huggins χ Parameters in Multicomponent Polymer Formulations

Polymer formulations are essential in diverse applications including personal care products, coatings, paints, adhesives, and plastic materials. Designing these formulations requires navigating large, complex design spaces, where phase and self-assembly behavior critically impact performance. The Flory–Huggins χ parameter, which quantifies segmental miscibility, is widely used to parametrize the excess free energy of mixing in formulation models. In this work, we introduce two data-efficient, top-down methods for estimating χ parameters using the Random Phase Approximation (RPA): (i) Boundary Nonlinear Regression (Boundary-NLR), which fits theoretical spinodal boundaries to experimental phase boundaries, and (ii) Surrogate Model Inverse Parameter Estimation (SMIPE), which uses a Gaussian Process Classifier to fit sparse phase maps via a surrogate model. Both methods allow rapid parametrization of polymer field-theoretic models without the need for additional experiments. We evaluate these approaches on data sets involving polymer–solvent–nonsolvent ternary mixtures and block copolymer–solvent systems, demonstrating their robustness to experimental noise and their relevance for real-world formulation design.

copolymers↗

Code Demonstration: Approximation of nearly-periodic symplectic maps via structure-preserving neural networks

In this notebook, we use the symplectic gyroceptron architecture from [Duruisseaux et al., 2022] to learn a surrogate map for the nearly-periodic symplectic flow map associated to a nearly-periodic Hamiltonian system composed of two nonlinearly coupled oscillators, where one of them oscillates significantly faster than the other: $\Big\lbrace$ $ {\dot{q}_1 = p_1 \hspace{5mm} \dot{p}_1 = -q_1 - \epsilon \partial_{q1}U(q_1 , q_2 )} \atop {\dot{q}_2 = \epsilon p_2 \hspace{4mm} \dot{p}_2 = -\epsilon q_2 - \epsilon \partial_{q2}U(q_1 , q_2 )}$. These equations of motion are the Hamilton's equations associated to the Hamiltonian $H_{\epsilon}(q_1,q_2,p_1,p_2)=\frac{1}{2}(q^2_1+p^2_1)+\frac{1}{2}\epsilon(q^2_2+p^2_2)+\epsilon$$U(q_1,q_2)$.

97 MATHEMATICS AND COMPUTING↗

On three dimensional object recognition and pose-determination: An abstraction based approach

A method of computing reliable Gaussian and mean curvature sign-map descriptors from the polynomial approximation of surfaces was demonstrated. Such descriptors which are invariant under perspective variation are suitable for hypothesis generation. A means for determining the pose of constructed geometric forms whose algebraic surface descriptors are nonlinear in terms of their orienting parameters was developed. This was done by means of linear functions which are capable of approximating nonlinear forms and determining their parameters. It was shown that biquadratic surfaces are suitable companion linear forms for cylindrical approximation and parameter estimation. The estimates provided the initial parametric approximations necessary for a nonlinear regression stage to fine tune the estimates by fitting the actual nonlinear form to the data. A hypothesis-based split-merge algorithm for extraction and pose determination of cylinders and planes which merge smoothly into other surfaces was developed. It was shown that all split-merge algorithms are hypothesis-based. A finite-state algorithm for the extraction of the boundaries of run-length regions was developed. The computation takes advantage of the run list topology and boundary direction constraints implicit in the run-length encoding.

Quek, Kok How Francis↗

Bayesian reduced-order deep learning surrogate model for dynamic systems described by partial differential equations

We propose a reduced-order deep-learning surrogate model for dynamic systems described by time-dependent partial differential equations. This method employs space–time Karhunen–Loève expansions (KLEs) of the state variables and space-dependent KLEs of space-varying parameters to identify the reduced (latent) dimensions. Subsequently, a deep neural network (DNN) is used to map the parameter latent space to the state variable latent space. An approximate Bayesian method is developed for uncertainty quantification (UQ) in the proposed KL-DNN surrogate model. The KL-DNN method is tested for the linear advection–diffusion and nonlinear diffusion equations, and the Bayesian approach for UQ is compared with the deep ensembling (DE) approach, commonly used for quantifying uncertainty in DNN models. It was found that the approximate Bayesian method provides a more informative distribution of the PDE solutions in terms of the coverage of the reference PDE solutions (the percentage of nodes where the reference solution is within the confidence interval predicted by the UQ methods) and log predictive probability. The DE method is found to underestimate uncertainty and introduce bias. For the nonlinear diffusion equation, we compare the KL-DNN method with the Fourier Neural Operator (FNO) method and find that KL-DNN is 10% more accurate and needs less training time than the FNO method.

97 MATHEMATICS AND COMPUTING↗

How Snow Aggregate Ellipsoid Shape and Orientation Variability Affects Fall Speed and Self-Aggregation Rates

Snow aggregate shapes and orientations have long been known to exhibit substantial variability. Despite this observed variability, most weather and climate prediction models use fixed power-law functions that deterministically map particle size to mass and fall speed. As such, integrated quantities like precipitation and self-aggregation rates currently ignore nonlinear effects resulting from variation in shape and orientation for aggregates of the same size. This study therefore develops an analytic framework that couples an empirically based bivariate distribution of ellipsoid shapes to classical hydrodynamic theory so as to capture an appropriate dispersion of masses, projected areas, and fall speeds for an assumed size distribution. For a fixed aggregate size, shape variations produce approximately ±0.13 m s -1 standard deviation of fall speed which increases the mass flux fall speed dispersion by more than 100% over traditional microphysics models. This increased fall speed dispersion results predominantly from shape-induced mass dispersion whereas orientation and drag dispersion play a lesser role. Shape variations can increase mass- and reflectivity-weighted fall speeds by up to 60% of traditional models whereas self-aggregation rates can increase by a factor of 100 for very small slope parameters. This implies that aggregate shape variations effectively forestall the theorized onset of fall speed distribution narrowing and subsequent quenching of the aggregation process. As a result, it is likely that secondary ice formation is necessary to prevent an ever decreasing slope parameter. The mathematical theory presented in this study is used to develop simple correction factors for snow forecast and climate models.

54 ENVIRONMENTAL SCIENCES↗

Dynamics of McMillan mappings III. Symmetric map with mixed nonlinearity

This article extends the study of the dynamical properties of the symmetric McMillan map, emphasizing its utility in understanding and modeling complex nonlinear systems. Although the map features six parameters, we demonstrate that only two are irreducible: the linearized rotation number at the fixed point and a nonlinear parameter representing the ratio of terms in the biquadratic invariant. Through a detailed analysis, we classify regimes of stable motion, provide exact solutions to the mapping equations, and derive a canonical set of action-angle variables, offering analytical expressions for the rotation number and nonlinear tune shift. We further establish connections between general standard-form mappings and the symmetric McMillan map, using the area-preserving Hénon map and accelerator lattices with thin sextupole magnet as representative case studies. Our results show that, despite being a second-order approximation, the symmetric McMillan map provides a highly accurate depiction of dynamics across a wide range of system parameters, demonstrating its practical relevance in both theoretical and applied contexts.

43 PARTICLE ACCELERATORS↗

Design of Neural Networks for Fast Convergence and Accuracy: Dynamics and Control

A procedure for the design and training of artificial neural networks, used for rapid and efficient controls and dynamics design and analysis for flexible space systems, has been developed. Artificial neural networks are employed, such that once properly trained, they provide a means of evaluating the impact of design changes rapidly. Specifically, two-layer feedforward neural networks are designed to approximate the functional relationship between the component/spacecraft design changes and measures of its performance or nonlinear dynamics of the system/components. A training algorithm, based on statistical sampling theory, is presented, which guarantees that the trained networks provide a designer-specified degree of accuracy in mapping the functional relationship. Within each iteration of this statistical-based algorithm, a sequential design algorithm is used for the design and training of the feedforward network to provide rapid convergence to the network goals. Here, at each sequence a new network is trained to minimize the error of previous network. The proposed method should work for applications wherein an arbitrary large source of training data can be generated. Two numerical examples are performed on a spacecraft application in order to demonstrate the feasibility of the proposed approach.

Maghami, Peiman G.↗

The evolution of Ertel's potential vorticity during stratospheric sudden warmings

In the winter stratosphere of the Northern Hemisphere, the disruption of the westerly vortex and associated warming of polar latitudes is a well known phenomenon. It has become apparent that some important dynamical processes in the stratosphere are highly nonlinear and are best thought of locally rather than in terms of the interaction between the zonal-mean flow and harmonic waves around latitude circles. The importance of nonlinear processes was suggested by McIntyre and Palmer (1983, 1984) who used isentropic maps of Ertel's Potential Vorticity to show that during disturbed episodes material lines may become strongly and irreversibly deformed in certain places. They adopted the term planetary wave breaking to describe this process. Isentropic maps of Q are used to follow the evolution of a Canadian warming in November - December 1981 and a particularly strong warming in January 1982. The advection of Q over large distances on isentropic surfaces was a striking feature of the flow during each event. This could be identified because of our ability to follow the movement of material lines due to the approximate conservation of Q over several days. The advection of Q was a nonlinear process because its changing distribution affected the advecting wind field. The Canadian warming did not lead to a permanent change in the structure of the westerly vortex, as defined by the coarse-grain field of Q, whereas the January event was accompanied by a substantial loss of resolved Q which was never fully recovered.

Fairlie, T. D. A.↗

Physics-Informed Sparse Gaussian Process for Probabilistic Stability Analysis of Large-Scale Power System with Dynamic PVs and Loads

This work proposes a physics-informed sparse Gaussian process (SGP) for probabilistic stability assessment of large-scale power systems in the presence of uncertain dynamic PVs and loads. The differential and algebraic equations considering uncertainties from dynamic PVs and loads are reformulated to a nonlinear mapping relationship that allows the application of SGP. Thanks to the nonparametric characteristic of Gaussian process, the proposed framework does not require distributions of uncertain inputs and this distinguishes it from existing approaches. As the original Gaussian process is not scalable to large-scale systems with high dimensional uncertain inputs, this paper develops the SGP with a stochastic variational inference technique. It leads to approximately two orders of complex reduction. A data pre-processing step is also introduced to tackle the coexistence of stable and unstable cases by sample clustering and constructing separate SGPs. The probabilistic transient stability index is analyzed to assess system stability under different uncertain dynamics loads and PVs. Comparisons are performed with the sampling-based, the polynomial chaos expansion-based, and traditional Gaussian process-based methods on the modified IEEE 118-bus and Texas 2000-bus systems under various scenarios, including different levels of uncertainties and the existence of nonlinear correlations among dynamic PVs. The impacts of data quality and quantity issues are also investigated. It is shown that the proposed SGP achieves significantly improved computational efficiency while maintaining high accuracy with a limited number of data.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Dynamics of McMillan mappings II. axially symmetric map

Here, in this article, we investigate the transverse dynamics of a single particle in a model integrable accelerator lattice, based on a McMillan axially-symmetric electron lens. Although the McMillan e-lens has been considered as a device potentially capable of mitigating collective space charge forces, some of its fundamental properties have not been described yet. The main goal of our work is to close this gap and understand the limitations and potentials of this device. It is worth mentioning that the McMillan axially symmetric map provides the first-order approximations of dynamics for a general linear lattice plus an arbitrary thin lens with motion separable in polar coordinates. Therefore, advancements in its understanding should give us a better picture of more generic and not necessarily integrable round beams. In the first part of the article, we classify all possible regimes with stable trajectories and find the canonical action-angle variables. This provides an evaluation of the dynamical aperture, Poincaré rotation numbers as functions of amplitudes, and thus determines the spread in nonlinear tunes. Also, we provide a parameterization of invariant curves, allowing for the immediate determination of the map image forward and backward in time. The second part investigates the particle dynamics as a function of system parameters. We show that there are three fundamentally different configurations of the accelerator optics causing different regimes of nonlinear oscillations. Each regime is considered in great detail, including the limiting cases of large and small amplitudes. In addition, we analyze the dynamics in Cartesian coordinates and provide a description of observable variables and corresponding spectra.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Fuzzy self-learning control for magnetic servo system

It is known that an effective control system is the key condition for successful implementation of high-performance magnetic servo systems. Major issues to design such control systems are nonlinearity; unmodeled dynamics, such as secondary effects for copper resistance, stray fields, and saturation; and that disturbance rejection for the load effect reacts directly on the servo system without transmission elements. One typical approach to design control systems under these conditions is a special type of nonlinear feedback called gain scheduling. It accommodates linear regulators whose parameters are changed as a function of operating conditions in a preprogrammed way. In this paper, an on-line learning fuzzy control strategy is proposed. To inherit the wealth of linear control design, the relations between linear feedback and fuzzy logic controllers have been established. The exercise of engineering axioms of linear control design is thus transformed into tuning of appropriate fuzzy parameters. Furthermore, fuzzy logic control brings the domain of candidate control laws from linear into nonlinear, and brings new prospects into design of the local controllers. On the other hand, a self-learning scheme is utilized to automatically tune the fuzzy rule base. It is based on network learning infrastructure; statistical approximation to assign credit; animal learning method to update the reinforcement map with a fast learning rate; and temporal difference predictive scheme to optimize the control laws. Different from supervised and statistical unsupervised learning schemes, the proposed method learns on-line from past experience and information from the process and forms a rule base of an FLC system from randomly assigned initial control rules.

Tarn, J. H.↗

Functional expansion representations of artificial neural networks

In the past few years, significant interest has developed in using artificial neural networks to model and control nonlinear dynamical systems. While there exists many proposed schemes for accomplishing this and a wealth of supporting empirical results, most approaches to date tend to be ad hoc in nature and rely mainly on heuristic justifications. The purpose of this project was to further develop some analytical tools for representing nonlinear discrete-time input-output systems, which when applied to neural networks would give insight on architecture selection, pruning strategies, and learning algorithms. A long term goal is to determine in what sense, if any, a neural network can be used as a universal approximator for nonliner input-output maps with memory (i.e., realized by a dynamical system). This property is well known for the case of static or memoryless input-output maps. The general architecture under consideration in this project was a single-input, single-output recurrent feedforward network.

Gray, W. Steven↗

On Lipschitz continuity of nonlinear differential operators

In connection with approximations for nonlinear evolution equations, it is standard to assume that nonlinear terms are at least locally Lipschitz continuous. However, it is shown here that f = f(X,del sub u(X)) is Lipschitz continuous from the subspace W sup 1, infinity is a subset of L sub 2 into W sup 1,2, and maps W sup 2, infinity into W sup 1, infinity, if and only if f is affine with W sup 1, infinity coefficients. In fact, a local version of this claim is proved.

Keeling, Stephen L.↗

Constraints on primordial non-Gaussianity from the cross-correlation of DESI luminous red galaxies and Planck CMB lensing

We use the angular cross-correlation between a luminous red galaxy (LRG) sample from the Dark Energy Spectroscopic Instrument (DESI) Legacy Survey data release DR9 and the Planck cosmic microwave background (CMB) lensing maps to constrain the local primordial non-Gaussianity parameter, f NL , using the scale-dependent galaxy bias effect. The galaxy sample covers approximately 40% of the sky, contains galaxies up to redshift z ∼ 1.4, and is calibrated with the LRG spectra that have been observed for DESI Year 1 (Y1). We apply a nonlinear imaging systematics treatment based on neural networks to remove observational effects that could potentially bias the f NL measurement. Our measurement is performed without blinding, but the full analysis pipeline is tested with simulations including systematics. Using the two-point angular cross-correlation between LRG and CMB lensing only, we find f NL = 39 −38 +40 at the 68% confidence level, and our result is robust in terms of systematics and cosmological assumptions. If we combine this information with the autocorrelation of LRG, applying a scale cut to limit the impact of systematics, we find f NL = 24 −21 +20 at the 68% confidence level. Our results motivate the use of CMB lensing cross-correlations to measure f NL with future datasets, given its stability in terms of observational systematics compared to the angular autocorrelation. Furthermore, performing accurate systematics mitigation is crucially important in order to achieve competitive constraints on f NL from CMB lensing cross-correlation in combination with the tracers’ autocorrelation.

79 ASTRONOMY AND ASTROPHYSICS↗

A conjugate gradients/trust regions algorithms for training multilayer perceptrons for nonlinear mapping

This paper addresses the issue of applying a globally convergent optimization algorithm to the training of multilayer perceptrons, a class of Artificial Neural Networks. The multilayer perceptrons are trained towards the solution of two highly nonlinear problems: (1) signal detection in a multi-user communication network, and (2) solving the inverse kinematics for a robotic manipulator. The research is motivated by the fact that a multilayer perceptron is theoretically capable of approximating any nonlinear function to within a specified accuracy. The algorithm that has been employed in this study combines the merits of two well known optimization algorithms, the Conjugate Gradients and the Trust Regions Algorithms. The performance is compared to a widely used algorithm, the Backpropagation Algorithm, that is basically a gradient-based algorithm, and hence, slow in converging. The performances of the two algorithms are compared with the convergence rate. Furthermore, in the case of the signal detection problem, performances are also benchmarked by the decision boundaries drawn as well as the probability of error obtained in either case.

Madyastha, Raghavendra K.↗

Construction of solutions for some nonlinear two-point boundary value problems

Constructive existence and uniqueness results for boundary value problems associated with some simple special cases of the second order equation y'' = f(x,y,y') 0 or = x or = 1, are sought. The approach considered is to convert the differential equation and boundary conditions to an integral equation via Green's functions, and then to apply fixed point and contraction map principles to a sequence of successive approximations. The approach is tested on several applied problems. Difficulties in trying to prove general theorems are discussed.

Pennline, J. A.↗

On the influence of over-parameterization in manifold based surrogates and deep neural operators

Constructing accurate and generalizable approximators (surrogate models) for complex physico-chemical processes exhibiting highly non-smooth dynamics is challenging. The main question is what type of surrogate models we should construct and should these models be under-parameterized or over-parameterized. In this work, we propose new developments and perform comparisons for two promising approaches: manifold-based polynomial chaos expansion (m-PCE) and the deep neural operator (DeepONet), and we examine the effect of over-parameterization on generalization. While m-PCE enables the construction of a mapping by first identifying low-dimensional embeddings of the input functions, parameters, and quantities of interest (QoIs), a neural operator learns the nonlinear mapping via the use of deep neural networks. Here, we demonstrate the performance of these methods in terms of generalization accuracy by solving the 2D time-dependent Brusselator reaction-diffusion system with uncertainty sources, modeling an autocatalytic chemical reaction between two species. We first propose an extension of the m-PCE by constructing a mapping between latent spaces formed by two separate embeddings of the input functions and the output QoIs. To further enhance the accuracy of the DeepONet, we introduce weight self-adaptivity in the loss function. We demonstrate that the performance of m-PCE and DeepONet is comparable for cases of relatively smooth input-output mappings. However, when highly non-smooth dynamics is considered, DeepONet shows higher approximation accuracy. We also find that for m-PCE, modest over-parameterization leads to better generalization, both within and outside of distribution, whereas aggressive over-parameterization leads to over-fitting. In contrast, an even highly over-parameterized DeepONet leads to better generalization for both smooth and non-smooth dynamics. Furthermore, we compare the performance of the above models with another recently proposed operator learning model, the Fourier Neural Operator, and show that its over-parameterization also leads to better generalization. Taken together, our studies show that m-PCE can provide very good accuracy at very low training cost, whereas a highly over-parameterized DeepONet can provide better accuracy and robustness to noise but at higher training cost. In both methods, the inference cost is negligible.

97 MATHEMATICS AND COMPUTING↗

Nonlinear proper orthogonal decomposition for convection-dominated flows

Autoencoder techniques find increasingly common use in reduced order modeling as a means to create a latent space. This reduced order representation offers a modular data-driven modeling approach for nonlinear dynamical systems when integrated with a time series predictive model. In this Letter, we put forth a nonlinear proper orthogonal decomposition (POD) framework, which is an end-to-end Galerkin-free model combining autoencoders with long short-term memory networks for dynamics. By eliminating the projection error due to the truncation of Galerkin models, a key enabler of the proposed nonintrusive approach is the kinematic construction of a nonlinear mapping between the full-rank expansion of the POD coefficients and the latent space where the dynamics evolve. We test our framework for model reduction of a convection-dominated system, which is generally challenging for reduced order models. Our approach not only improves the accuracy, but also significantly reduces the computational cost of training and testing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗