Search NASA⌕ Search

SEARCH · Search NASA

Results for “mathematical regularization”

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 199 records · Page 11

Error Estimates for the Optimal Control of a Parabolic Fractional PDE

In this work, we consider the integral definition of the fractional Laplacian and analyze a linear-quadratic optimal control problem for the so-called fractional heat equation; control constraints are also considered. We derive existence and uniqueness results, first order optimality conditions, and regularity estimates for the optimal variables. To discretize the state equation we propose a fully discrete scheme that relies on an implicit finite difference discretization in time combined with a piecewise linear finite element discretization in space. We derive stability results and a novel $L^2(0,T;L^2(\Omega))$ a priori error estimate. On the basis of the aforementioned solution technique, we propose a fully discrete scheme for our optimal control problem that discretizes the control variable with piecewise constant functions, and we derive a priori error estimates for it. We illustrate the theory with one- and two-dimensional numerical experiments.

97 MATHEMATICS AND COMPUTING↗

Regularization and index reduction for linear differential–algebraic systems

In this paper, a necessary and sufficient condition for the existence of a proportional semistate feedback is established such that the closed loop system is regular and of index at most two. The condition is characterized by a rank condition that involves only the original system coefficient matrices. Also, a new rank condition ensuring that a given linear time-invariant descriptor system is regular and of index at most some specific value is also derived. The developed theory is illustrated through physical and numerical examples.

97 MATHEMATICS AND COMPUTING↗

One-parameter families of supersymmetric isospectral potentials from Riccati solutions in function composition form

In the context of supersymmetric quantum mechanics, we define a potential through a particular Riccati solution of the composition form (F∘f)(x)=F(f(x)) and obtain a generalized Mielnik construction of one-parameter isospectral potentials when we use the general Riccati solution. Some examples for special cases of F and f are given to illustrate the method. An interesting result is obtained in the case of a parametric double well potential generated by this method, for which it is shown that the parameter of the potential controls the heights of the localization probability in the two wells, and for certain values of the parameter the height of the localization probability can be higher in the smaller well. -- Highlights: •Function-composition generalization of parametric isospectral potentials is presented. •Mielnik one-parameter family of harmonic potentials is obtained as a particular case. •Graphical discussion of regular and singular regions in the parameter space is given.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A priori error analysis of high-order LL* (FOSLL*) finite element methods

A number of non-standard finite element methods have been proposed in recent years, each of which derives from a specific class of PDE-constrained norm minimization problems. The most notable examples are LL* methods. In this work, we argue that all high-order methods in this class should be expected to deliver substandard uniform h-refinement convergence rates. In fact, one may not even see rates proportional to the polynomial order p > 1 when the exact solution is a constant function. Here, we show that the convergence rate is limited by the regularity of an extraneous Lagrange multiplier variable which naturally appears via a saddle-point analysis. In turn, limited convergence rates appear because the regularity of this Lagrange multiplier is determined, in part, by the geometry of the domain. Numerical experiments support our conclusions.

97 MATHEMATICS AND COMPUTING↗

ParelastiFWI 1.0 User Guide

ParelastiFWl is a python-based frontend to the seismic full waveform inversion process using Sandia Geophysics Department's 3-D isotropic elastic full waveform simulation code, Parelasti. The arguments one provides to ParelastiFWl guide the full waveform inversion process, including resolution of the inversion grid and basic regularization. This report outlines the user flags and ParelastiFWI usage to control the full waveform inversion procedure.

58 GEOSCIENCES↗

A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme

A constraint-reduced Mehrotra-predictor-corrector algorithm for convex quadratic programming is proposed. (At each iteration, such algorithms use only a subset of the inequality constraints in constructing the search direction, resulting in CPU savings.) The proposed algorithm makes use of a regularization scheme to cater to cases where the reduced constraint matrix is rank deficient. Global and local convergence properties are established under arbitrary working-set selection rules subject to satisfaction of a general condition. A modified active-set identification scheme that fulfills this condition is introduced. Numerical tests show great promise for the proposed algorithm, in particular for its active-set identification scheme. While the focus of the present paper is on dense systems, application of the main ideas to large sparse systems is briefly discussed.

97 MATHEMATICS AND COMPUTING↗

Relation between the standard perturbation theory and regularized multi-point propagator method

