Search NASA⌕ Search

SEARCH · Search NASA

Results for “Local Method”

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

Vision-based localization for cooperative robot-CNC hybrid manufacturing

Wire and arc additive manufacturing (WAAM) has shown promise in recent years for producing large-scale parts with higher deposition rates than other additive processes. WAAM is often combined with subtractive machining to form a hybrid manufacturing process. This hybrid process can be realized by retrofitting computer numerical control (CNC) machines with deposition heads, adding spindles and deposition heads to robots, or developing part localization methods to transfer parts from an additive cell to a CNC machine. Here, a novel, robot-CNC hybrid configuration is introduced where a maneuverable robot is placed in front of a CNC machine to deposit material within the machine envelop. Furthermore, this method removes the need for part localization and the extensive machine modifications required for retrofitting; however, the problem of robot localization is also added. In this work, the effects of error in vision-based, contactless robot localization on machining parameters in a robot-machine hybrid process were studied. Performance was characterized on an implementation of this system using classical computer vision techniques. In addition, machining simulations were conducted to evaluate the effects of image-induced error on chip thickness, material removal rate, and machining allowance. Initial tests show that computer vision could adequately locate a robot for the hybrid WAAM process within .5 mm.

Hybrid manufacturing↗

First-principles residual resistivity using a locally self-consistent multiple scattering method

The locally self-consistent multiple scattering (LSMS) method can perform efficient first-principles calculations of systems with a large number of atoms. Here, in this paper, we combine the Kubo-Greenwood equation with LSMS, enabling us to calculate the first-principles residual resistivity of large systems. This has been implemented in the open-source code LSMS . We apply this method to selected pure elements and binary random alloys. The results compare well with experiment, and with values obtained from a first-principles effective medium technique (the Korringa-Kohn-Rostoker coherent potential approximation). We discuss future applications of this method to complex systems where other methods are not applicable.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Simple Test Functions in Meshless Local Petrov-Galerkin Methods

Two meshless local Petrov-Galerkin (MLPG) methods based on two different trial functions but that use a simple linear test function were developed for beam and column problems. These methods used generalized moving least squares (GMLS) and radial basis (RB) interpolation functions as trial functions. These two methods were tested on various patch test problems. Both methods passed the patch tests successfully. Then the methods were applied to various beam vibration problems and problems involving Euler and Beck's columns. Both methods yielded accurate solutions for all problems studied. The simple linear test function offers considerable savings in computing efforts as the domain integrals involved in the weak form are avoided. The two methods based on this simple linear test function method produced accurate results for frequencies and buckling loads. Of the two methods studied, the method with radial basis trial functions is very attractive as the method is simple, accurate, and robust.

Raju, Ivatury S.↗

Interpolation methods for shaped reflector analysis

The diffraction analysis of reflector surfaces which are described only at a discrete set of locations usually leads to the requirement of an interpolation to determine the surface characteristics over a continuum of locations. Two methods of interpolation, the global and the local methods, are presented. The global interpolation representation is a closed-form or series expression valid over the entire surface. The coefficients of a series expression are found by an integration of all of the raw data. Since the number of coefficients used to describe the surface is much smaller than the number of raw data points, the integration effectively provides a smoothing of the raw data. The local interpolation provides a closed-form expression for only a small area of the reflector surface. The subreflector is divided into sectors each of which has constant discretized data. Each area segment is then locally described by a two-dimensional quadratic surface. The second derivative data give the desired smoothed values.

Galindo-Israel, Victor↗

Interpolation Methods for GTD Analysis of Shaped Reflectors

The finding of smooth analytic representations for antenna reflector surfaces which are prescribed only by discretized data obtained by various synthesis methods is examined. Frequently the data are distributed in a nonuniform grid and contain noise. The smoothness required is to C sub 1 for physical optics diffraction analysis and to C sub 2 for geometrical theory of diffraction (GTD) analysis. The GTD analysis approach requires a surface description which returns data very rapidly. Two methods of interpolation, the global and the local methods, are discussed. They each have advantages and disadvantages; characteristics are discussed and examples are presented.

