Search NASA⌕ Search

SEARCH · Search NASA

Results for “high-order surface reconstruction”

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.

9 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Compact feature-aware Hermite-style high-order surface reconstruction

High-order surface reconstruction is now a commonly used technique for mesh generation and adaptation, geometric and physical modeling, and high-order numerical methods for solving partial differential equations (PDEs). However, surface reconstruction from a relatively coarse mesh remained a challenging problem, especially for surfaces with sharp features. Here in this paper, we introduce a new method to address this challenge by improving the previous state of the art, including continuous moving frames (CMF) and weighted averaging of local fittings (WALF) (Eng Comput 28 (2012)), in two aspects. First, we significantly improve the robustness of reconstruction from coarse meshes using a Hermite-style least squares approximation to incorporate normals of the surface and tangents of the feature curves. Second, we ensure both G 0 continuity and high-order accuracy of the reconstruction near sharp features by generating parametric surface elements with an iterative feature-aware parameterization. We present the theoretical framework of our method and compare it against point-based methods in terms of accuracy and stability. We demonstrate the use of the proposed technique in generating high-order meshes for finite element methods, and show that it enables nearly identical solutions as using the meshes generated from exact geometry, while allowing additional flexibility.

42 ENGINEERING↗
DOE OSTI2016

Array-based, parallel hierarchical mesh refinement algorithms for unstructured meshes

In this paper, we describe an array-based hierarchical mesh refinement capability through uniform refinement of unstructured meshes for efficient solution of PDE's using finite element methods and multigrid solvers. A multi-degree, multi-dimensional and multi-level framework is designed to generate the nested hierarchies from an initial coarse mesh that can be used for a variety of purposes such as in multigrid solvers/preconditioners, to do solution convergence and verification studies and to improve overall parallel efficiency by decreasing I/O bandwidth requirements (by loading smaller meshes and in memory refinement). We also describe a high-order boundary reconstruction capability that can be used to project the new points after refinement using high-order approximations instead of linear projection in order to minimize and provide more control on geometrical errors introduced by curved boundaries.The capability is developed under the parallel unstructured mesh framework "Mesh Oriented dAtaBase" (MOAB Tautges et al. (2004)). We describe the underlying data structures and algorithms to generate such hierarchies in parallel and present numerical results for computational efficiency and effect on mesh quality. Furthermore, we also present results to demonstrate the applicability of the developed capability to study convergence properties of different point projection schemes for various mesh hierarchies and to a multigrid finite-element solver for elliptic problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Two-dimensional stitching interferometry for self-calibration of high-order additive systematic errors

Stitching interferometry is performed by collecting interferometric data from overlapped sub-apertures and stitching these data together to provide a full surface map. The propagation of the systematic error in the measured subset data is one of the main error sources in stitching interferometry for accurate reconstruction of the surface topography. In this work, we propose, using the redundancy of the captured subset data, two types of two-dimensional (2D) self-calibration stitching algorithms to overcome this issue by in situ estimating the repeatable high-order additive systematic errors, especially for the application of measuring X-ray mirrors. The first algorithm, called CS short for “Calibrate, and then Stitch”, calibrates the high-order terms of the reference by minimizing the de-tilted discrepancies of the overlapped subsets and then stitches the reference-subtracted subsets. The second algorithm, called SC short for “Stitch, and then Calibrate”, stitches a temporarily result and then calibrates the reference from the de-tilted discrepancies of the measured subsets and the temporarily stitched result. In the implementation of 2D scans in $x$- and y -directions, step randomization is introduced to generate nonuniformly spaced subsets which can diminish the periodic stitching errors commonly observed in evenly spaced subsets. The regularization on low-order terms enables a highly flexible option to add the curvature and twist acquired by another system. Both numerical simulations and experiments are carried out to verify the proposed method. All the results indicate that 2D high-order repeatable additive systematic errors can be retrieved from the 2D redundant overlapped data in stitching interferometry.

42 ENGINEERING↗
DOE OSTI2020

An arbitrarily high-order three-dimensional Cartesian-grid method for reconstructing interfaces from volume fraction fields

Here Tthis work describes a newly developed, arbitrarily high-order Cartesian-grid method for reconstructing material interfaces from a volume fraction field. The method begins by identifying all of the grid cells in the volume fraction field that are intersected by the interface and need to be approximated by the reconstruction scheme. Finite-differences are used to calculate the gradient of the volume fraction field and provide an estimate of the surface normal in all of the interfacial grid cells. Groups of connected grid cells are then identified which all have the same dominant component of the normal vector. This grouping by orientation determines the proper dependent variable to use in the surface reconstruction (e.g. for a 2D curve, this step determines if the surface will be approximated by a function of x or y). A cumulative integral over the surface is constructed and fit using b-splines for two-dimensional problems or tensor-product b-splines for three-dimensional problems. This construction allows for the interface to be recovered through application of the second fundamental theorem of calculus. Fitting the cumulative integral with $\mathscr{N}$ th-order b-splines (or tensor-product b-splines) yields an ($\mathscr{N}$-1) th-order convergence rate of the interface shape. Differentiation of the b-spline interface function(s) allows for the high-order approximation of the normal vector and curvature to be obtained directly anywhere along b-spline. Together, the proposed reconstruction technique can achieve arbitrarily high mesh convergence rates. Validation tests are presented with mesh convergence rates ranging from fourth- to tenth-order.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1995

