Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “remapping”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

The piecewise-linear predictor-corrector code - A Lagrangian-remap method for astrophysical flows

We describe a time-explicit finite-difference algorithm for solving the nonlinear fluid equations. The method is similar to existing Eulerian schemes in its use of operator-splitting and artificial viscosity, except that we solve the Lagrangian equations of motion with a predictor-corrector and then remap onto a fixed Eulerian grid. The remap is formulated to eliminate errors associated with coordinate singularities, with a general prescription for remaps of arbitrary order. We perform a comprehensive series of tests on standard problems. Self-convergence tests show that the code has a second-order rate of convergence in smooth, two-dimensional flow, with pressure forces, gravity, and curvilinear geometry included. While not as accurate on idealized problems as high-order Riemann-solving schemes, the predictor-corrector Lagrangian-remap code has great flexibility for application to a variety of astrophysical problems.

Lufkin, Eric A.↗
DOE OSTI2023

Data Remapping Between One Dimensional Meshes [Slides]

Remapping involves two meshes (source and target), where a discrete set of field values (data) is available on only one of the meshes (source mesh). Since the source and target mesh can be different, we need to find an approximation of the field on the target mesh using the data available on the source mesh. We will consider two algorithms for this problem: point-wise remap and conservative remap.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Strategies for conservative and non-conservative monotone remapping on the sphere

Abstract. Monotonicity is an important property of remapping operators for coupled weather and climate models. However, it is often challenging to design highly accurate operators that avoid the generation of new extrema or keep a remapped field between physically prescribed bounds. To that end, this paper explores several traditional and novel approaches for both conservative and non-conservative monotone remapping on the sphere. The accuracy and effectiveness of these algorithms are evaluated in the context of several different real and idealized fields and meshes.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

The distribution-based remapping of the nodal mass and momentum between arbitrary meshes for staggered arbitrary Lagrangian-Eulerian hydrodynamics

We present a new distribution-based remapping of the nodal mass and momentum between arbitrary source (Lagrangian) and arbitrary target (rezoned) meshes for indirect staggered arbitrary Lagrangian-Eulerian hydrodynamics. Here, the method is based on the following ideas: define cell-centered momentum and mass on the source mesh; conservatively remap those cell-centered quantities from source to target meshes; and use local constrained optimization for each cell of the target mesh to conservatively distribute cell mass and momentum to the nodes of the cell. This new method is efficient, conservative, accurate and bounds preserving.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Data Remapping Between One-Dimensional Meshes

In this report, we describe two approaches to the problem of remapping data from a source mesh (on which data is available) onto a target mesh. We consider two separate methods to solve the problem: Pointwise and Conservative remap, and determine why one is more advantageous when considering different physics applications and elements. We utilize C++ functionalities to derive our findings along with the C++ ”Chronos” library for timing measurements of our studies.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Remapping between meshes with isoparametric cells: a case study

We explore an intersection-based remap method between meshes consisting of isoparametric elements. We present algorithms for the case of serendipity isoparametric elements (QUAD8 elements) and piece-wise constant (cell-centered) discrete fields. We demonstrate convergence properties of this remap method with a few numerical experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Data Remapping Between One-Dimensional Meshes [Slides]