Galindo-Israel, V.↗

ULTRA: Underwater Localization for Transit and Reconnaissance Autonomy

This software addresses the issue of underwater localization of unmanned vehicles and the inherent drift in their onboard sensors. The software gives a 2 to 3 factor of improvement over the state-of-the-art underwater localization algorithms. The software determines the localization (position, heading) of an AUV (autonomous underwater vehicle) in environments where there is no GPS signal. It accomplishes this using only the commanded position, onboard gyros/accelerometers, and the bathymetry of the bottom provided by an onboard sonar system. The software does not rely on an onboard bathymetry dataset, but instead incrementally determines the position of the AUV while mapping the bottom. In order to enable long-distance underwater navigation by AUVs, a localization method called ULTRA uses registration of the bathymetry data products produced by the onboard forward-looking sonar system for hazard avoidance during a transit to derive the motion and pose of the AUV in order to correct the DR (dead reckoning) estimates. The registration algorithm uses iterative point matching (IPM) combined with surface interpolation of the Iterative Closest Point (ICP) algorithm. This method was used previously at JPL for onboard unmanned ground vehicle localization, and has been optimized for efficient computational and memory use.

Huntsberger, Terrance L.↗

Localization of fluorescent targets in deep tissue with expanded beam illumination for studies of cancer and the brain

Imaging fluorescence through millimeters or centimeters of tissue has important in vivo applications, such as guiding surgery and studying the brain. Often, the important information is the location of one of more optical reporters, rather than the specifics of the local geometry, motivating the need for a localization method that provides this information. We present an optimization approach based on a diffusion model for the fast localization of fluorescent inhomogeneities in deep tissue with expanded beam illumination that simplifies the experiment and the reconstruction. We show that the position of a fluorescent inhomogeneity can be estimated while assuming homogeneous tissue parameters and without having to model the excitation profile, reducing the computational burden and improving the utility of the method. We perform two experiments as a demonstration. First, a tumor in a mouse is localized using a near infrared folate-targeted fluorescent agent (OTL38). This result shows that localization can quickly provide tumor depth information, which could reduce damage to healthy tissue during fluorescence-guided surgery. Second, another near infrared fluorescent agent (ATTO647N) is injected into the brain of a rat, and localized through the intact skull and surface tissue. This result will enable studies of protein aggregation and neuron signaling.

60 APPLIED LIFE SCIENCES↗

Accuracy enhancements for overset grids using a defect correction approach

A defect-correction approach is investigated as a means of enhancing the accuracy of flow computations on overset grids. Typically, overset-grid techniques process and pass information only at grid boundaries. In the current approach, error corrections at all overlapped interior points are injected between grids by using a defect-correction scheme. In some cases this is found to enhance the overall accuracy of the overset-grid method. Locally refined overset grids can be used to provide an efficient solution-adaptation method. The defect correction can also be ultilized as an error-correction technique for a coarse grid by evaluating the residual using a fine base grid, but solving the implicit equations only on the coarse grid. Numerical examples include an accuracy and dissipation study of an unsteady decaying vortex flow, the flow over a NACA 0012 airfoil, and the flow over a mulit-element high-lift airfoil.

Rogers, Stuart E.↗

Demystifying Piecewise and Localized Scatter Correction Methods

Multiplicative scatter is a common source of noise in near-infrared spectroscopy and other related instrumental techniques. A wide variety of methods are commonly used for the correction of multiplicative scatter. However, the majority of such methods assume that the parameters that describe the scatter are constant throughout the measured spectrum, which is often not the case. This work investigates a family of methods that perform scatter correction using local regions of neighboring wavelengths in order to better account for wavelength-dependent scattering. The methods in question are piecewise standard normal variate, localized standard normal variate, piecewise multiplicative scatter correction, and localized multiplicative scatter correction. This work describes the theoretical and algorithmic foundations of the family of local region-based scatter correction methods and compares their application and optimization at a qualitative and quantitative level using several datasets.

NIR spectroscopy↗

