Search NASA⌕ Search

SEARCH · Search NASA

Results for “Smoothing methods”

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 505 records · Page 28

The L sub 1 finite element method for pure convection problems

The least squares (L sub 2) finite element method is introduced for 2-D steady state pure convection problems with smooth solutions. It is proven that the L sub 2 method has the same stability estimate as the original equation, i.e., the L sub 2 method has better control of the streamline derivative. Numerical convergence rates are given to show that the L sub 2 method is almost optimal. This L sub 2 method was then used as a framework to develop an iteratively reweighted L sub 2 finite element method to obtain a least absolute residual (L sub 1) solution for problems with discontinuous solutions. This L sub 1 finite element method produces a nonoscillatory, nondiffusive and highly accurate numerical solution that has a sharp discontinuity in one element on both coarse and fine meshes. A robust reweighting strategy was also devised to obtain the L sub 1 solution in a few iterations. A number of examples solved by using triangle and bilinear elements are presented.

Jiang, Bo-Nan↗

The L sub 1 finite element method for pure convection problems

The least squares (L sub 2) finite element method is introduced for 2-D steady state pure convection problems with smooth solutions. It is proven that the L sub 2 method has the same stability estimate as the original equation, i.e., the L sub 2 method has better control of the streamline derivative. Numerical convergence rates are given to show that the L sub 2 method is almost optimal. This L sub 2 method was then used as a framework to develop an iteratively reweighted L sub 2 finite element method to obtain a least absolute residual (L sub 1) solution for problems with discontinuous solutions. This L sub 1 finite element method produces a nonoscillatory, nondiffusive and highly accurate numerical solution that has a sharp discontinuity in one element on both coarse and fine meshes. A robust reweighting strategy was also devised to obtain the L sub 1 solution in a few iterations. A number of examples solved by using triangle and bilinear elements are presented.

Jiang, Bo-Nan↗

Parallelization of an Object-Oriented Unstructured Aeroacoustics Solver

A computational aeroacoustics code based on the discontinuous Galerkin method is ported to several parallel platforms using MPI. The discontinuous Galerkin method is a compact high-order method that retains its accuracy and robustness on non-smooth unstructured meshes. In its semi-discrete form, the discontinuous Galerkin method can be combined with explicit time marching methods making it well suited to time accurate computations. The compact nature of the discontinuous Galerkin method also makes it well suited for distributed memory parallel platforms. The original serial code was written using an object-oriented approach and was previously optimized for cache-based machines. The port to parallel platforms was achieved simply by treating partition boundaries as a type of boundary condition. Code modifications were minimal because boundary conditions were abstractions in the original program. Scalability results are presented for the SCI Origin, IBM SP2, and clusters of SGI and Sun workstations. Slightly superlinear speedup is achieved on a fixed-size problem on the Origin, due to cache effects.

Baggag, Abdelkader↗

Superconvergence results of Legendre spectral projection methods for Volterra integral equations of second kind

In this paper, Legendre spectral projection methods are applied for the Volterra integral equations of second kind with a smooth kernel. We prove that the approximate solutions of the Legendre Galerkin and Legendre collocation methods converge to the exact solution with the order O(n{sup −r}) in L{sup 2}-norm and order O(n{sup −r+(1/2)}) in infinity norm, and the iterated Legendre Galerkin solution converges with the order O(n{sup −2r}) in both L{sup 2}-norm and infinity norm, whereas the iterated Legendre collocation solution converges with the order O(n{sup −r}) in both L{sup 2}-norm and infinity norm, n being the highest degree of Legendre polynomials employed in the approximation and r being the smoothness of the kernels. We have also considered multi-Galerkin method and its iterated version, and prove that the iterated multi-Galerkin solution converges with the order O(n{sup −3r}) in both infinity and L{sup 2} norm. Numerical examples are given to illustrate the theoretical results.

97 MATHEMATICS AND COMPUTING↗

FleCSPH - a parallel and distributed SPH implementation based on the FleCSI framework

FleCSPH is a multi-physics compact application that exercises FleCSI parallel data structures for tree-based particle methods. In particular, FleCSPH implements a smoothed-particle hydrodynamics (SPH) solver for the solution of Lagrangian problems in astrophysics and cosmology. FleCSPH includes support for gravitational forces using the fast multipole method (FMM).

Junghans, Christoph↗

