Search NASA⌕ Search

SEARCH · Search NASA

Results for “Smoothing algorithm”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 325 records · Page 18

Navigation Algorithms for the SeaWiFS Mission

The navigation algorithms for the Sea-viewing Wide Field-of-view Sensor (SeaWiFS) were designed to meet the requirement of 1-pixel accuracy-a standard deviation (sigma) of 2. The objective has been to extract the best possible accuracy from the spacecraft telemetry and avoid the need for costly manual renavigation or geometric rectification. The requirement is addressed by postprocessing of both the Global Positioning System (GPS) receiver and Attitude Control System (ACS) data in the spacecraft telemetry stream. The navigation algorithms described are separated into four areas: orbit processing, attitude sensor processing, attitude determination, and final navigation processing. There has been substantial modification during the mission of the attitude determination and attitude sensor processing algorithms. For the former, the basic approach was completely changed during the first year of the mission, from a single-frame deterministic method to a Kalman smoother. This was done for several reasons: a) to improve the overall accuracy of the attitude determination, particularly near the sub-solar point; b) to reduce discontinuities; c) to support the single-ACS-string spacecraft operation that was started after the first mission year, which causes gaps in attitude sensor coverage; and d) to handle data quality problems (which became evident after launch) in the direct-broadcast data. The changes to the attitude sensor processing algorithms primarily involved the development of a model for the Earth horizon height, also needed for single-string operation; the incorporation of improved sensor calibration data; and improved data quality checking and smoothing to handle the data quality issues. The attitude sensor alignments have also been revised multiple times, generally in conjunction with the other changes. The orbit and final navigation processing algorithms have remained largely unchanged during the mission, aside from refinements to data quality checking. Although further improvements are certainly possible, future evolution of the algorithms is expected to be limited to refinements of the methods presented here, and no substantial changes are anticipated.

Hooker, Stanford B.↗

Toward Higher-order Accuracy in Self-gravitating Hydrodynamics

High-order algorithms have emerged in numerical astrophysics as a promising avenue to reduce truncation error (proportional to a power of the linear resolution Δ x ) with only a moderate increase to computational expense. Significant effort has been placed in the development of finite-volume algorithms for (magneto)hydrodynamics; however, state-of-the-art astrophysical simulations tightly couple a plenitude of physics, additionally including gravity, photon transport, cosmic-ray transport, chemistry, and/or diffusion, to name a few. Algorithms frequently operator-split this additional physics (often a first-order error in time) and/or adopt a model wherein their evaluation is limited to second-order accuracy in space. In this work, we present a fourth-order-accurate finite-volume scheme for self-gravitating hydrodynamics on a uniform Cartesian grid. The method supplies source terms for the gravitational acceleration ( ρ g ) and gravitational energy release ( ρ v · g ) associated with fourth-order-accurate solutions to the Poisson equation. Our scheme (1) guarantees the conservation of total linear momentum while (2) decreasing (in proportion to Δ x 4 ) the effects of spurious heating and/or cooling associated with truncation error in the gravity. We demonstrate expected convergence rates for the algorithm by measuring errors in test problems evolving self-gravity modified linear waves and 3D polytropic equilibria. We test robustness of the algorithm by integrating an induced “inside-out” adiabatic collapse. We also discuss a method to smoothly downgrade the solution to second-order spatial accuracy to avoid spurious overshoots near steep density and/or pressure gradients.

79 ASTRONOMY AND ASTROPHYSICS↗

Near minimum-time maneuvers of large space structures using parameter optimization

Near minimum-time attitude maneuvers for large, inherently-flexible space structures with finite fuel supplies are investigated. The open loop maneuver is determined with the Sequential Quadratic Programming (SQP) algorithm, which optimizes a bang-off-bang control parameter set for the given maneuver. Torque smoothing is used to prevent discontinuities in the control which would excite the flexible structure. Additional system dynamics such as thruster inefficiency, spring forces and pressure leaks are identified from preliminary experiments on the ASTREX test article.

Carter, M. T.↗

Software Performs Complex Design Analysis

