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 343 records · Page 19

The eXtended virtual element method for elliptic problems with weakly singular solutions

This paper introduces a novel eXtended virtual element method, an extension of the conforming virtual element method. The X-VEM is formulated by incorporating appropriate enrichment functions in the local spaces. The method is designed to handle highly generic enrichment functions, including singularities arising from fractured domains. By achieving consistency on the enrichment space, the method is proven to achieve arbitrary approximation orders even in the presence of singular solutions. The paper includes a complete convergence analysis under general assumptions on mesh regularity, and numerical experiments validating the method’s accuracy on various mesh families, demonstrating optimal convergence rates in the L 2 - and H 1 - norms on fractured or L-shaped domains.

97 MATHEMATICS AND COMPUTING↗

Monocular Horizon Navigation

The Artemis program advances towards operations on the lunar surface, where precise surface localization is a driving need for safety and science. Using the observable horizon as an image landmark allows for estimating the photographer’s position. This work analyzes the application of Perspective-n-Point (PnP) algorithms to this lunar localization problem. Batch simulations using lunar topography display the accuracy and drawbacks of these methods. Monte Carlo techniques show the pipeline’s solutions as measurements provided to a navigation filter. When filtered, these solutions have position errors of 50 meters or better, which is similar to or better than the performance of other methods of surface localization.

optical navigation↗

On the Approximability of Random-Hypergraph MAX-3-XORSAT Problems with Quantum Algorithms

Constraint satisfaction problems are an important area of computer science. Many of these problems are in the complexity class NP which is exponentially hard for all known methods, both for worst cases and often typical. Fundamentally, the lack of any guided local minimum escape method ensures the hardness of both exact and approximate optimization classically, but the intuitive mechanism for approximation hardness in quantum algorithms based on Hamiltonian time evolution is poorly understood. We explore this question using the prototypically hard MAX-3-XORSAT problem class. We conclude that the mechanisms for quantum exact and approximation hardness are fundamentally distinct. We qualitatively identify why traditional methods such as quantum adiabatic optimization are not good approximation algorithms. We propose a new spectral folding optimization method that does not suffer from these issues and study it analytically and numerically. We consider random rank-3 hypergraphs including extremal planted solution instances, where the ground state satisfies an anomalously high fraction of constraints compared to truly random problems. We show that, if we define the energy to be $E = N_{unsat}-N_{sat}$, then spectrally folded quantum optimization will return states with energy $E \leq A E_{GS}$ (where $E_{GS}$ is the ground state energy) in polynomial time, where conservatively, $A \simeq 0.6$. We thoroughly benchmark variations of spectrally folded quantum optimization for random classically approximation-hard (planted solution) instances in simulation, and find performance consistent with this prediction. We do not claim that this approximation guarantee holds for all possible hypergraphs, though our algorithm's mechanism can likely generalize widely. These results suggest that quantum computers are more powerful for approximate optimization than had been previously assumed.

Kapit, Eliot↗

Effect of deviation from local thermodynamic equilibrium on the Goldberg-Unno method

The dependence of turbulent velocity on optical depth was studied by use of the Goldberg-Unno method, with allowance made for the influence of deviation from the local thermodynamic equilibrium. It was found that allowance for deviation from local thermodynamic equilibrium displaces the curve of dependence of turbulent velocity on optical depth along two axes.

Troyan, V. I.↗

New Method Developed to Measure Contact Angles of a Sessile Drop

The spreading of an evaporating liquid on a solid surface occurs in many practical processes and is of importance in a number of practical situations such as painting, textile dyeing, coating, gluing, and thermal engineering. Typical processes involving heat transfer where the contact angle plays an important role are film cooling, boiling, and the heat transfer through heat pipes. The biological phenomenon of cell spreading also is analogous to a drop spreading (ref. 1). In the study of spreading, the dynamic contact angle describes the interfacial properties on solid substrates and, therefore, has been studied by physicists and fluid mechanics investigators. The dynamic contact angle of a spreading nonvolatile liquid drop provides a simple tool in the study of the free-boundary problem, but the study of the spreading of a volatile liquid drop is of more practical interest because the evaporation of common liquids is inevitable in practical processes. The most common method to measure the contact angle, the contact radius, and the height of a sessile drop on a solid surface is to view the drop from its edge through an optical microscope. However, this method gives only local information in the view direction. Zhang and Yang (ref. 2) developed a laser shadowgraphy method to investigate the evaporation of sessile drop on a glass plate. As described here, Zhang and Chao (refs. 3 and 4) improved the method and suggested a new optical arrangement to measure the dynamic contact angle and the instant evaporation rate of a sessile drop with much higher accuracy (less than 1 percent). With this method, any fluid motion in the evaporating drop can be visualized through shadowgraphy without using a tracer, which often affects the field under investigation.

