Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear approximation”

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 721 records · Page 40

Automated Dynamic Demand Response Implementation on a Micro-grid

In this paper, we describe a system for real-time automated Dynamic and Sustainable Demand Response with sparse data consumption prediction implemented on the University of Southern California campus microgrid. Supply side approaches to resolving energy supply-load imbalance do not work at high levels of renewable energy penetration. Dynamic Demand Response (D 2 R) is a widely used demand-side technique to dynamically adjust electricity consumption during peak load periods. Our D 2 R system consists of accurate machine learning based energy consumption forecasting models that work with sparse data coupled with fast and sustainable load curtailment optimization algorithms that provide the ability to dynamically adapt to changing supply-load imbalances in near real-time. Our Sustainable DR (SDR) algorithms attempt to distribute customer curtailment evenly across sub-intervals during a DR event and avoid expensive demand peaks during a few sub-intervals. It also ensures that each customer is penalized fairly in order to achieve the targeted curtailment. We develop near linear-time constant-factor approximation algorithms along with Polynomial Time Approximation Schemes (PTAS) for SDR curtailment that minimizes the curtailment error defined as the difference between the target and achieved curtailment values. Our SDR curtailment problem is formulated as an Integer Linear Program that optimally matches customers to curtailment strategies during a DR event while also explicitly accounting for customer strategy switching overhead as a constraint. We demonstrate the results of our D 2 R system using real data from experiments performed on the USC smartgrid and show that 1) our prediction algorithms can very accurately predict energy consumption even with noisy or missing data and 2) our curtailment algorithms deliver DR with extremely low curtailment errors in the 0.01-0.05 kWh range.

Kuppannagari, Sanmukh R.↗

Local time–space mesh refinement for simulation of elastic wave propagation in multi-scale media

This paper presents an original approach to local time–space grid refinement for the numerical simulation of wave propagation in models with localized clusters of micro-heterogeneities. The main features of the algorithm are –the application of temporal and spatial refinement on two different surfaces; –the use of the embedded-stencil technique for the refinement of grid step with respect to time; –the use of the Fast Fourier Transform (FFT)-based interpolation to couple variables for spatial mesh refinement. The latter makes it possible to perform filtration of high spatial frequencies, which provides stability in the proposed finite-difference schemes. In the present work, the technique is implemented for the finite-difference simulation of seismic wave propagation and the interaction of such waves with fluid-filled fractures and cavities of carbonate reservoirs. However, this approach is easy to adapt and/or combine with other numerical techniques, such as finite elements, discontinuous Galerkin method, or finite volumes used for approximation of various types of linear and nonlinear hyperbolic equations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners

This study presents a parallel preconditioning method for distributed sparse linear systems, based on an approximate inverse of the original matrix, that adopts a general framework of distributed sparse matrices and exploits domain decomposition (DD) and low-rank corrections. The DD approach decouples the matrix and, once inverted, a low-rank approximation is applied by exploiting the Sherman--Morrison--Woodbury formula, which yields two variants of the preconditioning methods. The low-rank expansion is computed by the Lanczos procedure with reorthogonalizations. Numerical experiments indicate that, when combined with Krylov subspace accelerators, this preconditioner can be efficient and robust for solving symmetric sparse linear systems. Comparisons with pARMS, a DD-based parallel incomplete LU (ILU) preconditioning method, are presented for solving Poisson's equation and linear elasticity problems.

97 MATHEMATICS AND COMPUTING↗

Alluvial fan morphology: A self-similar free boundary problem description

