Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Partially explicit”

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 19 records

Simple inhomogeneous cosmological (toy) models

Based on the Lemaître-Tolman-Bondi (LTB) metric we consider two flat inhomogeneous big-bang models. We aim at clarifying, as far as possible analytically, basic features of the dynamics of the simplest inhomogeneous models and to point out the potential usefulness of exact inhomogeneous solutions as generalizations of the homogeneous configurations of the cosmological standard model. We discuss explicitly partial successes but also potential pitfalls of these simplest models. Although primarily seen as toy models, the relevant free parameters are fixed by best-fit values using the Joint Light-curve Analysis (JLA)-sample data. On the basis of a likelihood analysis we find that a local hump with an extension of almost 2 Gpc provides a better description of the observations than a local void for which we obtain a best-fit scale of about 30 Mpc. Future redshift-drift measurements are discussed as a promising tool to discriminate between inhomogeneous configurations and the ΛCDM model.

79 ASTRONOMY AND ASTROPHYSICS↗

Chiral symmetry, the angular content of the vector current in QED and QCD, and the holographic description of hadrons

We perform a general chiral symmetry and unitarity based analysis of a local process of the fermion-antifermion creation from the vacuum by a high-energy photon as well as an explicit partial wave analysis of the vector current in QED and QCD. Such a local process proceeds necessarily via a certain superposition of the S- and D-wave contributions. These constraints are consistent with the well-known theoretical and experimental results on e{sup +}e{sup -}{yields}{gamma}{yields}{mu}{sup +}{mu}{sup -}. Then a free quark loop in the 1{sup --} channel, representing the leading term in the operator product expansion, contains both S-wave and D-wave contributions. This fact rules out the possibility that there is only one radial trajectory for the {rho}-mesons with the fixed S-wave content. It also implies that all holographic models that assume a pure S-wave content of the {rho}-meson have to fail to satisfy the matching conditions at the ultraviolet border z=0.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

ASC CSSE Level 2 Milestone #6362: Resilient Asynchronous Many Task Programming Model

This report is an outcome of the ASC CSSE Level 2 Milestone 6362: Analysis of Re- silient Asynchronous Many-Task (AMT) Programming Model. It comprises a summary and in-depth analysis of resilience schemes adapted to the AMT programming model. Herein, performance trade-offs of a resilient-AMT prograrnming model are assessed through two ap- proaches: (1) an analytical model realized by discrete event simulations and (2) empirical evaluation of benchmark programs representing regular and irregular workloads of explicit partial differential equation solvers. As part of this effort, an AMT execution simulator and a prototype resilient-AMT programming framework have been developed. The former permits us to hypothesize the performance behavior of a resilient-AMT model, and has undergone a verification and validation (V&V) process. The latter allows empirical evaluation of the perfor- mance of resilience schemes under emulated program failures and enabled the aforementioned V&V process. The outcome indicates that (1) resilience techniques implemented within an AMT framework allow efficient and scalable recovery under frequent failures, that (2) the abstraction of task and data instances in the AMT programming model enables readily us- able Application Program Interfaces (APIs) for resilience, and that (3) this abstraction enables predicting the performance of resilient-AMT applications with a simple simulation infrastruc- ture. This outcome will provide guidance for the design of the AMT programming model and runtime systems, user-level resilience support, and application development for ASC's next generation platforms (NGPs).

97 MATHEMATICS AND COMPUTING↗

Probabilistic Structures Analysis Methods (PSAM) for select space propulsion system components

The basic formulation for probabilistic finite element analysis is described and demonstrated on a few sample problems. This formulation is based on iterative perturbation that uses the factorized stiffness on the unperturbed system as the iteration preconditioner for obtaining the solution to the perturbed problem. This approach eliminates the need to compute, store and manipulate explicit partial derivatives of the element matrices and force vector, which not only reduces memory usage considerably, but also greatly simplifies the coding and validation tasks. All aspects for the proposed formulation were combined in a demonstration problem using a simplified model of a curved turbine blade discretized with 48 shell elements, and having random pressure and temperature fields with partial correlation, random uniform thickness, and random stiffness at the root.

Source record↗

Explicit finite difference predictor and convex corrector with applications to hyperbolic partial differential equations

An explicit finite difference scheme consisting of a predictor and a corrector has been developed and applied to solve some hyperbolic partial differential equations (PDEs). The corrector is a convex-type function which is applied at each time level and at each mesh point. It consists of a parameter which may be estimated such that for larger time steps the algorithm should remain stable and generate a fast speed of convergence to the steady-state solution. Some examples have been given.

Dey, C.↗

