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↗
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↗
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↗
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↗
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↗
DOE OSTI2026

SODAs: sparse optimization for the discovery of differential and algebraic equations

Differential-algebraic equations (DAEs) integrate ordinary differential equations (ODEs) with algebraic constraints, providing a fundamental framework for developing models of dynamical systems characterized by time-scale separation, conservation laws and physical constraints. While sparse optimization has revolutionized model development by allowing data-driven discovery of parsimonious models from a library of possible equations, existing approaches for dynamical systems assume DAEs can be reduced to ODEs by eliminating variables before model discovery. This assumption limits the applicability of such methods for DAE systems with unknown constraints and time scales. We introduce sparse optimization for differential-algebraic systems (SODAs), a data-driven method for the identification of DAEs in their explicit form. By discovering the algebraic and dynamic components sequentially without prior identification of the algebraic variables, this approach leads to a sequence of convex optimization problems. It has the advantage of discovering interpretable models that preserve the structure of the underlying physical system. To this end, SODAs improves since SODAs is singular numerical stability when handling high correlations between library terms, caused by near-perfect algebraic relationships, by iteratively refining the conditioning of the candidate library. We demonstrate the performance of our method on biological, mechanical and electrical systems, showcasing its robustness to noise in both simulated time series and real-time experimental data.

DAE↗
DOE OSTI2021

Semiclassical Trans-Series from the Perturbative Hopf-Algebraic Dyson-Schwinger Equations: $\phi$ 3 QFT in 6 Dimensions

We analyze the asymptotically free massless scalar $\phi$ 3 quantum field theory in 6 dimensions, using resurgent asymptotic analysis to find the trans-series solutions which yield the non-perturbative completion of the divergent perturbative solutions to the Kreimer–Connes Hopf-algebraic Dyson–Schwinger equations for the anomalous dimension. This scalar conformal field theory is asymptotically free and has a real Lipatov instanton. In the Hopf-algebraic approach we find a trans-series having an intricate Borel singularity structure, with three distinct but resonant non-perturbative terms, each repeated in an infinite series. These expansions are in terms of the renormalized coupling. The resonant structure leads to powers of logarithmic terms at higher levels of the trans-series, analogous to logarithmic terms arising from interactions between instantons and anti-instantons, but arising from a purely perturbative formalism rather than from a semi-classical analysis.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Semantic embedding for quantum algorithms

The study of classical algorithms is supported by an immense understructure, founded in logic, type, and category theory, that allows an algorithmist to reason about the sequential manipulation of data irrespective of a computation’s realizing dynamics. As quantum computing matures, a similar need has developed for an assurance of the correctness of high-level quantum algorithmic reasoning. Parallel to this need, many quantum algorithms have been unified and improved using quantum signal processing (QSP) and quantum singular value transformation (QSVT), which characterize the ability, by alternating circuit ansätze, to transform the singular values of sub-blocks of unitary matrices by polynomial functions. However, while the algebraic manipulation of polynomials is simple (e.g., compositions and products), the QSP/QSVT circuits realizing analogous manipulations of their embedded polynomials are non-obvious. This work constructs and characterizes the runtime and expressivity of QSP/QSVT protocols where circuit manipulation maps naturally to the algebraic manipulation of functional transforms (termed semantic embedding). In this way, QSP/QSVT can be treated and combined modularly, purely in terms of the functional transforms they embed, with key guarantees on the computability and modularity of the realizing circuits. We also identify existing quantum algorithms whose use of semantic embedding is implicit, spanning from distributed search to proofs of soundness in quantum cryptography. The methods used, based in category theory, establish a theory of semantically embeddable quantum algorithms, and provide a new role for QSP/QSVT in reducing sophisticated algorithmic problems to simpler algebraic ones.

Physics↗
DOE OSTI2022

Dynamic mode decomposition with core sketch