We investigate the relation between the regularized multi-propagator method, called 'Reg PT', and the standard perturbation theory. Reg PT is one of the most successful models to describe nonlinear evolution of dark matter fluctuations. However, Reg PT is a mathematically unproven interpolation formula between the large-scale solution calculated by the standard perturbation theory and the limiting solution in the small scale calculated by the multi-point propagator method. In this paper, we give an alternative explanation for Reg PT in the context of the standard perturbation theory, showing that Reg PT does not ever have more effective information on nonlinear matter evolution than the standard perturbation theory. In other words, the solutions of the standard perturbation theory reproduce the results of N-body simulations better than those of Reg PT, especially at the high-k region. This fact means that the standard perturbation theory at the two-loop level is still one of the best predictions of the nonlinear power spectrum to date. Nevertheless, the standard perturbation theory has not been preferred because of the divergent behavior of the solution at small scales. To solve this problem, we also propose a modified standard perturbation theory which avoids the divergence.

79 ASTRONOMY AND ASTROPHYSICS↗

Existence and Regularity of Invariant Measures for the Three Dimensional Stochastic Primitive Equations

We establish the continuity of the Markovian semigroup associated with strong solutions of the stochastic 3D Primitive Equations, and prove the existence of an invariant measure. The proof is based on new moment bounds for strong solutions. The invariant measure is supported on strong solutions and is furthermore shown to have higher regularity properties.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Problematic projection to the in-sample subspace for a kernelized anomaly detector

We examine the properties and performance of kernelized anomaly detectors, with an emphasis on the Mahalanobis-distance-based kernel RX (KRX) algorithm. Although the detector generally performs well for high-bandwidth Gaussian kernels, it exhibits problematic (in some cases, catastrophic) performance for distances that are large compared to the bandwidth. By comparing KRX to two other anomaly detectors, we can trace the problem to a projection in feature space, which arises when a pseudoinverse is used on the covariance matrix in that feature space. Here, we show that a regularized variant of KRX overcomes this difficulty and achieves superior performance over a wide range of bandwidths.

58 GEOSCIENCES↗

TNet: A Model-Constrained Tikhonov Network Approach for Inverse Problems

Deep learning (DL), in particular deep neural networks, by default is purely data-driven and in general does not require physics. This is the strength of DL but also one of its key limitations when applied to science and engineering problems in which underlying physical properties—such as stability, conservation, and positivity—and accuracy are required. DL methods in their original forms are often not capable of respecting the underlying mathematical models or achieving desired accuracy even in big-data regimes. On the other hand, many data-driven science and engineering problems, such as inverse problems, typically have limited experimental or observational data, and DL would overfit the data in this case. Leveraging information encoded in the underlying mathematical models, we argue, not only compensates for missing information in low data regimes but also provides opportunities to equip DL methods with the underlying physics, hence promoting better generalization. This paper develops a model-constrained DL approach and its variant TNet—a Tikhonov neural network—which are capable of learning not only information hidden in the training data but also in the underlying mathematical models to solve inverse problems governed by partial differential equations in low data regimes. We provide the constructions and some theoretical results for the proposed approaches for both linear and nonlinear inverse problems. Since TNet is designed to learn inverse solutions with Tikhonov regularization, it is interpretable: in fact it recovers Tikhonov solutions for linear cases while potentially approximating Tikhonov solutions for nonlinear inverse problems. We also prove that data randomization can enhance not only the smoothness of the networks but also their generalizations. Comprehensive numerical results confirm the theoretical findings and show that with even as little as 1 training data sample for one-dimensional (1D) deconvolution, 5 for an inverse 2D heat conductivity problem, 100 for inverse initial conditions for a time-dependent 2D Burgers’s equation, and 50 for inverse initial conditions for 2D Navier–Stokes equations, TNet solutions can be as accurate as Tikhonov solutions while being several orders of magnitude faster. Furthermore, this is possible owing to the model-constrained term, replications, and randomization.

97 MATHEMATICS AND COMPUTING↗

On Volterra quadratic stochastic operators with continual state space

