Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linearity”

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 235 records · Page 13

Cosmological forecasts for future galaxy surveys with the linear point standard ruler: Toward consistent BAO analyses far from a fiducial cosmology

The linear point (LP) standard ruler was identified as the basis of a purely geometric method for exploiting the baryon acoustic oscillations (BAO). The LP exploits the BAO feature imprinted in the galaxy two-point correlation function to measure cosmological distances independent of any specific cosmological model. We forecast the expected precision of future and ongoing spectroscopic galaxy surveys to measure distances leveraging the linear point. We investigate the cosmological implications of our forecasted results. We focus in particular on a relevant working example: the detection of the late-time cosmic acceleration independent of other cosmological probes. Further, our findings show that, even within the Λ⁢CDM standard cosmological paradigm, estimated distances need to be reliable over a very wide parameter range in order to realize their maximum utility. This is particularly relevant if we aim to properly characterize cosmological tensions. The LP is a promising candidate approach to achieve this reliability. In contrast, widely employed procedures in BAO analysis estimate distances keeping fixed cosmological parameters to fiducial values close to cosmic-microwave-background constraints in flat-Λ⁢CDM. It is unclear whether they are purely geometric methods. Moreover, they rely on untested extrapolations to explore the parameter space away from those fiducial flat-Λ⁢CDM values. We recommend that all BAO methodologies be validated across the full range of models and parameters over which their results are quoted, first by means of linear predictions and then N -body simulations.

79 ASTRONOMY AND ASTROPHYSICS↗

Counting linearly polarized gluons with lattice QCD

We outline an approach to calculate the transverse-momentum-dependent distribution of linearly polarized gluons inside an unpolarized hadron on the lattice with the help of large momentum effective theory. To achieve this purpose, we propose calculating a Euclidean version of the degree of polarization for a fast-moving hadron on the lattice, which is ultraviolet finite, and no soft function subtraction is needed. It indicates a practical way to explore the distribution of the linearly polarized gluons in a proton and the linearly polarized gluon effects in hadron collisions on the lattice.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Sparse Linear Solvers for Large-scale Electromagnetic Transient Simulations

Linear solvers form the basis for electromagnetic transient (EMT) simulations. There is a need to speed up EMT simulations as larger regions are analyzed using EMT simulations. For the same, the performance of linear solvers plays an important role. Exploiting the sparsity of the matrices generated in EMT simulations could assist with speed-up. Scalability is also crucial as power grids expand, demanding solutions capable of accommodating the increasing system size. Recent studies from the North American Electric Reliability Corporation (NERC) increasingly emphasize that EMT simulation models of the power grid will grow larger with the inclusion of power electronics components. Parallelisms in sparsity patterns exploit modern central processing units (CPUs), multi-core CPUs, and graphics processing units (GPUs) architectures in sparse solver designs. Therefore, this paper explores publicly available existing linear solvers and investigates their efficiency in large-scale power grid simulations. A large-scale power grid is developed by increasing the size of the IEEE 39 bus test system to up to 39000 bus systems.

Hsu, Kuan-Chieh↗

A Linear Programming Approach to Backtracking for Single-Axis Trackers on Rolling Terrain

In this article, we present a computationally efficient method for determining optimal backtracking rotations for single-axis solar trackers on nonuniform terrain. The method allows for ganged tracking, mechanical rotation constraints, uneven row spacing, and arbitrary maximum allowable shaded fractions (to enable “fractional backtracking”). As with previous 2-D approaches, the method is suitable for terrain that varies in the transverse direction with respect to the rotation axis of the trackers. The novelty of the method lies in formulating the problem of shade avoidance as a linear problem, which is achieved by using the row interception width as the optimization variable instead of rotation angles. Formulating backtracking as a linear problem enables the use of extremely efficient linear programming algorithms, making the method highly scalable, requiring less than 1 min to compute optimal rotation schedules for hundreds of trackers. It also produces more effective backtracking rotations, reducing the frequency of shading by 4× and improving system energy output by 1%–2%.

