Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algebraic models”

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 1,297 records · Page 72

A Condensed Constrained Nonconforming Mortar-Based Approach for Preconditioning Finite Element Discretization Problems

This paper presents and studies an approach for constructing auxiliary space preconditioners for finite element problems using a constrained nonconforming reformulation that is based on a proposed modified version of the mortar method. The well-known mortar finite element discretization method is modified to admit a local structure, providing an element-by-element or subdomain-by-subdomain assembly property. This is achieved via the introduction of additional trace finite element spaces and degrees of freedom (unknowns) associated with the interfaces between adjacent elements or subdomains. The resulting nonconforming formulation and a reduced-via-static-condensation Schur complement form on the interfaces are used in the construction of auxiliary space preconditioners for a given conforming finite element discretization problem. Overall, the properties of these preconditioners are studied and their performance is illustrated on model second order scalar elliptic problems utilizing high order elements.

97 MATHEMATICS AND COMPUTING↗

Multilevel well modeling in aggregation-based nonlinear multigrid for multiphase flow in porous media

A full approximation scheme (FAS) nonlinear multigrid solver for two-phase flow and transport problems driven by wells with multiple perforations is developed here. It is an extension to our previous work on FAS solvers for diffusion and transport problems. The solver is applicable to discrete problems defined on unstructured grids as the coarsening algorithm is aggregation-based and algebraic. To construct coarse basis that can better capture the radial flow near wells, coarse grids in which perforated well cells are not near the coarse-element interface are desired. This is achieved by an aggregation algorithm proposed in this paper that makes use of the location of well cells in the cell-connectivity graph. Numerical examples in which the FAS solver is compared against Newton's method on benchmark problems are given. In particular, for a refined version of the SAIGUP model, the FAS solver is at least 35% faster than Newton's method for time steps with a CFL number greater than 10.

58 GEOSCIENCES↗

Simplified calculation of the area specific impedance for solid-state battery design

Simplified algebraic area specific impedance (ASI) correlations have been developed for solid-state composite battery electrodes made of a single ion conducting electrolyte, conductive additive, and intercalation active material. Two ASI expressions were developed, one for short times ( i.e. , pulsed power operation) and another for the pseudo steady state operation (i.e., sustained discharge for energy estimation). A full electrochemical model based on porous electrode theory was developed to examine the accuracy of the simplified ASI expressions. The simplified expressions agree favorably with full model results over a wide range of parameters (i.e. , electrode thicknesses, electrolyte conductivities, solid-state diffusion coefficients, specific surface areas, etc.) and conditions (i.e. , C-rates, states of charge, and pulse times). Under most conditions, the error between the full model and the correlations is well below 7 %. Higher errors were observed for the pseudo steady state expression at high/ low states of charge where the assumption of uniform reaction distributions loses validity. Here, the short time ASI has higher error at low states of charge due to the nonlinearity of the open circuit voltage equation, which is assumed linear in the formulation of the simplified algebraic expression.

25 ENERGY STORAGE↗

A generalized Lyapunov theory for robust root clustering of linear state space models with real parameter uncertainty

The problem of analyzing and designing controllers for linear systems subject to real parameter uncertainty is considered. An elegant, unified theory for robust eigenvalue placement is presented for a class of D-regions defined by algebraic inequalities by extending the nominal matrix root clustering theory of Gutman and Jury (1981) to linear uncertain time systems. The author presents explicit conditions for matrix root clustering for different D-regions and establishes the relationship between the eigenvalue migration range and the parameter range. The bounds are all obtained by one-shot computation in the matrix domain and do not need any frequency sweeping or parameter gridding. The method uses the generalized Lyapunov theory for getting the bounds.

Yedavalli, R. K.↗

A simple model of a strong shock driven by a spherical or cylindrical piston

