SEARCH · Engineering Papers
Results for “SINGULARITY”
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.
CP decomposition for tensors via alternating least squares with QR decomposition
The CP tensor decomposition is used in applications such as machine learning and signal processing to discover latent low-rank structure in multidimensional data. Computing a CP decomposition via an alternating least squares (ALS) method reduces the problem to several linear least squares problems. The standard way to solve these linear least squares subproblems is to use the normal equations, which inherit special tensor structure that can be exploited for computational efficiency. However, the normal equations are sensitive to numerical ill-conditioning, which can compromise the results of the decomposition. In this paper, we develop versions of the CP-ALS algorithm using the QR decomposition and the singular value decomposition, which are more numerically stable than the normal equations, to solve the linear least squares problems. Our algorithms utilize the tensor structure of the CP-ALS subproblems efficiently, have the same complexity as the standard CP-ALS algorithm when the input is dense and the rank is small, and are shown via examples to produce more stable results when ill-conditioning is present. Our MATLAB implementation achieves the same running time as the standard algorithm for small ranks, and we show that the new methods can obtain lower approximation error.
Limited‐memory adaptive snapshot selection for proper orthogonal decomposition
Summary Reduced order models are useful for accelerating simulations in many‐query contexts, such as optimization, uncertainty quantification, and sensitivity analysis. However, offline training of reduced order models (ROMs) can have prohibitively expensive memory and floating‐point operation costs in high‐performance computing applications, where memory per core is limited. To overcome this limitation for proper orthogonal decomposition, we propose a novel adaptive selection method for snapshots in time that limits offline training costs by selecting snapshots according an error control mechanism similar to that found in adaptive time‐stepping ordinary differential equation solvers. The error estimator used in this work is related to theory bounding the approximation error in time of proper orthogonal decomposition‐based ROMs, and memory usage is minimized by computing the singular value decomposition using a single‐pass incremental algorithm. Results for a viscous Burgers' test problem demonstrate convergence in the limit as the algorithm error tolerances go to zero; in this limit, the full‐order model is recovered to within discretization error. A parallel version of the resulting method can be used on supercomputers to generate proper orthogonal decomposition‐based ROMs, or as a subroutine within hyperreduction algorithms that require taking snapshots in time, or within greedy algorithms for sampling parameter space. Copyright © 2016 John Wiley & Sons, Ltd.
High‐order cubature rules for tetrahedra
Summary In this paper, we construct new high‐order numerical integration schemes for tetrahedra, with positive weights and integration points that are in the interior of the domain. The construction of cubature rules is a challenging problem, which requires the solution of strongly nonlinear algebraic (moment) equations with side conditions given by affine inequality constraints. We present a robust algorithm based on a sequence of three modified Newton procedures to solve the constrained minimization problem. In the literature, numerical integration rules for the tetrahedron are available up to order p =15. We obtain integration rules for the tetrahedron from p =2 to p =20, which are computed using multiprecision arithmetic. For p ≤15, our approach provides integration rules that have the same or fewer number of integration points than existing rules; for p =16 to p =20, our rules are new. Numerical tests are presented that verify the polynomial‐precision of the cubature rules. Convergence studies are performed for the integration of exponential, rational, weakly singular and trigonometric test functions over tetrahedra with flat and curved faces. In all tests, improvements in accuracy is realized as p is increased, though in some cases nonmonotonic convergence is observed.
High‐order symmetric cubature rules for tetrahedra and pyramids
Abstract In this article, we present an algorithm to construct high‐order fully symmetric cubature rules for tetrahedral and pyramidal elements, with positive weights and integration points that are in the interior of the domain. Cubature rules are fully symmetric if they are invariant to affine transformations of the domain. We divide the integration points into symmetry orbits where each orbit contains all the points generated by the permutation stars. These relations are represented by equality constraints. The construction of symmetric cubature rules require the solution of nonlinear polynomial equations with both inequality and equality constraints. For higher orders, we use an algorithm that consists of five sequential phases to produce the cubature rules. In the literature, symmetric numerical integration rules are available for the tetrahedron for orders p = 1 – 10, 14 , and for the pyramid up to p = 10 . We have obtained fully symmetric cubature rules for both of these elements up to order p = 20 . Numerical tests are presented that verify the polynomial‐precision of the cubature rules. Convergence studies are performed for the integration of exponential, weakly singular, and trigonometric test functions over both elements with flat and curved faces. With increase in p , improvements in accuracy is realized, though nonmonotonic convergence is observed.
Numerical integration in the virtual element method with the scaled boundary cubature scheme
Abstract The virtual element method (VEM) is a stabilized Galerkin method on meshes that consist of arbitrary (convex and nonconvex) polygonal and polyhedral elements. A crucial ingredient in the implementation of low‐ and high‐order VEM is the numerical integration of monomials and nonpolynomial functions over such elements. In this article, we apply the recently proposed scaled boundary cubature (SBC) scheme to compute the weak form integrals in various virtual element formulations over polygonal and polyhedral meshes. In doing so, we demonstrate the flexibility of the approach and the accuracy that it delivers on a broad suite of boundary‐value problems in 2D and 3D over polytopes with affine faces as well as on elements with curved boundaries. In addition, the use of the SBC scheme is exemplified in an enriched Poisson formulation of the VEM in which weakly singular functions are required to be integrated. This study establishes the SBC method as a simple, accurate and efficient integration scheme for use in the VEM.
Design of a symmetry‐broken tetrahedral protein cage by a method of internal steric occlusion
Abstract Methods in protein design have made it possible to create large and complex, self‐assembling protein cages with diverse applications. These have largely been based on highly symmetric forms exemplified by the Platonic solids. Prospective applications of protein cages would be expanded by strategies for breaking the designed symmetry, for example, so that only one or a few (instead of many) copies of an exterior domain or motif might be displayed on their surfaces. Here we demonstrate a straightforward design approach for creating symmetry‐broken protein cages able to display singular copies of outward‐facing domains. We modify the subunit of an otherwise symmetric protein cage through fusion to a small inward‐facing domain, only one copy of which can be accommodated in the cage interior. Using biochemical methods and native mass spectrometry, we show that co‐expression of the original subunit and the modified subunit, which is further fused to an outward‐facing anti‐GFP DARPin domain, leads to self‐assembly of a protein cage presenting just one copy of the DARPin protein on its exterior. This strategy of designed occlusion provides a facile route for creating new types of protein cages with unique properties.
The Branes Behind Generalized Symmetry Operators
The modern approach to m-form global symmetries in a d-dimensional quantum field theory (QFT) entails specifying dimension d–m–1 topological generalized symmetry operators which non-trivially link with m-dimensional defect operators. In QFTs engineered via string constructions on a non-compact geometry X, these defects descend from branes wrapped on non-compact cycles which extend from a localized source / singularity to the boundary ∂X. The generalized symmetry operators which link with these defects arise from magnetic dual branes wrapped on cycles in ∂X. This provides a systematic way to read off various properties of such topological operators, including their worldvolume topological field theories, and the resulting fusion rules. We illustrate these general features in the context of 6D superconformal field theories, where we use the F-theory realization of these theories to read off the worldvolume theory on the generalized symmetry operators. Defects of dimension 3 which are charged under a suitable 3-form symmetry detect a non-invertible fusion rule for these operators. We also sketch how similar considerations hold for related systems.
Mapping resonant inelastic x-ray scattering onto electronic structure of iridium compounds
Resonant inelastic X-ray scattering (RIXS) is an indispensable tool that can selectively probe the electronic structure of active sites in energy conversion systems, for example, iridium oxides. However, decoding the RIXS spectra remains challenging due to its inherently complex many-body interactions. Here, we analyze Ir L 3 edge RIXS spectra of Ir, IrCl 3 , and IrO 2 , employing the joint density of states (JDOS) calculated directly from electronic band-structure calculations. The overall energy-loss features in the RIXS spectra are well reproduced by the JDOS, reaffirming the close correspondence between electron–hole excitations and RIXS spectra observed in prior studies. Intriguingly, the RIXS spectra above ∼4 eV in metallic Ir and IrO 2 follow a power-law behavior, 𝐼 RIXS ~Δ −𝑝 , where Δ is the energy loss and p is the associated power-law exponent. This is consistent with edge-singularity behavior commonly found in resonant X-ray scattering from metallic samples. Furthermore, orbital-projected JDOS enables a decomposition of the IrO 2 spectrum into specific dd transitions, providing a clear interpretation of orbital excitations and an efficient strategy for decoding RIXS spectra in iridium-based energy conversion systems.
Comparative Study of Clustering Techniques for Real-Time Dynamic Model Reduction
Dynamic model reduction in power systems is necessary for improving computational efficiency. Traditional model reduction using linearized models or offline analysis would not be adequate to capture power system dynamic behaviors, especially the new mix of intermittent generation and intelligent consumption makes the power system more dynamic and non-linear. Real time dynamic model reduction emerges as an important need. This paper explores the use of clustering techniques to analyze real-time phasor measurements to determine generator groups and representative generators for dynamic model reduction. Two clustering techniques – graph clustering and evolutionary clustering – are studied in this paper. Various implementations of these techniques are compared and also compared with a previously developed Singular Value Decomposition (SVD)-based dynamic model reduction approach. Various methods exhibit different levels of accuracy when comparing the reduced model simulation against the original model. But some of them are consistently accurate. From this comparative perspective, this paper provides a good reference point for practical implementations.
Learning compact physics‐aware delayed photocurrent models using dynamic mode decomposition
Abstract Radiation‐induced photocurrent in semiconductor devices can be simulated using complex physics‐based models, which are accurate, but computationally expensive. This presents a challenge for implementing device characteristics in high‐level circuit simulations where it is computationally infeasible to evaluate detailed models for multiple individual circuit elements. In this work we demonstrate a procedure for learning compact delayed photocurrent models that are efficient enough to implement in large‐scale circuit simulations, but remain faithful to the underlying physics. Our approach utilizes dynamic mode decomposition (DMD), a system identification technique for learning reduced‐order discrete‐time dynamical systems from time series data based on singular value decomposition. To obtain physics‐aware device models, we simulate the excess carrier density induced by radiation pulses by solving numerically the ambipolar diffusion equation, then use the simulated internal state as training data for the DMD algorithm. Our results show that the significantly reduced‐order delayed photocurrent models obtained via this method accurately approximate the dynamics of the internal excess carrier density—which can be used to calculate the induced current at the device boundaries—while remaining compact enough to incorporate into larger circuit simulations.
Randomized Algorithms for Low-Rank Matrix and Tensor Decompositions
This paper surveys randomized algorithms in numerical linear algebra for low-rank decompositions of matrices and tensors. The survey begins with a review of classical matrix algorithms that can be accelerated by randomized dimensionality reduction, such as the singular value decomposition (SVD) or interpolative (ID) and CUR decompositions. Recent advances in randomized dimensionality reduction are discussed, including new methods of fast matrix sketching and sampling techniques, which are incorporated into classical matrix algorithms for fast low-rank matrix approximations. The extension of randomized matrix algorithms to tensors is then explored for several low-rank tensor decompositions in the CP and Tucker formats, including the higher-order SVD, ID, and CUR decomposition.
On the Design, Development, and Analysis of Optimized Matrix-Vector Multiplication Routines for Coprocessors
The manycore paradigm shift, and the resulting change in modern computer architectures, has made the development of optimal numerical routines extremely challenging. In this work, we target the development of numerical algorithms and implementations for Xeon Phi coprocessor architecture designs. In particular, we examine and optimize the general and symmetric matrix-vector multiplication routines (gemv/symv), which are some of the most heavily used linear algebra kernels in many important engineering and physics applications. We describe a successful approach on how to address the challenges for this problem, starting with our algorithm design, performance analysis and programing model and moving to kernel optimization. Our goal, by targeting low-level and easy to understand fundamental kernels, is to develop new optimization strategies that can be effective elsewhere for use on manycore coprocessors, and to show significant performance improvements compared to existing state-of-the-art implementations. Therefore, in addition to the new optimization strategies, analysis, and optimal performance results, we finally present the significance of using these routines/strategies to accelerate higher-level numerical algorithms for the eigenvalue problem (EVP) and the singular value decomposition (SVD) that by themselves are foundational for many important applications.
F-theory on all toric hypersurface fibrations and its Higgs branches
We consider F-theory compactifications on genus-one fibered Calabi-Yau manifolds with their fibers realized as hypersurfaces in the toric varieties associated to the 16 reflexive 2D polyhedra. We present a base-independent analysis of the codimension one, two and three singularities of these fibrations. We use these geometric results to determine the gauge groups, matter representations, 6D matter multiplicities and 4D Yukawa couplings of the corresponding effective theories. All these theories have a non-trivial gauge group and matter content. We explore the network of Higgsings relating these theories. Such Higgsings geometrically correspond to extremal transitions induced by blow-ups in the 2D toric varieties. We recover the 6D effective theories of all 16 toric hypersurface fibrations by repeatedly Higgsing the theories that exhibit Mordell-Weil torsion. We find that the three Calabi-Yau manifolds without section, whose fibers are given by the toric hypersurfaces in $\mathbb P^{2}$, $\mathbb P^{1}$ × $\mathbb P^{1}$ and the recently studied $\mathbb P^{2}$ (1,1, 2) , yield F-theory realizations of SUGRA theories with discrete gauge groups $\mathbb Z$ 3 , $\mathbb Z$ 2 and $\mathbb Z$ 4 .This opens up a whole new arena for model building with discrete global symmetries in F-theory. In these three manifolds, we also find codimension two I 2 -fibers supporting matter charged only under these discrete gauge groups. Their 6D matter multiplicities are computed employing ideal techniques and the associated Jacobian fibrations. Here, we also show that the Jacobian of the biquadric fibration has one rational section, yielding one U(1)-gauge field in F-theory. Furthermore, the elliptically fibered Calabi-Yau manifold based on dP 1 has a U(1)-gauge field induced by a non-toric rational section. In this model, we find the first F-theory realization of matter with U(1)-charge q = 3.
Typical event horizons in AdS/CFT
We consider the construction of local bulk operators in a black hole background dual to a pure state in conformal field theory. The properties of these operators in a microcanonical ensemble are studied. It has been argued in the literature that typical states in such an ensemble contain firewalls, or otherwise singular horizons. Here, we argue this conclusion can be avoided with a proper definition of the interior operators.
4D scattering amplitudes and asymptotic symmetries from 2D CFT
We reformulate the scattering amplitudes of 4D at space gauge theory and gravity in the language of a 2D CFT on the celestial sphere. The resulting CFT structure exhibits an OPE constructed from 4D collinear singularities, as well as infinite-dimensional Kac-Moody and Virasoro algebras encoding the asymptotic symmetries of 4D at space. We derive these results by recasting 4D dynamics in terms of a convenient foliation of flat space into 3D Euclidean AdS and Lorentzian dS geometries. Tree-level scattering amplitudes take the form of Witten diagrams for a continuum of (A)dS modes, which are in turn equivalent to CFT correlators via the (A)dS/CFT dictionary. The Ward identities for the 2D conserved currents are dual to 4D soft theorems, while the bulk-boundary propagators of massless (A)dS modes are superpositions of the leading and subleading Weinberg soft factors of gauge theory and gravity. In general, the massless (A)dS modes are 3D Chern-Simons gauge fields describing the soft, single helicity sectors of 4D gauge theory and gravity. Consistent with the topological nature of Chern-Simons theory, Aharonov-Bohm effects record the \tracks" of hard particles in the soft radiation, leading to a simple characterization of gauge and gravitational memories. Soft particle exchanges between hard processes define the Kac-Moody level and Virasoro central charge, which are thereby related to the 4D gauge coupling and gravitational strength in units of an infrared cutoff. Lastly, we discuss a toy model for black hole horizons via a restriction to the Rindler region.
Elliptic Feynman integrals and pure functions
We propose a variant of elliptic multiple polylogarithms that have at most logarithmic singularities in all variables and satisfy a differential equation without homogeneous term. We investigate several non-trivial elliptic two-loop Feynman integrals with up to three external legs and express them in terms of our functions. Here, we observe that in all cases they evaluate to pure combinations of elliptic multiple polylogarithms of uniform weight. This is the first time that a notion of uniform weight is observed in the context of Feynman integrals that evaluate to elliptic polylogarithms.
Real time quantum gravity dynamics from classical statistical Yang-Mills simulations
We perform microcanonical classical statistical lattice simulations of SU(N) Yang-Mills theory with eight scalars on a circle. Measuring the eigenvalue distribution of the spatial Wilson loop we find two distinct phases depending on the total energy and circle radius, which we tentatively interpret as corresponding to black hole and black string phases in a dual gravity picture. We proceed to study quenches by first preparing the system in one phase, rapidly changing the total energy, and monitoring the real-time system response. We observe that the system relaxes to the equilibrium phase corresponding to the new energy, in the process exhibiting characteristic damped oscillations. We interpret this as the topology change from black hole to black string configurations, with damped oscillations corresponding to quasi-normal mode ringing of the black hole/black string final state. This would suggest that α′ corrections alone can resolve the singularity associated with the topology change. We extract the real and imaginary part of the lowest-lying presumptive quasinormal mode as a function of energy and N.