Optimization↗

Early Exploration of a Flexible Framework for Efficient Quantum Linear Solvers in Power Systems

The rapid integration of renewable energy resources presents formidable challenges in managing power grids. While advanced computing and machine learning techniques offer some solutions for accelerating grid modeling and simulation, there remain complex problems that classical computers cannot effectively address. Quantum computing, a promising technology, has the potential to fundamentally transform how we manage power systems, especially in scenarios with a higher proportion of renewable energy sources. One critical aspect is solving linear systems of equations, crucial for power system applications like power flow analysis, for which the Harrow-Hassidim-Lloyd (HHL) algorithm is a well-known quantum solution. However, HHL quantum circuits often exhibit excessive depth, making them impractical for current Noisy-Intermediate-Scale-Quantum (NISQ) devices. In this paper, we introduce a versatile framework, powered by NWQSim, that bridges the gap between power system applications and quantum linear solvers available in Qiskit. This framework empowers researchers to efficiently explore power system applications using quantum linear solvers. Through innovative gate fusion strategies, reduced circuit depth, and GPU acceleration, our simulator significantly enhances resource efficiency. Power flow case studies have demonstrated up to a eight-fold speedup compared to Qiskit Aer, all while maintaining comparable levels of accuracy.

quantum computing, Harrow-Hassidim-Lloyd, high-per↗

Learning Canonical Embeddings for Unsupervised Shape Correspondence With Locally Linear Transformations

We present a new approach to unsupervised shape correspondence learning between pairs of point clouds. We make the first attempt to adapt the classical locally linear embedding algorithm (LLE)-originally designed for nonlinear dimensionality reduction-for shape correspondence. The key idea is to find dense correspondences between shapes by first obtaining high-dimensional neighborhood-preserving embeddings of low-dimensional point clouds and subsequently aligning the source and target embeddings using locally linear transformations. We demonstrate that learning the embedding using a new LLE-inspired point cloud reconstruction objective results in accurate shape correspondences. More specifically, the approach comprises an end-to-end learnable framework of extracting high-dimensional neighborhood-preserving embeddings, estimating locally linear transformations in the embedding space, and reconstructing shapes via divergence measure-based alignment of probability density functions built over reconstructed and target shapes. Our approach enforces embeddings of shapes in correspondence to lie in the same universal/canonical embedding space, which eventually helps regularize the learning process and leads to a simple nearest neighbors approach between shape embeddings for finding reliable correspondences. Comprehensive experiments show that the new method makes noticeable improvements over state-of-the-art approaches on standard shape correspondence benchmark datasets covering both human and nonhuman shapes.

deformation↗

Limitations of Fault-Tolerant Quantum Linear System Solvers for Quantum Power Flow

Quantum computers hold promise for solving problems intractable for classical computers, especially those with high time or space complexity. Practical quantum advantage can be said to exist for such problems when the end-to-end time for solving such a problem using a classical algorithm exceeds that required by a quantum algorithm. Reducing the power flow (PF) problem into a linear system of equations allows for the formulation of quantum PF (QPF) algorithms, which are based on solving methods for quantum linear systems such as the Harrow-Hassidim-Lloyd (HHL) algorithm. Speedup from using QPF algorithms is often claimed to be exponential when compared to classical PF solved by state-of-the-art algorithms. Here, we investigate the potential for practical quantum advantage in solving QPF compared to classical methods on gate-based quantum computers. Notably, this paper does not present a new QPF solving algorithm but scrutinizes the end-to-end complexity of the QPF approach, providing a nuanced evaluation of the purported quantum speedup in this problem. Our analysis establishes a best-case bound for the HHL-based quantum power flow complexity, conclusively demonstrating that the HHL-based method has higher runtime complexity compared to the classical algorithm for solving the direct current power flow (DCPF) and fast decoupled load flow (FDLF) problem. Notably, our analysis and conclusions can be extended to any quantum linear system solver with rigorous performance guarantees, based on the known complexity lower bounds for this problem. Additionally, we establish that for potential practical quantum advantage (PQA) to exist it is necessary to consider DCPF-type problems with a very narrow range of condition number values and readout requirements.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Comparison of Rotary and Linear Cutting Methodology in Determining Specific Cutting Energy of Granite