A 3D High-Order Unstructured Finite-Volume Algorithm for Solving Maxwell's Equations

A three-dimensional finite-volume algorithm based on arbitrary basis functions for time-dependent problems on general unstructured grids is developed. The method is applied to the time-domain Maxwell equations. Discrete unknowns are volume integrals or cell averages of the electric and magnetic field variables. Spatial terms are converted to surface integrals using the Gauss curl theorem. Polynomial basis functions are introduced in constructing local representations of the fields and evaluating the volume and surface integrals. Electric and magnetic fields are approximated by linear combinations of these basis functions. Unlike other unstructured formulations used in Computational Fluid Dynamics, the new formulation actually does not reconstruct the field variables at each time step. Instead, the spatial terms are calculated in terms of unknowns by precomputing weights at the beginning of the computation as functions of cell geometry and basis functions to retain efficiency. Since no assumption is made for cell geometry, this new formulation is suitable for arbitrarily defined grids, either smooth or unsmooth. However, to facilitate the volume and surface integrations, arbitrary polyhedral cells with polygonal faces are used in constructing grids. Both centered and upwind schemes are formulated. It is shown that conventional schemes (second order in Cartesian grids) are equivalent to the new schemes using first degree polynomials as the basis functions and the midpoint quadrature for the integrations. In the new formulation, higher orders of accuracy are achieved by using higher degree polynomial basis functions. Furthermore, all the surface and volume integrations are carried out exactly. Several model electromagnetic scattering problems are calculated and compared with analytical solutions. Examples are given for cases based on 0th to 3rd degree polynomial basis functions. In all calculations, a centered scheme is applied in the interior, while an upwind matching scheme is employed at material interfaces and the Engquist-Majda non-reflecting boundary condition is implemented at the numerical outer boundaries. The staggered leapfrog scheme and the Runge-Kutta methods are utilized for the time integration. Excellent agreements are found between the numerical and analytical solutions.

Liu, Yen↗
NASA NTRS2004

Three-Dimensional High-Order Spectral Volume Method for Solving Maxwell's Equations on Unstructured Grids

A three-dimensional, high-order, conservative, and efficient discontinuous spectral volume (SV) method for the solutions of Maxwell's equations on unstructured grids is presented. The concept of discontinuous 2nd high-order loca1 representations to achieve conservation and high accuracy is utilized in a manner similar to the Discontinuous Galerkin (DG) method, but instead of using a Galerkin finite-element formulation, the SV method is based on a finite-volume approach to attain a simpler formulation. Conventional unstructured finite-volume methods require data reconstruction based on the least-squares formulation using neighboring cell data. Since each unknown employs a different stencil, one must repeat the least-squares inversion for every cell at each time step, or to store the inversion coefficients. In a high-order, three-dimensional computation, the former would involve impractically large CPU time, while for the latter the memory requirement becomes prohibitive. In the SV method, one starts with a relatively coarse grid of triangles or tetrahedra, called spectral volumes (SVs), and partition each SV into a number of structured subcells, called control volumes (CVs), that support a polynomial expansion of a desired degree of precision. The unknowns are cell averages over CVs. If all the SVs are partitioned in a geometrically similar manner, the reconstruction becomes universal as a weighted sum of unknowns, and only a few universal coefficients need to be stored for the surface integrals over CV faces. Since the solution is discontinuous across the SV boundaries, a Riemann solver is thus necessary to maintain conservation. In the paper, multi-parameter and symmetric SV partitions, up to quartic for triangle and cubic for tetrahedron, are first presented. The corresponding weight coefficients for CV face integrals in terms of CV cell averages for each partition are analytically determined. These discretization formulas are then applied to the integral form of the Maxwell equations. All numerical procedures for outer boundary, material interface, zonal interface, and interior SV face are unified with a single characteristic formulation. The load balancing in a massive parallel computing environment is therefore easier to achieve. A parameter is introduced in the Riemann solver to control the strength of the smoothing term. Important aspects of the data structure and its effects to communication and the optimum use of cache memory are discussed. Results will be presented for plane TE and TM waves incident on a perfectly conducting cylinder for up to fifth order of accuracy, and a plane wave incident on a perfectly conducting sphere for up to fourth order of accuracy. Comparisons are made with exact solutions for these cases.

Liu, Yen↗
NASA NTRS2004

High-Order Simulation of Non-Linear Oscillations and Shocks in the Solar Atmosphere

