Search NASA⌕ Search

SEARCH · Search NASA

Results for “approximation 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 739 records · Page 41

hdsullivan/ResSR

This is the official implementation of ResSR [1]. ResSR is a computationally efficient MSI-SR method that achieves high-quality reconstructions by using a closed-form spectral decomposition along with a spatial residual correction. ResSR applies singular value decomposition to identify correlations across spectral bands, uses pixel-wise computation to upsample the MSI, and then applies a residual correction process to correct the high-spatial frequency components of the upsampled bands. While ResSR is formulated as the solution to a spatially-coupled optimization problem, we use pixel-wise regularization and derive an approximate closed-form solution, resulting in a pixel-wise algorithm with a dramatic reduction in computation that achieves state-of-the-art reconstructions. [1] Duba-Sullivan, H., Reid, E. J., Voisin, S., Bouman, C. A., & Buzzard, G. T. (2024). ResSR: A Computationally Efficient Residual Approach to Super-Resolving Multispectral Images. arXiv preprint arXiv:2408.13225.

Duba-Sullivan, Haley [Oak Ridge National Laborator↗

Hydrated Metal and Metal-Nitrate Complexes in Water: Full Lanthanide(III) Series plus Miscellaneous Metal Ions

This is a dataset of hydrated metal complexes and metal–nitrate hydrated complexes intended for public use, reproducibility, and downstream structural analysis. A key feature is coverage across the full lanthanide(III) series (La–Lu), enabling systematic comparisons of coordination motifs and bonding trends across the entire lanthanide sequence. In addition to the lanthanides, the dataset also includes other metal ions such as UO2(VI), Fe(II), and Fe(III). The dataset provides optimized geometries for hydrated and nitrate-containing hydrated complexes, together with representative ab initio molecular dynamics (AIMD) trajectories saved in standard XYZ formats. The accompanying NWChem input decks enable reproduction of the reported calculations and provide a starting point for extending the simulations to related coordination environments. Computationally, DFT calculations employ the B3LYP functional with DFT-D3BJ dispersion corrections and a COSMO continuum solvent model (dielectric constant 78.4) to represent solvation beyond the explicitly treated first hydration shell. AIMD simulations are performed with the NWChem qmd module at 298 K, integrating nuclear motion with the velocity-Verlet algorithm and controlling temperature using a Nosé–Hoover thermostat. Trajectories are approximately 4.8 ps in length and are used primarily to assess short-time stability of candidate coordination motifs, including (for lanthanides) differences between 8- versus 9-water coordination and comparisons between nitrate-bound and nitrate-free hydrated complexes.

Dinpajooh, Mohammadhasan [Pacific Northwest Nation↗

Design of automata theory of cubical complexes with applications to diagnosis and algorithmic description

The following problems are considered: (1) methods for development of logic design together with algorithms, so that it is possible to compute a test for any failure in the logic design, if such a test exists, and developing algorithms and heuristics for the purpose of minimizing the computation for tests; and (2) a method of design of logic for ultra LSI (large scale integration). It was discovered that the so-called quantum calculus can be extended to render it possible: (1) to describe the functional behavior of a mechanism component by component, and (2) to compute tests for failures, in the mechanism, using the diagnosis algorithm. The development of an algorithm for the multioutput two-level minimization problem is presented and the program MIN 360 was written for this algorithm. The program has options of mode (exact minimum or various approximations), cost function, cost bound, etc., providing flexibility.

Roth, J. P.↗

Nonlinear problems of the theory of heterogeneous slightly curved shells

An account if given of the variational method of the solution of physically and geometrically nonlinear problems of the theory of heterogeneous slightly curved shells. Examined are the bending and supercritical behavior of plates and conical and spherical cupolas of variable thickness in a temperature field, taking into account the dependence of the elastic parameters on temperature. The bending, stability in general and load-bearing capacity of flexible isotropic elastic-plastic shells with different criteria of plasticity, taking into account compressibility and hardening. The effect of the plastic heterogeneity caused by heat treatment, surface work hardening and irradiation by fast neutron flux is investigated. Some problems of the dynamic behavior of flexible shells are solved. Calculations are performed in high approximations. Considerable attention is given to the construction of a machine algorithm and to the checking of the convergence of iterative processes.

Kantor, B. Y.↗

Solidification of a binary mixture

The time dependent concentration and temperature profiles of a finite layer of a binary mixture are investigated during solidification. The coupled time dependent Stefan problem is solved numerically using an implicit finite differencing algorithm with the method of lines. Specifically, the temporal operator is approximated via an implicit finite difference operator resulting in a coupled set of ordinary differential equations for the spatial distribution of the temperature and concentration for each time. Since the resulting differential equations set form a boundary value problem with matching conditions at an unknown spatial point, the method of invariant imbedding is used for its solution.

Antar, B. N.↗

A conservative type-dependent full potential method for the treatment of supersonic flows with embedded subsonic regions

A nonlinear method based on the full potential equation in conservation form, cast in an arbitrary coordinate system, has been developed to treat predominantly supersonic flows with embedded subsonic regions. This type of flow field occurs frequently near the fuselage-canopy junction area and wing leading edge regions for a moderately swept fighter configuration. The method uses the theory of characteristics to accurately monitor the type-dependent flow field. A conservative switching scheme is developed to transition from the supersonic marching algorithm to a subsonic relaxation procedure, and vice versa. An implicit approximate factorization scheme is employed to solve the finite-differenced equation. Results are shown for a few configurations, including a wing-body-wake realistic fighter model having embedded subsonic regions.

Shankar, V.↗

Application of a full potential method for computation of three-dimensional supersonic flows

A nonlinear aerodynamic analysis technique based on the full potential equation in conservative form has been modified to permit treatment of supersonic flows with embedded subsonic regions (typically near the fuselage-canopy juncture and the wing leading edge). Solution procedures for the equations do not require any specific form of geometry or physical grid system. This results in the capability to analyze easily very complex geometries provided the posed problem lies within the isentropic restrictions of the full potential theory. Characteristic signal propagation theory is used to monitor the type dependent flow and a conservative switching scheme is employed to transition from the supersonic marching algorithm to a subsonic relaxation procedure and vice versa. An implicit approximate factorization scheme is used to solve the finite-difference equations. These modifications now permit analysis of fully three-dimensional flowfields including the interference effects due to lifting surface wakes. Improved grid generation capability allows analysis of complete complex aircraft geometries (fuselage, wing, tail, wing wake, and tail wake). Results are presented showing very good correlations with experimental surface pressure data and aerodynamic force data at both design and off-design operating points. Configurations examined include several waverider concepts, an arrow wing-body with wake, an advanced tactical fighter concept, and a fighter forebody-canard configuration.

Jones, K. M.↗

The usefulness of Klett's inversion algorthms to simulated satellite Lidar returns

The lidar equation is a special form of the radiative transport equation in single scattering approximation and describes the return signal of a lidar. Klett's algorithm for retrieving the total extinction coefficient profile was developed for application to ground-based lidar returns by a backward integration from the far end to the near end, the range where the incident and backscattered pulse overlap totally. The applicability of Klett's algorithm to satellite backscatter lidar returns was assessed. The simulated data of a 1 J Alexandrite laser operated at about 0.7 micron and at a satellite flight level of 840 km.

Kastner, M.↗

Analysis of a parallelized nonlinear elliptic boundary value problem solver with application to reacting flows

A parallelized finite difference code based on the Newton method for systems of nonlinear elliptic boundary value problems in two dimensions is analyzed in terms of computational complexity and parallel efficiency. An approximate cost function depending on 15 dimensionless parameters is derived for algorithms based on stripwise and boxwise decompositions of the domain and a one-to-one assignment of the strip or box subdomains to processors. The sensitivity of the cost functions to the parameters is explored in regions of parameter space corresponding to model small-order systems with inexpensive function evaluations and also a coupled system of nineteen equations with very expensive function evaluations. The algorithm was implemented on the Intel Hypercube, and some experimental results for the model problems with stripwise decompositions are presented and compared with the theory. In the context of computational combustion problems, multiprocessors of either message-passing or shared-memory type may be employed with stripwise decompositions to realize speedup of O(n), where n is mesh resolution in one direction, for reasonable n.

Keyes, David E.↗

Estimators of primary production for interpretation of remotely sensed data on ocean color

The theoretical basis is explained for some commonly used estimators of daily primary production in a vertically uniform water column. These models are recast into a canonical form, with dimensionless arguments, to facilitate comparison with each other and with an analytic solution. The limitations of each model are examined. The values of the photoadaptation parameter I(k) observed in the ocean are analyzed, and I(k) is used as a scale to normalize the surface irradiance. The range of this scaled irradiance is presented. An equation is given for estimation of I(k) from recent light history. It is shown how the models for water column production can be adapted for estimation of the production in finite layers. The distinctions between model formulation, model implementation and model evaluation are discussed. Recommendations are given on the choice of algorithm for computation of daily production according to the degree of approximation acceptable in the result.

Platt, Trevor↗

Algorithm For Integer Cosine Transforms

Algorithm computes coefficients of integer cosine transforms, containing only integer coefficients approximately proportional to floating-point coefficients of discrete cosine transforms. Used in compression of image data in blocks of N x N pixels, discrete cosine transforms involve large amounts of computation, typically amounting to 80 percent of computational load in data-compression scheme. In constructing integer approximations, competing requirements are to obtain data-compression and data-decompression performances comparable to those of corresponding descrete cosine transforms while taking advantage of simplicity afforded by integer arithmetic to reduce complexity and amount of computation.

Pollara, Fabrizio↗

Telerobotic control of a mobile coordinated robotic server

The annual report on telerobotic control of a mobile coordinated robotic server is presented. The goal of this effort is to develop advanced control methods for flexible space manipulator systems. As such, an adaptive fuzzy logic controller was developed in which model structure as well as parameter constraints are not required for compensation. The work builds upon previous work on fuzzy logic controllers. Fuzzy logic controllers have been growing in importance in the field of automatic feedback control. Hardware controllers using fuzzy logic have become available as an alternative to the traditional PID controllers. Software has also been introduced to aid in the development of fuzzy logic rule-bases. The advantages of using fuzzy logic controllers include the ability to merge the experience and intuition of expert operators into the rule-base and that a model of the system is not required to construct the controller. A drawback of the classical fuzzy logic controller, however, is the many parameters needed to be turned off-line prior to application in the closed-loop. In this report, an adaptive fuzzy logic controller is developed requiring no system model or model structure. The rule-base is defined to approximate a state-feedback controller while a second fuzzy logic algorithm varies, on-line, parameters of the defining controller. Results indicate the approach is viable for on-line adaptive control of systems when the model is too complex or uncertain for application of other more classical control techniques.

Lee, Gordon↗

Non-Equilibrium Turbulence Modeling for High Lift Aerodynamics

This phase is discussed in ('Non linear kappa - epsilon - upsilon(sup 2) modeling with application to high lift', Application of the kappa - epsilon -upsilon(sup 2) model to multi-component airfoils'). Further results are presented in 'Non-linear upsilon(sup 2) - f modeling with application to high-lift' The ADI solution method in the initial implementation was very slow to converge on multi-zone chimera meshes. I modified the INS implementation to use GMRES. This provided improved convergence and less need for user intervention in the solution process. There were some difficulties with implementation into the NASA compressible codes, due to their use of approximate factorization. The Helmholtz equation for f is not an evolution equation, so it is not of the form assumed by the approximate factorization method. Although The Kalitzin implementation involved a new solution algorithm ('An implementation of the upsilon(sup 2) - f model with application to transonic flows'). The algorithm involves introducing a relaxation term in the f-equation so that it can be factored. The factorization can be into a plane and a line, with GMRES used in the plane. The NASA code already evaluated coefficients in planes, so no additional memory is required except that associated the the GMRES algorithm. So the scope of this project has expanded via these interactions. . The high-lift work has dovetailed into turbine applications.

Durbin, P. A.↗

Independent Component Analysis of Textures

A common method for texture representation is to use the marginal probability densities over the outputs of a set of multi-orientation, multi-scale filters as a description of the texture. We propose a technique, based on Independent Components Analysis, for choosing the set of filters that yield the most informative marginals, meaning that the product over the marginals most closely approximates the joint probability density function of the filter outputs. The algorithm is implemented using a steerable filter space. Experiments involving both texture classification and synthesis show that compared to Principal Components Analysis, ICA provides superior performance for modeling of natural and synthetic textures.

Manduchi, Roberto↗

Generative Representations for Automated Design of Robots

A method of automated design of complex, modular robots involves an evolutionary process in which generative representations of designs are used. The term generative representations as used here signifies, loosely, representations that consist of or include algorithms, computer programs, and the like, wherein encoded designs can reuse elements of their encoding and thereby evolve toward greater complexity. Automated design of robots through synthetic evolutionary processes has already been demonstrated, but it is not clear whether genetically inspired search algorithms can yield designs that are sufficiently complex for practical engineering. The ultimate success of such algorithms as tools for automation of design depends on the scaling properties of representations of designs. A nongenerative representation (one in which each element of the encoded design is used at most once in translating to the design) scales linearly with the number of elements. Search algorithms that use nongenerative representations quickly become intractable (search times vary approximately exponentially with numbers of design elements), and thus are not amenable to scaling to complex designs. Generative representations are compact representations and were devised as means to circumvent the above-mentioned fundamental restriction on scalability. In the present method, a robot is defined by a compact programmatic form (its generative representation) and the evolutionary variation takes place on this form. The evolutionary process is an iterative one, wherein each cycle consists of the following steps: 1. Generative representations are generated in an evolutionary subprocess. 2. Each generative representation is a program that, when compiled, produces an assembly procedure. 3. In a computational simulation, a constructor executes an assembly procedure to generate a robot. 4. A physical-simulation program tests the performance of a simulated constructed robot, evaluating the performance according to a fitness criterion to yield a figure of merit that is fed back into the evolutionary subprocess of the next iteration. In comparison with prior approaches to automated evolutionary design of robots, the use of generative representations offers two advantages: First, a generative representation enables the reuse of components in regular and hierarchical ways and thereby serves a systematic means of creating more complex modules out of simpler ones. Second, the evolved generative representation may capture intrinsic properties of the design problem, so that variations in the representations move through the design space more effectively than do equivalent variations in a nongenerative representation. This method has been demonstrated by using it to design some robots that move, variously, by walking, rolling, or sliding. Some of the robots were built (see figure). Although these robots are very simple, in comparison with robots designed by humans, their structures are more regular, modular, hierarchical, and complex than are those of evolved designs of comparable functionality synthesized by use of nongenerative representations.

Homby, Gregory S.↗

The Hitchhiker's Guide to the Outer Solar System

We propose a novel deep space propulsion method called the Comet Hitchhiker. The concept is to perform momentum exchange with small bodies (i.e., asteroid and comet) using an extendable/retrievable tether and a harpoon. Unlike previously proposed tethered fly-by, the use of extendable tether enables to change the relative speed with a target. Hence Hitchhiker would be a prospective means of providing orbit insertion deltaV, particularly for rendezvous missions to small bodies in the outer Solar System such as Kuiper belt objects and Centaurs, which are not easily manageable with chemical propulsion or solar electric propulsion. Furthermore, by applying regenerative brake during a hitchhike maneuver, a Hitchhiker can harvest energy. The stored energy can be used to make a departure from the target by quickly retrieving the tether, which we call a inverse hitchhike maneuver. By repeating hitchhike and inverse Hitchhike maneuvers, a Hitchhiker could perform a mission to rendezvous with multiple targets efficiently, which we call a multi-hitchhike mission. We derive the basic equation of Hitchhiker, namely the Space Hitchhike Equation, which relates the specific strength and mass fraction of tether to achievable ∆V. We then perform detailed feasibility analysis through finite element simulations of tether as well as hypervelocity impact simulations of the harpoon using the Adaptive Mesh Refinement Objected-oriented C++ (AMROC) algorithm. The analysis results suggest that a hitchhike maneuver with deltaV = approximately 1.5km/s is feasible with flight proven materials such as Kevlar/Zylon tether and tungsten harpoon. A carbon nanotube tether, combined with diamond harpoon, would enable approximately 10 km/s hitchhike maneuver. Finally, we present two particular mission scenarios for Hitchhiker: Pluto rendezvous and a multi-hitchhike mission to the Themis family asteroids in the main belt.

Ono, Masahiro↗

The Hitchhiker's Guide to the Outer Solar System

We propose a novel deep space propulsion method called the Comet Hitchhiker. The concept is to perform momentum exchange with small bodies (i.e., asteroid and comet) using an extendable/retrievable tether and a harpoon. Unlike previously proposed tethered fly-by, the use of extendable tether enables to change the relative speed with a target. Hence Hitchhiker would be a prospective means of providing orbit insertion deltaV, particularly for rendezvous missions to small bodies in the outer Solar System such as Kuiper belt objects and Centaurs, which are not easily manageable with chemical propulsion or solar electric propulsion. Furthermore, by applying regenerative brake during a hitchhike maneuver, a Hitchhiker can harvest energy. The stored energy can be used to make a departure from the target by quickly retrieving the tether, which we call a inverse hitchhike maneuver. By repeating hitchhike and inverse Hitchhike maneuvers, a Hitchhiker could perform a mission to rendezvous with multiple targets efficiently, which we call a multi-hitchhike mission. We derive the basic equation of Hitchhiker, namely the Space Hitchhike Equation, which relates the specific strength and mass fraction of tether to achievable ∆V. We then perform detailed feasibility analysis through finite element simulations of tether as well as hypervelocity impact simulations of the harpoon using the Adaptive Mesh Refinement Objected-oriented C++ (AMROC) algorithm. The analysis results suggest that a hitchhike maneuver with deltaV = approximately 1.5km/s is feasible with flight proven materials such as Kevlar/Zylon tether and tungsten harpoon. A carbon nanotube tether, combined with diamond harpoon, would enable approximately 10 km/s hitchhike maneuver. Finally, we present two particular mission scenarios for Hitchhiker: Pluto rendezvous and a multi-hitchhike mission to the Themis family asteroids in the main belt.

Ono, Masahiro↗