Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Smoothing methods”

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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

A Sparse and Low Rank Penalized Signal Decomposition Model with Constraints: Anomaly Detection in PV Systems

Recently, robust PCA has seen its wide application in various industries for its ability to perform the task of anomaly detection. The essence of robust PCA approach is to break down the signal into a low rank component and sparse component. In many applications, a simple breakdown of the signal without accounting for the signs of low rank components and sparse components would violate the physical constraints of the decomposed signal. In addition, often times, the signals in the real world collected for a long duration has smooth changes within a day and between days. As an example, the power signals collected in a photovoltaic (PV) system are cyclostationary, exhibiting these characteristics. Neglecting the smoothness of signals would result in miss detection of anomalous signals which are smooth within a day but non-smooth between days and vice versa. In this paper, we developed a signal decomposition approach for the purpose of anomaly detection based on the idea of low rank and sparse decomposition taking into consideration the signs of the decomposed low rank and sparse components and the within-day and between-day smooth changes in the original signals. The proposed unsupervised approach for fault detection eliminates the need for faulty samples required by other machine learning methods. It does not require the full I-V characteristics to work. Furthermore, there is no need for complex modelling of PV systems as in the case of power loss analysis. Using Monte Carlo simulations, we demonstrate the ability of our proposed approach for detecting anomalies of different duration and severity in PV systems.

14 SOLAR ENERGY↗
DOE OSTI2022

A nonsmooth nonconvex optimization algorithm for two-stage optimization problems

An optimization algorithm for a group of nonsmooth nonconvex problems inspired by two-stage stochastic programming problems is proposed. The main challenges for these problems include (1) the problems lack the popular lower-type properties such as prox-regularity assumed in many nonsmooth nonconvex optimization algorithms, (2) the objective can not be analytically expressed and (3) the evaluation of function values and subgradients are computationally expensive. To address these challenges, this report first examines the properties that exist in many two-stage problems, specifically upper-C 2 objectives. Then, we show that quadratic penalty method for securityconstrained alternating current optimal power flow (SCACOPF) contingency problems can make the contingency solution functions upper-C 2 . Based on these observations, a simplified bundle algorithm that bears similarity to sequential quadratic programming (SQP) method is proposed. It is more efficient in implementation and computation compared to conventional bundle methods. Global convergence analysis of the algorithm is presented under novel and reasonable assumptions. The proposed algorithm therefore fills the gap of theoretical convergence for smoothed SCACOPF problems. The inconsistency that might arise in our treatment of the constraints are addressed through a penalty algorithm whose convergence analysis is also provided. Finally, theoretical capabilities and numerical performance of the algorithm are demonstrated through numerical examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Unified Universal Control and Coordination of Inverter-Based Resources, and Validation for a PV + Battery Hybrid Plant