Efficient hybrid explicit-implicit learning for multiscale problems

Splitting method is a powerful method to handle application problems by splitting physics, scales, domain, and so on. Many splitting algorithms have been designed for efficient temporal discretization. Here, in this paper, our goal is to use temporal splitting concepts in designing machine learning algorithms and, at the same time, help splitting algorithms by incorporating data and speeding them up. We propose a machine learning assisted splitting scheme which improves the efficiency of the scheme meanwhile preserves the accuracy. We consider a recently introduced multiscale splitting algorithms, where the multiscale problem is solved on a coarse grid. To approximate the dynamics, only a few degrees of freedom are solved implicitly, while others explicitly. This splitting concept allows identifying degrees of freedom that need implicit treatment. In this paper, we use this splitting concept in machine learning and propose several strategies. First, the implicit part of the solution can be learned as it is more difficult to solve, while the explicit part can be computed. This provides a speed-up and data incorporation for splitting approaches. Secondly, one can design a hybrid neural network architecture because handling explicit parts requires much fewer communications among neurons and can be done efficiently. Thirdly, one can solve the coarse grid component via PDEs or other approximation methods and construct simpler neural networks for the explicit part of the solutions. We discuss these options and implement one of them by interpreting it as a machine translation task. This interpretation of the splitting scheme successfully enables us using the Transformer since it can perform model reduction for multiple time series and learn the connection between them. We also find that the splitting scheme is a great platform to predict the coarse solution with insufficient information of the target model: the target problem is partially given and we need to solve it through a known problem which approximates the target. Our machine learning model can incorporate and encode the given information from two different problems and then solve the target problems. We conduct four numerical examples and the results show that our method is stable and accurate.

97 MATHEMATICS AND COMPUTING↗

Learning functional priors and posteriors from data and physics

In this work, we develop a new Bayesian framework based on deep neural networks to be able to extrapolate in space-time using historical data and to quantify uncertainties arising from both noisy and gappy data in physical problems. Specifically, the proposed approach has two stages: (1) prior learning and (2) posterior estimation. At the first stage, we employ the physics-informed Generative Adversarial Networks (PI-GAN) to learn a functional prior either from a prescribed function distribution, e.g., Gaussian process, or from historical data and physics. At the second stage, we employ the Hamiltonian Monte Carlo (HMC) method to estimate the posterior in the latent space of PI-GANs. In addition, we use two different approaches to encode the physics: (1) automatic differentiation, used in the physicsinformed neural networks (PINNs) for scenarios with explicitly known partial differential equations (PDEs), and (2) operator regression using the deep operator network (DeepONet) for PDE-agnostic scenarios. We then test the proposed method for (1) meta-learning for one-dimensional regression, and forward/inverse PDE problems (combined with PINNs); (2) PDE-agnostic physical problems (combined with DeepONet), e.g., fractional diffusion as well as saturated stochastic (100-dimensional) flows in heterogeneous porous media; and (3) spatial-temporal regression problems, i.e., inference of a marine riser displacement field using experimental data from the Norwegian Deepwater Programme (NDP). The results demonstrate that the proposed approach can provide accurate predictions as well as uncertainty quantification given very limited scattered and noisy data, since historical data could be available to provide informative priors. In summary, the proposed method is capable of learning flexible functional priors, e.g., both Gaussian and non-Gaussian process, and can be readily extended to big data problems by enabling mini-batch training using stochastic HMC or normalizing flows since the latent space is generally characterized as low dimensional.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Learning Physically Interpretable Atmospheric Models From Data With WSINDy

The multiscale and turbulent nature of Earth's atmosphere has historically rendered accurate weather modeling a hard problem. Recently, there has been an explosion of interest surrounding data-driven approaches to weather modeling, which in many cases show improved forecasting accuracy and computational efficiency when compared to traditional methods. However, many of the current data-driven approaches employ highly parameterized neural networks, often resulting in uninterpretable models and limited gains in scientific understanding. In this work, we address the interpretability problem by explicitly discovering partial differential equations governing atmospheric phenomena, identifying symbolic mathematical models with direct physical interpretations. The purpose of this paper is to demonstrate that, in particular, the weak-form sparse identification of nonlinear dynamics (WSINDy) algorithm can learn effective atmospheric models from both simulated and assimilated data. Our approach adapts the standard WSINDy algorithm to work with high-dimensional fluid data of arbitrary spatial dimension.

58 GEOSCIENCES↗

Quantization of the Jackiw-Teitelboim model

