Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Linear Optimization”

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 1,063 records · Page 59

X-ray Characterization of a Multichannel Smart-Pixel Array Detector

The Voxtel VX-798 is a prototype X-ray pixel array detector (PAD) featuring a silicon sensor photodiode array of 48 x 48 pixels, each 130 mu m x 130 mu m x 520 mu m thick, coupled to a CMOS readout application specific integrated circuit (ASIC). The first synchrotron X-ray characterization of this detector is presented, and its ability to selectively count individual X-rays within two independent arrival time windows, a programmable energy range, and localized to a single pixel is demonstrated. During our first trial run at Argonne National Laboratory's Advance Photon Source, the detector achieved a 60 ns gating time and 700 eV full width at half-maximum energy resolution in agreement with design parameters. Each pixel of the PAD holds two independent digital counters, and the discriminator for X-ray energy features both an upper and lower threshold to window the energy of interest discarding unwanted background. This smart-pixel technology allows energy and time resolution to be set and optimized in software. It is found that the detector linearity follows an isolated dead-time model, implying that megahertz count rates should be possible in each pixel. Measurement of the line and point spread functions showed negligible spatial blurring. When combined with the timing structure of the synchrotron storage ring, it is demonstrated that the area detector can perform both picosecond time-resolved X-ray diffraction and fluorescence spectroscopy measurements.

CMOS ASIC↗

Secondary Voltage Control Via Demand-Side Energy Storage with Temporal Logic Specifications

This paper proposes a secondary voltage control method that can handle the temporal logic specifications (TLSs). The control objective is to schedule a control signal for energy storage system (ESS) such that the voltage variation of a defined critical bus satisfies TLSs. The TLS allows definitions of set and timing constraints at the same time, such as a finite-time restoration. A simplified analytical model is derived to describe the voltage variation of critical buses. Based on this model, a numerical optimal control problem is formulated as a mixed integer linear program to generate the proper control input for the ESS. The proposed control is verified on a lumped distribution system model. With this control diagram, supportive controllers can be easily designed to make voltage behaviors comply with grid codes and avoid unnecessary relay actions.

Zhang, Yichen↗

Extremum Seeking-Based Control System for Particle Accelerator Beam Loss Minimization

Particle accelerators throughout the world vary widely in terms of age and availability of advanced noninvasive diagnostics that provide varying levels of detail about the accelerated beams. Additionally, beam loss measurements and current monitors are ubiquitous in the accelerator community, they are noninvasive, and they are some of the most important metrics in terms of preventing damage or irradiation of beam pipes and equipment for high-energy machines. However, beam loss and current measurements are difficult to use for feedback tuning because of a lack of a known analytic relationship between scalar loss measurements throughout an accelerator and the hundreds of thousands of parameters that influence the beam and time variation of the beam source itself. In this work, we present a model-independent extremum seeking (ES) controller, which has been implemented for automated tuning and optimization of the Los Alamos Neutron Science Center (LANSCE) linear ion accelerator based only on scalar quantities, such as beam loss or flux measurements. We demonstrate the approach on various accelerator subsystems, including groups of radio frequency (RF) accelerating cavities, quadrupole magnets, bending magnets, and steering magnets. This tool is now available as a use graphical user interface (GUI) in the LANSCE control room, allowing beam physicists to choose arbitrary groups of parameters and beam loss or current monitors for adaptive tuning.

43 PARTICLE ACCELERATORS↗

A High Performance Block Eigensolver for Nuclear Configuration Interaction Calculations