Designers use computational fluid dynamics (CFD) to gain greater understanding of the fluid flow phenomena involved in components being designed. They also use finite element analysis (FEA) as a tool to help gain greater understanding of the structural response of components to loads, stresses and strains, and the prediction of failure modes. Automated CFD and FEA engineering design has centered on shape optimization, which has been hindered by two major problems: 1) inadequate shape parameterization algorithms, and 2) inadequate algorithms for CFD and FEA grid modification. Working with software engineers at Stennis Space Center, a NASA commercial partner, Optimal Solutions Software LLC, was able to utilize its revolutionary, one-of-a-kind arbitrary shape deformation (ASD) capability-a major advancement in solving these two aforementioned problems-to optimize the shapes of complex pipe components that transport highly sensitive fluids. The ASD technology solves the problem of inadequate shape parameterization algorithms by allowing the CFD designers to freely create their own shape parameters, therefore eliminating the restriction of only being able to use the computer-aided design (CAD) parameters. The problem of inadequate algorithms for CFD grid modification is solved by the fact that the new software performs a smooth volumetric deformation. This eliminates the extremely costly process of having to remesh the grid for every shape change desired. The program can perform a design change in a markedly reduced amount of time, a process that would traditionally involve the designer returning to the CAD model to reshape and then remesh the shapes, something that has been known to take hours, days-even weeks or months-depending upon the size of the model.

Source record↗

Internship Abstract - Aerosciences and Flight Mechanics Intern

Mars is a hard place to land on, but my internship with NASA's Aerosciences & Flight Mechanics branch has shown me the ways in which men and women will one day land safely. I work on Mars Aerocapture, an aeroassist maneuver that reduces the fuel necessary to "capture" into Martian orbit before a descent. The spacecraft flies through the Martian atmosphere to lose energy through heating before it exits back into space, this time at a slower velocity and in orbit around Mars. Spacecraft will need to maneuver through the Martian atmosphere to accurately hit their orbit, and they will need to survive the generated heat. Engineering teams need simulation data to continue their designs, and the guidance algorithm that ensures a proper orbit insertion needs to be refined - two jobs that fell to me at the summer's start. Engineers within my branch have developed two concept aerocapture vehicles, and I run simulations on their behavior during the maneuver. I also test and refine the guidance algorithm. I spent the first few weeks familiarizing myself with the simulation software, troubleshooting various guidance bugs and writing code. Everything runs smoothly now, and I recently sent my first set of trajectory data to a Thermal Protection System group so they can incorporate it into their heat-bearing material designs. I hope to generate plenty of data in the next few weeks for various engineering groups before my internship ends mid-August. My major accomplishment so far is improving the guidance algorithm. It is a relatively new algorithm that promises higher accuracy and fuel efficiency, but it hasn't undergone extensive testing yet. I've had the opportunity to work with the principal developer - a professor at Iowa State University - to find and fix several issues. I was also assigned the task of expanding the branch's aerodynamic heating simulation software. I am excited to do this because engineers in the future will use my work to generate meaningful data and make design decisions. My internship has taught me to how to teach myself. There are no tutors, study sessions or professor office hours. When I am given an assignment I am expected to figure out how to accomplish it, and I have grown in my problem solving abilities. My summer experience has reinforced my drive to work at NASA, and I can definitely see myself working full time on the aerocapture project, or something similar.

Rangel, John↗

Interface of an uncoupled boundary layer algorithm with an inviscid core flow algorithm for unsteady supersonic engine inlets

An uncoupled boundary layer algorithm was combined with an inviscid core flow algorithm to model flows within supersonic engine inlets. The inviscid flow algorithm that was used was the LArge Perturbation INlet Code (LAPIN). The boundary layer and inviscid core flow algorithms were formulated in different manners. The boundary layer algorithm was two dimensional and solved in nonconservation form, while the core flow algorithm was one dimensional and solved in conservation form. In order to interface the two codes, the following modifications were important. The coordinate system was set up to maintain the parabolic nature of the boundary layer algorithm while approaching the one dimensional core flow solution far from a wall. The pressure gradient used in the boundary layer equation was calculated using the core flow values and the boundary layer equations, so the boundary layer solution smoothly approached the core flow values far from the wall. Flaring was used for the advection terms perpendicular to the core flow to maintain the stability of the algorithm. With these modifications, the combined viscous/inviscid algorithm matched well with experimental observations of pressure distributions with a supersonic inlet.

Darling, Douglas↗

Interface of an uncoupled boundary layer algorithm with an inviscid core flow algorithm for unsteady supersonic engine inlets