Let (X,F) be a measurable space, and S(X,F) be the set of all probability measures on (X,F) where X is a state space and F is σ - algebraon X. We consider a nonlinear transformation (quadratic stochastic operator) defined by (Vλ)(A) = ∫{sub X}∫{sub X}P(x,y,A)dλ(x)dλ(y), where P(x, y, A) is regarded as a function of two variables x and y with fixed A ∈ F . A quadratic stochastic operator V is called a regular, if for any initial measure the strong limit lim{sub n→∞} V{sup n }(λ) is exists. In this paper, we construct a family of quadratic stochastic operators defined on the segment X = [0,1] with Borel σ - algebra F on X , prove their regularity and show that the limit measure is a Dirac measure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Energy and momentum conservation in the Euler–Poincaré formulation of local Vlasov–Maxwell-type systems

The action principle by Low for the classic Vlasov–Maxwell system contains a mix of Eulerian and Lagrangian variables. This renders the Noether analysis of reparametrization symmetries inconvenient, especially since the well-known energy- and momentum-conservation laws for the system are expressed in terms of Eulerian variables only. While an Euler–Poincaré formulation of Vlasov–Maxwell-type systems, effectively starting with Low's action and using constrained variations for the Eulerian description of particle motion, has been known for a while Cendra et al, it is hard to come by a documented derivation of the related energy- and momentum-conservation laws in the spirit of the Euler–Poincaré machinery. To our knowledge only one such derivation exists in the literature so far, dealing with the so-called guiding-center Vlasov–Darwin system Sugama et al. The present exposition discusses a generic class of local Vlasov–Maxwell-type systems, with a conscious choice of adopting the language of differential geometry to exploit the Euler–Poincaré framework to its full extent. After reviewing the transition from a Lagrangian picture to an Eulerian one, we demonstrate how symmetries generated by isometries in space lead to conservation laws for linear- and angular-momentum density and how symmetry by time translation produces a conservation law for energy density. Here, we also discuss what happens if no symmetries exist. Finally, two explicit examples will be given—the classic Vlasov–Maxwell and the drift-kinetic Vlasov–Maxwell—and the results expressed in the language of regular vector calculus for familiarity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Role of chaos in quantum communication through a dynamical dephasing channel

In this article we treat the subject of chaotic environments with few degrees of freedom in quantum communication by investigating a conservative dynamical map as a model of a dephasing quantum channel. When the channel's dynamics is chaotic, we investigate the model's semi-classical limit and show that the entropy exchange grows at a constant rate which depends on a single parameter (the interaction strength), analogous to stochastic models of dephasing channels. We analyze memory effects in the channel and present strong physical arguments to support that the present model is forgetful in the chaotic regime while memory effects in general cannot be ignored when channel dynamics is regular. In order to render the nonchaotic channel forgetful, it becomes necessary to apply a reset to the channel and this reset can efficiently be modeled by application of a chaotic map. We may then refer to encoding theorems (valid in the case of forgetful channels) to present evidence of a transition from noiseless to noisy channel due to the environment's transition from regular to chaotic dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Alternatives to Contour Visualizations for Power Systems Data

Electrical grids are geographical and topological structures whose voltage states are challenging to represent accurately and efficiently for visual analysis. The current common practice is to use colored contour maps, yet these can misrepresent the data. We examine the suitability of four alternative visualization methods for depicting voltage data in a geographically dense distribution system - Voronoi polygons, H3 tessellations, S2 tessellations, and a network-weighted contour map. We find that Voronoi tessellations and network-weighted contour maps more accurately represent the statistical distribution of the data than regular contour maps.

MATHEMATICS AND COMPUTING,POWER TRANSMISSION AND D↗

Uncertainty-driven dynamics for active learning of interatomic potentials

Machine learning (ML) models, if trained to data sets of high-fidelity quantum simulations, produce accurate and efficient interatomic potentials. Active learning (AL) is a powerful tool to iteratively generate diverse data sets. In this approach, the ML model provides an uncertainty estimate along with its prediction for each new atomic configuration. If the uncertainty estimate passes a certain threshold, then the configuration is included in the data set. Here we develop a strategy to more rapidly discover configurations that meaningfully augment the training data set. The approach, uncertainty-driven dynamics for active learning (UDD-AL), modifies the potential energy surface used in molecular dynamics simulations to favor regions of configuration space for which there is large model uncertainty. The performance of UDD-AL is demonstrated for two AL tasks: sampling the conformational space of glycine and sampling the promotion of proton transfer in acetylacetone. The method is shown to efficiently explore the chemically relevant configuration space, which may be inaccessible using regular dynamical sampling at target temperature conditions.

97 MATHEMATICS AND COMPUTING↗