Search NASA⌕ Search

SEARCH · Search NASA

Results for “quadratic”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Real-world CMB lensing quadratic estimator power spectrum response

I describe a method to estimate response matrices of Cosmic Microwave Background (CMB) lensing power spectra estimators to the true sky power under realistic conditions. Applicable to all lensing reconstruction pipelines based on quadratic estimators (QE), it uses a small number of Gaussian CMB Monte-Carlos and specially designed QE's in order to obtain sufficiently accurate matrices with little computational effort. This method may be used to improve the modelling of CMB lensing band-powers by incorporating at least some of the non-idealities encountered in CMB lensing reconstruction. These non-idealities always include masking, and often inhomogeneous filtering, either in the harmonic domain or pixel space. I obtain these matrices for Planck latest lensing reconstructions, and then show that the residual couplings induced by masking explain very well the residual multiplicative bias seen on the Planck simulations, removing the need for an empirical correction.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Global stellarator coil optimization with quadratic constraints and objectives

Most present stellarator designs are produced by costly two-stage optimization: the first for an optimized equilibrium, and the second for a coil design reproducing its magnetic configuration. Few proxies for coil complexity and forces exist at the equilibrium stage. Rapid initial state finding for both stages is a topic of active research. Most present convex coil optimization codes use the least square winding surface method by Merkel (NESCOIL), with recent improvements in conditioning, regularization, sparsity, and physics objectives. While elegant, the method is limited to modeling the norms of linear functions in coil current. We present QUADCOIL, a global coil optimization method that targets combinations of linear and quadratic functions of the current. It can directly constrain and/or minimize a wide range of physics objectives unavailable in NESCOIL and REGCOIL, including the Lorentz force, magnetic energy, curvature, field-current alignment, and the maximum density of a dipole array. QUADCOIL requires no initial guess and runs nearly $10$ 2 x faster than filament optimization. Integrating it in the equilibrium optimization stage can potentially exclude equilibria with difficult-to-design coils, without significantly increasing the computation time per iteration. QUADCOIL finds the exact, global minimum in a large parameter space when possible, and otherwise finds a well-performing approximate global minimum. It supports most regularization techniques developed for NESCOIL and REGCOIL. We demonstrate QUADCOIL’s effectiveness in coil topology control, minimizing non-convex penalties, and predicting filament coil complexity with three numerical examples.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

Fault-tolerant resource comparison of qudit and qubit encodings for diagonal quadratic operators

Finite local Hilbert-space truncations arise naturally in quantum simulations of lattice field theories and motivate qudit encodings, but their fault-tolerant advantage over qubit encodings remains unclear. We compare the non-Clifford cost of implementing quadratic diagonal evolutions, exemplified by 𝑈 = 𝑒$^{−𝑖⁢𝑡⁢𝜙^2_𝑥}$ in a uniform field-amplitude discretization of a real scalar field, using either one logical 𝑑-level qudit or 𝑛 𝑏 = ⌈log 2⁡ 𝑑⌉ logical qubits. We analyze two standard settings: product-formula simulation and linear combination of unitaries (LCU) per block encoding, taking the resource metric to be the number of non-Clifford gates after synthesis into a discrete logical gate set. Because tight synthesis bounds for general single-qudit rotations are not known, we express the qudit constructions in terms of embedded two-level SU⁡(2) rotations and derive explicit finite-𝑑 break-even conditions for their synthesis cost; these serve as compiler targets for when qudit encodings can outperform the qubit baseline. Within the constructive models studied here, product-formula implementations would require an exponentially stronger per-primitive synthesis advantage for qudits to win asymptotically, while in the LCU setting the qubit encoding is asymptotically cheaper in 𝑑. Nevertheless, the finite-𝑑 threshold analysis identifies low-dimensional regions in which qudits can yield meaningful constant-factor savings, particularly for LCU-based implementations. As a secondary analysis of the LCU construction, we use an idealized negligible-overhead qubit-qudit code-switching model to give an absolute 𝑇-count comparison and reinterpret the savings as an allowable per-switch overhead budget.

