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 523 records · Page 29

Connected three-body terms in single-reference unitary many-body theories: Iterative and perturbative approximations

This work introduces various approaches to include connected three-body terms in unitary many-body theories, focusing on the driven similarity renormalization group (DSRG). Starting from the least approximate method—the linearized DSRG truncated to one-, two-, and three-body operators [LDSRG(3)]—we develop several approximate LDSRG(3) models with reduced computational cost. Through a perturbative analysis, we motivate a family of iterative LDSRG(3)-n and -n' (n = 1, 2, 3, 4) methods that contain a subset of the LDSRG(3) diagrams. Among these variants, the LDSRG(3)-2 scheme has the same computational complexity of coupled cluster theory with singles, doubles, and triples (CCSDT), but it outperforms CCSDT in the accuracy of the predicted correlation energies. We also propose and implement two perturbative triples corrections based on the linearized DSRG truncated to one- and two-body operators augmented with recursive semi-quadratic commutators [qDSRG(2)]. Overall, the resulting qDSRG(2)+(T) approach matches the accuracy of the “gold-standard” coupled cluster theory with singles, doubles, and perturbative triples model on the energetics of twenty-eight closed-shell atoms and small molecules.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Lithium-Ion Battery Diagnostics Using Electrochemical Impedance via Machine-Learning

Diagnosing battery states such as health, state-of-charge, or temperature is crucial for ensuring the safety and reliability of electrochemical energy storage systems. While some states, such as temperature, may be measured using cheap sensors, accurate diagnosis of battery health metrics usually requires time-consuming performance measurements, making them infeasible for use in real-world operation. These health metrics can be measured during lab-testing and then estimated on-line using predictive life models or via state observer algorithms such as Kalman filters, but these predictive methods should be supplemented by actual measurement of battery health whenever possible to ensure reliability. Rapid measurement of battery health may be done by various types of fast diagnostic techniques such as electrochemical impedance spectroscopy (EIS), which can be performed in only a few minutes and require only a fraction of the energy and power needed for a full charge and discharge measurement. But there is a substantial challenge for estimating battery health using EIS data, as EIS is sensitive to cell temperature, state-of-charge, current, and resting time in addition to health. Thus, utilizing EIS data to predict battery capacity requires correcting for all these additional variables, a task that is extremely difficult to handle analytically. This talk utilizes machine-learning methods to estimate the effectiveness of battery capacity prediction from EIS data, leveraging a data set of hundreds of EIS measurements recorded at varying temperature and state-of-charge throughout a 500-day aging study of 32 commercial, large-format NMC-Graphite lithium-ion batteries. Using EIS as input to machine-learning models is complicated by the nonlinear response of impedance to battery health, temperature, and state-of-charge, as well as the collinearity between the impedance response at neighboring frequencies, which can easily lead to overfit models. To train robust models, features from EIS data need to be extracted from the data or some subset of critical frequencies selected. Many approaches for extracting and selecting features from EIS data from electrochemical analysis and machine-learning fields were identified for analysis: using the entire raw spectra; selection of one, two, or many frequencies from the entire spectra; selecting interesting points from the EIS measurement using domain knowledge; fitting EIS with an equivalent-circuit model; calculating statistics on the raw impedance values; and reducing the dimensionality of the data using unsupervised linear (principal component analysis) and non-linear (uniform manifold approximation and projection) methods. These approaches were rigorously compared using a machine-learning pipeline approach, training linear, Gaussian process, and random forest regression models and quantifying performance using cross-validation as well as a held-out test set. An artificial neural network model trained on the raw spectra was also tested. Promising pipelines were fine-tuned via Bayesian hyperparameter optimization using cross-validation loss and training with class-specific weights to counter data set imbalance. The most reliable method for utilizing impedance in this work was the selection of two optimal frequencies through an exhaustive search, resulting in about 2% mean absolute error on test data for both Gaussian process and random forest model architectures. Interrogation of a variety of models reveals critical frequencies of 100 Hz and 103 Hz for this data set, though the optimal set of frequencies is not necessarily intuitive, i.e., the best performing models are not simply those that use impedance at frequencies that have the highest correlation to the relative discharge capacity. The best performing model is an ensemble model, which is able to predict battery capacity with 1.9% mean absolute error for unseen cells using impedance recorded at a variety of temperatures and states-of-charge.

battery↗

Parallel-in-Time Solution of Hyperbolic PDE Systems via Characteristic-Variable Block Preconditioning

