Search NASA⌕ Search

SEARCH · Search NASA

Results for “Iterative algorithms”

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
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Simulated Vision-based Approach and Landing System for Advanced Air Mobility

Advanced Air Mobility (AAM) aircraft require precision approach and landing systems (PALS) in several environments, such as urban, suburban, and rural. It is challenging to implement current state-of-the-art methods approved for automated approach and landing for AAM operations with challenges such as GPS degradation in urban environments and visual navigation aids like the glideslope and localizer being narrow and not allowing alternative incoming landing angles at vertiports. However, existing technology and systems, i.e., the instrument landing system (ILS) with glideslope and localizer indicators that use vision, IR, radar, or GPS methods, provide baseline perception and sensing requirements for AAM aircraft approach and landing. This paper focuses on vision-based PAL and computer vision feature correspondence methods to demonstrate a baseline navigation system while adhering to the Federal Aviation Administration requirements and regulations about heliport design (FAA AC 150/5390-2C), which is one of the closest references for vertiport requirements and regulations. The coplanar pose from orthography and scaling with iterations (COPOSIT) algorithm determines pose estimation, which feeds into an Extended Kalman filter that combines IMU with vision to create a vision-based approach and landing (VAL) sensor fusion navigation solution for GPS-denied environments. The VAL navigation solution provides promising simulation results for AAM PALS with Hough circle detection and feature correspondence, which demonstrate robustness to false positives. This paper incorporates moderately high- fidelity simulations with computer graphics rendering to show a distributed sensor network to track an AAM aircraft during approach and landing to compare with the aircraft’s onboard vision-based navigation solution.

distributed sensing↗
NASA NTRSDate not supplied

Overview of Rotor Hover Performance Capabilities at Low Reynolds Number for Mars Exploration

The Evolutionary aLgorithm for Iterative Studies of Aeromechanics (ELISA) software was developed in support of the Rotorcraft Optimization for the Advancement of Mars eXploration (ROAMX) project. ELISA was developed to enable aerodynamic rotor hover optimization for low Reynolds number flows in the Mars atmosphere. ELISA comprises two modules. The first module is dedicated to airfoil optimization and allows for the creation of multi-objective Pareto optimal (PO) airfoil sets with the airfoil performance evaluation performed using OVERFLOW. The second module is dedicated to rotor hover performance optimization and generates multi-objective PO rotor sets with the rotor performance evaluation performed using the comprehensive analysis code CAMRAD II. This paper presents recent updates to the ELISA optimization toolset. The airfoil module now includes variation in section Reynolds number, alongside simultaneous maximization of section lift and minimization of section drag. Consequently, the rotor optimization module can query PO airfoil sets (as a function of section lift, drag, and Reynolds number) and generate PO C81 decks tailored to specific Reynolds numbers, eliminating the need for adequate initial chord guesses and allowing for arbitrary rotor solidities to be studied. Furthermore, the rotor optimization has been extended to incorporate a third dimension, alongside maximization of blade loading and minimization of rotor power. This enables optimization across a relevant density range on Mars, presenting the lowest power rotor hover geometry, for each attainable blade loading, for each density. The goal of this work is to present the relevance of recent updates to the ELISA optimization toolset, by showing full rotor hover optimization using unconventional airfoils across a practical Mars density range, and by presenting various optimizations for changing blade numbers with unconstrained solidity in the Mars atmosphere.

Rotor↗
DOE OSTI2025

Optimizing Power Line Undergrounding Decisions under Varying Wildfire Risk and Weather Scenarios

Abstract—The threat of wildfire ignitions from electric power equipment has led utilities to increasingly turn to preemptive power shutoffs, which, while effective in reducing grid-induced wildfire risk, can cause significant load loss. Undergrounding power lines is an alternative strategy for preventing grid-induced wildfires. However, undergrounding lines is costly, so an efficient undergrounding plan must balance reductions in wildfire risk and load loss with the cost of undergrounding lines. We propose a robust optimization model to identify which power lines to underground to maximize load served while limiting wildfire risk across a range of wildfire risk and weather scenarios. Since solving this problem may be computationally heavy for large power grids and many operating scenarios, we present a delayed constraint generation algorithm to iteratively add scenarios until an optimal solution is found. We evaluate the performance of this framework on the RTS-GMLC with scenarios representing a year of operating conditions and compare it with a stochastic programming formulation. Our results indicate that our undergrounding model is successful in reducing load shed and risk compared to baseline cases in which no mitigation action is taken and only power shutoffs are implemented (no undergrounding). The robust formulation also reduces more load shed than the stochastic formulation in the most extreme scenarios. Index Terms—grid resilience, optimization, transmission systems, underground power lines, wildfire risk.