As on-node parallelism increases and the performance gap between the processor and the memory system widens, achieving high performance in large-scale scientific applications requires an architecture-aware design of algorithms and solvers. We focus on the eigenvalue problem arising in nuclear Configuration Interaction (CI) calculations, where a few extreme eigenpairs of a sparse symmetric matrix are needed. Here, we consider a block iterative eigensolver whose main computational kernels are the multiplication of a sparse matrix with multiple vectors (SpMM), and tall-skinny matrix operations. We then present techniques to significantly improve the SpMM and the transpose operation SpMM T by using the compressed sparse blocks (CSB) format. We achieve 3-4× speedup on the requisite operations over good implementations with the commonly used compressed sparse row (CSR) format. We develop a performance model that allows us to correctly estimate the performance of our SpMM kernel implementations, and we identify cache bandwidth as a potential performance bottleneck beyond DRAM. We also analyze and optimize the performance of LOBPCG kernels (inner product and linear combinations on multiple vectors) and show up to 15× speedup over using high performance BLAS libraries for these operations. The resulting high performance LOBPCG solver achieves 1.4× to 1.8× speedup over the existing Lanczos solver on a series of CI computations on high-end multicore architectures (Intel Xeons). We also analyze the performance of our techniques on an Intel Xeon Phi Knights Corner (KNC) processor.

97 MATHEMATICS AND COMPUTING↗

Generative Patch Priors for Practical Compressive Image Recovery

In this work, we propose the generative patch prior (GPP) that defines a generative prior for compressive image recovery, based on patch-manifold models. Unlike learned, image-level priors that are restricted to the range space of a pre-trained generator, GPP can recover a wide variety of natural images using a pre-trained patch generator. Additionally, GPP retains the benefits of generative priors like high reconstruction quality at extremely low sensing rates, while also being much more generally applicable. We show that GPP outperforms several unsupervised and supervised techniques on three different sensing models – linear compressive sensing with known, and unknown calibration settings, and the non-linear phase retrieval problem. Finally, we propose an alternating optimization strategy using GPP for joint calibration-and-reconstruction which performs favorably against several baselines on a real world, uncalibrated compressive sensing dataset. The code and models for GPP are available on github.

compressed sensing↗

Generation of auroral kilometric radiation by a finite-size source in a dipole magnetic field

Generation, amplification, and propagation of auroral kilometric radiation in a narrow three-dimensional plasma cavity in which a weakly relativistic electron beam propagates is studied in the geometrical optics approximation. It is shown that the waves that start with a group velocity directed earthward and have optimal relation between the wave vector components determining the linear growth rate and the wave residence time inside the amplification region undergo the largest amplification. Taking into account the longitudinal velocity of fast electrons results in the shift of the instability domain toward wave vectors directed to the Earth and leads to a change in the dispersion relation, due to which favorable conditions are created for the generation of waves with frequencies above the cutoff frequency for the cold background plasma at the wave generation altitude. The amplification factor for these waves is lower than for waves that have the same wave vectors but are excited by the electron beams with lower velocities along the magnetic field. For waves excited at frequencies below the cutoff frequency of the background plasma at the generation altitude, the amplification factor increases with increasing longitudinal electron velocity, because these waves reside for a longer time in the amplification region.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Albany v 1.0

The Albany code is a general purpose finite element code for solving partial differential equations (PDEs). Albany is a research code that demonstrates how a PDE code can be built by interfacing many of the open-source software libraries that are released under Sandia's Trilinos project. Part of the mission of Albany is to be a testbed for new Trilinos libraries, to refine their methods, usability, and interfaces. Albany also serves as a demonstration code on how to build an application code against an installed Trilinos project. Because of this, Albany is a desirable starting point for new code development efforts that wish to make heavy use of Trilinos. The physics solved in Albany are currently only very academic problems, such as heat transfer, linear elasticity, and nonlinear elasticity. Albany includes hooks to optimization and uncertainty quantification algorithms, including those in the Dakota toolkit.

Source record↗

BLING

The Bounded Linearized Iteration for Natural Gas (BLING) algorithm solves an optimization problem for gas pipeline flow scheduling that maximizes economic surplus and minimizes the energy used for gas compression subject to pressure, flow, and engineering constraints.

Zlotnik, Anatoly↗

Generalized Tensor-on-Tensor Regression (GToTR)

