Search NASA⌕ Search

SEARCH · Search NASA

Results for “Algebraic 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.

At least 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Landau Singularities Revisited: Computational Algebraic Geometry for Feynman Integrals

We reformulate the analysis of singularities of Feynman integrals in a way that can be practically applied to perturbative computations in the standard model in dimensional regularization. After highlighting issues in the textbook treatment of Landau singularities, we develop an algorithm for classifying and computing them using techniques from computational algebraic geometry. We introduce an algebraic variety called the principal Landau determinant, which captures the singularities even in the presence of massless particles or UV/IR divergences. We illustrate this for 114 example diagrams, including a cutting-edge 2-loop 5-point nonplanar QCD process with multiple mass scales. Published by the American Physical Society 2024

Physics↗
NASA NTRS1989

An interpretation and solution of ill-conditioned linear equations

Data insufficiency, poorly conditioned matrices and singularities in equations occur regularly in complex optimization, correlation, and interdisciplinary model studies. This work concerns itself with two methods of obtaining certain physically realistic solutions to ill-conditioned or singular algebraic systems of linear equations arising from such studies. Two efficient computational solution procedures that generally lead to locally unique solutions are presented when there is insufficient data to completely define the model, or a least-squares error formulation of this system results in an ill-conditioned system of equations. If it is assumed that a reasonable estimate of the uncertain data is available in both cases cited above, then we shall show how to obtain realistic solutions efficiently, in spite of the insufficiency of independent data. The proposed methods of solution are more efficient than singular-value decomposition for dealing with such systems, since they do not require solutions for all the non-zero eigenvalues of the coefficient matrix.

Ojalvo, I. U.↗
NASA NTRS1983

Algebraic grid generation with corner singularities

A simple noniterative algebraic procedure is presented for generating smooth computational meshes on a quadrilateral topology. Coordinate distribution and normal derivative are provided on all boundaries, one of which may include a slope discontinuity. The boundary conditions are sufficient to guarantee continuity of global meshes formed of joined patches generated by the procedure. The method extends to 3-D. The procedure involves a synthesis of prior techniques stretching functions, cubic blending functions, and transfinite interpolation - to which is added the functional form of the corner solution. The procedure introduces the concept of generalized blending, which is implemented as an automatic scaling of the boundary derivatives for effective interpolation. Some implications of the treatment at boundaries for techniques solving elliptic PDE's are discussed in an Appendix.

Vinokur, M.↗
DOE OSTI2024

Finite-size effects in periodic coupled cluster calculations

Here, we provide the first rigorous study of the finite-size error in the simplest and representative coupled cluster theory, namely the coupled cluster doubles (CCD) theory, for gapped periodic systems. Given exact Hartree-Fock orbitals and their corresponding orbital energies, we demonstrate that the correlation energy obtained from the approximate CCD method, after a finite number of fixed-point iterations over the amplitude equation, exhibits a finite-size error scaling as $\mathcal{O}(N^{-\frac{1}{3}}_k)$. Here $N_k$ is the number of discretization points in the Brillouin zone and characterizes the system size. Under additional assumptions ensuring the convergence of the fixed-point iterations, we demonstrate that the CCD correlation energy also exhibits a finite-size error scaling as $\mathcal{O}(N^{-\frac{1}{3}}_k)$. Our analysis shows that the dominant error lies in the coupled cluster amplitude calculation, and the convergence of the finite-size error in energy calculation can be boosted to $\mathcal{O}(N^{-1}_k)$ with accurate amplitudes. This also provides the first proof of the scaling of the finite-size error in the third order Møller-Plesset perturbation theory (MP3) for periodic systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Explicit Quantum Circuits for Block Encodings of Certain Sparse Matrices

Many standard linear algebra problems can be solved on a quantum computer by using recently developed quantum linear algebra algorithms that make use of block encodings and quantum eigenvalue/singular value transformations. A block encoding embeds a properly scaled matrix of interest A in a larger unitary transformation U that can be decomposed into a product of simpler unitaries and implemented efficiently on a quantum computer. Although quantum algorithms can potentially achieve exponential speedup in solving linear algebra problems compared to the best classical algorithm, such a gain in efficiency ultimately hinges on our ability to construct an efficient quantum circuit for the block encoding of A, which is difficult in general, and not trivial even for well structured sparse matrices. Here, in this paper, we give a few examples on how efficient quantum circuits can be explicitly constructed for some well structured sparse matrices and discuss a few strategies used in these constructions. We also provide implementations of these quantum circuits in MATLAB.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1993

On nonlinear Tollmien-Schlichting/vortex interaction in three-dimensional boundary layers