Taylor, S. [Department of Electrical and Computer ↗
NASA NTRS1993

Phase-retrieval algorithms for a complicated optical system

Phase-retrieval algorithms have been developed that handle a complicated optical system that requires multiple Fresnellike transforms to propagate from one end of the system to the other including the absorption by apertures in more than one plane and allowance for bad detector pixels. Gradient-search algorithms and generalizations of the iterative-transform phase-retrieval algorithms are derived. Analytic expressions for the gradient of an error metric, with respect to polynomial coefficients and with respect to point-by-point phase descriptions, are given. The entire gradient can be computed with the number of transforms required to propagate a wave front from one end of the optical system to the other and back again, independent of the number of coefficients or phase points. This greatly speeds the computation. The reconstruction of pupil amplitude is also given. A convergence proof of the generalized iterative transform algorithm is given. These improved algorithms permit a more accurate characterization of complicated optical systems from their point spread functions.

Fienup, J. R.↗
NASA NTRS1987

Solving Finite-Element Problems on a Concurrent Processor

By use of "conjugate gradients" technique, concurrent efficiency greater than 90 percent. Algorithm applies method of conjugate gradients to iterative solution of finite-element problems on concurrent processor. With algorithm, iteration rates nearly proportional to number of processors. For sufficiently large problems, fraction of proportional speedup achieved, called concurrent efficiency, exceeds 90 percent. Results indicate future application of this and related algorithms to large finite-element problems depend primarily upon applicability of iteratiave techniques, not upon issues of concurrency or efficiency.

Lyzenga, G. A.↗
NASA NTRS1988

I-BIEM, an iterative boundary integral equation method for computer solutions of current distribution problems with complex boundaries: A new algorithm. I - Theoretical

A new algorithm for an iterative computation of solutions of Laplace's or Poisson's equations in two dimensions, using Green's second identity, is presented. This algorithm converges strongly and geometrically and can be applied to curved, irregular, or moving boundaries with nonlinear and/or discontinuous boundary conditions. It has been implemented in Pascal on a number of micro- and minicomputers and applied to several geometries. Cases with known analytic solutions have been tested. Convergence to within 0.1 percent to 0.01 percent of the theoretical values are obtained in a few minutes on a microcomputer.

Cahan, B. D.↗
NASA NTRS1984

Second-order p-iterative solution of the Lambert/Gauss problem

An algorithm is presented for efficient p-iterative solution of the Lambert/Gauss orbit-determination problem using second-order Newton iteration. The algorithm is based on a universal transformation of Kepler's time-of-flight equation and approximate inverse solutions of this equation for short-way and long-way flight paths. The approximate solutions provide both good starting values for iteration and simplified computation of the second-order term in the iteration formula. Numerical results are presented which indicate that in many cases of practical significance (except those having collinear position vectors) the algorithm produces at least eight significant digits of accuracy with just two or three steps of iteration.

Boltz, F. W.↗
DOE OSTI2024

Real space iterative reconstruction for vector tomography (RESIRE-V)

Tomography has had an important impact on the physical, biological, and medical sciences. To date, most tomographic applications have been focused on 3D scalar reconstructions. However, in some crucial applications, vector tomography is required to reconstruct 3D vector fields such as the electric and magnetic fields. Over the years, several vector tomography methods have been developed. Here, we present the mathematical foundation and algorithmic implementation of REal Space Iterative REconstruction for Vector tomography, termed RESIRE-V. RESIRE-V uses multiple tilt series of projections and iterates between the projections and a 3D reconstruction. Each iteration consists of a forward step using the Radon transform and a backward step using its transpose, then updates the object via gradient descent. Incorporating with a 3D support constraint, the algorithm iteratively minimizes an error metric, defined as the difference between the measured and calculated projections. The algorithm can also be used to refine the tilt angles and further improve the 3D reconstruction. To validate RESIRE-V, we first apply it to a simulated data set of the 3D magnetization vector field, consisting of two orthogonal tilt series, each with a missing wedge. Our quantitative analysis shows that the three components of the reconstructed magnetization vector field agree well with the ground-truth counterparts. We then use RESIRE-V to reconstruct the 3D magnetization vector field of a ferromagnetic meta-lattice consisting of three tilt series. Our 3D vector reconstruction reveals the existence of topological magnetic defects with positive and negative charges. We expect that RESIRE-V can be incorporated into different imaging modalities as a general vector tomography method. To make the algorithm accessible to a broad user community, we have made our RESIRE-V MATLAB source codes and the data freely available at https://github.com/minhpham0309/RESIRE-V.

47 OTHER INSTRUMENTATION↗
DOE OSTI2022

Delaunay walk for fast nearest neighbor: accelerating correspondence matching for ICP

Point set registration algorithms such as Iterative Closest Point (ICP) are commonly utilized in time-constrained environments like robotics. Finding the nearest neighbor of a point in a reference 3D point set is a common operation in ICP and frequently consumes at least 90% of the computation time. We introduce a novel approach to performing the distance-based nearest neighbor step based on Delaunay triangulation. This greedy algorithm finds the nearest neighbor of a query point by traversing the edges of the Delaunay triangulation created from a reference 3D point set. Our work integrates the Delaunay traversal into the correspondences search of ICP and exploits the iterative aspect of ICP by caching previous correspondences to expedite each iteration. An algorithmic analysis and comparison is conducted showing an order of magnitude speedup for both serial and vector processor implementation.

3d point cloud processing↗
NASA NTRS1975

A parallel Jacobson-Oksman optimization algorithm

A gradient-dependent optimization technique which exploits the vector-streaming or parallel-computing capabilities of some modern computers is presented. The algorithm, derived by assuming that the function to be minimized is homogeneous, is a modification of the Jacobson-Oksman serial minimization method. In addition to describing the algorithm, conditions insuring the convergence of the iterates of the algorithm and the results of numerical experiments on a group of sample test functions are presented. The results of these experiments indicate that this algorithm will solve optimization problems in less computing time than conventional serial methods on machines having vector-streaming or parallel-computing capabilities.

Straeter, T. A.↗
NASA NTRS2018

Super Resolution of Remote Sensing Images Using Edge-Directed Radial Basis Functions

Edge-Directed Radial Basis Functions (EDRBF) are used to compute super resolution(SR) image from a given set of low resolution (LR) images differing in subpixel shifts. The algorithm is tested on remote sensing images and compared for accuracy with other well-known algorithms such as Iterative Back Projection (IBP), Maximum Likelihood (ML) algorithm, interpolation of scattered points using Nearest Neighbor (NN) and Inversed Distance Weighted (IDW) interpolation, and Radial Basis Functin(RBF) . The accuracy of SR depends on various factors besides the algorithm (i) number of subpixel shifted LR images (ii) accuracy with which the LR shifts are estimated by registration algorithms (iii) and the targeted spatial resolution of SR. In our studies, the accuracy of EDRBF is compared with other algorithms keeping these factors constant. The algorithm has two steps: i) registration of low resolution images and (ii) estimating the pixels in High Resolution (HR) grid using EDRBF. Experiments are conducted by simulating LR images from a input HR image with different sub-pixel shifts. The reconstructed SR image is compared with input HR image to measure the accuracy of the algorithm using sum of squared errors (SSE). The algorithm has outperformed all of the algorithms mentioned above. The algorithm is robust and is not overly sensitive to the registration inaccuracies.