We study the phase space structure of the Jackiw-Teitelboim model in its connection variables formulation where the gauge group of the field theory is given by local SL(2,R)[or SU(2) for the Euclidean model], i.e. the de Sitter group in two dimensions. In order to make the connection with two-dimensional gravity explicit, a partial gauge fixing of the de Sitter symmetry can be introduced that reduces it to space-time diffeomorphisms. This can be done in different ways. Having no local physical degrees of freedom, the reduced phase space of the model is finite dimensional. The simplicity of this gauge field theory allows for studying different avenues for quantization, which may use various (partial) gauge fixings. We show that reduction and quantization are noncommuting operations: the representation of basic variables as operators in a Hilbert space depends on the order chosen for the latter. Moreover, a representation that is natural in one case may not even be available in the other leading to inequivalent quantum theories.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Explicit Integration of Extremely Stiff Reaction Networks: Partial Equilibrium Methods

In two preceding papers [1,2] we have shown that, when reaction networks are well removed from equilibrium, explicit asymptotic and quasi-steady-state approximations can give algebraically stabilized integration schemes that rival standard implicit methods in accuracy and speed for extremely stiff systems. However, we also showed that these explicit methods remain accurate but are no longer competitive in speed as the network approaches equilibrium. In this paper we analyze this failure and show that it is associated with the presence of fast equilibration timescales that neither asymptotic nor quasi-steady-state approximations are able to remove efficiently from the numerical integration. Based on this understanding, we develop a partial equilibrium method to deal effectively with the new partial equilibrium methods, give an integration scheme that plausibly can deal with the stiffest networks, even in the approach to equilibrium, with accuracy and speed competitive with that of implicit methods. Thus we demonstrate that algebraically stabilized explicit methods may offer alternatives to implicit integration of even extremely stiff systems, and that these methods may permit integration of much larger networks than have been feasible previously in a variety of fields.

Guidry, Mike W↗

Higher order accurate partial implicitization: An unconditionally stable fourth-order-accurate explicit numerical technique

The previously obtained second-order-accurate partial implicitization numerical technique used in the solution of fluid dynamic problems was modified with little complication to achieve fourth-order accuracy. The Von Neumann stability analysis demonstrated the unconditional linear stability of the technique. The order of the truncation error was deduced from the Taylor series expansions of the linearized difference equations and was verified by numerical solutions to Burger's equation. For comparison, results were also obtained for Burger's equation using a second-order-accurate partial-implicitization scheme, as well as the fourth-order scheme of Kreiss.

Graves, R. A., Jr.↗

Relativistic partial waves for celestial amplitudes

The formalism of relativistic partial wave expansion is developed for four-point celestial amplitudes of massless external particles. In particular, relativistic partial waves are found as eigenfunctions to the product representation of celestial Poincaré Casimir operators with appropriate eigenvalues. The requirement of hermiticity of Casimir operators is used to fix the corresponding integral inner product, and orthogonality of the obtained relativistic partial waves is verified explicitly. The completeness relation, as well as the relativistic partial wave expansion follow. Example celestial amplitudes of scalars, gluons, gravitons and open superstring gluons are expanded on the basis of relativistic partial waves for demonstration. A connection with the formulation of relativistic partial waves in the bulk of Minkowski space is made in appendices.

79 ASTRONOMY AND ASTROPHYSICS↗

Progressive wave equations and algorithms for sonic boom propagation

Raspet, Bass, and others have carried out a number of studies of sonic boom propagation using algorithms that can be traced back to a 1973 doctoral thesis written by Pestorius at the University of Texas. The algorithm was originally set forth without a formal derivation from a governing set of partial differential equations. Perusal of Pestorius's report and of subsequent reports from the Texas nonlinear accoustics group suggests that such a derivation has not yet appeared in the archival literature. The author and his colleagues, on the other hand, have been working with an explicit set of approximate partial differential equations analogous to Burgers' equation. The present paper traces through the pertinent statements in the Pestorius reports and shows that the derived algorithm, at least in the limit of sufficiently short steps, is equivalent to the numerical solution of a similar (and nearly equivalent) explicit set of partial differential equations. The tying-together of the two approaches is important because it is possible that some of the basic ideas embodied in the Pestorius algorithm may be incorporated in other contexts where more nearly general models of sonic boom propagation through realistic atmospheres are to be solved numerically.

Pierce, Allan D.↗

The angular dependence of partially redistributed resonance radiation