We consider the parallel-in-time solution of both linear and nonlinear hyperbolic partial differential equation (PDE) systems in one spatial dimension. In the nonlinear setting, the discretized equations are solved with a preconditioned residual iteration based on a global linearization. The linear(ized) equation systems are approximately solved parallel-in-time using a block preconditioner applied in the characteristic variables of the underlying linear(ized) hyperbolic PDE. This change of variables is motivated by the observation that intervariable coupling between characteristic variables is weak, at least locally where spatio-temporal variations in the eigenvectors of the associated flux Jacobian are sufficiently small, while that between the original variables is not. For an ℓ-dimensional system of PDEs, applying the preconditioner consists of solving a sequence of ℓ scalar linear(ized)-advection-like problems, each associated with a different characteristic wave-speed in the underlying linear(ized) PDE. Furthermore, we approximately solve these linear advection problems using multigrid reduction-in-time (MGRIT); however, any other suitable parallel-in-time method could be used. Numerical examples are shown for the (linear) acoustics equations in heterogeneous media and for the (nonlinear) shallow water equations and Euler equations of gas dynamics with shocks and rarefactions. For many test problems, the solver converges in just a handful of iterations and with mesh-independent convergence rates.

97 MATHEMATICS AND COMPUTING↗

Analysis of Curvilinear Geometry Characteristic-Based Particles Transport Discretizations (Final Report, Year 2)

The analysis of characteristic methods in Cartesian geometry performed by M. L. Adams, T. A. Wareing and W. F. Walters showed that characteristic methods on triangular cells meet the asymptotic diffusion limit. We currently working on the development of a linear characteristic method in RZ geometry on triangular grids. The grid is formed on the basis of a rectangular grid in (r, z) space. Each rectangular cell of this grid is divided into four triangular cells. The discretization method approximates the angular flux in each triangular cell with linear functions along the cell edge and in the interior of the cell. The unknowns are edge-average and cell-average angular fluxes, first spatial moments of the angular flux over the cell and edges. The scattering term is interpolated with a linear function in each cell by means of the cell-average scalar flux and its linear spatial moments. The main research issue is the calculation of linear spatial moments of the scalar flux based on the linear spatial moments of the angular flux in a cell in (ξ, z) coordinates that will enable one to construct a linear approximation of the cell-wise scalar flux with desired properties.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Linear-depth quantum circuits for loading Fourier approximations of arbitrary functions

Abstract The ability to efficiently load functions on quantum computers with high fidelity is essential for many quantum algorithms, including those for solving partial differential equations and Monte Carlo estimation. In this work, we introduce the Fourier series loader (FSL) method for preparing quantum states that exactly encode multi-dimensional Fourier series using linear-depth quantum circuits. Specifically, the FSL method prepares a (Dn)-qubit state encoding the 2 Dn -point uniform discretization of aD-dimensional function specified by aD-dimensional Fourier series. A free parameter,m, which must be less thann, determines the number of Fourier coefficients, 2 D ( m + 1 ) , used to represent the function. The FSL method uses a quantum circuit of depth at most 2 ( n − 2 ) + ⌈ log 2 ( n − m ) ⌉ + 2 D ( m + 1 ) + 2 − 2 D ( m + 1 ) , which is linear in the number of Fourier coefficients, and linear in the number of qubits (Dn) despite the fact that the loaded function’s discretization is over exponentially many (2 Dn ) points. The FSL circuit consists of at most D n + 2 D ( m + 1 ) + 1 − 1 single-qubit and D n ( n + 1 ) / 2 + 2 D ( m + 1 ) + 1 − 3 D ( m + 1 ) − 2 two-qubit gates; we present a classical compilation algorithm with runtime O ( 2 3 D ( m + 1 ) ) to determine the FSL circuit for a given Fourier series. The FSL method allows for the highly accurate loading of complex-valued functions that are well-approximated by a Fourier series with finitely many terms. We report results from noiseless quantum circuit simulations, illustrating the capability of the FSL method to load various continuous 1D functions, and a discontinuous 1D function, on 20 qubits with infidelities of less than 10 −6 and 10 −3 , respectively. We also demonstrate the practicality of the FSL method for near-term quantum computers by presenting experiments performed on the Quantinuum H1-1 and H1-2 trapped-ion quantum computers: we loaded a complex-valued function on 3 qubits with a fidelity of over 95 % , as well as various 1D real-valued functions on up to 6 qubits with classical fidelities ≈99%, and a 2D function on 10 qubits with a classical fidelity ≈94%.

Physics↗

A continuous analogue of the tensor-train decomposition