Mareboyana, Manohar M.↗
NASA NTRS1981

Eigenvector determination by iterative optical methods

Three power algorithms are considered by which an iterative optical processor can be used to compute the eigenvalues and eigenvectors of a matrix. The algorithms are appropriate for three applications: (1) calculating the largest eigenvalue; (2) calculating the eigenvalues in order of decreasingly dominant eigenvalues; and (3) calculating the eigenvector whose eigenvalue is closest to a given value.

Vijaya Kumar, B. V. K.↗
DOE OSTI2023

Seven open problems in applied combinatorics

We present and discuss seven different open problems in applied combinatorics. Additionally, the application areas relevant to this compilation include quantum computing, algorithmic differentiation, topological data analysis, iterative methods, hypergraph cut algorithms, and power systems.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1984

Tomography by iterative convolution - Empirical study and application to interferometry

An algorithm for computer tomography has been developed that is applicable to reconstruction from data having incomplete projections because an opaque object blocks some of the probing radiation as it passes through the object field. The algorithm is based on iteration between the object domain and the projection (Radon transform) domain. Reconstructions are computed during each iteration by the well-known convolution method. Although it is demonstrated that this algorithm does not converge, an empirically justified criterion for terminating the iteration when the most accurate estimate has been computed is presented. The algorithm has been studied by using it to reconstruct several different object fields with several different opaque regions. It also has been used to reconstruct aerodynamic density fields from interferometric data recorded in wind tunnel tests.