Research in computational fluid dynamics and analysis of algorithms

Recently, higher-order compact schemes have seen increasing use in the DNS (Direct Numerical Simulations) of the Navier-Stokes equations. Although they do not have the spatial resolution of spectral methods, they offer significant increases in accuracy over conventional second order methods. They can be used on any smooth grid, and do not have an overly restrictive CFL dependence as compared with the O(N(exp -2)) CFL dependence observed in Chebyshev spectral methods on finite domains. In addition, they are generally more robust and less costly than spectral methods. The issue of the relative cost of higher-order schemes (accuracy weighted against physical and numerical cost) is a far more complex issue, depending ultimately on what features of the solution are sought and how accurately they must be resolved. In any event, the further development of the underlying stability theory of these schemes is important. The approach of devising suitable boundary clusters and then testing them with various stability techniques (such as finding the norm) is entirely the wrong approach when dealing with high-order methods. Very seldom are high-order boundary closures stable, making them difficult to isolate. An alternative approach is to begin with a norm which satisfies all the stability criteria for the hyperbolic system, and look for the boundary closure forms which will match the norm exactly. This method was used recently by Strand to isolate stable boundary closure schemes for the explicit central fourth- and sixth-order schemes. The norm used was an energy norm mimicking the norm for the differential equations. Further research should be devoted to BC for high order schemes in order to make sure that the results obtained are reliable. The compact fourth order and sixth order finite difference scheme had been incorporated into a code to simulate flow past circular cylinders. This code will serve as a verification of the full spectral codes. A detailed stability analysis by Carpenter (from the fluid Mechanics Division) and Gottlieb gave analytic conditions for stability as well as asymptotic stability. This had been incorporated in the code in form of stable boundary conditions. Effects of the cylinder rotations had been studied. The results differ from the known theoretical results. We are in the middle of analyzing the results. A detailed analysis of the effects of the heating of the cylinder on the shedding frequency had been studied using the above schemes. It has been found that the shedding frequency decreases when the wire was heated. Experimental work is being carried out to affirm this result.

Gottlieb, David↗

FleCSPH - a parallel and distributed SPH implementation based on the FleCSI framework

FleCSPH is a multi-physics compact application that exercises FleCSI parallel data structures for tree-based particle methods. In particular, FleCSPH implements a smoothed-particle hydrodynamics (SPH) solver for the solution of Lagrangian problems in astrophysics and cosmology. FleCSPH includes support for gravitational forces using the fast multipole method (FMM).

Junghans, Christoph↗

An inexact regularized Newton framework with a worst-case iteration complexity of $ {\mathscr O}(\varepsilon^{-3/2}) $ for nonconvex optimization

Abstract An algorithm for solving smooth nonconvex optimization problems is proposed that, in the worst-case, takes ${\mathscr O}(\varepsilon ^{-3/2})$ iterations to drive the norm of the gradient of the objective function below a prescribed positive real number $\varepsilon $ and can take ${\mathscr O}(\varepsilon ^{-3})$ iterations to drive the leftmost eigenvalue of the Hessian of the objective above $-\varepsilon $. The proposed algorithm is a general framework that covers a wide range of techniques including quadratically and cubically regularized Newton methods, such as the Adaptive Regularization using Cubics (arc) method and the recently proposed Trust-Region Algorithm with Contractions and Expansions (trace). The generality of our method is achieved through the introduction of generic conditions that each trial step is required to satisfy, which in particular allows for inexact regularized Newton steps to be used. These conditions center around a new subproblem that can be approximately solved to obtain trial steps that satisfy the conditions. A new instance of the framework, distinct from arc and trace, is described that may be viewed as a hybrid between quadratically and cubically regularized Newton methods. Numerical results demonstrate that our hybrid algorithm outperforms a cubically regularized Newton method.

Mathematics↗

Polarized quasiperiodic structures in pulsar radio emission reflect temporal modulations of non-stationary plasma flow