In this work, we examine approximate geometrically self-similar solutions to a parabolic free boundary value problem applied to alluvial fan surface morphology and growth. Alluvial fans are fan- or cone-shaped sedimentary deposits caused by the rapid deposition of sediment from a canyon discharging onto a flatter plain. Longitudinal, topographic profiles of fans can be readily described by a seemingly time independent dimensionless profile (DeChant et al., 1999). However, because an alluvial fan can be expected to grow over time, it is clear that this “steady” profile is certainly time dependent and can be described using a space-time self-similar solution. In an experimental and theory-based study, Guerit et al. (2014) developed a self-similar (or as they describe it a self-affine) linear solution based upon an approximate first order small parameter expansion solution for a 1-d homogeneous nonlinear diffusion equation. Direct substitution of this result into a linear diffusion equation suggests that this first order expression may not fully satisfy the associated governing equation. In contrast, we develop a more complete solution based upon a modeled approximation for the axi-symmetric formulation such that the associated temporal behavior is consistent with a 1/3 time power-law as described by Reitz and Jerolmack (2014). The resulting expression is an exact solution to a linear heat equation. Furthermore, we emphasize that a small parameter is not inherent to the resulting profile result and is not included in our model development. Though developed using rather different approaches, the formal solution developed here is in good agreement with the simple polynomial described by DeChant et al. (1999) suggesting that this self-similar solution is a suitable time dependent representation of alluvial fan longitudinal profile form and improves on earlier work.

58 GEOSCIENCES↗

A moment approach for entropy solutions to nonlinear hyperbolic PDEs

We propose to solve hyperbolic partial differential equations(PDEs) with polynomial flux using a convex optimization strategy. This approach is based on a very weak notion of solution of the nonlinear equation, namely the measure-valued (mv) solution, satisfying a linear equation in the space of Borel measures. The aim of this paper is, first, to provide the conditions that ensure the equivalence between the two formulations and, second, to introduce a method which approximates the infinite-dimensional linear problem by a hierarchy of convex, finite-dimensional, semidefinite programming problems. This result is then illustrated on the celebrated Burgers equation. Here, we also compare our results with an existing numerical scheme, namely the Godunov scheme.

97 MATHEMATICS AND COMPUTING↗

McMillan map and nonlinear Twiss parameters

In this article we consider two dynamical systems: the McMillan sextupole and octupole integrable mappings originally introduced by Edwin McMillan; the second one is also known as canonical McMillan map. Both of them are simplest symmetric McMillan maps with only one intrinsic parameter, the trace of the Jacobian at the fixed point. While these dynamical systems have numerous of applications and are used in many areas of math and physics, some of their dynamical properties have not been described yet. We fulfill the gap and provide complete description of all stable trajectories including parametrization of invariant curves, Pioncaré rotation numbers and canonical action-angle variables. In the second part we relate these maps with general chaotic map in McMillan-Turaev form. We show that McMillan sextupole and octupole mappings are first order approximations of dynamics around the fixed point, in a similar way as linear map and quadratic invariant (Courant-Snyder invariant in accelerator physics) is the zeroth order approximation (known as linearization). Finally we suggest the new formalism of nonlinear Twiss parameters which incorporate dependence of rotation number as a function of amplitude, in contrast to e.g. betatron phase advance used in accelerator physics which is independent of amplitude. Specifically in application to accelerator physics this new formalism is capable of predicting dynamical aperture around 1-st, 2-nd, 3-rd and 4-th order resonances for flat beams, which is critical for beam injection/extraction.

43 PARTICLE ACCELERATORS↗

Real-time nonlinear optimization as a generalized equation.

We establish results for the problem of tracking a time-dependent manifold arising in real-time optimization by casting this as a parametric generalized equation. We demonstrate that if points along a solution manifold are consistently strongly regular, it is possible to track the manifold approximately by solving a single linear complementarity problem (LCP) at each time step. We derive sufficient conditions guaranteeing that the tracking error remains bounded to second order with the size of the time step even if the LCP is solved only approximately. We use these results to derive a fast, augmented Lagrangian tracking algorithm and demonstrate the developments through a numerical case study.

36 MATERIALS SCIENCE↗

Approximate Green’s Function Coupled Cluster A Method Employing Effective Dimension Reduction