We develop new approximation algorithms and data structures for representing and computing with multivariate functions using the functional tensor-train (FT), a continuous extension of the tensor-train (TT) decomposition. The FT represents functions using a tensor-train ansatz by replacing the three-dimensional TT cores with univariate matrix-valued functions. The main contribution of this paper is a framework to compute the FT that employs adaptive approximations of univariate fibers, and that is not connected to any tensorized discretization. The algorithm can be coupled with any univariate linear or nonlinear approximation procedure. We demonstrate that this approach can generate multivariate function approximations that are several orders of magnitude more accurate, for the same cost, than those based on the conventional approach of compressing the coefficient tensor of a tensor-product basis. Our approach is in the spirit of other continuous computation packages such as Chebfun, and yields an algorithm which requires the computation of “continuous” matrix factorizations such as the LU and QR decompositions of vector-valued functions. To support these developments, we describe continuous versions of an approximate maximum-volume cross approximation algorithm and of a rounding algorithm that re-approximates an FT by one of lower ranks. We demonstrate that our technique improves accuracy and robustness, compared to TT and quantics-TT approaches with fixed parameterizations, of high-dimensional integration, differentiation, and approximation of functions with local features such as discontinuities and other nonlinearities.

42 ENGINEERING↗

On spectral perturbation caused by bounded variation of potential

The harmonic oscillator operator is perturbed by an arbitrary bounded continuous term. This results in the perturbation of the spectrum. The map sending the first of these perturbations into the second is examined. Its approximation by a linear map is studied. Bibliography: 2 titles.

97 MATHEMATICS AND COMPUTING↗

Accurate Determination of Eigenvalues for the Spherical Linear Potential

Because of the asymptotic freedom behavior, quark and antiquark in a tightly bound mesonic system behave like free particles, under the influence of a potential, which can be described, to a first approximation, by a linear potential. The present paper is an attempt to obtain, to a higher degree of accuracy, the eigenvalues for the spherical linear potential. These will serve as the basis from which the physics for more realistic potential can be determined.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Data-driven modeling and control of dynamical systems using Koopman and Perron-Frobenius operators

This dissertation studies the data-driven modeling and control problem of nonlinear systems by exploiting the linear operator theoretic framework involving Koopman and Perro-Frobenius operator. A systematic linear-operator based controller design procedure has been established, which can be used to solve a variety of nonlinear control problems, including feedback stabilization using control Lyapunov functions, optimal quadratic regulation using Koopman eigenfunctions and convex optimization formulation of optimal control problem using P-F and Koopman operator approximation. As the core of data-driven modeling, we first propose a new algorithm for the finite-dimensional approximation of the linear transfer Koopman and Perron-Frobenius operator from time-series data. We argue that the existing approach for the finite-dimensional approximation of these transfer operators such as Dynamic Mode Decomposition (DMD) and Extended Dynamic Mode Decomposition (EDMD) do not capture two important properties of these operators, namely positivity and Markov property. The algorithm we propose preserves these two properties. We call the proposed algorithm as naturally structured DMD (NSDMD) since it retains the inherent properties of these operators. Naturally structured DMD algorithm leads to a better approximation of the steady-state dynamics of the system regarding computing Koopman and Perron- Frobenius operator eigenfunctions and eigenvalues. However, preserving positivity property is critical for capturing the real transient dynamics of the system. This positivity property of the transfer operators and it's finite-dimensional approximation play an important role for controller and estimator design of nonlinear systems. To solve the feedback stabilization problem for nonlinear control systems, we tried to take advantage of the Koopman operator framework. The Koopman operator approach provides a linear representation for a nonlinear dynamical system and a bilinear representation for a nonlinear control system. The problem of feedback stabilization of a nonlinear control system is then transformed to the stabilization of a bilinear control system. We propose a control Lyapunov function (CLF)-based approach for the design of stabilizing feedback controllers for the bilinear system. The search for finding a CLF for the bilinear control system is formulated as a convex optimization problem. This leads to a schematic procedure for designing CLF-based stabilizing feedback controllers for the bilinear system and hence the original nonlinear system. Another advantage of the proposed controller design approach outlined in this dissertation is that it does not require explicit knowledge of system dynamics. In particular, the bilinear representation of a nonlinear control system in the Koopman eigenfunction space can be obtained from time-series data. Next, we study the optimal quadratic regulation problem for nonlinear systems. The linear operator theoretic framework involving the Koopman operator is used to lift the dynamics of nonlinear control system to an infinite-dimensional bilinear system. The optimal quadratic regulation problem for nonlinear system is formulated in terms of the finite-dimensional approximation of the bilinear system. A convex optimization-based approach is proposed for solving the quadratic regulator problem for bilinear system. We applied a variety of examples and compared the simulation results between our framework and conventional LQR control using linearized model. For more general optimal control problems, we provide a density-function based convex formulation for the optimal control problem of the nonlinear system. The convex formulation relies on the duality result in the stability theory of a dynamical system involving density function and Perron-Frobenius operator. The optimal control problem is formulated as an infinite-dimensional convex optimization program. The finite-dimensional approximation of the optimization problem relies on the recent advances made in the data-driven computation of the Koopman operator, which is dual to the Perron-Frobenius operator. Simulation results are presented to demonstrate the application of the developed framework.