Chao, David F.↗

ASDFL: An adaptive super‐pixel discriminative feature‐selective learning for vehicle matching

Abstract There are a large number of cameras in modern transportation system that capture numerous vehicle images continuously. Therefore, automatic analysis of these vehicle images is helpful for traffic flow management, criminal investigations and vehicle inspections. Vehicle matching, which aims to determine whether two input images depict an identical vehicle, is one of the core tasks in vehicle analysis. Recent relevant studies have focused on local feature extraction instead of global extraction, since local details can provide crucial cues to distinguish between cars. However, these methods do not select local features; that is, they do not assign weights to local features. Therefore, in this research, we systematically study the vehicle matching task, and present a novel annotation‐free local‐based deep learning method called Adaptive super‐pixel discriminative feature‐selective learning (ASDFL) to address this issue. In ASDFL, vehicle images are segmented into clusters of super‐pixels of similar size by considering the location and colour similarities of pixels without using any component‐level annotation. These super‐pixels are deemed to be the virtual components of vehicles. Moreover, a convolutional neural network is used to extract the deep features of these virtual components. Thereafter, an instance‐specific mask generation module driven by the extracted global features is enhanced to produce a mask to select the most distinctive virtual components of each vehicle image pair in the feature space. Finally, the vehicle matching task is accomplished by classifying the selected virtual component features of each imaged vehicle pair. Extensive experiments on two popular vehicle identification benchmarks demonstrate that our method is 1.57% and 0.8% more accurate than the previous baselines in a vehicle matching task on the VeRi and VehicleID datasets, respectively, which demonstrates the effectiveness of our method.

Qin, Rong↗

Sharp front tracking with geometric interface reconstruction

Here, this paper presents a novel sharp front-tracking method designed to address limitations in classical front-tracking approaches, specifically their reliance on smooth interpolation kernels and extended stencils for coupling the front and fluid mesh. In contrast, the proposed method employs exclusively sharp, localized interpolation and spreading kernels, restricting the coupling to the interfacial fluid cells–those containing the interface/front. This localized coupling is achieved by integrating a divergence-preserving velocity interpolation method with a piecewise parabolic interface calculation (PPIC) and a polyhedron intersection algorithm to compute the indicator function and local interface curvature. Surface tension is computed using the Continuum Surface Force (CSF) method, maintaining consistency with the sharp representation. Additionally, we propose an efficient local roughness smoothing implementation to account for surface mesh undulations, which is easily applicable to any triangulated surface mesh. Building on our previous work, the primary innovation of this study lies in the localization of the coupling for both the indicator function and surface tension calculations. By reducing the interface thickness on the fluid mesh to a single cell, as opposed to the 4–5 cell spans typical in classical methods, the proposed sharp front-tracking method achieves a highly localized and accurate representation of the interface. This sharper representation mitigates parasitic currents and improves force balancing, making it particularly suitable for scenarios where the interface plays a critical role, such as microfluidics, fluid-fluid interactions, and fluid-structure interactions. The proposed method is comprehensively validated and tested on canonical interfacial flow problems, including stationary and translating Laplace equilibria, oscillating droplets, and rising bubbles. The presented results demonstrate that the sharp front-tracking method significantly outperforms the classical approach in terms of accuracy, stability, and computational efficiency. Notably, parasitic currents are reduced by approximately two orders of magnitude and stable results are obtained for parameter ranges where classical front tracking fails to converge.

42 ENGINEERING↗

Near conformal perturbation theory in SYK type models