Vest, C. M.↗
DOE OSTI2020

RIFTA: A Robust Iterative Fourier Transform-based dwell time Algorithm for ultra-precision ion beam figuring of synchrotron mirrors

With the rapid evolution of synchrotron X-ray sources, the demand for high-precision X-ray mirrors has greatly increased. Single nanometer profile error is required to keep imaging capability at the diffraction limit. Ion Beam Figuring (IBF), as a highly deterministic surfacing technique, has been used for ultra-precision finishing of mirrors. One crucial step that guides the IBF process is dwell time calculation. A valid dwell time solution should be non-negative and duplicate the shape of the desired removal map. Another important aspect is to minimize the total dwell time. In this study, we propose a Robust Iterative Fourier Transform-based dwell time Algorithm (RIFTA) that automatically fulfills these requirements. First, the thresholded inverse filtering in Fourier transform-based deconvolution is stabilized and automated by optimizing the threshold value using the Nelder-Mead simplex algorithm. Second, a novel two-level iterative scheme is proposed to guarantee the minimized total dwell time with its non-negativity at each dwell point. Third, a bicubic resampling is employed to flexibly adapt the calculated dwell time map to any IBF process intervals. The performance of RIFTA is first studied with simulation, followed by a comparison with the other state-of-the-art dwell time algorithms. We then demonstrate with an experiment that, using the dwell time calculated by the RIFTA, the total dwell time is shortened by a factor of two and the RMS in a 5 × 50 mm clear aperture was reduced from 3.4 nm to 1.1 nm after one IBF run, which proves the effectiveness and the efficiency of the proposed algorithm.

42 ENGINEERING↗
NASA NTRS1991

An iterative implicit diagonally-dominant factorization algorithm for solving the Navier-Stokes equations

Presented here is an algorithm for solving the multidimensional unsteady Navier-Stokes equations for compressible flows. It is based on a diagonally-dominant approximate factorization procedure. The factorization error and the timewise linearization error associated with this procedure are reduced by performing Newton-type inner iterations at each time step. The inviscid fluxes are evaluated by the fourth-order central differencing scheme amended with a numerical dissipation directly proportional to the entire dissipative part of the truncation error intrinsic to the third order biased upwind scheme. The important features of the proposed solution are elucidated by the numerical results of the convection of a vortex and the backward-facing step flows.

Chen, Shu-Cheng↗
DOE OSTI2026

CHESS 2025: Leaf Area Index (LAI) for meadow, shrub, tree, and understory vegetation