Huang, Bowen↗

Fast alogorithms for Bayesian uncertainty quantification in large-scale linear inverse problems based on low-rank partial Hessian approximations

We consider the problem of estimating the uncertainty in large-scale linear statistical inverse problems with high-dimensional parameter spaces within the framework of Bayesian inference. When the noise and prior probability densities are Gaussian, the solution to the inverse problem is also Gaussian, and is thus characterized by the mean and covariance matrix of the posterior probability density. Unfortunately, explicitly computing the posterior covariance matrix requires as many forward solutions as there are parameters, and is thus prohibitive when the forward problem is expensive and the parameter dimension is large. However, for many ill-posed inverse problems, the Hessian matrix of the data misfit term has a spectrum that collapses rapidly to zero. We present a fast method for computation of an approximation to the posterior covariance that exploits the lowrank structure of the preconditioned (by the prior covariance) Hessian of the data misfit. Analysis of an infinite-dimensional model convection-diffusion problem, and numerical experiments on large-scale 3D convection-diffusion inverse problems with up to 1.5 million parameters, demonstrate that the number of forward PDE solves required for an accurate low-rank approximation is independent of the problem dimension. This permits scalable estimation of the uncertainty in large-scale ill-posed linear inverse problems at a small multiple (independent of the problem dimension) of the cost of solving the forward problem.

97 MATHEMATICS AND COMPUTING↗

A quick introduction to linear transport phenomena

The goal of this report is to provide an introductory-level overview of the linear Boltzmann equation in the context of neutron transport. After deriving the transport equation, we discuss some of its basic applications in reactor theory. Finally, we review several simplifying approximations of the linearized Boltzmann equation that are essential to solving it in many applications. Although the context of neutron transport is called upon to add concreteness to our discussion, many of the concepts and approximations that we discuss remain relevant in other many other phenomena.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Smoothness of Functions in Spaces of the Finite Element Method

We find necessary and sufficient conditions for the generalized smoothness of the coordinate functions obtained from the approximate relations. We show that for the coordinate functions the smoothness on their supports is equivalent to that on the boundaries of supports. We obtain conditions for the continuity of Courant type finite element approximations and conditions for the uniqueness of a linear space of such approximations.

97 MATHEMATICS AND COMPUTING↗

Towards the Robust Small-Signal Stability Region of Power Systems Under Perturbations Such as Uncertain and Volatile Wind Generation

This paper addresses how to extend the concept of small-signal stability region (SSSR) to that of robust small-signal stability region (RSSSR), within which the system can remain stable even under perturbations caused by uncertain and volatile nodal injections, such as renewable generation. We first employ the structured perturbation theory to formulate the perturbations of nodal injections in state space. Both the intensity and the locations of perturbations can be taken into account. Then, we leverage the stability radius theory and structured singular value theory to define the RSSSR in parameter subspace, enabling a systematic analysis of small-signal stability of power systems under perturbations in a region-wise manner. The hyperplane-approximation method can be employed to construct a linear closed-form approximation of RSSSR boundaries. Case studies on the modified two-area system and New England 39-node system illustrate the new concept of RSSSR and its potential applications.

power system stability analysis↗

Field-induced spin level crossings within a quasi-$XY$ antiferromagnetic state in $Ba$ 2 $FeSi$ 2 $O$ 7