Explicit expressions for the angular distribution and frequency dependence of radiation scattered by a spatially degenerate atom undergoing collisions are derived using a previously developed formalism of the quantum theory of line broadening for an atom in its rest frame. Results valid in the impact regime for resonant scattering are presented for the cases of linear incident and scattered polarization circular incident and linear scattered polarization, and unpolarized incident radiation with no monitoring of the scattered polarization. These results relate to scattering involving a j - j + or - 1 - j atomic transition, with lower-state interactions neglected; the expressions obtained take a relatively simple form involving atomic multipolar relaxation rates of the order of k = 0 and k = 2. The angular distributions for each case are combined with the frequency dependences to yield a three-component frequency redistribution function for an s-p-s transition, the components being a coherent term, a frequency-redistributed term with the same angular dependence as the coherent term, and an isotropic frequency-redistributed term.

Ballagh, R. J.↗

Location of quantum information in additive graph codes

The location of quantum information in various subsets of the qudit carriers of an additive graph code is discussed using a collection of operators on the coding space which form what we call the information group. It represents the input information through an encoding operation constructed as an explicit quantum circuit. Partial traces of these operators down to a particular subset of carriers provide an isomorphism of a subgroup of the information group, and this gives a precise characterization of what kinds of information they contain. All carriers are assumed to have the same dimension D, an arbitrary integer greater than 1.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A robust real-time surface reconstruction method on point clouds captured from a 3D surface photogrammetry system

Purpose: To develop a robust and real-time surface reconstruction method on point clouds captured from a 3D surface photogrammetry system. Methods: The authors have developed a robust and fast surface reconstruction method on point clouds acquired by the photogrammetry system, without explicitly solving the partial differential equation required by a typical variational approach. Taking advantage of the overcomplete nature of the acquired point clouds, their method solves and propagates a sparse linear relationship from the point cloud manifold to the surface manifold, assuming both manifolds share similar local geometry. With relatively consistent point cloud acquisitions, the authors propose a sparse regression (SR) model to directly approximate the target point cloud as a sparse linear combination from the training set, assuming that the point correspondences built by the iterative closest point (ICP) is reasonably accurate and have residual errors following a Gaussian distribution. To accommodate changing noise levels and/or presence of inconsistent occlusions during the acquisition, the authors further propose a modified sparse regression (MSR) model to model the potentially large and sparse error built by ICP with a Laplacian prior. The authors evaluated the proposed method on both clinical point clouds acquired under consistent acquisition conditions and on point clouds with inconsistent occlusions. The authors quantitatively evaluated the reconstruction performance with respect to root-mean-squared-error, by comparing its reconstruction results against that from the variational method. Results: On clinical point clouds, both the SR and MSR models have achieved sub-millimeter reconstruction accuracy and reduced the reconstruction time by two orders of magnitude to a subsecond reconstruction time. On point clouds with inconsistent occlusions, the MSR model has demonstrated its advantage in achieving consistent and robust performance despite the introduced occlusions. Conclusions: The authors have developed a fast and robust surface reconstruction method on point clouds captured from a 3D surface photogrammetry system, with demonstrated sub-millimeter reconstruction accuracy and subsecond reconstruction time. It is suitable for real-time motion tracking in radiotherapy, with clear surface structures for better quantifications.

60 APPLIED LIFE SCIENCES↗

Optical systolic solutions of linear algebraic equations

The philosophy and data encoding possible in systolic array optical processor (SAOP) were reviewed. The multitude of linear algebraic operations achievable on this architecture is examined. These operations include such linear algebraic algorithms as: matrix-decomposition, direct and indirect solutions, implicit and explicit methods for partial differential equations, eigenvalue and eigenvector calculations, and singular value decomposition. This architecture can be utilized to realize general techniques for solving matrix linear and nonlinear algebraic equations, least mean square error solutions, FIR filters, and nested-loop algorithms for control engineering applications. The data flow and pipelining of operations, design of parallel algorithms and flexible architectures, application of these architectures to computationally intensive physical problems, error source modeling of optical processors, and matching of the computational needs of practical engineering problems to the capabilities of optical processors are emphasized.

Neuman, C. P.↗

Vectorized schemes for conical potential flow using the artificial density method

A method is developed to determine solutions to the full-potential equation for steady supersonic conical flow using the artificial density method. Various update schemes used generally for transonic potential solutions are investigated. The schemes are compared for speed and robustness. All versions of the computer code have been vectorized and are currently running on the CYBER-203 computer. The update schemes are vectorized, where possible, either fully (explicit schemes) or partially (implicit schemes). Since each version of the code differs only by the update scheme and elements other than the update scheme are completely vectorizable, comparisons of computational effort and convergence rate among schemes are a measure of the specific scheme's performance. Results are presented for circular and elliptical cones at angle of attack for subcritical and supercritical crossflows.

Bradley, P. F.↗