As renewable energy deployment grows, hybrid power plants (HPPs) combining photovoltaic (PV) and battery systems must evolve to offer both energy and grid stability services. These systems typically include a mix of grid-following (GFL) and grid-forming (GFM) inverters, presenting unique coordination and control challenges. This Department of Energy–funded project developed and validated a Unified Universal Control and Coordination (UUCC) framework for such PV + battery hybrid plants, enabling seamless and stable operation, including ultrafast black start, autonomous synchronization, and robust frequency and voltage regulation, under different grid conditions. The project significantly advanced the understanding of inverter-based resource (IBR) control by developing and validating three complementary system-level approaches for hybrid GFL/GFM operation: 1. A combined Virtual Resistance (VR)-based GFL and Virtual Oscillator Control (VOC)-based GFM method, where each inverter type is governed by a specialized control strategy. Together, these achieve stable, fast-response coordination, eliminating inrush current and enabling smooth black start and grid synchronization across a wide range of grid strengths. 2. A Deadbeat-based UUCC strategy, which uses discrete-time, switching-cycle-level control for both GFL and GFM inverters. This approach replaces traditional PI/PLL control with a control parameter-free, high-bandwidth framework that supports stable LVRT and instantaneous synchronization under all conditions. 3. A benchmark comparison with Siemens’ commercial GFM microgrid controller, which provided a fast baseline platform. The commercial approach decoupled v & f control was implemented on a commercial microgrid controller.The baseline commercial benchmark helped highlight superior transient response and black start performance offered by the deadbeat and VOC approaches. These technical contributions offer substantial improvements over conventional inverter control schemes, which often rely on slow phase-locked loop (PLL)-based synchronization, require careful control parameters tuning, and prone to unstable in weak grids with GFL inverters and in stiff grid with GFM inverters therefore challenging for hybrid GFL+GFM under all grid conditions. The deadbeat-based UUCC framework enables simpler, faster, and more robust operation of hybrid IBR systems using wide-bandgap (WBG) devices such as SiC power semiconductors. The rapid expansion of hybrid distributed energy resources (DERs), including residential and commercial PV-BESS installations such as Tesla Powerwall, PV with vehicle-to-grid (V2G) capability, and other integrated configurations, presents complex operational challenges for medium-voltage radial distribution feeders. These networks are subject to frequent disturbances such as faults, switching operations, rapid reclosing sequences, and feeder reconfigurations, all of which introduce dynamic stress on IBRs. In addition, planned feeder segmentation and deliberate islanding for resilience will require DERs that can autonomously perform blackstart, establish voltage and frequency references, and resynchronize with the main grid. The advanced deadbeat-based UUCC control and blackstart functionalities developed in this project directly address these requirements, enabling decentralized and autonomous operation of inverter-dominated DERs in distribution systems under a wide range of fault and reconfiguration scenarios. From a public benefit perspective, these innovations enable more reliable and cost-effective integration of renewable energy into distribution networks. The ability to autonomously black start and stabilize grids under varying grid conditions support accelerates recovery from outages and support decentralized resilient energy systems. By reducing system complexity and improving performance, this project lays critical groundwork for future inverter-dominated power grids that are clean, reliable, and accessible to all.

14 SOLAR ENERGY↗
DOE OSTI2023

A Method to Probe the Interfaces in La2−xSrxCuO4-LaSrAlO4-La2−xSrxCuO4 Trilayer Junctions

C-axis trilayer cuprate Josephson junctions are essential for basic science and digital circuit applications of high-temperature superconductors. We present a method for probing the interface perfection in La2−xSrxCuO4 (LSCO)-LaSrAlO4 (LSAO)-La2−xSrxCuO4 trilayer junctions. A series of LSCO-LSAO superlattices with atomically smooth surfaces and sharp interfaces were grown by the atomic-layer-by-layer molecular beam epitaxy (ALL-MBE) technique. We have systematically varied the thickness of LSCO and LSAO layers with monolayer precision. By studying the mutual inductance and electrical transport in these superlattices, we detect the non-superconducting (“dead”) layers at the interfaces and quantify their thicknesses. Our results indicate that two optimally doped LSCO monolayers just above and below the one monolayer LSAO barrier are no longer superconducting, rendering the actual barrier thickness of five monolayers. Next, we have shown that introducing a protective highly-overdoped LSCO layer reduces the thickness of dead layers by one or two monolayers.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Improved Models of R Coronae Borealis Stars

We present an improved numerical method to model subsolar He+CO-WD merger progenitors of R Corona Borealis stars that builds on our previous work. These improvements include a smooth entropy transition from the core to the envelope of the post-merger, inclusion of single-zone nucleosynthesis to mimic the effects of burning during the merger event, and post-processing the models with a larger nuclear network for analysis of s-process nucleosynthesis. We perform a parameter study to understand the effects of the entropy transition, peak temperature, and overshooting on our models. The models that best agree with observations of R Corona Borealis stars are processed with a much larger nuclear network to investigate s-process nucleosynthesis and the dredge-up of s-process products into the outer envelope in detail. We present a model with a significant enhancement in s-process elements, which also agrees with observed surface abundances and isotopic ratios of 16 O/ 16 O and C/O between 1 and 10. Finally, we find that the neutron exposure and initial neutron densities this model requires to obtain such an enhancement are much more consistent with i-process nucleosynthesis.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

An efficient reconstruction algorithm for diffusion on triangular grids using the nodal discontinuous Galerkin method