Abstract Single polycrystalline diamond compact (PDC) cutting is a practical technique to understand the rock–tool interactions in drag-bit-type geothermal drilling operations. This paper introduces a rotary cutting method to determine specific cutting energy (SCE) and compares it with the conventional linear cutting method. In this work, granite is selected to represent hard rock formations in geothermal drilling. Cutting tests are conducted on a Computer Numerical Control (CNC) machine with a realistic cutting speed of 12.7 m/min and several chip loads ranging from 0.08 to 0.25 mm. The cutting force is measured using a dynamometer and then converted to specific cutting energy (SCE). The results show that the rotary method produces an inverse relationship between SCE and chip load, whereas the linear method shows the opposite. As a result, the produced SCE by the rotary method tends to be lower than that of the linear method at a higher chip load at and over 0.16 mm. The difference may be attributed to the cutting configuration and associated force components.

Engineering↗

High-resolution 3D microwave imaging using an optically tracked linear array

Active three-dimensional microwave or millimeter-wave imaging is typically performed using a linear array that is mechanically scanned over a uniform planar or cylindrical aperture. However, an image can also be formed with a linear array that is scanned over a non-uniform irregular aperture. This requires that the precise position of the array be known for each radar sample. This paper explores high-resolution 3D microwave imaging of stationary targets using an optically tracked manually scanned linear array. The image reconstruction techniques necessary to account for a non-uniform irregular aperture are also developed.

Clark, Richard T.↗

Data for Renewable Linear Alpha-Olefins by Base-Catalyzed Dehydration of Biologically-Derived Fatty Alcohols

Base catalysts were studied for the dehydration of fatty alcohols to linear alpha olefins (LAOs). For the gas phase dehydration of 1-octanol to 1-octene, 15% Cs/SiO2 catalyst was 56% selective at 10% conversion. Diluting a feed of C8, C10, and C14 fatty alcohols to 50% in undecane increased the selectivity to alpha olefins to 77–99%. 15% Cs/SiO2 was further investigated for the gas phase dehydration of a 4.2 g L−1 mixed C8–C14 fatty alcohol in tridecane feed and showed linear alpha olefin selectivities of 78–100% at initial conversions of 51–91% with the conversion lowering to 32–77% over 30 h. Catalytic activity was totally regenerated through calcination. A feed of biologically derived alcohols was produced with E. coli strain CM24 transformed with three plasmids (pBTRCk–pVHb–maACR, pACYC–pVHb–seFadBA, pTRC99A–pVHb–tdTER–fdh) which yielded a 5.5 g L−1 of C8–C14 fatty alcohol in tridecane. This biologically-derived feed was successfully dehydrated to linear alpha olefins over 15% Cs/SiO2 at selectivities of 60–100% with initial conversions of 35–75% which decreased to 22–55% over 30 h. Techno-economic analysis (TEA) of the integrated process for fatty alcohol production and subsequent dehydration to alpha olefins was conducted across the potential fermentation TRY (titer, rate, yield) landscape. Baseline fermentation performance resulted in a minimum product selling price (MPSP) double the market price for LAOs due to low titers and high costs associated with managing water and tridecane solvent flows through the system. However, targeted improvements in fermentation performance (e.g., achieving 40 g L−1 titer, 0.5 g L−1 h−1 productivity, 80% theoretical yield) can enable financially viable production of biologically derived LAOs.

Catalysis↗

Is Mini Beam Ready for Human Trials? Results of Randomized Study of Treating De-Novo Brain Tumors in Canines Using Linear Accelerator Generated Mini Beams