An uncoupled boundary layer algorithm was combined with an inviscid core flow algorithm to model flows within supersonic engine inlets. The inviscid flow algorithm that was used was the LArge Perturbation INlet Code (LAPIN). The boundary layer and inviscid core flow algorithms were formulated in different manners. The boundary layer algorithm was two dimensional and solved in nonconservation form, while the core flow algorithm was one dimensional and solved in conservation form. In order to interface the two codes, the following modifications were important. The coordinate system was set up to maintain the parabolic nature of the boundary layer algorithm while approaching the one dimensional core flow solution far from a wall. The pressure gradient used in the boundary layer equation was calculated using the core flow values and the boundary layer equations, so the boundary layer solution smoothly approached the core flow values far from the wall. Flaring was used for the advection terms perpendicular to the core flow to maintain the stability of the algorithm. With these modifications, the combined viscous/inviscid algorithm matched well experimental observations of pressure distributions with a supersonic inlet.

Darling, Douglas↗

GX: a GPU-native gyrokinetic turbulence code for tokamak and stellarator design

GX is a code designed to solve the nonlinear gyrokinetic system for low-frequency turbulence in magnetized plasmas, particularly tokamaks and stellarators. In GX, our primary motivation and target is a fast gyrokinetic solver that can be used for fusion reactor design and optimization along with wide-ranging physics exploration. Here, this has led to several code and algorithm design decisions, specifically chosen to prioritize time to solution. First, we have used a discretization algorithm that is pseudospectral in the entire phase space, including a Laguerre–Hermite pseudospectral formulation of velocity space, which allows for smooth interpolation between coarse gyrofluid-like resolutions and finer conventional gyrokinetic resolutions and efficient evaluation of a model collision operator. Additionally, we have built GX to natively target graphics processors (GPUs), which are among the fastest computational platforms available today. Finally, we have taken advantage of the reactor-relevant limit of small $\rho _*$ by using the radially local flux-tube approach. In this paper we present details about the gyrokinetic system and the numerical algorithms used in GX to solve the system. We then present several numerical benchmarks against established gyrokinetic codes in both tokamak and stellarator magnetic geometries to verify that GX correctly simulates gyrokinetic turbulence in the small $\rho _*$. Moreover, we show that the convergence properties of the Laguerre–Hermite spectral velocity formulation are quite favourable for nonlinear problems of interest. Coupled with GPU acceleration, which we also investigate with scaling studies, this enables GX to be able to produce useful turbulence simulations in minutes on one (or a few) GPUs and higher fidelity results in a few hours using several GPUs. GX is open-source software that is ready for fusion reactor design studies.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Optimization of satellite altimeter and wave height measurements

Two techniques for simultaneously estimating altitude, ocean wave height, and signal-to-noise ratio from the GEOS-C satellite altimeter data are described. One technique was based on maximum likelihood estimation, MLE, and the other on minimum mean square error estimation, MMSE. Performance was determined by comparing the variance and bias of each technique with the variance and bias of the smoothed output from the Geos altimeter tracker. Ocean wave height tracking performance for the MLE and MMSE algorithms was measured by comparing the variance and bias of the wave height estimates with that of the expression for the return waveform obtained by a fit to the average output of the 16 waveform sampling gates.

Dooley, R. P.↗

Transonic flow calculations using a flux vector splitting method for the Euler equations

A study of the flux vector splitting method of Steger and Warming for the solution of the time dependent Euler equations in strong conservation law form for arbitrary two-dimensional geometries is presented. The procedure employed here differs from that of Buning and Steger in that it uses a different algorithm and employs implicit boundary conditions. Moreover, the method, as implemented here, does not contain any explicit smoothing or any adjustable parameters. Calculations were carried out for an NACA 0012 airfoil at various Mach numbers and angles of attack, and cylinders. Steady symmetric solutions were obtained for the full cylinder at a freestream Mach number of .5 without imposing a symmetry condition. In general, good agreement with other methods was obtained.

Seaford, C. M.↗

A coupled discontinuous Galerkin-Finite Volume framework for solving gas dynamics over embedded geometries

Herein, we present a computational framework for solving the equations of inviscid gas dynamics using structured grids with embedded geometries. The novelty of the proposed approach is the use of high-order discontinuous Galerkin (dG) schemes and a shock-capturing Finite Volume (FV) scheme coupled via an hp adaptive mesh refinement (hp-AMR) strategy that offers high-order accurate resolution of the embedded geometries. The hp-AMR strategy is based on a multi-level block-structured domain partition in which each level is represented by block-structured Cartesian grids and the embedded geometry is represented implicitly by a level set function. The intersection of the embedded geometry with the grids produces the implicitly-defined mesh that consists of a collection of regular rectangular cells plus a relatively small number of irregular curved elements in the vicinity of the embedded boundaries. High-order quadrature rules for implicitly-defined domains enable high-order accuracy resolution of the curved elements with a cell-merging strategy to address the small-cell problem. The hp-AMR algorithm treats the system with a second-order finite volume scheme at the finest level to dynamically track the evolution of solution discontinuities while using dG schemes at coarser levels to provide high-order accuracy in smooth regions of the flow. On the dG levels, the methodology supports different orders of basis functions on different levels. The space-discretized governing equations are then advanced explicitly in time using high-order Runge-Kutta algorithms. Numerical tests are presented for two-dimensional and three-dimensional problems involving an ideal gas. The results are compared with both analytical solutions and experimental observations and demonstrate that the framework provides high-order accuracy for smooth flows and accurately captures solution discontinuities.