A simple model of piston-driven spherical and cylindrical shocks is suggested. The model is based on a consistent use of two factors: (a) an almost uniform pressure across the shocked layer and, (b) continuous geometrical stretching of the surface elements of the expanding piston. It turns out that for a uniform pre-shock medium the gas between the piston and the shock behaves essentially as an incompressible fluid. An algebraic equation for the shock vs piston position is obtained. Detailed evaluation of the accuracy of the proposed solution shows that its accuracy is a few percent for the adiabatic index γ = 5/3 (as in ideal plasma). A closed-form solution describing enhancement of a weak ambient magnetic field by the shock is presented. The proposed model of piston-driven shocks goes beyond the classical self-similar solutions in that it: (1) naturally covers an early, non-asymptotic dynamics and its transition to asymptotic regime; (2) allows for smooth radial density variation of an ambient gas of the form of bumps, dimples or ramps between two constant values; and (3) allows for smooth temporal variation of piston velocity of the form of bumps, dimples, or ramps. Furthermore, this simple and versatile model provides some new insights into a classical hydrodynamical problem.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Gauges, loops, and polynomials for partition functions of graphical models

Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and optimization applications. The problem is #P-hard that is of an exponential complexity with respect to the number of variables. Here, aimed at approximating the partition function, we consider multi-graph models where binary variables and multivariable factors are associated with edges and nodes, respectively, of an undirected multi-graph. We suggest a new methodology for analysis and computations that combines the Gauge function technique from Chertkov and Chernyak with the technique developed in Anari and Oveis Gharan 2017 arXiv:1702.02937; Gurvits 2011 arXiv:1106.2844; Straszak and Vishnoi 2017 55th Annual Allerton Conf. on Communication, Control, and Computing, based on the recent progress in the field of real stable polynomials. We show that the Gauge function, representing a single-out term in a finite sum expression for the partition function which achieves extremum at the so-called belief-propagation gauge, has a natural polynomial representation in terms of gauges/variables associated with edges of the multi-graph. Moreover, Gauge function can be used to recover the partition function through a sequence of transformations allowing appealing algebraic and graphical interpretations. Algebraically, one step in the sequence consists of the application of a differential operator over gauges associated with an edge. Graphically, the sequence is interpreted as a repetitive elimination/contraction of edges resulting in multi-graph models on decreasing in size (number of edges) graphs with the same partition function as in the original multi-graph model. Even though the complexity of computing factors in the sequence of the derived multi-graph models and respective Gauge functions grow exponentially with the number of eliminated edges, polynomials associated with the new factors remain bi-stable if the original factors have this property. Moreover, we show that BP estimations in the sequence do not decrease, each low-bounding the partition function.

97 MATHEMATICS AND COMPUTING↗

Narain to Narnia

We generalize the holographic correspondence between topological gravity coupled to an abelian Chern–Simons theory in three dimensions and an ensemble average of Narain’s family of massless free bosons in two dimensions, discovered by Afkhami-Jeddi et al. and by Maloney and Witten. We find that the correspondence also works for toroidal orbifolds but not for K3 or Calabi–Yau sigma-models and not always for the minimal models. Here, we conjecture that the correspondence requires that the central charge is equal to the critical central charge defined by the asymptotic density of states of the chiral algebra. For toroidal orbifolds, we extend the holographic correspondence to correlation functions of twist operators by using topological properties of rational tangles in the three-dimensional ball, which represent configurations of vortices associated to a discrete gauge symmetry.

97 MATHEMATICS AND COMPUTING↗

A one-time truncate and encode multiresolution stochastic framework

In this work a novel adaptive strategy for stochastic problems, inspired from the classical Harten's framework, is presented. The proposed algorithm allows building, in a very general manner, stochastic numerical schemes starting from a whatever type of deterministic schemes and handling a large class of problems, from unsteady to discontinuous solutions. Its formulations permits to recover the same results concerning the interpolation theory of the classical multiresolution approach, but with an extension to uncertainty quantification problems. The present strategy permits to build numerical scheme with a higher accuracy with respect to other classical uncertainty quantification techniques, but with a strong reduction of the numerical cost and memory requirements. Moreover, the flexibility of the proposed approach allows to employ any kind of probability density function, even discontinuous and time varying, without introducing further complications in the algorithm. The advantages of the present strategy are demonstrated by performing several numerical problems where different forms of uncertainty distributions are taken into account, such as discontinuous and unsteady custom-defined probability density functions. In addition to algebraic and ordinary differential equations, numerical results for the challenging 1D Kraichnan–Orszag are reported in terms of accuracy and convergence. Finally, a two degree-of-freedom aeroelastic model for a subsonic case is presented. Though quite simple, the model allows recovering some physical key aspect, on the fluid/structure interaction, thanks to the quasi-steady aerodynamic approximation employed. The injection of an uncertainty is chosen in order to obtain a complete parameterization of the mass matrix. All the numerical results are compared with respect to classical Monte Carlo solution and with a non-intrusive Polynomial Chaos method.

97 MATHEMATICS AND COMPUTING↗

Critical scaling dimension of D-module representations of N=4,7,8 superconformal algebras and constraints on superconformal mechanics