We present a systematic procedure to extract the dynamics of the low energy soft mode in SYK type models with a single energy scale J and emergent reparametrization symmetry in the IR. This is given in the framework of the perturbative scheme of arXiv:1608.07567 based on a specific (off-shell) breaking of conformal invariance in the UV, adjusted to yield the exact large-N saddle point. While this breaking term formally vanishes on-shell, it has a non-trivial effect on correlation functions and the effective action. In particular, it leads to the Schwarzian action with a specific coupling to bi-local matter. The method is applied to the evaluation of O(1) corrections to the correlation function of bi-locals. As a byproduct we confirm precise agreement with the explicit, symmetry breaking procedure. We provide a verification in the large q limit (Liouville theory), where the correlators can be calculated exactly at all length scales. In this case, our scheme illuminates how the enhanced O(J) and the subleading O(1) contributions originate from the Schwarzian dynamics of the soft mode and its interaction with h = 2 (bi-local) matter.

1/N expansion↗

A new self-adaptive reconstruction method to identify defects through Wigner–Seitz approach

A new self-adaptive reconstruction method based on local atomic structure at any given molecular dynamics (MD) step has been developed in this article. The method can be used in Wigner–Seitz defect analysis approach to correctly and efficiently explore the information of both point defects and complex defect clusters (e.g. dislocation loops and voids) formed after a displacement cascade where the cascade interacts with grain boundaries and/or dislocations. The algorithm and validation are provided in detail. Results for identification of radiation defects during and after cascades interacting with a dislocation network show that the new method can well recognize all simple and complex defects and defect clusters. Thus, this new method provides a totally new way to explore the density and size of radiation defects at atomic scale after complex MD evolution processes, providing correct information to understand and predict radiation damage in materials through atomic simulations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Face Gear Drive With Helical Involute Pinion: Geometry, Generation by a Shaper and a Worm, Avoidance of Singularities and Stress Analysis

A new type of face-gear drive with intersected axes of rotation formed by a helical involute pinion and conjugated face-gear has been investigated. Generation of face-gears by a shaper free of undercutting and pointing has been investigated. A new method of grinding or cutting of face-gears by a worm of special shape has been developed. A computerized design procedure has been developed to avoid undercutting and pointing by a shaper or by a generating worm. Also, a method to determine the limitations of the helix angle magnitude has been developed. The method provides a localization of the bearing contact to reduce the shift of bearing contact caused by misalignment. The analytical method provides a simulation of the meshing and contact of misaligned gear drives. An automatic mesh generation method has been developed and used to conduct a 3D contact stress analysis of several teeth. The theory developed is illustrated with several examples.

Litvin, Faydor L.↗

Method of up-front load balancing for local memory parallel processors

In a parallel processing computer system with multiple processing units and shared memory, a method is disclosed for uniformly balancing the aggregate computational load in, and utilizing minimal memory by, a network having identical computations to be executed at each connection therein. Read-only and read-write memory are subdivided into a plurality of process sets, which function like artificial processing units. Said plurality of process sets is iteratively merged and reduced to the number of processing units without exceeding the balance load. Said merger is based upon the value of a partition threshold, which is a measure of the memory utilization. The turnaround time and memory savings of the instant method are functions of the number of processing units available and the number of partitions into which the memory is subdivided. Typical results of the preferred embodiment yielded memory savings of from sixty to seventy five percent.

Baffes, Paul Thomas↗

Development of MLPG and LBIE Methods for Nonlinear Problems of Fracture

The truly meshless local Petrov-Galerkin (MLPG) method holds a great promise in solving boundary value problems, using a local symmetric weak form as a natural approach. In the present paper, in the context of MLPG and the meshless interpolation of a moving least squares (MLS) type, a method which uses primary and secondary nodes in the domain and on the global boundary is introduced, in order to improve the accuracy of solution. The secondary nodes can be placed at any location where one needs to obtain a better resolution. The sub-domains for the shape functions in the MLS approximation are defined only from the primary nodes, and the secondary nodes use the same sub-domains. The shape functions based on the MLS approximation, in an integration domain, have a single type of a rational function, which reduces the difficulty of numerical integration to evaluate the weak form. The present method is very useful in an adaptive calculation, because the secondary nodes can be easily added and/or moved without an additional mesh. The essential boundary conditions can be imposed exactly, and non-convex boundaries can be treated without special techniques. Several numerical examples are presented to illustrate the performance of the present method.

Atluri, Satya N.↗

Benchmarking image processing techniques for porosity measurement in polymer additive manufacturing: Review and experimental analysis