With the increase in collected data volumes, either from experimental measurements or high fidelity simulations, there is an ever-growing need to develop computationally efficient tools to process, analyze, and interpret these datasets. Modal analysis techniques have gained great interest due to their ability to identify patterns in the data and extract valuable information about the system being considered. Dynamic mode decomposition (DMD) relies on elements of the Koopman approximation theory to compute a set of modes, each associated with a fixed oscillation frequency and a decay/growth rate. Extracting these details from large datasets can be computationally expensive due to the need to implement singular value decomposition of the input data matrix. Sketching algorithms have become popular in numerical linear algebra where statistical theoretic approaches are utilized to reduce the cost of major operations. A sketch of a matrix is another matrix, which is significantly smaller, but still sufficiently approximates the original system. We put forth an efficient DMD framework, SketchyDMD, based on a core sketching algorithm that captures information about the range and corange (their mutual relationship) of input data. The proposed sketching-based framework can accelerate various portions of the DMD routines, compared to classical methods that operate directly on the raw input data. We conduct numerical experiments using the spherical shallow water equations as a prototypical model in the context of geophysical flows. In conclusion, we show that the proposed SketchyDMD is superior to existing randomized DMD methods that are based on capturing only the range of the input data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Fast truncated SVD of sparse and dense matrices on graphics processors

We investigate the solution of low-rank matrix approximation problems using the truncated singular value decomposition (SVD). For this purpose, we develop and optimize graphics processing unit (GPU) implementations for the randomized SVD and a blocked variant of the Lanczos approach. Our work takes advantage of the fact that the two methods are composed of very similar linear algebra building blocks, which can be assembled using numerical kernels from existing high-performance linear algebra libraries. Furthermore, the experiments with several sparse matrices arising in representative real-world applications and synthetic dense test matrices reveal a performance advantage of the block Lanczos algorithm when targeting the same approximation accuracy.

Computer Science↗
DOE OSTI2023

Constraints on sequential discontinuities from the geometry of on-shell spaces

We present several classes of constraints on the discontinuities of Feynman integrals that go beyond the Steinmann relations. These constraints follow from a geometric formulation of the Landau equations that was advocated by Pham, in which the singularities of Feynman integrals correspond to critical points of maps between on-shell spaces. To establish our results, we review elements of Picard-Lefschetz theory, which connect the homotopy properties of the space of complexified external momenta to the homology of the combined space of on-shell internal and external momenta. An important concept that emerges from this analysis is the question of whether or not a pair of Landau singularities is compatible — namely, whether or not the Landau equations for the two singularities can be satisfied simultaneously. Under conditions we describe, sequential discontinuities with respect to non-compatible Landau singularities must vanish. Although we only rigorously prove results for Feynman integrals with generic masses in this paper, we expect the geometric and algebraic insights that we gain will also assist in the analysis of more general Feynman integrals.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Virasoro completeness relation and the inverse Shapovalov form

In this work, we introduce an explicit expression for the inverse of the symmetric bilinear form of Virasoro Verma modules, the so-called Shapovalov form, in terms of singular vector operators and their conformal dimensions. Our proposed expression also determines the resolution of the identity for Verma modules of the Virasoro algebra, and can be thus employed in the computation of Virasoro conformal blocks via the sewing procedure. Published by the American Physical Society 2025

Fortin, Jean-François (ORCID:0000000278135015)↗
DOE OSTI2024

HHL algorithm with mapping function and enhanced sampling for model predictive control in microgrids

Here, this paper presents a refined quantum Harrow Hassidim Lloyd (HHL) algorithm for microgrid control. The first novelty of the developed method is that a mapping shift function enables the original HHL algorithm to handle general linear equations with non-singular and indefinite matrix. Second, a method of Matrix Extension for Amplifying Sampling Probabilities of Intended Solution (ME-ASPI) is proposed to design the reformulated linear algebraic equations, allowing for improved sampling efficiency of the quantum tomography in the refined HHL algorithm. Then, we applied the method to solve the model predictive control (MPC) problem in nonlinear dynamical microgrids. Specifically, with the ME-ASPI method, the refined HHL algorithm can effectively obtain the intended partial optimal control inputs for MPC. The optimization of quadratic programming problem in each time step of MPC is transformed into a linear system problem, which is addressed by the proposed quantum solver through using only partial information, with the time complexity improved from $\mathscr{O}(\mathscr{N}^{2.37286})$ classically to $\mathscr{O}(\mathscr{N}^{2} log \mathscr{N}$ x $p$ log $p)$ in quantum. Numerical examples have validated the effectiveness of the refined HHL algorithm with the proposed mapping function and the ME-ASPI method. By leveraging quantum properties, the proposed method provides a hybrid quantum–classical framework for microgrid control. This generic method can also potentially tackle many other challenges in analyzing and controlling general complex engineered systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

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.

Pearce, Katherine J. [The University of Texas at A↗