Learning local equivariant representations for large-scale atomistic dynamics

Abstract A simultaneously accurate and computationally efficient parametrization of the potential energy surface of molecules and materials is a long-standing goal in the natural sciences. While atom-centered message passing neural networks (MPNNs) have shown remarkable accuracy, their information propagation has limited the accessible length-scales. Local methods, conversely, scale to large simulations but have suffered from inferior accuracy. This work introduces Allegro, a strictly local equivariant deep neural network interatomic potential architecture that simultaneously exhibits excellent accuracy and scalability. Allegro represents a many-body potential using iterated tensor products of learned equivariant representations without atom-centered message passing. Allegro obtains improvements over state-of-the-art methods on QM9 and revMD17. A single tensor product layer outperforms existing deep MPNNs and transformers on QM9. Furthermore, Allegro displays remarkable generalization to out-of-distribution data. Molecular simulations using Allegro recover structural and kinetic properties of an amorphous electrolyte in excellent agreement with ab-initio simulations. Finally, we demonstrate parallelization with a simulation of 100 million atoms.

74 ATOMIC AND MOLECULAR PHYSICS↗

The Local Discontinuous Galerkin Method for Time-Dependent Convection-Diffusion Systems

In this paper, we study the Local Discontinuous Galerkin methods for nonlinear, time-dependent convection-diffusion systems. These methods are an extension of the Runge-Kutta Discontinuous Galerkin methods for purely hyperbolic systems to convection-diffusion systems and share with those methods their high parallelizability, their high-order formal accuracy, and their easy handling of complicated geometries, for convection dominated problems. It is proven that for scalar equations, the Local Discontinuous Galerkin methods are L(sup 2)-stable in the nonlinear case. Moreover, in the linear case, it is shown that if polynomials of degree k are used, the methods are k-th order accurate for general triangulations; although this order of convergence is suboptimal, it is sharp for the LDG methods. Preliminary numerical examples displaying the performance of the method are shown.

Cockburn, Bernardo↗

An extension of the localized artificial diffusivity method for immiscible and high density ratio flows

The localized artificial diffusivity (LAD) method is widely regarded as the preferred multi-material regularization scheme for the compact finite difference method, because it is conservative, easy to implement, and generally robust for a wide range of multi-material problems. However, traditional LAD methods face significant challenges when applied to flows with large density ratios and when maintaining thermodynamic equilibrium across material interfaces. These limitations arise from the formulation of the artificial diffusivity flux and the reliance on enthalpy diffusion for interface regularization. Additionally, traditional LAD methods struggle to ensure stability under large density ratio conditions, fail to maintain a finite interface thickness, and are therefore unsuitable for modeling immiscible interfaces. Here, in this work, we discuss the origins of these issues in traditional LAD methods and propose modifications which enable the simulation of large density ratio and immiscible flows. The proposed method targets the artificial diffusion fluxes at gradients and ringing in the volume fraction, rather than the mass fraction in traditional methods, to consistently regularize large density ratio interfaces. Furthermore, the proposed method introduces an artificial bulk density diffusion term to enforce equilibrium conditions across interfaces. To address the challenge of modeling immiscible flows, a conservative diffuse interface term is incorporated into the formulation to ensure a finite interface thickness. Specific consideration is taken in the design of the method to ensure that these crucial properties are maintained for N -material flows. The effectiveness of the proposed method is demonstrated through a series of canonical test cases, and its accuracy is validated by comparison with experimental data on micro-bubble collapse in water. These results highlight the method’s robustness and its ability to overcome the limitations of traditional LAD approaches.

Artificial diffusivity↗

Local Discontinuous Galerkin Methods for Partial Differential Equations with Higher Order Derivatives