97 MATHEMATICS AND COMPUTING↗

BeyondPlanck: VII. Bayesian estimation of gain and absolute calibration for cosmic microwave background experiments

We present a Bayesian calibration algorithm for cosmic microwave background (CMB) observations as implemented within the global end-to-end BEYONDPLANCK framework and applied to the Planck Low Frequency Instrument (LFI) data. Following the most recent Planck analysis, we decomposed the full time-dependent gain into a sum of three nearly orthogonal components: one absolute calibration term, common to all detectors, one time-independent term that can vary between detectors, and one time-dependent component that was allowed to vary between one-hour pointing periods. Each term was then sampled conditionally on all other parameters in the global signal model through Gibbs sampling. The absolute calibration is sampled using only the orbital dipole as a reference source, while the two relative gain components were sampled using the full sky signal, including the orbital and Solar CMB dipoles, CMB fluctuations, and foreground contributions. We discuss various aspects of the data that influence gain estimation, including the dipole-polarization quadrupole degeneracy and processing masks. Comparing our solution to previous pipelines, we find good agreement in general, with relative deviations of -0.67% (-0.84%) for 30 GHz, 0.12% (-0.04%) for 44 GHz and -0.03% (-0.64%) for 70 GHz, compared to Planck PR4 and Planck 2018, respectively. We note that the BEYONDPLANCK calibration was performed globally, which results in better inter-frequency consistency than previous estimates. Additionally, WMAP observations were used actively in the BEYONDPLANCK analysis, which both breaks internal degeneracies in the Planck data set and results in an overall better agreement with WMAP. Finally, we used a Wiener filtering approach to smoothing the gain estimates. We show that this method avoids artifacts in the correlated noise maps as a result of oversmoothing the gain solution, which is difficult to avoid with methods like boxcar smoothing, as Wiener filtering by construction maintains a balance between data fidelity and prior knowledge. Although our presentation and algorithm are currently oriented toward LFI processing, the general procedure is fully generalizable to other experiments, as long as the Solar dipole signal is available to be used for calibration.

79 ASTRONOMY AND ASTROPHYSICS↗

Smooth periodic gauge satisfying crystal symmetry and periodicity to study high-harmonic generation in solids

Intense lasers can easily drive nonadiabatic transitions of excited electron wave packets across the Brillouin zones, thus transition dipole moments (TDM) between energy bands of solids should be continuous, satisfying crystal symmetry, and periodic at zone boundaries. While current ab initio algorithms are powerful in calculating band structures of solids, they all introduced random phases into the eigenfunctions at each crystal momentum k. In this work, we show how to choose a “smooth-periodic” gauge where TDMs can be smooth versus k, preserving crystal symmetry, as well as maintaining periodic at boundaries. The symmetry properties of TDMs with respect to k ensure the absence of even-order harmonics from MgO with inversion symmetry, while the TDM in the “smooth-periodic” gauge for broken-symmetry ZnO is responsible for even harmonics that were underestimated in previous simulations. These results reveal the importance of correctly treating the complex TDMs that satisfy crystal symmetry and continuous across zone boundaries in nonlinear laser-solid interactions, which has been elusive in most theories so far.

36 MATERIALS SCIENCE↗

Area-Preserving Mapping of 3D Carotid Ultrasound Images Using Density-Equalizing Reference Map