The main challenge in treating malignant brain neoplasms lies in eradicating the tumor while minimizing treatmentrelated damage. Conventional radiation treatments are associated with considerable side effects. Synchrotron generated micro-beam radiation (SMBRT) has shown to preserve brain architecture while killing tumor cells, however physical characteristics and limited facility access restrict its use. We have created a new clinical device which produces mini beams on a linear accelerator, to provide a new type of treatment called mini-beam radiation therapy (MBRT). The objective of this study is to compare the treatment outcomes of linear accelerator based MBRT versus standard radiation treatment (SRT), to evaluate the tumor response and the treatment-related changes in the normal brain with respect to each treatment type. Pet dogs with de-novo brain tumors were accrued for treatment. Dogs were randomized between standard fractionated stereotactic (9 Gy in 3 fractions) radiation treatment vs. a single fraction of MBRT (26 Gy mean dose). Dogs were monitored after treatment for clinical assessment and imaging. When the dogs were euthanized, a veterinary pathologist assessed the radiation changes and tumor response. We accrued 16 dogs, 8 dogs in each treatment arm. In the MBRT arm, 71% dogs achieved complete pathological remission. The radiation-related changes were all confined to the target region. Structural damage was not observed in the beam path outside of the target region. In contrast, none of the dogs in control group achieved remission and the treatment related damage was more extensive. Therapeutic superiority was observed with MBRT, including both tumor control and the normal structural preservation. The MBRT findings are suggestive of an immune related mechanism which is absent in standard treatment. These findings together with the widespread availability of clinical linear accelerators make MBRT a promising research topic to explore further treatment and clinical trial opportunities.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Linear viscoelastic measurements of commerical therapy putties for design and intuition

This dataset complements the publication Mapping Linear Viscoelasticity for Design and Tactile Intuition (Corman & Ewoldt, 2019). It contains rigorous shear rheometry measurements for six commercial silicone putties, including creep recovery, SAOS, LAOS, and stress relaxation. Additional, unpublished data was generated as part of a graduate rheology course taught by Randy Ewoldt at University of Illinois Urbana-Champaign. Together, these datasets provide a comprehensive example of linear viscoelasticity of a commercial material. The collection is intended both as a pedagogical resource for developing physical intuition in linear viscoelasticity and as a reference dataset for data interpretation, model fitting, and comparative rheological analysis.

C. Marsh, Maxwell↗

Modular Linear Thermoviscoelastic Model

Time-dependent, viscoelastic responses of materials like polymers and glasses have long been studied. As such, a variety of models have been put forth to describe the behavior including simple rheological models (e.g. Maxwell, Kelvin), linear "fading memory" theories, and hereditary integral based linear thermal viscoelastic approaches as well as more recent nonlinear theories that are either integral, fictive temperature, or differential internal state variable based. The current work details a new LINEAR_THERMOVISCOELASTIC model that has been added to LAME. This formulation represents a viscoelastic theory that neglects some of the phenomenological details of the PEC/SPEC models in favor of efficiency and simplicity. Furthermore, this new model is a first step towards developing "modular" viscoelastic capabilities akin to those available with hardening descriptions for plasticity models in LAME. Specifically, multiple different (including user-defined) shift-factor forms are implemented with each being easily selected via parameter specification rather than requiring distinct material models.

36 MATERIALS SCIENCE↗

Batched Sparse Linear Algebra (Final Report for Subcontract B648960)

This report finalizes design specifications for developing batched kernels for small tensor operations for unassembled matrix-free iterative solvers, batched solvers for partially assembled operators, and batched solvers with support for various sparse formats. The outcome of the project milestones is a set of interfaces to Batched Sparse LA solvers running on hardware accelerators for use in ECP Libraries and Applications. It is part of the development of sparse batched kernels, solvers/preconditioners as well as creating interoperability in xSDK libraries with sparse and dense batched functions to benefit ECP applications. The participants included representatives from ECP libraries (not limited to the xSDK project), applications, and vendors (AMD, Intel, and NVIDIA). Batched sparse linear algebra solvers form the new frontier for algorithmic development and performance engineering. Many applications (ECP and non-ECP alike) require simultaneous solutions of small linear systems of equations that are structurally sparse. To move towards high hardware utilization, it is important to provide these applications with appropriate interfaces to efficient batched sparse solvers running on modern hardware accelerators. We present interface designs in use by HPC software libraries supporting batched sparse linear algebra and the development of sparse batched kernel codes for solvers and preconditioners. We also address the potential interoperability opportunities to keep the software portable between the major hardware accelerators from AMD, Intel, and NVIDIA. The presented interface specifications includes batched band, sparse iterative, and sparse direct solvers. This report summarizes progress in Kokkos Kernels and the xSDK libraries MAGMA, Ginkgo, hypre, SUNDIALS, and SuperLU_dist.