An image processing workflow is proposed for porosity measurement in polymer additive manufacturing. Various techniques, including global and local thresholding, region growing, and K-means clustering, were applied to microscopic images of carbon fiber reinforced acrylonitrile butadiene styrene (CF-ABS) and benchmarked for their ability to accurately measure porosity. Global methods included Otsu, minimum error, iterative, and entropy-based thresholding, while local methods included Niblack, Bernsen, Sauvola, and Bradley-Roth algorithms. Artificial uneven illumination was introduced to test local adaptive thresholds. Results showed significant differences in porosity values across methods. Otsu, region growing, and K-means clustering excelled under uniform illumination, while Sauvola and Bradley-Roth performed better with uneven illumination. Comparison with X-ray computed tomography (XCT) revealed slightly lower porosity values (2.55 %) than optimized methods (2.73–2.79 %) due to XCT's lower resolution excluding smaller pores. While XCT offers finer pore detection, it limits sample volume and underestimates porosity due to spatial variation. Validation using artificial grayscale images with 5 % porosity confirmed that Otsu, Bradley-Roth, region growing, and Sauvola algorithms produced accurate results. Although tested on a single material system, these methods can be adapted to others with optimization. In conclusion, given XCT's high computational and time costs, this study highlights suitable image processing techniques as cost-effective alternatives for porosity analysis in polymer composites.

Additive manufacturing↗

Charge-density-wave melting in the one-dimensional Holstein model

We study the Holstein model of spinless fermions, which at half filling exhibits a quantum phase transition from a metallic Tomonaga-Luttinger liquid phase to an insulating charge-density-wave (CDW) phase at a critical electron-phonon coupling strength. In our work, we focus on the real-time evolution starting from two different types of initial states that are CDW ordered: (i) ideal CDW states with and without additional phonons in the system and (ii) correlated ground states in the CDW phase. We identify the mechanism for CDW melting in the ensuing real-time dynamics and show that it strongly depends on the type of initial state. We focus on the far-from-equilibrium regime and emphasize the role of electron-phonon coupling rather than dominant electronic correlations, thus complementing a previous study of photoinduced CDW melting [H. Hashimoto and S. Ishihara, Phys. Rev. B 96, 035154 (2017)]. The numerical simulations are performed by means of matrix-product-state based methods with a local basis optimization (LBO). Within these techniques, one rotates the local (bosonic) Hilbert spaces adaptively into an optimized basis that can then be truncated while still maintaining a high precision. In this work, we extend the time-evolving block decimation (TEBD) algorithm with LBO, previously applied to single-polaron dynamics, to a half-filled system. We demonstrate that in some parameter regimes, a conventional TEBD method without LBO would fail. Furthermore, we introduce and use a ground-state density-matrix renormalization group method for electron-phonon systems using local basis optimization. In our examples, we account for up to M ph =40 bare phonons per site by working with O(10) optimal phonon modes.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Extracting symplectic maps for space-charge dominated beams

Symplecticity of transfer maps is important for reliable evaluation of space-charge dominated beams in accelerators. Unfortunately, most simulation codes that include collective effects, such as space charge, do not use canonical phase-space variables and therefore are not symplectic in the presence of electromagnetic fields. In this paper, we present a numerical method to extract local linear symplectic transfer maps using particle tracking simulation code for space-charge dominated beams. We demonstrate this method for the photoinjector (113 MHz SRF gun) section of the Coherent electron Cooling (CeC) Proof of Principle (POP) experiment.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Some comments on global-local analyses

The main theme concerns methods that may be classified as global (approximate) and local (exact). Some specific applications of these methods are found in: fracture and fatigue analysis of structures with 3-D surface flaws; large-deformation, post-buckling analysis of large space trusses and space frames, and their control; and stresses around holes in composite laminates.

Atluri, Satya N.↗

Image reconstruction from multiple 1-D scans using filtered localized projection

The spatial resolution that can be attained using scanning linear arrays (consisting of discrete IR solid-state detectors) for image acquisition is considered, and a filtered local projection (FLP) method is described which efficiently combines all available scan information into one rectangular grid without the need for explicit interpolation. Mathematically, the FLP algorithm consists of a localized summation followed by an inverse-filter operation, and it has application to nonlinear restoring techniques. The present method is applied, using a linear array, to simulated data for staggered parallel scans and to multiple scan directions. Noise effects and limitations of the technique are also considered.

Frieden, B. Roy↗