High-energy-density (HED) hydrodynamics studies such as those relevant to inertial confinement fusion and astrophysics require highly disparate densities, temperatures, viscosities, and other diffusion parameters over relatively short spatial scales. This presents a challenge for high-order accurate methods to effectively resolve the hydrodynamics at these scales, particularly in the presence of highly disparate diffusion. A significant volume of engineering and physics applications use an unstructured discontinuous Galerkin (DG) method developed based on the finite element mesh generation and algorithmic framework. This work discusses the application of an affine reconstructed nodal DG method for unstructured grids of triangles. Solving the diffusion terms in the DG method is non-trivial due to the solution representations being piecewise continuous. Hence, the diffusive flux is not defined on the interface of elements. The proposed numerical approach reconstructs a smooth solution in a parallelogram that is enclosed by the quadrilateral formed by two adjacent triangle elements. The interface between these two triangles is the diagonal of the enclosed parallelogram. Similar to triangles, the mapping of parallelograms from a physical domain to a reference domain is an affine mapping, which is necessary for an accurate and efficient implementation of the numerical algorithm. Thus, all computations can still be performed on the reference domain, which promotes efficiency in computation and storage. This reconstruction does not make assumptions on choice of polynomial basis. Reconstructed DG algorithms have previously been developed for modal implementations of the convection–diffusion equations. However, to the best of the authors’ knowledge, this is the first practical guideline that has been proposed for applying the reconstructed algorithm on a nodal discontinuous Galerkin method with a focus on accuracy and efficiency. As a result, the algorithm is demonstrated on a number of benchmark cases as well as a challenging substantive problem in HED hydrodynamics with highly disparate diffusion parameters.

Computational efficiency↗
DOE OSTI2020

The second-generation Shifted Boundary Method and its numerical analysis

Recently, the Shifted Boundary Method (SBM) was proposed within the class of unfitted (or immersed, or embedded) finite element methods. By reformulating the original boundary value problem over a surrogate (approximate) computational domain, the SBM avoids integration over cut cells and the associated problematic issues regarding numerical stability and matrix conditioning. Accuracy is maintained by modifying the original boundary conditions using Taylor expansions. Hence the name of the method, that shifts the location and values of the boundary conditions. In this article, we present enhanced variational SBM formulations for the Poisson and Stokes problems with improved flexibility and robustness. These simplified variational forms allow to relax some of the assumptions required by the mathematical proofs of stability and convergence of earlier implementations. First, we show that these new SBM implementations can be proved asymptotically stable and convergent even without the rather restrictive assumption that the inner product between the normals to the true and surrogate boundaries is positive. Second, we show that it is not necessary to introduce a stabilization term involving the tangential derivatives of the solution at Dirichlet boundaries, therefore avoiding the calibration of an additional stabilization parameter. Finally, we prove enhanced L 2 -estimates without the cumbersome assumption – of earlier proofs – that the surrogate domain is convex. Instead we rely on a conventional assumption that the boundary of the true domain is smooth, which can also be replaced by requiring convexity of the true domain. The aforementioned improvements open the way to a more general and efficient implementation of the Shifted Boundary Method, particularly in complex three-dimensional geometries. We complement these theoretical developments with numerical experiments in two and three dimensions.

42 ENGINEERING↗
DOE OSTI2022

A novel hardmask-to-substrate pattern transfer method for creating 3D, multi-level, hierarchical, high aspect-ratio structures for applications in microfluidics and cooling technologies