SAND2026-23069O Generalized Tensor-on-Tensor Regression (GToTR) is a Python-based tool for conducting generalized tensor-on-tensor regression. It provides Canonical Polyadic (CP)-based generalized tensor regression models, support for generalized linear model-like families and links, alternating-optimization model fitting methods, and a standard statistics software interface. The tool supports tensor-valued responses and covariates using the open-source Python Tensor Toolbox (pyttb) software package. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Dunlavy, Daniel [Sandia National Lab. (SNL-CA), Li↗

Application of artificial intelligence methods in the international roughness index prediction of rigid and composite pavements: a systematic review

The International Roughness Index (IRI) is a widely adopted metric for quantifying pavement roughness, directly influencing vehicle safety, ride comfort, and overall roadway performance. In recent years, the use of Machine Learning (ML) models for IRI prediction has gained momentum, with the goal of improving the allocation of maintenance and rehabilitation resources by enabling accurate assessments of pavement conditions. Most prior reviews, however, have concentrated on flexible pavements, leaving a notable gap regarding rigid and composite pavements. To address this gap, the present study conducts a systematic review of Artificial Intelligence (AI) methods applied to IRI prediction for rigid and composite pavements. Literature published between 2004 and 2025 is synthesized to highlight prevailing trends, methodological contributions, and directions for future research. Particular attention is given to the types of models employed, the datasets used for training and validation, and the role of input variables and data-processing strategies. Across the included studies, ensemble learning methods (especially gradient boosting variants such as XGBoost), artificial neural networks, and hybrid architectures frequently achieved high predictive skill, with several models reporting test-set coefficients of determination approaching 0.9–0.96, indicating strong potential for capturing the influence of traffic, pavement structure, and climatic factors. Since these results are obtained from heterogeneous datasets and evaluation protocols, they are interpreted qualitatively rather than as strict cross-study rankings. Analysis of input variables revealed that pavement age and initial IRI were included in 91% (21 of 23) and 78% (18 of 23) of studies, respectively. Climatic variables such as the freezing index appeared in 57% (13 of 23), while traffic-related factors were considered in 65% (15 of 23). The findings underscore the importance of standardized, high-quality datasets, such as those from the Long-Term Pavement Performance (LTPP) program, along with data consistency, model interpretability, computational efficiency, and replicability in enhancing IRI prediction. Future research should focus on incorporating input variable selection techniques to identify the most influential predictors, thereby improving accuracy and robustness. Integrating these approaches with advanced non-linear data-driven models, coupled with robust hyperparameter optimization, holds considerable promise for strengthening the reliability of IRI prediction and supporting resilient pavement management strategies.

42 ENGINEERING↗

Combining DPG in space with DPG time-marching scheme for the transient advection-reaction equation

In this article, we present a general methodology to combine the Discontinuous PetrovGalerkin (DPG) method in space and time in the context of methods of lines for transient advection-reaction problems. We first introduce a semidiscretization in space with a DPG method redefining the ideas of optimal testing and practicality of the method in this context. Then, we apply the recently developed DPG-based time-marching scheme, which is of exponential-type, to the resulting system of Ordinary Differential Equations (ODEs). We also discuss how to efficiently compute the action of the exponential of the matrix coming from the space semidiscretization without assembling the full matrix. Finally, we verify the proposed method for 1D+time advection-reaction problems showing optimal convergence rates for smooth solutions and more stable results for linear conservation laws comparing to the classical exponential integrators.

97 MATHEMATICS AND COMPUTING↗

Quantum Algorithm for Simulating Hamiltonian Dynamics with an Off-diagonal Series Expansion

We propose an efficient quantum algorithm for simulating the dynamics of general Hamiltonian systems. Our technique is based on a power series expansion of the time-evolution operator in its off-diagonal terms. The expansion decouples the dynamics due to the diagonal component of the Hamiltonian from the dynamics generated by its off-diagonal part, which we encode using the linear combination of unitaries technique. Our method has an optimal dependence on the desired precision and, as we illustrate, generally requires considerably fewer resources than the current state-of-the-art. We provide an analysis of resource costs for several sample models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

New Beam Loss Monitor for 12 GeV Upgrade

This paper describes a new VME based machine protection Beam Loss Monitor (BLM) signal processing board designed at Jefferson Lab to replace the current CAMAC based BLM board. The new eight-channel BLM signal processor has linear, logarithmic, and integrating amplifiers that simultaneously provide the optimal signal processing for each application. Amplified signals are digitized and then further processed through a Field Programmable Gate Array (FPGA). Combining both the diagnostic and machine protection functions in each channel allows the operator to tune-up and monitor beam operations while the machine protection is integrating the same signal. Other features include extensive built-in-self-test, fast shutdown interface (FSD), and 16-Mbit buffers for beam loss transient play-back. The new VME BLM board features high sensitivity, high resolution, and low cost per channel.

43 PARTICLE ACCELERATORS↗

Albany v 1.0

The Albany code is a general purpose finite element code for solving partial differential equations (PDEs). Albany is a research code that demonstrates how a PDE code can be built by interfacing many of the open-source software libraries that are released under Sandia's Trilinos project. Part of the mission of Albany is to be a testbed for new Trilinos libraries, to refine their methods, usability, and interfaces. Albany also serves as a demonstration code on how to build an application code against an installed Trilinos project. Because of this, Albany is a desirable starting point for new code development efforts that wish to make heavy use of Trilinos. The physics solved in Albany are currently only very academic problems, such as heat transfer, linear elasticity, and nonlinear elasticity. Albany includes hooks to optimization and uncertainty quantification algorithms, including those in the Dakota toolkit.

Source record↗

Signal Processing Board for Beam Loss Monitors

This paper describes a new VME based machine protection Beam Loss Monitor (BLM) signal processing board designed at Jefferson Lab which features high sensitivity, high resolution, and low cost per channel. This double-wide VME board provides eight-channel signal processing with each channel having linear, logarithmic, and integrating amplifiers that simultaneously provide the optimal signal processing for both machine protection and beam diagnostics. Amplified signals are independently sampled by 16-bit, fast ADCs and then further processed through a Field Programmable Gate Array (FPGA). It also has features of fast shutdown interface (FSD), beam sync interface, built-in-self-test, remotely controlled bias signals, and on-board memory buffer. The initial experimental test shows that the BLM board has fast response (<< 1us) for integrating and wide dynamic range from 10 nA to 1 mA (>50 dB) for logarithmic signals. The board is suitable for signal processing from photomultiplier (PMT) and ion chamber detectors. Notice: Authored by Jefferson Science Associates, LLC under U.S. DOE Contract No. DE-AC05-06OR23177. The U.S. Government retains a non-exclusive, paid-up, irrevocable, world-wide license to publish or reproduce this manuscript for U.S. Government purposes.

Yan, Jianxun↗

Dictionary construction in sparse methods for image restoration

Sparsity-based methods have achieved very good performance in a wide variety of image restoration problems, including denoising, inpainting, super-resolution, and source separation. These methods are based on the assumption that the image to be reconstructed may be represented as a superposition of a few known components, and the appropriate linear combination of components is estimated by solving an optimization such as Basis Pursuit De-Noising (BPDN). Considering that the K-SVD constructs a dictionary which has been optimised for mean performance over a training set, it is not too surprising that better performance can be achieved by selecting a custom dictionary for each individual block to be reconstructed. The nearest neighbor dictionary construction can be understood geometrically as a method for estimating the local projection into the manifold of image blocks, whereas the K-SVD dictionary makes more sense within a source-coding framework (it is presented as a generalization of the k-means algorithm for constructing a VQ codebook), is therefore, it could be argued, less appropriate in principle, for reconstruction problems. One can, of course, motivate the use of the K-SVD in reconstruction application on practical grounds, avoiding the computational expense of constructing a different dictionary for each block to be denoised. Since the performance of the nearest neighbor dictionary decreases when the dictionary becomes sufficiently large, this method is also superior to the approach of utilizing the entire training set as a dictionary (and this can also be understood within the image block manifold model). In practical terms, the tradeoff is between the computational cost of a nearest neighbor search (which can be achieved very efficiently), or of increased cost at the sparse optimization.

99 GENERAL AND MISCELLANEOUS↗

cis-trans Germanium chains in the intermetallic compounds ALi{sub 1-x}In{sub x}Ge{sub 2} and A{sub 2}(Li{sub 1-x}In{sub x}){sub 2}Ge{sub 3} (A=Sr, Ba, Eu)-experimental and theoretical studies

Two types of strontium-, barium- and europium-containing germanides have been synthesized using high temperature reactions and characterized by single-crystal X-ray diffraction. All reported compounds also contain mixed-occupied Li and In atoms, resulting in quaternary phases with narrow homogeneity ranges. The first type comprises EuLi{sub 0.91(1)}In{sub 0.09}Ge{sub 2}, SrLi{sub 0.95(1)}In{sub 0.05}Ge{sub 2} and BaLi{sub 0.99(1)}In{sub 0.01}Ge{sub 2}, which crystallize in the orthorhombic space group Pnma (BaLi{sub 0.9}Mg{sub 0.1}Si{sub 2} structure type, Pearson code oP16). The lattice parameters are a=7.129(4)-7.405(4) A; b=4.426(3)-4.638(2) A; and c=11.462(7)-11.872(6) A. The second type includes Eu{sub 2}Li{sub 1.36(1)}In{sub 0.64}Ge{sub 3} and Sr{sub 2}Li{sub 1.45(1)}In{sub 0.55}Ge{sub 3}, which adopt the orthorhombic space group Cmcm (Ce{sub 2}Li{sub 2}Ge{sub 3} structure type, Pearson code oC28) with lattice parameters a=4.534(2)-4.618(2) A; b=19.347(8)-19.685(9) A; and c=7.164(3)-7.260(3) A. The polyanionic sub-structures in both cases feature one-dimensional Ge chains with alternating Ge-Ge bonds in cis- and trans-conformation. Theoretical studies using the tight-binding linear muffin-tin orbital (LMTO) method provide the rationale for optimizing the overall bonding by diminishing the {pi}-p delocalization along the Ge chains, accounting for the experimentally confirmed substitution of Li forIn. -- Graphical abstract: Presented are the single-crystal structures of two types of closely related intermetallics, as well as their band structures, calculated using tight-binding linear muffin-tin orbital (TB-LMTO-ASA) method. Display Omitted

36 MATERIALS SCIENCE↗

Machine learning-enabled prediction of chemical durability of A 2 B 2 O 7 pyrochlore and fluorite

Pyrochlore-structure type and its derivative in a general formula A 2 B 2 O 7 (A = rare earth elements and actinides; B = Ti, Sn, Zr, Hf, Pb, Si, etc.) display excellent structural flexibility and rich crystal chemistry as promising nuclear waste form materials capable of immobilizing actinides and fission products. It is essential to understand these materials’ chemical durability and element release of radionuclides in order to evaluate their performance in near-field environment. However, it is a formidable grand technological challenge to experimentally perform durability testing across hundreds of thousands of possibilities resulting from their extreme compositional complexities due to cation substitutions at both A and B-sites. In this work, we demonstrate a machine learning approach to determine the key materials parameters and structural characteristics governing the leaching behaviors from a small set of selected compositions as model systems, enabling a science-based prediction of their chemical durability that can be extended to a wide range of chemical compositions. The combination of four key structural characteristics and materials parameters, including ionic radius size difference , ionic potential difference , electronegativity difference , and lattice parameter , creates features an optimized prediction of the chemical durability. Two machine learning models, linear regression and Kernel ridge regression models, are trained on the randomly-split training dataset derived from the experimentally-determined elemental release rates, and subsequently tested on the testing dataset. The predicted leaching rates from both machine learning models show an excellent agreement with the experimental data, demonstrating the feasibility of rapidly evaluating the material properties of new compositions. These results highlight the immense potential of synergizing informatics through machine learning-based models and well-controlled experiments of selected model systems to accelerate materials design and discovery with optimized compositions and performance of promising materials for effective nuclear waste management.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