At critical values of the scaling dimension {lambda}, supermultiplets of the global N-extended one-dimensional supersymmetry algebra induce D-module representations of finite superconformal algebras (the latters being identified in terms of the global supermultiplet and its critical scaling dimension). For N=4,8 and global supermultiplets (k,N,N-k), the exceptional superalgebras D(2, 1;{alpha}) are recovered for N=4, with a relation between {alpha} and the scaling dimension given by {alpha}= (2 -k){lambda}. For N=8 and k{ne} 4 all four N=8 finite superconformal algebras are recovered, at the critical values {lambda}{sub k}=(1/k-4), with the following identifications: D(4, 1) for k= 0, 8, F(4) for k= 1, 7, A(3, 1) for k= 2, 6 and D(2, 2) for k= 3, 5. The N=7 global supermultiplet (1, 7, 7, 1) induces, at {lambda}=-(1/4), a D-module representation of the exceptional superalgebra G(3). D-module representations are applicable to the construction of superconformal mechanics in a Lagrangian setting. The isomorphism of the D(2, 1;{alpha}) algebras under an S{sub 3} group action on {alpha}, coupled with the relation between {alpha} and the scaling dimension {lambda}, induces non-trivial constraints on the admissible models of N=4 superconformal mechanics. The existence of new superconformal models is pointed out. For example, coupled (1, 4, 3) and (3, 4, 1) supermultiplets generate an N=4 superconformal mechanics if {lambda} is related to the golden ratio. The relation between classical versus quantum D-module representations is presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal renormalization of multiscale systems

While model order reduction is a promising approach in dealing with multi-scale time-dependent systems that are too large or too expensive to simulate for long times, the resulting reduced order models can suffer from instabilities. We have recently developed a time-dependent renormalization approach to stabilize such reduced models. In the current work, we extend this framework by introducing a parameter that controls the time-decay of the memory of such models and optimally selecting this parameter based on limited fully resolved simulations. First, we demonstrate our framework on the inviscid Burgers equation whose solution develops a finite-time singularity. Our renormalized reduced order models are stable and accurate for long times while using for their calibration only data from a full order simulation before the occurrence of the singularity. Furthermore, we apply this framework to the 3D Euler equations of incompressible fluid flow, where the problem of finite-time singularity formation is still open and where brute force simulation is only feasible for short times. Our approach allows us to obtain for the first time a perturbatively renormalizable model which is stable for long times and includes all the complex effects present in the 3D Euler dynamics. We find that, in each application, the renormalization coefficients display algebraic decay with increasing resolution, and that the parameter which controls the time-decay of the memory is problem-dependent.

Price, Jacob↗

An advanced joint inversion system for CO 2 storage modeling with large date sets for characterization and real-time monitoring-enhancing storage performance and reducing failure risks under uncertainties

As large-scale, commercial storage projects become operational, the problem of utilizing information from diverse sources becomes more critically important. In this project, we developed, tested, and applied an advanced joint data inversion system for CO 2 storage modeling with large data sets for use in site characterization and real-time monitoring. Emphasis was on the development of advanced and efficient computational algorithms for joint inversion of hydro-geophysical data, coupled with state-of-the-art forward process simulations. The developed system consists of (1) inversion tools using characterization data, such as 3D seismic survey (amplitude images), borehole log and core data, as well as hydraulic, tracer and thermal tests before CO 2 injection, (2) joint inversion tools for updating the geologic model with the distribution of rock properties, thus reducing uncertainty, using hydro-geophysical monitoring data, and (3) highly efficient algorithms for directly solving the dense or sparse linear algebra systems derived from the joint inversion. The system combines methods from stochastic analysis, fast linear algebra, and high performance computing. The developed joint inversion tools have been tested through synthetic CO 2 storage examples.

01 COAL, LIGNITE, AND PEAT↗

On recent advances and future research directions for computational fluid dynamics

This paper highlights some recent accomplishments regarding CFD numerical algorithm constructions for generation of discrete approximate solutions to classes of Reynolds-averaged Navier-Stokes equations. Following an overview of turbulent closure modeling, and development of appropriate conservation law systems, a Taylor weak-statement semi-discrete approximate solution algorithm is developed. Various forms for completion to the final linear algebra statement are cited, as are a range of candidate numerical linear algebra solution procedures. This development sequence emphasizes the key building blocks of a CFD RNS algorithm, including solution trial and test spaces, integration procedure and added numerical stability mechanisms. A range of numerical results are discussed focusing on key topics guiding future research directions.

Baker, A. J.↗

Beyond Generalized Eigenvalues in Lattice Quantum Field Theory