Bright single pulses of many radio pulsars show rapid intensity fluctuations (called microstructure) when observed with time resolutions of tens of microseconds. Here, we report an analysis of Arecibo 59.5 μs resolution polarimetric observations of 11 P-band and 32 L-band pulsars with periods ranging from 150 ms to 3.7 s. These higher-frequency observations form the most reliable basis for detailed microstructure studies. Close inspection of individual pulses reveals that most pulses exhibit quasi-periodicities with a well-defined periodicity timescale (P{sub μ}). While we find some pulses with deeply modulating microstructure, most pulses show low-amplitude modulations on top of broad smooth subpulse features, thereby making it difficult to infer periodicities. We have developed a method for such low-amplitude fluctuations wherein a smooth subpulse envelope is subtracted from each de-noised subpulse; the fluctuating portion of each subpulse is then used to estimate P{sub μ} via autocorrelation analysis. We find that the microstructure timescale P{sub μ} is common across all Stokes parameters of polarized pulsar signals. Moreover, no clear signature of curvature radiation in vacuum in highly resolved microstructures was found. Our analysis further shows strong correlation between P{sub μ} and the pulsar period P. We discuss implications of this result in terms of a coherent radiation model wherein radio emission arises due to formation and acceleration of electron–positron pairs in an inner vacuum gap over magnetic polar cap, and a subpulse corresponds to a series of non-stationary sparking discharges. We argue that in this model, P{sub μ} reflects the temporal modulation of non-stationary plasma flow.

79 ASTRONOMY AND ASTROPHYSICS↗

Reliability enhancement of Navier-Stokes codes through convergence enhancement

Reduction of total computing time required by an iterative algorithm for solving Navier-Stokes equations is an important aspect of making the existing and future analysis codes more cost effective. Several attempts have been made to accelerate the convergence of an explicit Runge-Kutta time-stepping algorithm. These acceleration methods are based on local time stepping, implicit residual smoothing, enthalpy damping, and multigrid techniques. Also, an extrapolation procedure based on the power method and the Minimal Residual Method (MRM) were applied to the Jameson's multigrid algorithm. The MRM uses same values of optimal weights for the corrections to every equation in a system and has not been shown to accelerate the scheme without multigriding. Our Distributed Minimal Residual (DMR) method based on our General Nonlinear Minimal Residual (GNLMR) method allows each component of the solution vector in a system of equations to have its own convergence speed. The DMR method was found capable of reducing the computation time by 10-75 percent depending on the test case and grid used. Recently, we have developed and tested a new method termed Sensitivity Based DMR or SBMR method that is easier to implement in different codes and is even more robust and computationally efficient than our DMR method.

Choi, K.-Y.↗

A continuum meshfree method for sandbox-style numerical modeling of accretionary and doubly vergent wedges

Here, in this study, we introduce and utilize GEOSPH, a Lagrangian particle-based continuum Smoothed Particle Hydrodynamics (SPH) code to simulate the deformation of geologic materials in sandbox-style experiments using an elastoplastic constitutive model. Due to the meshfree nature of SPH, our proposed framework is capable of handling the large deformations characteristic of sandbox-style experiments. SPH is also able to capture strain localization and discontinuities, allowing us to resolve faulting patterns emerging in the sandbox experiments. We successfully validate our SPH implementation against the benchmark experiments of Buiter and co-workers, and then apply SPH to understand the deformational processes occurring in doubly vergent orogens resultant from the S-point experimental setup and from finitely high wedge-like indenter backstops of different inclinations. We find that the topographic slope of the prowedge results from the competing processes of vertical uplift due to the indenter and forward thrusting, while the topographic slope of the retrowedge is a product of repeated shallow slope failure. Our findings show that SPH is a promising numerical method which should be added to the current palette of computational tools used by structural geologists for solving problems relating to tectonics and crustal deformation.

58 GEOSCIENCES↗

A high-order finite-volume method for hyperbolic conservation laws on locally-refined grids

We present a fourth-order accurate finite-volume method for solving time-dependent hyperbolic systems of conservation laws on Cartesian grids with multiple levels of refinement. The underlying method is a generalization of that in [5] to nonlinear systems, and is based on using fourth-order accurate quadratures for computing fluxes on faces, combined with fourth-order accurate Runge?Kutta discretization in time. To interpolate boundary conditions at refinement boundaries, we interpolate in time in a manner consistent with the individual stages of the Runge-Kutta method, and interpolate in space by solving a least-squares problem over a neighborhood of each target cell for the coefficients of a cubic polynomial. The method also uses a variation on the extremum-preserving limiter in [8], as well as slope flattening and a fourth-order accurate artificial viscosity for strong shocks. We show that the resulting method is fourth-order accurate for smooth solutions, and is robust in the presence of complex combinations of shocks and smooth flows.