Carotid atherosclerosis is a focal disease at the bifurcations of the carotid artery. To quantitatively monitor the local changes in the vessel-wall-plus-plaque thickness (VWT) and compare the VWT distributions for different patients or for the same patients at different ultrasound scanning sessions, a mapping technique is required to adjust for the geometric variability of different carotid artery models. In this work, we propose a novel method called density-equalizing reference map (DERM) for mapping 3D carotid surfaces to a standardized 2D carotid template, with an emphasis on preserving the local geometry of the carotid surface by minimizing the local area distortion. The initial map was generated by a previously described arc-length scaling (ALS) mapping method, which projects a 3D carotid surface onto a 2D non-convex L-shaped domain. A smooth and area-preserving flattened map was subsequently constructed by deforming the ALS map using the proposed algorithm that combines the density-equalizing map and the reference map techniques. This combination allows, for the first time, one-to-one mapping from a 3D surface to a standardized non-convex planar domain in an area-preserving manner. Evaluations using 20 carotid surface models show that the proposed method reduced the area distortion of the flattening maps by over 80% as compared to the ALS mapping method.

60 APPLIED LIFE SCIENCES↗

LANDSAT instruments characterization

Work performed for the LANDSAT instrument characterization task in the areas of absolute radiometry, coherent noise analysis, and between-date smoothing is reported. Absolute radiometric calibration for LANDSAT-5 TM under ambient conditions was performed. The TM Radiometric Algorithms and Performance Program (TRAPP) was modified to create optional midscan data files and to match the TM Image Processing System (TIPS) algorithm for pulse determination. Several data reduction programs were developed, including a linear regression and its plotted result. A fast Fourier transformation study was conducted on the resequenced TM data. Subscenes of homogeneous water within scenes over Pensacola, Florida were used for testing the FFT on the resequenced data. Finally, a gain and pulse height stability study of LANDSAT 5 TM spectral bands was performed.

Lee, Y.↗

The MSFC/J70 orbital atmosphere model and the data bases for the MSFC solar activity prediction technique

The MSFC/J70 Orbital Atmospheric Density Model, a modified version of the Smithsonian Astrophysical Observatory Jacchia 1970 model is explained. The algorithms describing the MSFC/J70 model are included as well as listing of the computer program. The 13-month smoothed values of solar flux (F sub 10.7) and geomagnetic index (S sub p), which are required as inputs for the MSFC/J70 model, are also included and discussed.

Johnson, D. L.↗

Three-dimensional multigrid algorithms for the flux-split Euler equations

The Full Approximation Scheme (FAS) multigrid method is applied to several implicit flux-split algorithms for solving the three-dimensional Euler equations in a body fitted coordinate system. Each of the splitting algorithms uses a variation of approximate factorization and is implemented in a finite volume formulation. The algorithms are all vectorizable with little or no scalar computation required. The flux vectors are split into upwind components using both the splittings of Steger-Warming and Van Leer. The stability and smoothing rate of each of the schemes are examined using a Fourier analysis of the complete system of equations. Results are presented for three-dimensional subsonic, transonic, and supersonic flows which demonstrate substantially improved convergence rates with the multigrid algorithm. The influence of using both a V-cycle and a W-cycle on the convergence is examined.

Anderson, W. Kyle↗

Volume 2: Explicit, multistage upwind schemes for Euler and Navier-Stokes equations

The objective of this study was to develop a high-resolution-explicit-multi-block numerical algorithm, suitable for efficient computation of the three-dimensional, time-dependent Euler and Navier-Stokes equations. The resulting algorithm has employed a finite volume approach, using monotonic upstream schemes for conservation laws (MUSCL)-type differencing to obtain state variables at cell interface. Variable interpolations were written in the k-scheme formulation. Inviscid fluxes were calculated via Roe's flux-difference splitting, and van Leer's flux-vector splitting techniques, which are considered state of the art. The viscous terms were discretized using a second-order, central-difference operator. Two classes of explicit time integration has been investigated for solving the compressible inviscid/viscous flow problems--two-state predictor-corrector schemes, and multistage time-stepping schemes. The coefficients of the multistage time-stepping schemes have been modified successfully to achieve better performance with upwind differencing. A technique was developed to optimize the coefficients for good high-frequency damping at relatively high CFL numbers. Local time-stepping, implicit residual smoothing, and multigrid procedure were added to the explicit time stepping scheme to accelerate convergence to steady-state. The developed algorithm was implemented successfully in a multi-block code, which provides complete topological and geometric flexibility. The only requirement is C degree continuity of the grid across the block interface. The algorithm has been validated on a diverse set of three-dimensional test cases of increasing complexity. The cases studied were: (1) supersonic corner flow; (2) supersonic plume flow; (3) laminar and turbulent flow over a flat plate; (4) transonic flow over an ONERA M6 wing; and (5) unsteady flow of a compressible jet impinging on a ground plane (with and without cross flow). The emphasis of the test cases was validation of code, and assessment of performance, as well as demonstration of flexibility.

Elmiligui, Alaa↗