Abstract This letter solves a major hurdle that mars photolithography-based fabrication of micro-mesoscale structures in silicon. Conventional photolithography is usually performed on smooth, flat wafer surfaces to lay a 2D design and subsequently etch it to create single-level features. It is, however, unable to process non-flat surfaces or already etched wafers and create more than one level in the structure. In this study, we have described a novel cleanroom-based process flow that allows for easy creation of such multi-level, hierarchical 3D structures in a substrate. This is achieved by introducing an ultra-thin sacrificial silicon dioxide hardmask layer on the substrate which is first 3D patterned via multiple rounds of lithography. This 3D pattern is then scaled vertically by a factor of 200–300 and transferred to the substrate underneath via a single shot deep etching step. The proposed method is also easily characterizable—using features of different topographies and dimensions, the etch rates and selectivities were quantified; this characterization information was later used while fabricating specific target structures. Furthermore, this study comprehensively compares the novel pattern transfer technique to already existing methods of creating multi-level structures, like grayscale lithography and chip stacking. The proposed process was found to be cheaper, faster, and easier to standardize compared to other methods—this made the overall process more reliable and repeatable. We hope it will encourage more research into hybrid structures that hold the key to dramatic performance improvements in several micro-mesoscale devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Simulation of crumpled sheets via alternating quasistatic and dynamic representations

In this work, we present a method for simulating the large-scale deformation and crumpling of thin, elastoplastic sheets. Motivated by the physical behavior of thin sheets during crumpling, two different formulations of the governing equations of motion are used: (1) a quasistatic formulation that effectively describes smooth deformations, and (2) a fully dynamic formulation that captures large changes in the sheet's velocity. The former is a differential-algebraic system of equations integrated implicitly in time, while the latter is a set of ordinary differential equations (ODEs) integrated explicitly. We adopt a hybrid integration scheme to adaptively alternate between the quasistatic and dynamic representations as appropriate. Further, we demonstrate the capacity of this method to effectively simulate a variety of crumpling phenomena. Finally, we show that statistical properties, notably the accumulation of creases under repeated loading, as well as the area distribution of facets, are consistent with experimental observations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Learning Optimal Multigrid Smoothers via Neural Networks

Multigrid methods are one of the most efficient techniques for solving large sparse linear systems arising from partial differential equations (PDEs) and graph Laplacians from machine learning applications. One of the key components of multigrid is smoothing, which aims at reducing high-frequency errors on each grid level. However, finding optimal smoothing algorithms is problem-dependent and can impose challenges for many problems. In this paper, we propose an efficient adaptive framework for learning optimized smoothers from operator stencils in the form of convolutional neural networks (CNNs). Here, the CNNs are trained on small-scale problems from a given type of PDEs based on a supervised loss function derived from multigrid convergence theories and can be applied to large-scale problems of the same class of PDEs. Numerical results on anisotropic rotated Laplacian problems and variable coefficient diffusion problems demonstrate improved convergence rates and solution time compared with classical hand-crafted relaxation methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Image-Based Digital Twin for Assessing the Coupled Electro-Chemo-Mechanical Behavior of Li-Ion Batteries

In energy storage materials, strong electrochemical-mechanical coupling and highly anisotropic material properties contribute to the formation and propagation of micro-cracking during charge/discharge cycling, resulting in reduced performance and service life. In this work, a digital twin is created to investigate the performance of a Li-ion battery cathode and simulate degradation accumulation. Pixel-based model construction is used to represent the complex material geometries from microstructural images supplied by the National Renewable Energy Laboratory (NREL). Because of the expected large deformation and crack opening, the reproducing kernel particle method (RKPM), a meshfree method with discretization at the image pixels, is used to approximate the field variables: electrostatic potential, concentration, and displacement. An interface modified reproducing kernel (IM-RK) is constructed by scaling a smooth kernel function with an interface-distance function to achieve strategic discontinuity types (i.e. weak discontinuities for strain discontinuities and strong discontinuities for cracks) and alleviate Gibbs oscillations near these transition zones. The discrete nature of the images' pixel points is employed throughout the model and approximation construction. The mechanical model is verified using an image-based microstructure under tensile loading. A transient electro-chemo-mechanical coupled simulation is performed to evaluate the potential micro-cracking induced degradation of the battery cathode material subjected to charge/discharge cycling.

battery degradation↗
DOE OSTI2021

An adaptive Hessian approximated stochastic gradient MCMC method