The instability of an incompressible three-dimensional boundary layer (that is, one with cross-flow) is considered theoretically and computationally in the context of vortex/wave interactions. Specifically the work centers on two low amplitude, lower-branch Tollmien-Schlichting waves which mutually interact to induce a weak longitudinal vortex flow; the vortex motion, in turn, gives rise to significant wave-modulation via wall-shear forcing. The characteristic Reynolds number is taken as a large parameter and, as a consequence, the waves' and the vortex motion are governed primarily by triple-deck theory. The nonlinear interaction is captured by a viscous partial-differential system for the vortex coupled with a pair of amplitude equations for each wave pressure. Three distinct possibilities were found to emerge for the nonlinear behavior of the flow solution downstream - an algebraic finite-distance singularity, far downstream saturation or far-downstream wave-decay (leaving pure vortex flow) - depending on the input conditions, the wave angles, and the size of the cross-flow.

Davis, Dominic A. R.↗
NASA NTRS1994

Influence of cross-flow on nonlinear Tollmien-Schlichting/vortex interaction

The transition of an incompressible three-dimensional boundary layer with strong cross-flow is considered theoretically and computationally in the context of vortex/wave interactions. Specifically the work centers on two lower-branch Tollmien-Schlichting waves which mutually interact nonlinearly to induce a longitudinal vortex flow. The vortex motion in turn gives rise to significant wave modulation via wall-shear forcing. The characteristic Reynolds number is large and, as a consequence, the waves' and the vortex motion are governed primarily by triple deck theory. The nonlinear interaction is captured by a viscous partial-differential system for the vortex coupled with a pair of amplitude equations for each wave pressure. Following analysis and computation over a wide range of parameters, three distinct responses are found to emerge in the nonlinear behavior of the flow solution downstream: an algebraic finite-distance singularity, far-downstream saturation or far-downstream wave decay leaving pure vortex flow. These depend on the input conditions, the wave angles and the size of the cross flow.

Davis, D. A. R.↗
NASA NTRS1993

Linear, multivariable robust control with a mu perspective

The structured singular value is a linear algebra tool developed to study a particular class of matrix perturbation problems arising in robust feedback control of multivariable systems. These perturbations are called linear fractional, and are a natural way to model many types of uncertainty in linear systems, including state-space parameter uncertainty, multiplicative and additive unmodeled dynamics uncertainty, and coprime factor and gap metric uncertainty. The structured singular value theory provides a natural extension of classical SISO robustness measures and concepts to MIMO systems. The structured singular value analysis, coupled with approximate synthesis methods, make it possible to study the tradeoff between performance and uncertainty that occurs in all feedback systems. In MIMO systems, the complexity of the spatial interactions in the loop gains make it difficult to heuristically quantify the tradeoffs that must occur. This paper examines the role played by the structured singular value (and its computable bounds) in answering these questions, as well as its role in the general robust, multivariable control analysis and design problem.

Packard, Andy↗
DOE OSTI2022

Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning

We present an algorithmic framework for quantum-inspired classical algorithms on close-to-low-rank matrices, generalizing the series of results started by Tang’s breakthrough quantum-inspired algorithm for recommendation systems [STOC’19]. Motivated by quantum linear algebra algorithms and the quantum singular value transformation (SVT) framework of Gilyén et al. [STOC’19], we develop classical algorithms for SVT that run in time independent of input dimension, under suitable quantum-inspired sampling assumptions. Our results give compelling evidence that in the corresponding QRAM data structure input model, quantum SVT does not yield exponential quantum speedups. Since the quantum SVT framework generalizes essentially all known techniques for quantum linear algebra, our results, combined with sampling lemmas from previous work, suffice to generalize all prior results about dequantizing quantum machine learning algorithms. In particular, our classical SVT framework recovers and often improves the dequantization results on recommendation systems, principal component analysis, supervised clustering, support vector machines, low-rank regression, and semidefinite program solving. We also give additional dequantization results on low-rank Hamiltonian simulation and discriminant analysis. Our improvements come from identifying the key feature of the quantum-inspired input model that is at the core of all prior quantum-inspired results: ℓ 2 -norm sampling can approximate matrix products in time independent of their dimension. We reduce all our main results to this fact, making our exposition concise, self-contained, and intuitive.

Computer Science↗
NASA NTRS2003

Flutter and Divergence Analysis using the Generalized Aeroelastic Analysis Method