The solar atmosphere presents a rich source of highly non-linear magneto-hydrodynamic phenomena: strong gradients and forcing terms result in both large shocks and oscillations. The additional requirements of energy balance and initialization in hydrostatic equilibrium compound the challenge of this problem. A wealth of observational data allows us to check the results of our simulations. The problem of simulating the solar atmosphere provides, in addition to an interesting system in its own right, a challenging testbed for high-order shock-capturing methods. We discuss the challenge of simulating solar atmospheric phenomena, concentrating on various high-order central methods ranging from second to fourth order. Our method is based on the central-upwind scheme of Kurganov, Noelle and Petrova, which we extend to high order via various interpolants. We investigate various initial data for our simulations, corresponding to observed conditions in different regions of the solar surface: the normal quiet sun and sunspots. When non-oscillatory using second- and third-order methods, we are able to reproduce non-trivial observational results. In particular we find a correlation between initial data and both the shock speeds and particle oscillation spectra that match observations in the corresponding regions. When using fourth-order WENO interpolants, we find that while the individual shock profiles at any given time appear non-oscillatory, spurious oscillations appear in the fields after long time integrations. The issue of initialization in hydrostatic equilibrium raises difficult issues. Careful treatment of the gravitational source term can reduce violations of hydrostatic equilibrium, but difficulties remain, primarily due to discontinuities in the piecewise-polynomial reconstructions. In the case of the Euler equations in gravity, the use of high-order methods reduces the violation of hydrostatic equilibrium to a sufficiently low level for the above described results to be obtained. Including various energy flux terms in the equations, however, leads to severe instability when hydrostatic balance is violated. We discuss various strategies to address this problem, including adaptive grid methods.

Bryson, S.↗
DOE OSTI2018

Conservative fourth-order finite-volume Vlasov–Poisson solver for axisymmetric plasmas in cylindrical (r,v r ,v θ ) phase space coordinates

In this paper, a fourth-order finite-volume Vlasov–Poisson algorithm is developed for simulating axisymmetric plasma configurations in ( r , v r , v θ ) phase space coordinates. The Vlasov equation for cylindrical phase space coordinates is cast into conservation-law form and is discretized on a structured grid. The conservative finite-volume discretization is based on fifth-order upwind reconstructions of the distribution function and a fourth-order quadrature rule that accounts for transverse variations of fluxes along control volume surfaces. High-order specular reflection boundary conditions enable high-fidelity treatment of plasma distribution functions at the axis and at wall boundaries. The numerical method is applied to simulate a confined uniform neutral gas to assess convergence properties for an equilibrium system in which effects of finite-temperature and acceleration due to centrifugal and Coriolis forces are present. The discretization is also applied to a Z-pinch configuration to study electrostatic ion confinement and the dynamics of the associated breathing mode. Simulations show that the ion distribution function exhibits non-Maxwellian features and that a temperature anisotropy develops and is sustained. Finally, the finite-volume implementation is demonstrated to converge at fourth-order for both applications.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS2004

Discontinuous Spectral Difference Method for Conservation Laws on Unstructured Grids

A new, high-order, conservative, and efficient discontinuous spectral finite difference (SD) method for conservation laws on unstructured grids is developed. The concept of discontinuous and high-order local representations to achieve conservation and high accuracy is utilized in a manner similar to the Discontinuous Galerkin (DG) and the Spectral Volume (SV) methods, but while these methods are based on the integrated forms of the equations, the new method is based on the differential form to attain a simpler formulation and higher efficiency. Conventional unstructured finite-difference and finite-volume methods require data reconstruction based on the least-squares formulation using neighboring point or cell data. Since each unknown employs a different stencil, one must repeat the least-squares inversion for every point or cell at each time step, or to store the inversion coefficients. In a high-order, three-dimensional computation, the former would involve impractically large CPU time, while for the latter the memory requirement becomes prohibitive. In addition, the finite-difference method does not satisfy the integral conservation in general. By contrast, the DG and SV methods employ a local, universal reconstruction of a given order of accuracy in each cell in terms of internally defined conservative unknowns. Since the solution is discontinuous across cell boundaries, a Riemann solver is necessary to evaluate boundary flux terms and maintain conservation. In the DG method, a Galerkin finite-element method is employed to update the nodal unknowns within each cell. This requires the inversion of a mass matrix, and the use of quadratures of twice the order of accuracy of the reconstruction to evaluate the surface integrals and additional volume integrals for nonlinear flux functions. In the SV method, the integral conservation law is used to update volume averages over subcells defined by a geometrically similar partition of each grid cell. As the order of accuracy increases, the partitioning for 3D requires the introduction of a large number of parameters, whose optimization to achieve convergence becomes increasingly more difficult. Also, the number of interior facets required to subdivide non-planar faces, and the additional increase in the number of quadrature points for each facet, increases the computational cost greatly.

Liu, Yen↗