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.

SourceResearch connectionFrom yearThrough year

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

At least 325 records · Page 18

All sources NASA NTRS DOE OSTI

DOE OSTI2018

FEL system with homogeneous average output

A method of varying the output of a free electron laser (FEL) on very short time scales to produce a slightly broader, but smooth, time-averaged wavelength spectrum. The method includes injecting into an accelerator a sequence of bunch trains at phase offsets from crest. Accelerating the particles to full energy to result in distinct and independently controlled, by the choice of phase offset, phase-energy correlations or chirps on each bunch train. The earlier trains will be more strongly chirped, the later trains less chirped. For an energy recovered linac (ERL), the beam may be recirculated using a transport system with linear and nonlinear momentum compactions M.sub.56, which are selected to compress all three bunch trains at the FEL with higher order terms managed.

43 PARTICLE ACCELERATORS↗

NASA NTRS1986

An upwind algorithm for the parabolized Navier-Stokes equations

A new upwind algorithm based on Roe's scheme has been developed to solve the two-dimensional parabolized Navier-Stokes (PNS) equations. This method does not require the addition of user specified smoothing terms for the capture of discontinuities such as shock waves. Thus, the method is easy to use and can be applied without modification to a wide variety of supersonic flowfields. The advantages and disadvantages of this adaptation are discussed in relation to those of the conventional Beam-Warming scheme in terms of accuracy, stability, computer time and storage, and programming effort. The new algorithm has been validated by applying it to three laminar test cases including flat plate boundary-layer flow, hypersonic flow past a 15 deg compression corner, and hypersonic flow into a converging inlet. The computed results compare well with experiment and show a dramatic improvement in the resolution of flowfield details when compared with the results obtained using the conventional Beam-Warming algorithm.

Lawrence, S. L.↗

NASA NTRS2004

Triphasic Tooling with Small Oriented Diamond Tip for Turning and Smoothing Lightweight Mirrors

We are developing a new method for the growth of small diamond crystals at very high temperatures and pressures directly from a carbon melt. A prototype "Supercell" has been developed for this purpose. This system is capable of high rate crystal growth in relatively large working volumes. The resulting high quality diamond crystals will be incorporated into a triphasic diamond/titanium carbide/titanium composite tool, with an oriented diamond crystal at its tip. High pressure is needed to prevent degradation of diamond at high temperature, and to ensure the formation of a crack & composite structure. After grinding and polishing, the composite material will be joined to a steel holder, thus forming a diamond-tipped tool for turning and smoothing of a mirror surface. A properly oriented single-crystal diamond cuts and smoothes much better than a conventional polycrystalline diamond crystal. This is because the hardness depends on crystallographic orientation-the difference corresponds to 60-100 GPa on the Knoop scale. Our goal is to achieve surface roughness of about 1 nm, which will be accomplished by precision cutting and smoothing. The hardness of the functionally-graded diamond/titanium carbide/titanium composite tool varies from 100 GPa at its tip to 15 GPa at its base. Previous work has shown that the mass of machined material using an oriented-diamond tool is much larger than that for a standard diamond-metal composite tool.

Voronov, O. A.↗

DOE OSTI2022

Smoothed aggregation for difficult stretched mesh and coefficient variation problems

Abstract Four adaptations of the smoothed aggregation algebraic multigrid (SA‐AMG) method are proposed with an eye toward improving the convergence and robustness of the solver in situations when the discretization matrix contains many weak connections. These weak connections can cause higher than expected levels of fill‐in within the coarse discretization matrices and can also give rise to suboptimal smoothing within the prolongator smoothing phase. These smoothing drawbacks are due to the relatively small size of some diagonal entries within the filtered matrix that one obtains after dropping the weak connections. The new algorithms consider modifications to the Jacobi‐like step that defines the prolongator smoother, modifications to the filtered matrix, and also direct modifications to the resulting grid transfer operators. Numerical results are given illustrating the potential benefits of the proposed adaptations.

Hu, Jonathan J.↗

NASA NTRS1995

Elliptic surface grid generation on minimal and parmetrized surfaces

An elliptic grid generation method is presented which generates excellent boundary conforming grids in domains in 2D physical space. The method is based on the composition of an algebraic and elliptic transformation. The composite mapping obeys the familiar Poisson grid generation system with control functions specified by the algebraic transformation. New expressions are given for the control functions. Grid orthogonality at the boundary is achieved by modification of the algebraic transformation. It is shown that grid generation on a minimal surface in 3D physical space is in fact equivalent to grid generation in a domain in 2D physical space. A second elliptic grid generation method is presented which generates excellent boundary conforming grids on smooth surfaces. It is assumed that the surfaces are parametrized and that the grid only depends on the shape of the surface and is independent of the parametrization. Concerning surface modeling, it is shown that bicubic Hermite interpolation is an excellent method to generate a smooth surface which is passing through a given discrete set of control points. In contrast to bicubic spline interpolation, there is extra freedom to model the tangent and twist vectors such that spurious oscillations are prevented.

Spekreijse, S. P.↗