Here, we present a high-field study of the strongly anisotropic easy-plane square lattice $S$ = 2 quantum magnet $Ba$ 2 $FeSi$ 2 $O$ 7 . This compound is a rare high-spin antiferromagnetic system with very strong easy-plane anisotropy, such that the interplay between spin level crossings and antiferromagnetic order can be studied. We observe a magnetic field-induced spin level crossing occurring within an ordered state. This spin level crossing appears to preserve the magnetic symmetry while producing a nonmonotonic dependence of the order parameter magnitude. The resulting temperature–magnetic field phase diagram exhibits two dome-shaped regions of magnetic order overlapping around 30 T. The ground state of the lower-field dome is predominantly a linear combination of |$S^z$ = 0$\rangle$ and |$S^z$ = 1$\rangle$ states, while the ground state of the higher-field dome can be approximated by a linear combination of |$S^z$ = 1$\rangle$ and |$S^z$ = 2$\rangle$ states. At 30 T, where the spin levels cross, the magnetization exhibits a slanted plateau, the magnetocaloric effect shows a broad hump, and the electric polarization shows a weak slope change. We determined the detailed magnetic phase boundaries and the spin level crossings using measurements of magnetization, electric polarization, and the magnetocaloric effect in pulsed magnetic fields to 60 T. Furthermore, we calculate these properties using a mean-field theory based on direct products of SU(5) coherent states and find good agreement. Finally, we measure and calculate the magnetically induced electric polarization that reflects magnetic ordering and spin level crossings. This multiferroic behavior provides another avenue for detecting phase boundaries and symmetry changes.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Deep-Learning-Based Koopman Modeling for Online Control Synthesis of Nonlinear Power System Transient Dynamics

Power system stability and control have become more challenging due to the increasing uncertainty associated with renewable generation. Here, the performance of conventional control is highly driven by the physics-based offline-developed dynamic models that can deviate from the actual system characteristics under different operating conditions and/or configurations. Data-driven approaches based on online measurements can be a better solution to addressing these issues by capturing real-time operation conditions. This article describes a novel fully data-driven probabilistic framework to derive a linear representation of postcontingency grid dynamics and online prescribe control based on the derived model to enhance transient stability. The complex nonlinear power system dynamics is approximated by a linear model by using multiple neural network modules that infer distributions of the observations and introducing a Koopman layer to sample possible Koopman linear models from the inferred distributions. The trained model features linearity that can be easily incorporated into the existing linear control design paradigm and ease the controller design process. The effectiveness of Koopman-based control designs is validated through comparative case studies, which demonstrate increased prediction accuracy and control performance when applied to a power system with heterogeneous generator dynamics.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Density functional theory beyond the linear regime: Validating an adiabatic local density approximation

We present a local density approximation (LDA) for one-dimensional (1D) systems interacting via the soft-Coulomb interaction based on quantum Monte Carlo calculations. Results for the ground-state energies and ionization potentials of finite 1D systems show excellent agreement with exact calculations obtained by exploiting the mapping of an N-electron system in d dimensions onto a single electron in Nxd dimensions, properly symmetrized by the Young diagrams. We conclude that 1D LDA is of the same quality as its three-dimensional (3D) counterpart, and we infer conclusions about 3D LDA. The linear and nonlinear time-dependent responses of 1D model systems using LDA, exact exchange, and the exact solution are investigated and show very good agreement in both cases, except for the well-known problem of missing double excitations. Consequently, the 3D LDA is expected to be of good quality beyond the linear response. In addition, the 1D LDA should prove useful in modeling the interaction of atoms with strong laser fields, where this specific 1D model is often used.

74 ATOMIC AND MOLECULAR PHYSICS↗

Entanglement from density measurements: Analytical density functional for the entanglement of strongly correlated fermions

We derive an analytical density functional for the single-site entanglement of the one-dimensional homogeneous Hubbard model by means of an approximation to the linear entropy. We show that this very simple density functional reproduces quantitatively the exact results. We then use this functional as input for a local-density approximation to the single-site entanglement of inhomogeneous systems. We illustrate the power of this approach in a harmonically confined system, which could simulate recent experiments with ultracold atoms in optical lattices as well as in a superlattice and in an impurity system. The impressive quantitative agreement with numerical calculations--which includes reproducing subtle signatures of the particle density stages--shows that our density functional can provide entanglement calculations for actual experiments via density measurements. Next we use our functional to calculate the entanglement in disordered systems. We find that, in contrast with the expectation that disorder destroys the entanglement, there exist regimes for which the entanglement remains almost unaffected by the presence of disordered impurities.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multi-sensor system for the detection and characterization of unexploded ordnance

To fully characterize the inductive response of an isolated conductive object, such as buried unexploded ordinance, one needs to measure its response to stimulation by primary magnetic fields in three linearly independent (e.g., approximately orthogonal) directions. In one embodiment this is achieved by measuring the response to magnetic fields of three independent transmitters arranged to have magnetic fields that are linearly independent. According to the apparatus and methods employing the system of this invention, multiple transmitters and receivers of known relative position and orientation on a single platform are used. In a preferred embodiment, matched sets of receiver pairs connected in gradient mode are positioned adjacent to closely spaced pairs of transmitting coils, such that a minor displacement of one or both of the receiver coil pairs relative to the paired transmitting coils will not affect the detected secondary signals emitted by a buried metallic object.

47 OTHER INSTRUMENTATION↗