The Generalized Aeroelastic Analysis Method (GAAM) is applied to the analysis of three well-studied checkcases: restrained and unrestrained airfoil models, and a wing model. An eigenvalue iteration procedure is used for converging upon roots of the complex stability matrix. For the airfoil models, exact root loci are given which clearly illustrate the nature of the flutter and divergence instabilities. The singularities involved are enumerated, including an additional pole at the origin for the unrestrained airfoil case and the emergence of an additional pole on the positive real axis at the divergence speed for the restrained airfoil case. Inconsistencies and differences among published aeroelastic root loci and the new, exact results are discussed and resolved. The generalization of a Doublet Lattice Method computer code is described and the code is applied to the calculation of root loci for the wing model for incompressible and for subsonic flow conditions. The error introduced in the reduction of the singular integral equation underlying the unsteady lifting surface theory to a linear algebraic equation is discussed. Acknowledging this inherent error, the solutions of the algebraic equation by GAAM are termed 'exact.' The singularities of the problem are discussed and exponential series approximations used in the evaluation of the kernel function shown to introduce a dense collection of poles and zeroes on the negative real axis. Again, inconsistencies and differences among published aeroelastic root loci and the new 'exact' results are discussed and resolved. In all cases, aeroelastic flutter and divergence speeds and frequencies are in good agreement with published results. The GAAM solution procedure allows complete control over Mach number, velocity, density, and complex frequency. Thus all points on the computed root loci can be matched-point, consistent solutions without recourse to complex mode tracking logic or dataset interpolation, as in the k and p-k solution methods.

Edwards, John W.↗
DOE OSTI2025

Evaluation of data driven low-rank matrix factorization for accelerated solutions of the Vlasov equation

Low-rank methods have shown success in accelerating simulations of a collisionless plasma described by the Vlasov equation, but still rely on computationally costly linear algebra every time step. We propose a data-driven factorization method using artificial neural networks, specifically with convolutional layer architecture, that trains on existing simulation data. At inference time, the model outputs a low-rank decomposition of the distribution field of the charged particles, and we demonstrate that this step is faster than the standard linear algebra technique. Numerical experiments show that the method achieves comparable reconstruction accuracy for interpolation tasks, generalizing to unseen test data in a manner beyond just memorizing training data; patterns in factorization also inherently followed the same numerical trend as those within algebraic methods (e.g., truncated singular-value decomposition). However, when training on the first 70% of a time-series data and testing on the remaining 30%, the method fails to meaningfully extrapolate. Despite this limiting result, the technique may have benefits for simulations in a statistical steady-state or otherwise showing temporal stability. These results suggest that while the model offers a computationally efficient alternative for datasets with temporal stability, its current formulation is best suited for interpolation rather than for predicting future states in time-evolving systems. This study thus lays the groundwork for further refinement of neural network-based approaches to low-rank matrix factorization in high-dimensional plasma simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Using computational singular perturbation as a diagnostic tool in ODE and DAE systems: a case study in heterogeneous catalysis

We have extended the computational singular perturbation (CSP) method to differential algebraic equation (DAE) systems and demonstrated its application in a heterogeneous-catalysis problem. The extended method obtains the CSP basis vectors for DAEs from a reduced Jacobian matrix that takes the algebraic constraints into account. Here we use a canonical problem in heterogeneous catalysis, the transient continuous stirred tank reactor (T-CSTR), for illustration. The T-CSTR problem is modelled fundamentally as an ordinary differential equation (ODE) system, but it can be transformed to a DAE system if one approximates typically fast surface processes using algebraic constraints for the surface species. We demonstrate the application of CSP analysis for both ODE and DAE constructions of a T-CSTR problem, illustrating the dynamical response of the system in each case. We also highlight the utility of the analysis in commenting on the quality of any particular DAE approximation built using the quasi-steady state approximation (QSSA), relative to the ODE reference case.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Equilibrium field theory of magnetic monopoles in degenerate square spin ice: Correlations, entropic interactions, and charge screening regimes

In this work, we describe degenerate square spin as an ensemble of magnetic monopoles coupled via an emergent entropic field that subsumes the effect of the underlying spin vacuum. We compute their effective free energy, entropic interaction, correlations, screening, and structure factor, and find that they coincide with the experimental ones. Unlike in pyrochlore ices, a dimensional mismatch between real and entropic interactions leads to weak singularities at the pinch points and algebraic correlations at long distances. This algebraic screening can be, however, camouflaged by a pseudoscreening regime.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
NASA NTRS1989

A survey on the structured singular value

The structured singular value, U, is an important linear algebra tool to study a class of matrix perturbation problems. It is useful for analyzing the robustness of stability and performance of uncertain, (nominally) linear systems. Computation of (M) is difficult, and usually, upper and lower bounds are all that can be reliably computed. Upper bounds give conservative estimates of the sizes of allowable perturbations. The maximum singular value of a matrix M is an upper bound for (M). As an upper bound, it can be improved by finding a transformations to the data (i.e. M) which do not change the structured singular value, but do reduce the maximum singular value. Typically, upper bound algorithms involve searches over sets of transformations to yield the tightest bound. Lower bound algorithms are intelligent searches for minimum-norm solutions to multivariable polynomial equations, and are based on various optimality conditions that hold at the global (and, unfortunately, some local) minima. The current methods to compute both of these types of bounds are reviewed. Theoretical justification and extensive numerical experience with the various algorithms are covered.