NASA NTRS1995

Automatic multi-block grid generation for high-lift configuration wings

A new method for automatic multi-block grid generation is described. The method combines the Modified Advancing Front Method as a Predictor with an elliptic scheme as a corrector. It advances a collection of cells by one cell height in the outward direction using Modified Advancing Front Method, and then corrects newly-obtained cell positions by solving elliptic equations. This predictor-corrector type scheme is repeatedly applied until the field of interest is filled with hexahedral grid cells. Given the configuration surface grid, the scheme produces block layouts as well as grid cells with overall smoothness as its output. The present method saves human-time and reduces the burden on the user in generating grids for general 3-D configurations. It was used to generate multi-block grids for wings in their high-lift configuration.

Kim, Byoungsoo↗

DOE OSTI2017

ELUCID—Exploring the Local Universe with the reConstructed Initial Density Field. II. Reconstruction Diagnostics, Applied to Numerical Halo Catalogs

The ELUCID project aims to build a series of realistic cosmological simulations that reproduce the spatial and mass distributions of the galaxies as observed in the Sloan Digital Sky Survey. This requires powerful reconstruction techniques to create constrained initial conditions (ICs). We test the reconstruction method by applying it to several N -body simulations. We use two medium-resolution simulations, which each produced three additional constrained N -body simulations. We compare the resulting friend-of-friend catalogs by using the particle indexes as tracers, and quantify the quality of the reconstruction by varying the main smoothing parameter. The cross-identification method we use proves to be efficient, and the results suggest that the most massive reconstructed halos are effectively traced from the same Lagrangian regions in the ICs. A preliminary time-dependence analysis indicates that high-mass-end halos converge only at a redshift close to the reconstruction redshift. This suggests that, for earlier snapshots, only collections of progenitors may be effectively cross-identified.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2023

Yet another parameter-free shape optimization method

The use of node coordinates as design variables in shape optimization offers a larger design space than computer-aided design (CAD)-based shape parameterizations. It also allows for the optimization of legacy designs, i.e., a finite element mesh from an existing design can be readily optimized to meet new performance requirements without involving a CAD model. However, it is well known that the node coordinate parameterization method is fraught with numerical difficulties, which makes it impractical to use. This has led to several of “parameter-free” shape optimization methods that seek the advantages and avoid the pitfalls of the naïve node coordinate parameterization method. These methods come in two main varieties: sensitivity filtering (or gradient smoothing) and consistent filtering. The latter is analogous to the density filter method used in topology optimization (TO). In this work, we use the PDE filter from TO and energy-based filters to implement consistent shape optimization filtering schemes easily and efficiently. Numerical experiments demonstrate that consistent methods are more robust than sensitivity filtering methods.

42 ENGINEERING↗

DOE OSTI2024

Experimental and numerical investigation of fracture conductivity between non-smooth rock surfaces with and without proppant

The enhancement of fracture conductivity is vital for the efficient recovery of subsurface resources, such as geothermal energy and petroleum hydrocarbons. Proppants, granular materials injected into hydraulic fractures to maintain their conductivity, have been studied primarily in the context of smooth fractures (i.e., fractures between smooth rock surfaces). However, non-smooth fractures (i.e., fractures between rough rock surfaces) are common in geoenergy reservoirs and thus require further investigations. In this study, we conducted laboratory measurements of fracture conductivity on shale slabs with non-smooth surfaces and carried out numerical simulation using the lattice Boltzmann (LB) method, which aimed to investigate the conductivity of non-smooth fractures with and without proppants placement. When ceramic proppant with an areal concentration of 2 lb/ft 2 was placed in the fracture, the conductivity was enhanced by roughly 3-8 times compared to fractures without proppant. In fractures with proppant, gas-measured conductivity was higher than that measured with water due to proppant embedment caused by water. The experiments demonstrate the advantages of using proppant in fractures, even if the rock surface roughness can provide certain fracture conductivity via the self-propping mechanism. For fractures without proppants, high rock surface roughness is not necessarily favorable for enhancing fracture conductivity because the self-propping mechanism requires shear slip along the fracture surface. If there is no shear slip, high rock surface roughness can cause a detrimental effect on the fracture conductivity due to the interlocking effect. Utilizing advanced experimental equipment and LB modeling, this research explores the interplays between proppant placement, fracture geometry, and stress conditions to develop a comprehensive understanding of the productivity in non-smooth fractures. Further, the outcomes of this investigation indicate the importance of creating fractures with surface roughness during hydraulic fracturing and will contribute to the development of more efficient stimulation techniques for subsurface energy extraction.

15 GEOTHERMAL ENERGY↗

NASA NTRS1991

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↗

NASA NTRS1991

The L sub 1 finite element method for pure convection problems

Jiang, Bo-Nan↗

NASA NTRS1999

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↗

DOE OSTI2018

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↗

DOE OSTI2017

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↗

NASA NTRS1992

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↗

DOE OSTI2017

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

Junghans, Christoph↗

DOE OSTI2018

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↗

NASA NTRS1993

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.↗