In this paper we review the existing and develop new continuous Galerkin methods for solving time dependent partial differential equations with higher order derivatives in one and multiple space dimensions. We review local discontinuous Galerkin methods for convection diffusion equations involving second derivatives and for KdV type equations involving third derivatives. We then develop new local discontinuous Galerkin methods for the time dependent bi-harmonic type equations involving fourth derivatives, and partial differential equations involving fifth derivatives. For these new methods we present correct interface numerical fluxes and prove L(exp 2) stability for general nonlinear problems. Preliminary numerical examples are shown to illustrate these methods. Finally, we present new results on a post-processing technique, originally designed for methods with good negative-order error estimates, on the local discontinuous Galerkin methods applied to equations with higher derivatives. Numerical experiments show that this technique works as well for the new higher derivative cases, in effectively doubling the rate of convergence with negligible additional computational cost, for linear as well as some nonlinear problems, with a local uniform mesh.

Yan, Jue↗

A splice method for local-to–nonlocal coupling of weak forms

Here, we propose a method to couple local and nonlocal diffusion models. By inheriting desirable properties such as patch tests, asymptotic compatibility and unintrusiveness from related splice and optimization-based coupling schemes, it enables the use of weak (or variational) formulations, is computationally efficient and straightforward to implement. We prove well-posedness of the coupling scheme and demonstrate its properties and effectiveness in a variety of numerical examples.

97 MATHEMATICS AND COMPUTING↗

A distributed voltage inference framework for cyber-physical attacks detection and localization in active distribution grids

The transition to active distribution grids with real-time monitoring and control depends on the proliferation of advanced communication networks and devices. This paradigm shift towards a cyber-physical architecture also introduces new vulnerabilities for adversaries to exploit and launch sophisticated cyber-physical attacks targeting grid observability. Current research highlights the challenges in distinguishing attacks on voltage phasor or nodal injection measurements and isolating multi-source attack locations in a multiphase distribution grid. The attack detection and localization methods in literature face accuracy issues, applications across diverse attack scenarios, or scalability limits. Here, to bridge these gaps, this paper proposes a distributed Voltage Inference framework for real-time detection and localization of cyber-physical attacks, addressing scalability, adaptability, and accuracy challenges in state-of-the-art methods. The proposed methodology leverages the distributed nature of the Voltage Inference framework through a two-step process of prediction and correction, together with a tractable graph partitioning approach, providing a reliable solution to identify compromised measurement sources and facilitate isolation. Extensive testing on IEEE 13 and 123-node distribution feeders underscores the algorithm’s efficacy, enhancing the security and resilience of active distribution grids against evolving cyber threats. Additionally, Hardware-in-the-Loop (HIL) implementation validates the proposed strategy’s practical applicability in real-world scenarios.

active distribution grids↗

Measurement of local connective heat transfer coefficients of four ice accretion shapes

In the analytical study of ice accretions that form on aerodynamic surfaces (airfoils, engine inlets, etc.) it is often necessary to be able to calculate convective heat transfer rates. In order to do this, local convective heat transfer coefficients for the ice accretion shapes must be known. In the past, coefficients obtained for circular cylinders were used as an approximation to the actual coefficients since no better information existed. The purpose of this experimental study was to provide local convective heat transfer coefficients for four shapes that represent ice accretions. The shapes were tested with smooth and rough surfaces. The experimental method chosen was the thin-skin heat rate technique. Using this method local Nusselt numbers were determined for the ice shapes. In general it was found that the convective heat transfer was higher in regions where the model's surfaces were convex and lower in regions where the model's surfaces were concave. The effect of roughness was to increase the heat transfer in the high heat transfer regions by approximately 100% while little change was apparent in the low heat transfer regions.

Smith, M. E.↗

A Hybrid Method for Tensor Decompositions that Leverages Stochastic and Deterministic Optimization

In this paper, we propose a hybrid method that uses stochastic and deterministic search to compute the maximum likelihood estimator of a low-rank count tensor with Poisson loss via state-of-theart local methods. Our approach is inspired by Simulated Annealing for global optimization and allows for fine-grain parameter tuning as well as adaptive updates to algorithm parameters. We present numerical results that indicate our hybrid approach can compute better approximations to the maximum likelihood estimator with less computation than the state-of-the-art methods by themselves.

97 MATHEMATICS AND COMPUTING↗