97 MATHEMATICS AND COMPUTING↗

UO 2 target preparation with spin coating assisted solution combustion synthesis

A simple and efficient target preparation method is developed combining spin coating and solution combustion synthesis. Multiple smooth and uniform UO 2 targets have been prepared using this method on a variety of backings (aluminium, carbon, silicon) used in nuclear physics experiments. The thicknesses of the targets can be precisely tuned by changing the number of coatings within the range of ~50-1000 µm/cm 2 . These targets are highly uniform (<5% deviation), robust, and remain strongly adherent to their backings even after being irradiated by high doses (10 17 ions/ cm 2 ) of 1.7 MeV Ar 2+ ions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A TWO-DIMENSIONAL METHOD OF MANUFACTURED SOLUTIONS BENCHMARK SUITE BASED ON VARIATIONS OF LARSEN'S BENCHMARK WITH ESCALATING ORDER OF SMOOTHNESS OF THE EXACT SOLUTION

The quantification of the discretization error associated with the spatial discretization of the Discrete Ordinate(DO) equations in multidimensional Cartesian geometries is the central problem in error estimation of spatial discretization schemes for transport theory as well as computer code verification. Traditionally fine mesh solutions are employed as reference, because analytical solutions only exist in the absence of scattering. This approach, however, is inadequate when the discretization error associated with the reference solution is not small compared to the discretization error associated with the mesh under scrutiny. Typically this situation occurs if the mesh of interest is only a couple of refinement levels away from the reference solution or if the order of accuracy of the numerical method (and hence the reference as well) is lower than expected. In this work we present a Method of Manufactured Solutions (MMS) benchmark suite with variable order of smoothness of the underlying exact solution for two-dimensional Cartesian geometries which provides analytical solutions aver- aged over arbitrary orthogonal meshes for scattering and non-scattering media. It should be emphasized that the developed MMS benchmark suite first eliminates the aforementioned limitation of fine mesh reference solutions since it secures knowledge of the underlying true solution and second that it allows for an arbitrary order of smoothness of the underlying ex- act solution. The latter is of importance because even for smooth parameters and boundary conditions the DO equations can feature exact solution with limited smoothness. Moreover, the degree of smoothness is crucial for both the order of accuracy and the magnitude of the discretization error for any spatial discretization scheme.

99 GENERAL AND MISCELLANEOUS↗

A new nonlinear reconstruction method based on total variation regularization of neutron penumbral imaging

Neutron penumbral imaging is a significant diagnostic technique in laser-driven inertial confinement fusion experiment. It is very important to develop a new reconstruction method to improve the resolution of neutron penumbral imaging. A new nonlinear reconstruction method based on total variation (TV) regularization is proposed in this paper. A TV-norm is used as regularized term to construct a smoothing functional for penumbral image reconstruction in the new method, in this way, the problem of penumbral image reconstruction is transformed to the problem of a functional minimization. In addition, a fixed point iteration scheme is introduced to solve the problem of functional minimization. The numerical experimental results show that, compared to linear reconstruction method based on Wiener filter, the TV regularized nonlinear reconstruction method is beneficial to improve the quality of reconstructed image with better performance of noise smoothing and edge preserving. Meanwhile, it can also obtain the spatial resolution with 5 {mu}m which is higher than the Wiener method.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Trigonometric polynomial approximation, K-functionals and generalized moduli of smoothness

Best approximation and approximation by families of linear polynomial operators (FLPO) in the spaces L{sub p}, 0<p⩽+∞, are investigated for periodic functions of an arbitrary number of variables in terms of the generalized modulus of smoothness generated by a periodic generator which, near the origin, is assumed to be close in a certain sense to some homogeneous function of positive order. Direct and inverse theorems (Jackson- and Bernstein-type estimates) are proved; conditions on the generators are obtained under which the approximation error by an FLPO is equivalent to an appropriate modulus of smoothness. These problems are solved by going over from the modulus to an equivalent K-functional. The general results obtained are applied to classical objects in the theory of approximation and smoothness. In particular, they are applied to the methods of approximation generated by Fejér, Riesz and Bochner-Riesz kernels, and also to the moduli of smoothness and K-functionals corresponding to the conventional, Weyl and Riesz derivatives and to the Laplace operator. Bibliography: 24 titles. (paper)