The Green’s function coupled cluster (GFCC) method, originally proposed in the early 1990s, is a powerful many-body tool for computing and analyzing the electronic structures of molecular structures and periodic systems, especially when electrons are strongly correlated. However, in order for the GFCC method to become an approach that can be routinely used in the electronic structure calculations, more robust linear algebraic techniques and approximations need to be employed to reduce its extremely high computational overhead. In our recent studies, we showed that the GFCC equation can be numerically solved by seeking solutions of multiple linear systems in the frequency regime of interest, which can be easily distributed in a massively parallel environment, and broaden the avenue for more state-of-the-art numerical linear algebraic tools associated with multiple linear systems to be kicked in to this field. In the present pursuit of this practice, we show a successful application of model order reduction (MOR) techniques in the GFCC framework. Briefly speaking, for a frequency regime of interest that requires a high resolution of spectral function, instead of solving GFCC linear equation in the original dimension for every single frequency point, an easily-solvable linear system model with reduced dimension can be built upon projecting the original GFCC linear system into a subspace, from which the interpolation and extrapolation can give a reasonable approximation to the results of the original GFCC linear equations. Here, we show that the subspace can be properly constructed in an iterative manner from the auxiliary vectors of the GFCC linear equations at some select frequencies inside the frequency regime. During the iterations, the quality of the subspace, as well as the linear system model, can be systematically improved. The approach is tested in this work in terms of the efficiency and accuracy of computing spectral functions for some typical molecular systems including carbon monoxide, 1,3-butadiene, benzene, and adenine molecules. As a byproduct, the high quality linear system model is also found to be able to provide high quality initial guess for the existing linear solver to improve the convergence performance.

Peng, Bo↗

Nonlinear dimension reduction for surrogate modeling using gradient information

We introduce a method for the nonlinear dimension reduction of a high-dimensional function $u:{\mathbb{R}}^d\rightarrow{\mathbb{R}}$, $d\gg 1$. Our objective is to identify a nonlinear feature map $g:{\mathbb{R}}^d\rightarrow{\mathbb{R}}^m$, with a prescribed intermediate dimension $m\ll d$, so that $u$ can be well approximated by $f\circ g$ for some profile function $f:{\mathbb{R}}^m\rightarrow{\mathbb{R}}$. We propose to build the feature map by aligning the Jacobian $\nabla g$ with the gradient $\nabla u$, and we theoretically analyze the properties of the resulting $g$. Once $g$ is built, we construct $f$ by solving a gradient-enhanced least squares problem. Our practical algorithm uses a sample $\{{\textbf{x}}^{(i)},u({\textbf{x}}^{(i)}),\nabla u({\textbf{x}}^{(i)})\}_{i=1}^N$ and builds both $g$ and $f$ on adaptive downward-closed polynomial spaces, using cross validation to avoid overfitting. We numerically evaluate the performance of our algorithm across different benchmarks, and explore the impact of the intermediate dimension $m$. We show that building a nonlinear feature map $g$ can permit more accurate approximation of $u$ than a linear $g$, for the same input data set.

97 MATHEMATICS AND COMPUTING↗

THE ANGULAR DISTRIBUTION OF Ly{alpha} RESONANT PHOTONS EMERGING FROM AN OPTICALLY THICK MEDIUM

We investigate the angular distribution of Ly{alpha} photons scattering or emerging from an optically thick medium. Since the evolution of specific intensity I in frequency space and angular space are coupled with each other, we first develop the WENO numerical solver to find the time-dependent solutions of the integro-differential equation of I in frequency and angular space simultaneously. We first show that the solutions with the Eddington approximation, which assume that I is linearly dependent on the angular variable {mu}, yield similar frequency profiles of the photon flux as those without the Eddington approximation. However, the solutions of the {mu} distribution evolution are significantly different from those given by the Eddington approximation. First, the angular distribution of I is found to be substantially dependent on the frequency of the photons. For photons with the resonant frequency {nu}{sub 0}, I contains only a linear term of {mu}. For photons with frequencies at the double peaks of the flux, the {mu}-distribution is highly anisotropic; most photons are emitted radially forward. Moreover, either at {nu}{sub 0} or at the double peaks, the {mu} distributions actually are independent of the initial {mu} distribution of photons of the source. This is because the photons with frequencies either at {nu}{sub 0} or the double peaks undergo the process of forgetting their initial conditions due to resonant scattering. We also show that the optically thick medium is a collimator of photons at the double peaks. Photons from the double peaks form a forward beam with a very small opening angle.