Two different remapping algorithms were implemented: point wise (node-to-node date remapping) and conservative (conserves the area under the curve. The performance of both linear and binary searches were studied and it was found that the binary search was more efficient.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1982

Report on the subpanel on remapping procedures

Problems associated with remapping procedures are defined and research tasks are proposed. It is noted that the remapping/rectification process could be significantly aided through engineering systems improvements in attitude control, with subsequent improvement in spacecraft ephemeris modeling accuracy. There is a need for state-of-the-art technology assessments prior to initiation of major programs, and the high potential return from well formulated testing of algorithms on selected data sets of actual and synthetic imagery. In addition, there is a need for tasks that incorporate standard photogrammetric methodology and formulas and that more fully utilize platform and calibration data from current and proposed sensors to reproject digital imagery. The impact of improved platform stability and integration of global positioning system measurements on reduced ground segment processing needs to be critically assessed. Also highlighted is the need for a substantial effort in the development of remapping software and systems that are modular and transportable.

Source record↗
NASA NTRS1982

Computational aspects of remapping digital imagery

One of the advantages of automated cartography is that map data stored in the digital computer can be plotted or displayed at any scale or projection by recomputing the coordinates of the data. This is especially easy in the case of vector (graphics) data but in the case of digital image (raster) data, remapping is a more difficult operation. Examples of the remapping of digital imagery would include rectification of a LANDSAT MSS to an orthographic or Mercator projection, warping of one image to register with another, or rotation, scale, or aspect changes of a digital image. Use of general purpose computers and array processors for this task will be covered. Data processing error will be discussed for each modelling/warping approach.

Zobrist, A. L.↗
NASA NTRS1997

Efficient Load Balancing and Data Remapping for Adaptive Grid Calculations

Mesh adaption is a powerful tool for efficient unstructured- grid computations but causes load imbalance among processors on a parallel machine. We present a novel method to dynamically balance the processor workloads with a global view. This paper presents, for the first time, the implementation and integration of all major components within our dynamic load balancing strategy for adaptive grid calculations. Mesh adaption, repartitioning, processor assignment, and remapping are critical components of the framework that must be accomplished rapidly and efficiently so as not to cause a significant overhead to the numerical simulation. Previous results indicated that mesh repartitioning and data remapping are potential bottlenecks for performing large-scale scientific calculations. We resolve these issues and demonstrate that our framework remains viable on a large number of processors.

Oliker, Leonid↗
DOE OSTI2022

Conservative remapping of material-dependent fields between possibly misaligned material regions

In this work, we propose an interpolation or remapping algorithm of material-dependent fields on polyhedral meshes where any source or target cell contains only one material. It is conservative and it preserves sharp material boundaries on the target mesh, even if the source and target regions delineating the same material are slightly misaligned. If those material regions are aligned, then the algorithm is also linearity-preserving and bounds-preserving. For a given material, it consists of a conservative field reconstruction on a target mesh part from a source mesh part associated with that material, followed by a repair step in case of misaligned boundaries. No assumption is made regarding the topology of the input meshes

36 MATERIALS SCIENCE↗
DOE OSTI2020

3D Cell-centered hydrodynamics with subscale closure model and multi-material remap

We extend a higher-order finite volume cell-centered hydrodynamic (CCH) formulation to include an interface-aware subscale closure model and a multi-material remap for simulating 3D compressible hydrodynamic problems within an arbitrary Lagrangian-Eulerian (ALE) framework. This CCH formulation involves a multidirectional approximate Riemann solution using quadratic polynomial reconstructions of the stress tensor and the velocity. At the subscale level, we determine pair-wise material interactions by solving a distinct approximate Riemann problem at the common interface, using the volume of fluids (VOF) method to find the interface. Material interactions are constrained to ensure smooth pressure equilibration among materials. The accuracy and robustness of the ALE method is demonstrated by simulating a suite of 3D Cartesian multi-material problems covering both gas and solid dynamics, where each test case has two or more materials.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Moments-based interface reconstruction, remap and advection

Here, we present a new moment-of-fluid (MOF 2 ) interface reconstruction method. It uses the zeroth, first, and second moments of the fragment of material inside a cell of the mesh to reconstruct a convex material polygon or a union of convex polygons that approximate the respective material fragment. The new method requires information about the material moments only for the cell under consideration. The MOF 2 method allows to exactly reproduce several convex shapes: corners, filaments, and some concave shapes: cell-complements to corners and filaments. Interface reconstruction is formulated as a local (for each cell), non-linear, equality constrained optimization problem, which does not require additional communication and allows for an efficient parallel implementation. We present an extensive set of test problems, both for interface reconstruction on a single cell, and for reconstruction of a variety of shapes on a variety of meshes. We describe how to perform two-material advection using the MOF 2 method and present the results for the classical advection tests. We also show the examples of material interface remapping needed in the framework of multi-material arbitrary Lagrangian-Eulerian methods, and give a brief description of a procedure that can be used to update the material moments on the Lagrangian stage of those methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Applying an Oriented Divergence Theorem to Swept Face Remap

Here we present a novel oriented divergence theorem and apply the results to a swept face remap method (conservative data transfer between two meshes) in arbitrary Langrangian–Eulerian hydrodynamics. In our setting, we compute the material flux along swept regions between corresponding faces in the source and target meshes. Since the swept region may add material, subtract material, or do both when it intersects itself, we cannot apply the conventional divergence theorem without accounting for orientation and self-overlaps. In this work, we encode the swept region orientation and geometry with a map from the unit n -dimensional cube, and then apply an oriented analog of divergence theorem to compute the material flux. We present efficient implementation strategies for the presented method. We also provide numerical evidence supporting our results and discuss extensions to more general mesh topologies.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

METRICS FOR INTERCOMPARISON OF REMAPPING ALGORITHMS (MIRA)

The MIRA project comprises of a set of Python drivers that enable rigorous intercomparison of remapping algorithms by providing the infrastructure for computing the numerical metrics of interest for ESM. This work is funded by the SciDAC Coupling Approaches for Next-Generation Architectures (CANGA) project.

SciDAC↗
NASA NTRS2003

Research priorities and plans for the International Space Station-results of the 'REMAP' Task Force

Recent events in the International Space Station (ISS) Program have resulted in the necessity to re-examine the research priorities and research plans for future years. Due to both technical and fiscal resource constraints expected on the International Space Station, it is imperative that research priorities be carefully reviewed and clearly articulated. In consultation with OSTP and the Office of Management and budget (OMB), NASA's Office of Biological and Physical Research (OBPR) assembled an ad-hoc external advisory committee, the Biological and Physical Research Maximization and Prioritization (REMAP) Task Force. This paper describes the outcome of the Task Force and how it is being used to define a roadmap for near and long-term Biological and Physical Research objectives that supports NASA's Vision and Mission. Additionally, the paper discusses further prioritizations that were necessitated by budget and ISS resource constraints in order to maximize utilization of the International Space Station. Finally, a process has been developed to integrate the requirements for this prioritized research with other agency requirements to develop an integrated ISS assembly and utilization plan that maximizes scientific output. c2003 American Institute of Aeronautics and Astronautics. Published by Elsevier Science Ltd. All rights reserved.

NASA Center HQS↗
DOE OSTI2026

Noise-Directed Adaptive Remapping for Integer Optimization: from qubits to (encoded) qudits

We extend Noise-Directed Adaptive Remapping (NDAR), a recently proposed heuristic meta-algorithm that leverages device noise as a computational resource, to optimization problems over discrete (integer) domains. While originally introduced for unconstrained binary optimization, the proposed generalization introduces additional gauge degrees of freedom at the logical level, such that the gauge transformation applied at each iteration is no longer unique, allowing tailoring to particular encodings or quantum hardware. We identify encoding-dependent requirements for NDAR beyond binary domains: feasibility of the noise attractor, existence of compatible gauge transformations that preserve an efficiently implementable circuit family, and a systematic way to select the transform to apply at each step. We analyze these criteria for qudit-native and for binary, one-hot, and domain-wall qubit encodings, using the Max-k-colorable subgraph problem as a running example. We demonstrate that these encodings can exhibit distinct advantages and tradeoffs when integrated within the NDAR framework, particularly in how noise-induced dynamics interact with the solution landscape and choice of encoding. Our results indicate that NDAR-guided noise considerations provide a new criterion for comparing device-level encoding choices for quantum optimization. Finally, we outline directions toward experimental realization in superconducting qudit devices and further algorithmic improvements.

Hadfield, Stuart [RIACS, Mtn. View] (ORCID:0000000↗