Two analysis techniques, the generalized eigenvalue method (GEM) or Prony's (or related) method (PM), are commonly used to analyze statistical estimates of correlation functions produced in lattice quantum field theory calculations. GEM takes full advantage of the matrix structure of correlation functions but only considers individual pairs of time separations when much more data exists. PM can be applied to many time separations and many individual matrix elements simultaneously but does not fully exploit the matrix structure of the correlation function. We combine both these methods into a single framework based on matrix polynomials. As these algebraic methods are well known for producing extensive spectral information about statistically-noisy data, the method should be paired with some information criteria, like the recently proposed Bayesean model averaging.

Fleming, George T.↗

SO(3)-invariance of informed-graph-based deep neural network for anisotropic elastoplastic materials

This work examines the frame-invariance (and the lack thereof) exhibited in simulated anisotropic elasto-plastic responses generated from supervised machine learning of classical multi-layer and informed-graph-based neural networks, and proposes different remedies to fix this drawback. The inherent hierarchical relations among physical quantities and state variables in an elasto-plasticity model are first represented as informed, directed graphs, where three variations of the graph are tested. While feed-forward neural networks are used to train path-independent constitutive relations (e.g., elasticity), recurrent neural networks are used to replicate responses that depends on the deformation history, i.e. or path dependent. In dealing with the objectivity deficiency, we use the spectral form to represent tensors and, subsequently, three metrics, the Euclidean distance between the Euler Angles, the distance from the identity matrix, and geodesic on the unit sphere in Lie algebra, can be employed to constitute objective functions for the supervised machine learning. In this, the aim is to minimize the measured distance between the true and the predicted 3D rotation entities. Following this, we conduct numerical experiments on how these metrics, which are theoretically equivalent, may lead to differences in the efficiency of the supervised machine learning as well as the accuracy and robustness of the resultant models. Neural network models trained with tensors represented in component form for a given Cartesian coordinate system are used as a benchmark. Our numerical tests show that, even given the same amount of information and data, the quality of the anisotropic elasto-plasticity model is highly sensitive to the way tensors are represented and measured. The results reveal that using a loss function based on geodesic on the unit sphere in Lie algebra together with an informed, directed graph yield significantly more accurate rotation prediction than the other tested approaches.

42 ENGINEERING↗

Burns space and holography

We elaborate on various aspects of our top-down celestial holographic duality wherein the semiclassical bulk spacetime is a 4d asymptotically flat, self-dual Kähler geometry known as Burns space. The bulk theory includes an open string sector comprising a 4d WZW model and a closed string sector called “Mabuchi gravity” capturing fluctuations of the Kähler potential. Starting with the type I topological B-model on the twistor space of flat space, we obtain the twistor space of Burns space from the backreaction of a stack of N coincident D1 branes, while the chiral algebra is obtained from (a twist of) the brane worldvolume theory. One striking consequence of this duality is that all loop-level scattering amplitudes of the theory on Burns space can be expressed as correlation functions of an explicit 2d chiral algebra.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Contractions of AdS brane algebra and superGalileon Lagrangians

We examine AdS Galileon Lagrangians using the method of nonlinear realization. By contractions (1) flat curvature limit, (2) non-relativistic brane algebra limit, and (3) (1) + (2) limits we obtain DBI, Newton-Hoock, and Galilean Galileons, respectively. We make clear how these Lagrangians appear as invariant 4-forms and/or pseudo-invariant Wess-Zumino (WZ) terms using Maurer-Cartan (MC) equations on the coset G/SO(3, 1). We show the equations of motion are written in terms of the MC forms only and explain why the inverse Higgs condition is obtained as the equation of motion for all cases. The supersymmetric extension is also examined using a supercoset SU(2, 2 Double-Vertical-Line 1)/(SO(3, 1) Multiplication-Sign U(1)) and five WZ forms are constructed. They are reduced to the corresponding five Galileon WZ forms in the bosonic limit and are candidates for supersymmetric Galileon action.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Control of simulation of a particle accelerator as a spatially distributed system

The work deals with the construction of strategy for finding optimal control of systems for spatially distributed systems on an example of problems in physics beams. The suggested approach is based on use of exact and approximate invariants as a controlling mechanism for control of modelling process of beam lines. The classical problem of optimal control of similar systems as an optimal control problem is formulated in a functional space. This approach is based on algebraic methods Lie and the corresponding matrix formalism that allows you to build not only the formal procedures for finding optimal solutions, but also provide the necessary constructive computational procedures.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