Packard, Andy↗
NASA NTRS1984

Opening of an interface flaw in a layered elastic half-plane under compressive loading

A static analysis is given of the problem of an elastic layer perfectly bonded, except for a frictionless interface crack, to a dissimilar elastic half-plane. The free surface of the layer is loaded by a finite pressure distribution directly over the crack. The problem is formulated using the two dimensional linear elasticity equations. Using Fourier transforms, the governing equations are converted to a pair of coupled singular integral equations. The integral equations are reduced to a set of simultaneous algebraic equations by expanding the unknown functions in a series of Jacobi polynomials and then evaluating the singular Cauchy-type integrals. The resulting equations are found to be ill-conditioned and, consequently, are solved in the least-squares sense. Results from the analysis show that, under a normal pressure distribution on the free surface of the layer and depending on the combination of geometric and material parameters, the ends of the crack can open. The resulting stresses at the crack-tips are singular, implying that crack growth is possible. The extent of the opening and the crack-top stress intensity factors depend on the width of the pressure distribution zone, the layer thickness, and the relative material properties of the layer and half-plane.

Kennedy, J. M.↗
NASA NTRS1995

Fully-Explicit and Self-Consistent Algebraic Reynolds Stress Models

A fully-explicit, self-consistent algebraic expression for the Reynolds stress, which is the exact solution to the Reynolds stress transport equation in the 'weak equilibrium' limit for two-dimensional mean flows for all linear and some quasi-linear pressure-strain models, is derived. Current explicit algebraic Reynolds stress models derived by employing the 'weak equilibrium' assumption treat the production-to-dissipation (P/epsilon) ratio implicitly, resulting in an effective viscosity that can be singular away from the equilibrium limit. In the present paper, the set of simultaneous algebraic Reynolds stress equations are solved in the full non-linear form and the eddy viscosity is found to be non-singular. Preliminary tests indicate that the model performs adequately, even for three dimensional mean flow cases. Due to the explicit and non-singular nature of the effective viscosity, this model should mitigate many of the difficulties encountered in computing complex turbulent flows with the algebraic Reynolds stress models.

Girimaji, Sharath S.↗
DOE OSTI2024

Principal Landau determinants

We reformulate the Landau analysis of Feynman integrals with the aim of advancing the state of the art in modern particle-physics computations. We contribute new algorithms for computing Landau singularities, using tools from polyhedral geometry and symbolic/numerical elimination. Inspired by the work of Gelfand, Kapranov, and Zelevinsky (GKZ) on generalized Euler integrals, we define the principal Landau determinant of a Feynman diagram. We illustrate with a number of examples that this algebraic formalism allows to compute many components of the Landau singular locus. We adapt the GKZ framework by carefully specializing Euler integrals to Feynman integrals. For instance, ultraviolet and infrared singularities are detected as irreducible components of an incidence variety, which project dominantly to the kinematic space. We compute principal Landau determinants for the infinite families of one-loop and banana diagrams with different mass configurations, and for a range of cutting-edge Standard Model processes. Furthermore, our algorithms build on the Julia package this http URL and are implemented in the new open-source package this http URL available at this https URL.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Deformation of Lie–Poisson algebras and chirality

Linearization of a Hamiltonian system around an equilibrium point yields a set of Hamiltonian symmetric spectra: If λ is an eigenvalue of the linearized generator, -λ and $\barλ$ (hence, -$\barλ$) are also eigenvalues—the former implies a time-reversal symmetry, while the latter guarantees the reality of the solution. However, linearization around a singular equilibrium point (which commonly exists in noncanonical Hamiltonian systems) works out differently, resulting in breaking of the Hamiltonian symmetry of spectra; time-reversal asymmetry causes chirality. This interesting phenomenon was first found in analyzing the chiral motion of the rattleback, a boat-shaped top having misaligned axes of inertia and geometry [Z. Yoshida et al., Phys. Lett. A 381, 2772–2777 (2017)]. To elucidate how chiral spectra are generated, we study the three-dimensional Lie–Poisson systems and classify the prototypes of singularities that cause symmetry breaking. The central idea is the deformation of the underlying Lie algebra; invoking Bianchi’s list of all three-dimensional Lie algebras, we show that the so-called class-B algebras, which are produced by asymmetric deformations of the simple algebra s o ( 3 ) , yield chiral spectra when linearized around their singularities. The theory of deformation is generalized to higher dimensions, including the infinite-dimensional Poisson manifolds relevant to fluid mechanics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