97 MATHEMATICS AND COMPUTING↗

Redshifting galaxies from DESI to JWST CEERS: Correction of biases and uncertainties in quantifying morphology

Observations of high-redshift galaxies with unprecedented detail have now been rendered possible with the James Webb Space Telescope (JWST). However, accurately quantifying their morphology remains uncertain due to potential biases and uncertainties. To address this issue, we used a sample of 1816 nearby DESI galaxies, with a stellar mass range of 10 9.75 - 11.25 M ⊙ , to compute artificial images of galaxies of the same mass located at 0.75 ≤ z ≤ 3 and observed at rest-frame optical wavelength in the Cosmic Evolution Early Release Science (CEERS) survey. We analyzed the effects of cosmological redshift on the measurements of Petrosian radius (R p ), half-light radius (R 50 ), asymmetry (A), concentration (C), axis ratio (q), and Sérsic index (n). Our results show that R p and R 50 , calculated using non-parametric methods, are slightly overestimated due to PSF smoothing, while R 50 , q, and n obtained through fitting a Sérsic model does not exhibit significant biases. By incorporating a more accurate noise effect removal procedure, we improve the computation of A over existing methods, which often overestimate, underestimate, or lead to significant scatter of noise contributions. Due to PSF asymmetry, there is a minor overestimation of A for intrinsically symmetric galaxies. However, for intrinsically asymmetric galaxies, PSF smoothing dominates and results in an underestimation of A, an effect that becomes more significant with higher intrinsic A or at lower resolutions. Moreover, PSF smoothing also leads to an underestimation of C, which is notably more pronounced in galaxies with higher intrinsic C or at lower resolutions. We developed functions based on resolution level, defined as R p /FWHM, for correcting these biases and the associated statistical uncertainties. Applying these corrections, we measured the bias-corrected morphology for the simulated CEERS images and we find that the derived quantities are in good agreement with their intrinsic values – except for A, which is robust only for angularly large galaxies where R p /FWHM ≥ 5. Our correction functions can be applied to other surveys, offering valuable tools for future studies.

79 ASTRONOMY AND ASTROPHYSICS↗

Structured adaptive grid generation using algebraic methods

The accuracy of the numerical algorithm depends not only on the formal order of approximation but also on the distribution of grid points in the computational domain. Grid adaptation is a procedure which allows optimal grid redistribution as the solution progresses. It offers the prospect of accurate flow field simulations without the use of an excessively timely, computationally expensive, grid. Grid adaptive schemes are divided into two basic categories: differential and algebraic. The differential method is based on a variational approach where a function which contains a measure of grid smoothness, orthogonality and volume variation is minimized by using a variational principle. This approach provided a solid mathematical basis for the adaptive method, but the Euler-Lagrange equations must be solved in addition to the original governing equations. On the other hand, the algebraic method requires much less computational effort, but the grid may not be smooth. The algebraic techniques are based on devising an algorithm where the grid movement is governed by estimates of the local error in the numerical solution. This is achieved by requiring the points in the large error regions to attract other points and points in the low error region to repel other points. The development of a fast, efficient, and robust algebraic adaptive algorithm for structured flow simulation applications is presented. This development is accomplished in a three step process. The first step is to define an adaptive weighting mesh (distribution mesh) on the basis of the equidistribution law applied to the flow field solution. The second, and probably the most crucial step, is to redistribute grid points in the computational domain according to the aforementioned weighting mesh. The third and the last step is to reevaluate the flow property by an appropriate search/interpolate scheme at the new grid locations. The adaptive weighting mesh provides the information on the desired concentration of points to the grid redistribution scheme. The evaluation of the weighting mesh is accomplished by utilizing the weight function representing the solution variation and the equidistribution law. The selection of the weight function plays a key role in grid adaptation. A new weight function utilizing a properly weighted boolean sum of various flowfield characteristics is defined. The redistribution scheme is developed utilizing Non-Uniform Rational B-Splines (NURBS) representation. The application of NURBS representation results in a well distributed smooth grid by maintaining the fidelity of the geometry associated with boundary curves. Several algebraic methods are applied to smooth and/or nearly orthogonalize the grid lines. An elliptic solver is utilized to smooth the grid lines if there are grid crossings. Various computational examples of practical interest are presented to demonstrate the success of these methods.

Yang, Jiann-Cherng↗