79 ASTRONOMY AND ASTROPHYSICS↗

Large-scale harmonic balance simulations with Krylov subspace and preconditioner recycling

The multi-harmonic balance method combined with numerical continuation provides an efficient framework to compute a family of time-periodic solutions, or response curves, for large-scale, nonlinear mechanical systems. The predictor and corrector steps repeatedly solve a sequence of linear systems that scale by the model size and number of harmonics in the assumed Fourier series approximation. In this paper, a novel Newton–Krylov iterative method is embedded within the multi-harmonic balance and continuation algorithm to efficiently compute the approximate solutions from the sequence of linear systems that arise during the prediction and correction steps. Further, the method recycles, or reuses, both the preconditioner and the Krylov subspace generated by previous linear systems in the solution sequence. A delayed frequency preconditioner refactorizes the preconditioner only when the performance of the iterative solver deteriorates. The GCRO-DR iterative solver recycles a subset of harmonic Ritz vectors to initialize the solution subspace for the next linear system in the sequence. The performance of the iterative solver is demonstrated on two exemplars with contact-type nonlinearities and benchmarked against a direct solver with traditional Newton–Raphson iterations.

97 MATHEMATICS AND COMPUTING↗

A simple, stable, and accurate linear tetrahedral finite element for transient, nearly, and fully incompressible solid dynamics: A dynamic variational multiscale approach [A simple, stable, and accurate tetrahedral finite element for transient, nearly incompressible, linear and nonlinear elasticity: A dynamic variational multiscale approach]

Here, we propose a new approach for the stabilization of linear tetrahedral finite elements in the case of nearly incompressible transient solid dynamics computations. Our method is based on a mixed formulation, in which the momentum equation is complemented by a rate equation for the evolution of the pressure field, approximated with piece-wise linear, continuous finite element functions. The pressure equation is stabilized to prevent spurious pressure oscillations in computations. Incidentally, it is also shown that many stabilized methods previously developed for the static case do not generalize easily to transient dynamics. Extensive tests in the context of linear and nonlinear elasticity are used to corroborate the claim that the proposed method is robust, stable, and accurate.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Low-Rank Solver for the Navier--Stokes Equations with Uncertain Viscosity

In this work, we study an iterative low-rank approximation method for the solution of the steady-state stochastic Navier--Stokes equations with uncertain viscosity. The method is based on linearization schemes using Picard and Newton iterations and stochastic finite element discretizations of the linearized problems. For computing the low-rank approximate solution, we adapt the nonlinear iterations to an inexact and low-rank variant, where the solution of the linear system at each nonlinear step is approximated by a quantity of low rank. This is achieved by using a tensor variant of the GMRES method as a solver for the linear systems. We explore the inexact low-rank nonlinear iteration with a set of benchmark problems, using a model of flow over an obstacle, under various configurations characterizing the statistical features of the uncertain viscosity, and we demonstrate its effectiveness by extensive numerical experiments.

97 MATHEMATICS AND COMPUTING↗

Complex-valued universal linear transformations and image encryption using spatially incoherent diffractive networks

As an optical processor, a diffractive deep neural network (D2NN) utilizes engineered diffractive surfaces designed through machine learning to perform all-optical information processing, completing its tasks at the speed of light propagation through thin optical layers. With sufficient degrees of freedom, D2NNs can perform arbitrary complex-valued linear transformations using spatially coherent light. Similarly, D2NNs can also perform arbitrary linear intensity transformations with spatially incoherent illumination; however, under spatially incoherent light, these transformations are nonnegative, acting on diffraction-limited optical intensity patterns at the input field of view. Here, we expand the use of spatially incoherent D2NNs to complex-valued information processing for executing arbitrary complex-valued linear transformations using spatially incoherent light. Through simulations, we show that as the number of optimized diffractive features increases beyond a threshold dictated by the multiplication of the input and output space-bandwidth products, a spatially incoherent diffractive visual processor can approximate any complex-valued linear transformation and be used for all-optical image encryption using incoherent illumination. The findings are important for the all-optical processing of information under natural light using various forms of diffractive surface-based optical processors.