Bayesian approaches have been successfully integrated into training deep neural networks. One popular family is stochastic gradient Markov chain Monte Carlo methods (SG-MCMC), which have gained increasing interest due to their ability to handle large datasets and the potential to avoid overfitting. Although standard SG-MCMC methods have shown great performance in a variety of problems, they may be inefficient when the random variables in the target posterior densities have scale differences or are highly correlated. Here, we present an adaptive Hessian approximated stochastic gradient MCMC method to incorporate local geometric information while sampling from the posterior. The idea is to apply stochastic approximation (SA) to sequentially update a preconditioning matrix at each iteration. The preconditioner possesses second-order information and can guide the random walk of a sampler efficiently. Instead of computing and saving the full Hessian of the log posterior, we use limited memory of the samples and their stochastic gradients to approximate the inverse Hessian-vector multiplication in the updating formula. Moreover, by smoothly optimizing the preconditioning matrix via SA, our proposed algorithm can asymptotically converge to the target distribution with a controllable bias under mild conditions. To reduce the training and testing computational burden, we adopt a magnitude-based weight pruning method to enforce the sparsity of the network. Our method is user-friendly and demonstrates better learning results compared to standard SG-MCMC updating rules. The approximation of inverse Hessian alleviates storage and computational complexities for large dimensional models. Numerical experiments are performed on several problems, including sampling from 2D correlated distribution, synthetic regression problems, and learning the numerical solutions of heterogeneous elliptic PDE. The numerical results demonstrate great improvement in both the convergence rate and accuracy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

SANE: strategic autonomous non-smooth exploration for multiple optima discovery in multi-modal and non-differentiable black-box functions

Both computational and experimental material discovery bring forth the challenge of exploring multidimensional and multimodal parameter spaces, such as phase diagrams of Hamiltonians with multiple interactions, composition spaces of combinatorial libraries, material structure image spaces, and molecular embedding spaces. Often these systems are black-boxes and time-consuming to evaluate, which resulted in strong interest towards active learning methods such as Bayesian optimization (BO). However, these systems are often noisy which make the black box function severely multi-modal and non-differentiable, where a vanilla BO can get overly focused near a single or faux optimum, deviating from the broader goal of scientific discovery. To address these limitations, here we developed Strategic Autonomous Non-Smooth Exploration (SANE) to facilitate an intelligent Bayesian optimized navigation with a proposed cost-driven probabilistic acquisition function to find multiple global and local optimal regions, avoiding the tendency to becoming trapped in a single optimum. To distinguish between a true and false optimal region due to noisy experimental measurements, a human (domain) knowledge driven dynamic surrogate gate is integrated with SANE. We implemented the gate-SANE into pre-acquired piezoresponse spectroscopy data of a ferroelectric combinatorial library with high noise levels in specific regions, and piezoresponse force microscopy (PFM) hyperspectral data. SANE demonstrated better performance than classical BO to facilitate the exploration of multiple optimal regions and thereby prioritized learning with higher coverage of scientific values in autonomous experiments. Our work showcases the potential application of this method to real-world experiments, where such combined strategic and human intervening approaches can be critical to unlocking new discoveries in autonomous research.