Godwood, Samuel [Univ. of Liverpool (United Kingdo↗
DOE OSTI2021

Higher Chern numbers in multilayer Lieb lattices ( N ≥ 2 ): Topological transitions and quadratic band crossing lines

In this work, we consider a hitherto unexplored setting of a stacked multilayer (N) Lieb lattice which undergoes an unusual topological transition in the presence of intralayer spin-orbit coupling (SOC). The specific stacking configuration induces an effective nonsymmorphic two-dimensional lattice structure, even though the constituent monolayer Lieb lattice is characterized by a symmorphic space group. This emergent nonsymmorphicity leads to multiple doubly degenerate bands extending over the edge of the Brillouin zone (i.e., quadratic band crossing lines). In the presence of intralayer SOC, these doubly degenerate bands typically form three N-band subspaces, mutually separated by two band gaps. We analyze the topological properties of these multiband subspaces, using specially devised Wilson loop operators to compute non-Abelian Berry phases in order to show that they carry a higher Chern number N.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Nonlinear dynamics of quadratic gravity in spherical symmetry

We present the first numerically stable nonlinear evolution for the leading-order gravitational effective field theory (quadratic gravity) in the spherically-symmetric sector. The formulation relies on (i) the harmonic gauge to cast the evolution system into quasilinear form (ii) the Cartoon method to reduce to spherical symmetry in keeping with the harmonic gauge, and (iii) order reduction to first order (in time) by means of introducing auxiliary variables. The well posedness of the respective initial-value problem is numerically confirmed by evolving randomly perturbed flat-space and black-hole initial data. In conclusion, our study serves as a proof-of-principle for the possibility of stable numerical evolution in the presence of higher derivatives.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Quantum Bipolaron Superconductivity from Quadratic Electron-Phonon Coupling

When the electron-phonon coupling is quadratic in the phonon coordinates, electrons can pair to form bipolarons due to phonon zero-point fluctuations, a purely quantum effect. Here we study superconductivity originating from this pairing mechanism in a minimal model and reveal that, in the strong coupling regime, the critical temperature (T c ) is only mildly suppressed by the coupling strength, in stark contrast to the exponential suppression in linearly coupled systems, thus implying higher optimal T c values. We demonstrate that large coupling constants of this flavor are achieved in known materials such as perovskites, and discuss strategies to realize such superconductivity using superlattices.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Time-Varying Feedback Optimization for Quadratic Programs with Heterogeneous Gradient Step Sizes

Online feedback-based optimization has become a promising framework for real-time optimization and control of complex engineering systems. This tutorial paper surveys the recent advances in the field as well as provides novel convergence results for primal-dual online algorithms with heterogeneous step sizes for different elements of the gradient. The analysis is performed for quadratic programs and the approach is illustrated on applications for adaptive step-size and model-free online algorithms, in the context of optimal control of modern power systems.

gradient methods↗
DOE OSTI2023

Near-Optimal Distributed Linear-Quadratic Regulator for Networked Systems

This paper studies the trade-off between the degree of decentralization and the performance of a distributed controller in a linear-quadratic control setting. We study a system of interconnected agents over a graph and a distributed controller, called k-distributed control, which lets the agents make control decisions based on the state information within distance k on the underlying graph. This controller can tune its degree of decentralization using the parameter k and thus allows a characterization of the relationship between decentralization and performance. We show that under mild assumptions, including stabilizability, detectability, and a subexponentially growing graph condition, the performance difference between k-distributed control and centralized optimal control becomes exponentially small in k. Finally, this result reveals that distributed control can achieve near-optimal performance with a moderate degree of decentralization, and thus it is an effective controller architecture for large-scale networked systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective

An optimization algorithm for nonsmooth nonconvex constrained optimization problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objective functions is proposed and analyzed. Upper- \({\boldsymbol{\mathcal{C}^2}}\) is a weakly concave property that exists in difference of convex (DC) functions and arises naturally in many applications, particularly certain classes of solutions to parametric optimization problems e.g., recourse of stochastic programming and projection onto closed sets. The algorithm can be viewed as an extension of sequential quadratic programming (SQP) to nonsmooth problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objectives or a simplified bundle method. It is globally convergent with bounded algorithm parameters that are updated with a trust-region criterion. The algorithm handles general smooth constraints through linearization and uses a line search to ensure progress. The potential inconsistencies from the linearization of the constraints are addressed through a penalty method. In conclusion, the capabilities of the algorithm are demonstrated by solving both simple upper- \({\boldsymbol{\mathcal{C}^2}}\) problems and a real-world optimal power flow problem used in current power grid industry practices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Memory and CPU efficient coherent mode decomposition of partially coherent synchrotron radiation with subtraction of common quadratic phase terms

Application examples of a memory and CPU efficient coherent mode decomposition (CMD) method for wave-optics based simulation of the partially coherent undulator radiation propagation through a hard X-ray beamline in a 3rd generation synchrotron radiation source are presented. The high efficiency of the method is achieved thanks to the analytical treatment of the common quadratic phase terms that are developed in the phase of cross-spectral density (CSD) of partially coherent radiation at a distance from source. This treatment allows for a considerable, several orders of magnitude, reduction of the 4D CSD mesh density (and the memory occupied by the CSD) required for ensuring sufficient accuracies of wavefront propagation simulations with the modes produced by the CMD at a beamline entrance. This method, implemented in the “Synchrotron Radiation Workshop” open-source software, dramatically increases the feasibility of the CMD of 4D CSD for producing 2D coherent modes for a large variety of applications at storage rings and other types of radiation sources.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Nonlinear regenerative amplification using tunable intracavity cascaded quadratic nonlinearities

Conventional nonlinear regenerative amplification utilizes Kerr (i.e., self-focusing) nonlinearity to broaden the spectrum via self-phase modulation during the direct amplification of ultrashort pulses, which helps overcome spectral gain narrowing for high-energy, ultrashort-pulse generation. We introduce cascaded quadratic nonlinearities from a type-I second-harmonic generation crystal, which can be tuned in both magnitude and sign via the phase-mismatching condition, inside a regenerative amplifier to enable nonlinearity-tunable regenerative amplification. We demonstrate, both experimentally and numerically, a nonlinear Yb:YAG thin-disk regenerative amplifier with either positive or negative net nonlinearity that delivers 1-kHz, >0.4-mJ pulses as short as ∼200 fs and high-quality beams free of self-focusing. The laser’s average power can be scaled to >100 W when seeded and operated at a much higher repetition rate to benefit various applications.

47 OTHER INSTRUMENTATION↗
DOE OSTI2022

Sampling electronic structure quadratic unconstrained binary optimization problems (QUBOs) with Ocean and Mukai solvers

The most advanced D-Wave Advantage quantum annealer has 5000+ qubits, however, every qubit is connected to a small number of neighbors. As such, implementation of a fully-connected graph results in an order of magnitude reduction in qubit count. To compensate for the reduced number of qubits, one has to rely on special heuristic software such as qbsolv, the purpose of which is to decompose a large quadratic unconstrained binary optimization (QUBO) problem into smaller pieces that fit onto a quantum annealer. In this work, we compare the performance of the open-source qbsolv which is a part of the D-Wave Ocean tools and a new Mukai QUBO solver from Quantum Computing Inc. (QCI). The comparison is done for solving the electronic structure problem and is implemented in a classical mode (Tabu search techniques). The Quantum Annealer Eigensolver is used to map the electronic structure eigenvalue-eigenvector equation to a QUBO problem, solvable on a D-Wave annealer. We find that the Mukai QUBO solver outperforms the Ocean qbsolv with one to two orders of magnitude more accurate energies for all calculations done in the present work, both the ground and excited state calculations. This work stimulates the further development of software to assist in the utilization of modern quantum annealers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

SPT-3G D1: Quadratic-Estimator CMB Lensing Reconstruction and Cosmology

We present a map of the cosmic microwave background (CMB) lensing potential reconstructed from observations taken during the 2019 and 2020 seasons with the third-generation camera on the South Pole Telescope (SPT), covering the $1500\,{\rm deg}^{2}$ SPT-3G Main field, referred to as the SPT-3G D1 dataset. From the multi-frequency temperature and polarization data, we reconstruct the CMB lensing field using a quadratic estimator that jointly accounts for the $T$, $E$, and $B$ fields and their covariance. The resulting lensing map is dominated by polarization information for $L \lesssim 600$ and provides the highest signal-to-noise measurement per mode reported to date. With nuisance parameters fixed to their best-fit values, we measure a lensing amplitude consistent with unity at $2\%$ precision relative to the $Λ$CDM model that best fits the combined Planck, ACT DR6, and SPT-3G D1 $TT/TE/EE$ likelihoods (${\rm CMB}_{\rm SPA}$). We further measure the structure-growth parameter $σ_{8}Ω_{\rm m}^{0.25}$ to be $0.6046\pm0.0096$ from the SPT-3G D1 lensing spectrum alone and $0.6020\pm0.0084$ when combined with ACT DR6 and Planck PR4 CMB lensing. By further combining this with ${\rm CMB}_{\rm SPA}$ and the latest DESI DR2 BAO data, we obtain $\sum m_ν < 0.072\,\mathrm{eV}$ (95% C.L.) when allowing the neutrino mass to vary within $Λ$CDM. Compared with previous work, the better agreement of our measurement with DESI DR2 BAO yields both this relaxed upper bound and reduced ($\mathord{\sim}2σ$) preferences for nonzero spatial curvature and for deviations of $(w_0,w_a)$ from the $Λ$CDM expectation. When we combine CMB lensing with the DES Y3 3$\times$2pt analysis, we obtain $S_{8}=0.811\pm0.011$, corresponding to a $1.4\%$ constraint on the late-time clustering amplitude. This precision is competitive with that obtained from the primary CMB within $Λ$CDM.

Omori, Y. [Chicago U., Astron. Astrophys. Ctr.; Ch↗
DOE OSTI2021

Massless charged particles tunneling radiation from a RN-dS horizon and the linear and quadratic GUP

Highlights: • Generalized Uncertainty Principle (GUP). • Reissner–Nordstrom de Sitter (RNdS) spacetime. • Massless charged particles. • Tunneling through cosmological horizon. • Tunneling of spin fields. In this paper, we investigate the massless Reissner–Nordstrom de Sitter metric in the context of minimal length scenarios. We prove not only the confinement of the energy density of massless charged particles, both fermions and bosons, but also their ability to tunnel through the cosmological horizon. These massless particles might be interacting with Dirac sea and in this case they will appear outside the cosmological horizon in the context of dS/CFT holography. This result may formulate a fundamental reason for the expansion of the Dirac sea. Therefore, a spacetime Big Crunch may occur.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