36 MATERIALS SCIENCE↗

Design of a One-Dimensional Sextupole Using Semi-Analytic Methods

Sextupole magnets provide position-dependent momentum kicks and are tuned to provide the correct kicks to parti- cles within a small acceptance region in phase space. Sextupoles are useful and even necessary in circular accelerators for chromaticity corrections. They are routinely used in most rings, i.e. CESR. Although sextupole magnets are necessary for particle energy corrections, they also have undesirable effects on dynamic aperture, especially because of their non- linear coupling term in the momentum kick. Studies of integrable systems suggest that there is an analytic way to create transport lattices with specific transfer matrices that limit the momentum kick to one dimension. A one-dimension sex- tupole is needed for chromaticity corrections: a horizontal sextupole for horizontal bending magnets. We know how to make a “composite” horizontal sextupole using regular 2D sextupoles and linear transfer matrices in an ideal thin-lens approximation. Thus, one could create an accelerator lattice using linear elements, in series with sextupole magnets to create a “1D sextupole”. This paper describes progress to- wards realizing a realistic focusing lattice resulting in a 1D sextupole.

43 PARTICLE ACCELERATORS↗

McCormick envelopes in mixed-integer PDE-constrained optimization

McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in PDE-constrained optimization so far. This lack of attention may be due to the distributed nature of such problems, which on the one hand leads to infinitely many linear constraints (generally state constraints that may be difficult to handle) in addition to the state equation for a pointwise formulation of the McCormick envelopes and renders bound-tightening procedures that successively improve the resulting convex relaxations computationally intractable. We analyze McCormick envelopes for a model problem class that is governed by a semilinear PDE involving a bilinearity and integrality constraints. We approximate the nonlinearity and in turn the McCormick envelopes by averaging the involved terms over the cells of a partition of the computational domain on which the PDE is defined. This yields convex relaxations that underestimate the original problem up to an a priori error estimate that depends on the mesh size of the discretization. These approximate McCormick relaxations can be improved by means of an optimization-based bound-tightening procedure. We show that their minimizers converge to minimizers to a limit problem with a pointwise formulation of the McCormick envelopes when driving the mesh size to zero. We provide a computational example, for which we certify all of our imposed assumptions. The results point to both the potential of the methodology and the gaps in the research that need to be closed. Our methodology provides a framework first for obtaining pointwise underestimators for nonconvexities and second for approximating them with finitely many linear inequalities in an infinite-dimensional setting.

Approximations and Expansions↗

On differential singular perturbation problems: a simple variational approach

An alternative approach for the analysis and the numerical approximation of singular perturbation problems, using a variational framework, is presented. It is based on the natural idea of minimizing the residual of the differential equation measured in the L{sup 2} norm. By this strategy, the approximation is based in the solution of a set of linear problems giving the descent step directions of the problem. This is the main advantage of our approach, since we can use stable and convergent methods for linear problems (without assuming the knowledge of good initial guesses used in the approximation of the associated non-linear systems necessary in Newton-type methods). Remember that for this type of problems, we should use implicit methods. We prove that our procedure can never get stuck in local minima, and the error decreases until getting to the original solution independent of the perturbation parameter. Finally, we include some numerical examples.

97 MATHEMATICS AND COMPUTING↗

Laser-assisted positron-impact ionization of atomic hydrogen in the second Born approximation

We study positron-impact ionization of atomic hydrogen in the presence of a linearly polarized laser field in the second Born approximation. The state of the fast incident positron is described by the Volkov wave function and the dressed state of the ejected electron and ground-state hydrogen are treated as a first-order time-dependent perturbative wave function. We calculate the triple differential cross section in the Ehrhardt asymmetric geometry, and numerical results indicate that the second-order effects are significant. Compared with the ionization process by electrons, the influence of the projectile charge sign appears: the binary peaks are greatly enhanced for positrons in the second Born approximation.

74 ATOMIC AND MOLECULAR PHYSICS↗