Biswas, Arpan [University of Tennessee, Knoxville,↗
DOE OSTI2023

11-th order of accuracy for numerical solution of 3-D Poisson equation with irregular interfaces on unfitted Cartesian meshes

For the first time the optimal local truncation error method (OLTEM) with 125-point stencils and unfitted Cartesian meshes has been developed in the general 3-D case for the Poisson equation for heterogeneous materials with smooth irregular interfaces. The 125-point stencils equations that are similar to those for quadratic finite elements are used for OLTEM. The interface conditions for OLTEM are imposed as constraints at a small number of interface points and do not require the introduction of additional unknowns, i.e., the sparse structure of global discrete equations of OLTEM is the same for homogeneous and heterogeneous materials. The stencils coefficients of OLTEM are calculated by the minimization of the local truncation error of the stencil equations. These derivations include the use of the Poisson equation for the relationship between the different spatial derivatives. Such a procedure provides the maximum possible accuracy of the discrete equations of OLTEM. In contrast to known numerical techniques with quadratic elements and third order of accuracy on conforming and unfitted meshes, OLTEM with the 125-point stencils provides 11-th order of accuracy, i.e., an extremely large increase in accuracy by 8 orders for similar stencils. The numerical results show that OLTEM yields much more accurate results than high-order finite elements with much wider stencils. The increased numerical accuracy of OLTEM leads to an extremely large increase in computational efficiency. Additionally, a new post-processing procedure with the 125-point stencil has been developed for the calculation of the spatial derivatives of the primary function. The post-processing procedure includes the minimization of the local truncation error and the use of the Poisson equation. It is demonstrated that the use of the partial differential equation (PDE) for the 125-point stencils improves the accuracy of the spatial derivatives by 6 orders compared to post-processing without the use of PDE as in existing numerical techniques. At an accuracy of 0.1% for the spatial derivatives, OLTEM reduces the number of degrees of freedom by 900 - 4∙10 6 times compared to quadratic finite elements. The developed post-processing procedure can be easily extended to unstructured meshes and can be independently used with existing post-processing techniques (e.g., with finite elements).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Revealing the Predominant Surface Facets of Rough Cu Electrodes under Electrochemical Conditions

Metal electrodes with rough surfaces are frequently found to convert CO or CO 2 to hydrocarbons and oxygenates with high selectivity and at high reaction rates in comparison with their smooth counterparts. The atomic-level morphology of a rough electrode is likely one key factor responsible for its comparatively high catalytic selectivity and activity. However, few methods are capable of probing the atomic-level structure of rough metal electrodes under electrocatalytic conditions. As a result, the nuances in the atomic-level surface morphology that control the catalytic characteristics of these electrodes have remained largely unexplored. Because the C≡O stretching frequency of atop-bound CO (CO atop ) depends on the coordination of the underlying metal atom, the IR spectrum of this reaction intermediate on the copper electrode could, in principle, provide structural information about the catalytic surface during electrolysis. However, other effects, such as dynamic dipole coupling, easily obscure the dependence of the frequency on the surface morphology. Further, in the limit of low CO atop coverage, where coupling effects are small, the C≡O stretching frequencies of CO atop on Cu(111) and Cu(100) facets are virtually identical. Therefore, on the basis of the C≡O stretching frequency, it is not straightforward to distinguish between these two ubiquitous surface facets, which exhibit vastly different CO reduction activities. Herein, we show that key features of the atomic-level surface morphology of rough copper electrodes can be inferred from the potential dependence of the line shape of the C≡O stretching band of CO atop . Specifically, we compared two types of rough copper thin-film electrodes that are routinely employed in the context of surface-enhanced infrared absorption spectroscopy (SEIRAS). We found that copper films that are electrochemically deposited on Si-supported Au films (CuAu–Si) are poor catalysts for the reduction of CO to ethylene in comparison to copper films (Cu–Si) that are electrolessly deposited onto Si crystals. As quantified by differential electrochemical mass spectrometry (DEMS), the onset potential for ethylene is ~200 ± 65 mV more cathodic for CuAu–Si than that for Cu–Si. To reveal the origin of the disparate catalytic properties of Cu–Si and CuAu–Si, we probed the surfaces of the electrodes with cyclic voltammetry (CV) and SEIRAS. The CV characterization suggests that the (111) surface facet predominates on CuAu–Si, whereas the (100) facet is more common on Cu–Si. SEIRAS reveals that the line shape of the C≡O stretching of CO atop is composed of two bands that are attributable to CO atop on terrace and defect sites. The different surface structures manifest themselves in the form of starkly different potential dependences of the line shape of the C≡O stretching mode of CO atop on the two types of electrodes. With a simple Boltzmann model that considers the different adsorption energies of CO atop on terrace and defect sites, and the resulting CO atop populations on terrace and defect sites, we deduced that the observed electrode-specific potential dependence of the line shape is consistent with the presence of different predominant terrace sites on the two types of films. This strategy for assessing the atomic-level morphology is not restricted to SEIRAS but could also be applied to the C≡O stretching bands recorded with surface-enhanced Raman spectroscopy (SERS), which is suitable for probing a wide range of rough copper electrodes. Therefore, with this work, we establish the potential dependence of the C≡O stretching band of CO atop as a probe of the atomic-level surface structure of rough metal electrodes under electrochemical conditions. When it is coupled with complementary techniques, this methodology provides essential structural information for further improvement in the reaction selectivity of rough metal electrodes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Deblurring galaxy images with Tikhonov regularization on magnitude domain

Abstract We propose a regularization-based deblurring method that works efficiently for galaxy images. The spatial resolution of a ground-based telescope is generally limited by seeing conditions and is much worse than space-based telescopes. This circumstance has generated considerable research interest in the restoration of spatial resolution. Since image deblurring is a typical inverse problem and often ill-posed, solutions tend to be unstable. To obtain a stable solution, much research has adopted regularization-based methods for image deblurring, but the regularization term is not necessarily appropriate for galaxy images. Although galaxies have an exponential or Sérsic profile, the conventional regularization assumes the image profiles to behave linearly in space. The significant deviation between the assumption and real situations leads to blurring of the images and smoothing out the detailed structures. Clearly, regularization on logarithmic domain, i.e., magnitude domain, should provide a more appropriate assumption, which we explore in this study. We formulate a problem of deblurring galaxy images by an objective function with a Tikhonov regularization term on a magnitude domain. We introduce an iterative algorithm minimizing the objective function with a primal–dual splitting method. We investigate the feasibility of the proposed method using simulation and observation images. In the simulation, we blur galaxy images with a realistic point spread function and add both Gaussian and Poisson noise. For the evaluation with the observed images, we use galaxy images taken by the Subaru HSC-SSP. Both of these evaluations show that our method successfully recovers the spatial resolution of the deblurred images and significantly outperforms the conventional methods. The code is publicly available from the GitHub 〈https://github.com/kzmurata-astro/PSFdeconv_amag〉.

Murata, Kazumi↗
DOE OSTI2024

E-PVT: enhanced position-velocity-time scheduler for computer-controlled optical finishing with comprehensive considerations of dynamics constraints, continuity and efficiency

Deterministic computer-controlled optical finishing is an essential approach for achieving high-quality optical surfaces. Its determinism and convergence rely heavily on precise and smooth motion control to guide the machine tool over an optical surface to correct residual errors. One widely supported and smooth motion control model is position-velocity-time (PVT), which employs piecewise cubic polynomials to describe positions. Our prior research introduced a PVT-based velocity scheduling method, demonstrating sub-nanometer level convergence in ion beam figuring (IBF) processes. However, three challenges remained. Firstly, this method relies on quadratic programming, resulting in computational intensiveness for dense tool paths. Secondly, the dynamics constraints and velocity and acceleration continuities are not comprehensively considered, limiting the full potential of PVT-based control. Thirdly, no compensation mechanism existed when dynamics constraints are exceeded. In this study, in response to these challenges, we proposed the Enhanced PVT (E-PVT) method, reducing the time complexity from O ( n 3 ) to O ( n ) while fully addressing dynamics constraints and continuities. A novel compensation method utilizing particle swarm optimization was proposed to address situations where dynamics constraints might be exceeded while maintaining the overall processing efficiency. Validation through simulation and experimentation confirmed the improved performance of E-PVT.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Image segmentation for analyzing galaxy-galaxy strong lensing systems

The goal of this Letter is to develop a machine learning model to analyze the main gravitational lens and detect dark substructure (subhalos) within simulated images of strongly lensed galaxies. Using the technique of image segmentation, we turn the task of identifying subhalos into a classification problem, where we label each pixel in an image as coming from the main lens, a subhalo within a binned mass range, or neither. Our network is only trained on images with a single smooth lens and either zero or one subhalo near the Einstein ring. On an independent test set with lenses with large ellipticities, quadrupole and octopole moments, and for source apparent magnitudes between 17–25, the area of the main lens is recovered accurately. On average, only 1.3% of the true area is missed and 1.2% of the true area is added to another part of the lens. In addition, subhalos as light as 10 8.5 M ⊙ can be detected if they lie in bright pixels along the Einstein ring. Furthermore, the model is able to generalize to new contexts it has not been trained on, such as locating multiple subhalos with varying masses or more than one large smooth lens.

79 ASTRONOMY AND ASTROPHYSICS↗