This dataset contains Leaf Area Index (LAI) measurements made as part of the Colorado Headwaters Ecological Spectroscopy Study (CHESS) during June and July of 2025. Data were collected in the Upper Gunnison Basin, Colorado, across three study domains: the Upper East River (CRBU), Almont Triangle (ALMO), and the Upper Taylor Basin (UPTA). Field observations of LAI were collected within 72 hours of airborne data collection by the National Ecological Observatory Network’s Aerial Observation Platform (NEON AOP). The NEON AOP collected waveform LiDAR (Light Detection and Ranging) and imaging spectrometer data in 426 spectral bands from the visible to shortwave infrared. LAI measurements were collected using the LICOR LAI-2200C Plant Canopy Analyzer following protocols outlined in the instrument manual (LI-COR 2019). Sampling targeted four distinct vegetation types: meadows, shrubs, trees, and aspen forest understory. We have archived data separately by site type because different field methods were used for each. At meadow sites, measurements were made at the four corners of 1m x 1m plots, with the instrument moving inward toward the center of the plot. At shrub sites, we measured the canopies of individual shrubs. At tree sites, we made measurements within a 10m x 10m subplot centered around a focal tree, with 30 observations taken on a regular grid. At aspen understory sites, we measured overstory trees following the tree protocol and understory herbaceous vegetation following the meadow protocol. All measurements included above-canopy (A) and below-canopy (B) readings, with specific protocols for scattering correction measurements in direct-sun conditions. Data were processed using the R package `rlai` (Worsham 2025). This package includes functions to calculate LAI, gap fraction, apparent clumping factor (Ω), scattering correction, and other canopy metrics. Package contents: Full file descriptions appear in ‘flmd.csv’. Files named according to the convention ‘lai_*_summary_data_cleaned.csv’ contain summary values of LAI, apparent clumping factor (Ωapp), and scattering correction factors for each site. These are the analysis-ready products that most data users will work with. Files named ‘lai_*_metadata_cleaned.csv’ contain additional site-level observations made during field collection. We have also archived intermediate and supplementary data for users who wish to check our processing approach or apply alternative methods. ‘raw_lai_2200C.zip’ contains the raw files as read from the LI-COR instrument, with no processing applied, in TXT format. The zip archive contains subdirectories by site type, which are further subdivided by sampling area. Filenames correspond to the sampling site number. ‘intermediate_results.zip’ contains detailed output from the processing routines, in JSON format. The zip archive contains subdirectories by site type; filenames correspond to the sampling site number. ‘scattering_correction_logs.zip’ contains logfiles from the implementation of Kobayashi et al.'s (2013) scattering correction algorithm. The logfiles report values of several parameters at each iteration of the algorithm, as the model converges toward a stable solution. They are intended for users who want to verify scattering correction performance. The zip archive contains subdirectories by site type; filenames correspond to the sampling site number. ‘spot_checks.csv’ reports LAI and other values for a small number of files processed with LI-COR FV2200 software (LI-COR 2013) using the same control parameters as in our R-based approach. Additional metadata are provided in a data dictionary describing column names and definitions (dd.csv), and in a file-level metadata file (flmd.csv). All zip files can be expanded with common archive utilities. TXT, CSV, and JSON files can be ingested into R or Python computing environments or read in common text editor utilities. Geospatial information: Geospatial data for mapping measurement site locations are in the files CHESS_polygons_lai_UTM.geojson, CHESS_polygons_shrub_UTM.geojson, and CHESS_polygons_meadow_UTM.geojson in the companion geospatial package for the 2025 CHESS campaign, ‘CHESS 2025: Location data for field observations and sampling’ (Henderson et al., 2026). CHESS Project Description: The Colorado Headwaters Ecological Spectroscopy Study (CHESS) comprised a multi-week airborne remote sensing and field observation campaign in the Upper Gunnison Basin, Colorado, conducted in June and July of 2025. Airborne remote sensing was conducted by the National Ecological Observatory Network Airborne Observation Platform (NEON AOP), concurrent with a field campaign run by the Rocky Mountain Biological Laboratory (RMBL), the Lawrence Berkeley National Laboratory (LBNL) and SLAC National Accelerator Laboratory Watershed Function Science Focus Area (SFA), and NASA-JPL (Jet Propulsion Laboratory) Earth Surface Mineral Dust Source Investigation (EMIT) program. Between June 10 and July 18, 2025, the NEON AOP flight team collected high-resolution aerial imaging spectroscopy and Light Detection and Ranging (LiDAR) data over three domains: the Upper East River (CRBU), Almont Triangle (ALMO), and the Upper Taylor Basin (UPTA). In coordination with the flights, a field campaign acquired ground-truth observations, including observations of vegetation composition, foliar traits, forest demography, and subsurface properties in 18 core sampling areas within the domains. Additional surface water observations were taken at over 380 point locations. All CHESS campaign datasets can be found within the CHESS ESS-DIVE data portal: https://data.ess-dive.lbl.gov/portals/chess. Funding Acknowledgement: Field and remote-sensing data acquisition was performed under a grant from the National Aeronautics and Space Administration (80NSSC24K1005). This work was also supported by the Watershed Function Science Focus Area at Lawrence Berkeley National Laboratory funded by the US Department of Energy, Office of Science, Biological and Environmental Research under Contract No. DE-AC02-05CH11231. * Todorov and Worsham are co–first authors.

2018 NEON and 2025 CHESS Campaigns↗