97 MATHEMATICS AND COMPUTING↗

Randomized Algorithms for Linear Solvers

Recently, randomized algorithms in numerical linear algebra, specifically those centered around random sketching, have gained traction in primarily theoretical research due to their potential to significantly reduce problem dimensionality at the cost of an O(1) multiplicative distortion factor. It has been assumed that this sketching can be done efficiently, but thorough investigation into how precisely to do it has been neglected. Moreover, the theory-based community has argued for sketching’s ability to reduce computational cost via complexity analysis, but has not researched how it affects the stability of the algorithms. At Sandia, efficient linear solvers that scale well on modern HPC architectures while maintaining stability are imperative for practical applications. In this LDRD, we developed a random sketching strategy that is substantially faster than existing ones, and demonstrate its superior performance in practice on a NVIDIA H100 GPU. Moreover, we show how this can be used to significantly outperform existing linear least squares solvers while improving the solver’s stability as well. Additionally, we demonstrate how this sketching strategy can be used to make a fast, stable QR factorization that can subsequently be used in s-step and block Krylov solvers. Finally, we incorporate a sketching-based block orthogonalization scheme into s-step GMRES, which is stable and faster than existing approaches on the Perlmutter supercomputer.

97 MATHEMATICS AND COMPUTING↗

Compensating for Amplifier Non-Linearity in a SEL Controller

The SEL architecture used commonly in CW superconducting linacs is a positive feedback system that requires determining the correct limits for the operating conditions to ensure stable operation. These limits are determined from the results of the amplifier calibration which characterizes the dac drive(forward power) against the cavity field. When the amplifier non-linearity precludes a simple linear fit for this characteristic, its modification to account for the amplifiers non-linearity is essential to operate the system in the SEL architecture. This process is described with test data from a 32kW SSA for the PIP-II linac.

Sankar Raman, Shrividhyaa [Fermilab]↗

Variational Quantum Linear Solver

Previously proposed quantum algorithms for solving linear systems of equations cannot be implemented in the near term due to the re quired circuit depth. Here, we propose a hybrid quantum-classical algorithm, called Variational Quantum Linear Solver (VQLS), for solving linear systems on near-term quantum computers. VQLS seeks to variationally prepare |x$\rangle$ such that A|x$\rangle$ ∝ |b$\rangle$. We derive an operationally meaningful termination condition for VQLS that allows one to guarantee that a desired solution precision ϵ is achieved. Specifically, we prove that C $⩾$ ϵ 2 /κ 2 , where C is the VQLS cost function and κ is the condition number of A. We present efficient quantum circuits to estimate C, while providing evidence for the classical hardness of its estimation. Using Rigetti’s quantum computer, we success fully implement VQLS up to a problem size of 1024 × 1024. Finally, we numerically solve nontrivial problems of size up to 2 50 × 2 50 . For the specific examples that we consider, we heuristically find that the time complexity of VQLS scales efficiently in ϵ, κ, and the system size N.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Geometric Interpretation of a Non-Linear Extension of Quantum Mechanics

We recently introduced a particular non-linear generalization of quantum mechanics that has the property that it is exactly solvable in terms of the eigenvalues and eigenfunctions of the Hamiltonian of the usual linear quantum mechanics problem. In this paper, we suggest that the two components of the wave function represent the system described by the Hamiltonian H in two different asymptotic regions of spacetime and we show that the non-linear terms can be viewed as giving rise to gravitational effects.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