Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
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.↗
DOE OSTI2021

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↗
DOE OSTI2023

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↗
DOE OSTI2023

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↗
NASA NTRS1993

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↗
NASA NTRS1982

The computation of Laplacian smoothing splines with examples

Laplacian smoothing splines (LSS) are presented as generalizations of graduation, cubic and thin plate splines. The method of generalized cross validation (GCV) to choose the smoothing parameter is described. The GCV is used in the algorithm for the computation of LSS's. An outline of a computer program which implements this algorithm is presented along with a description of the use of the program. Examples in one, two and three dimensions demonstrate how to obtain estimates of function values with confidence intervals and estimates of first and second derivatives. Probability plots are used as a diagnostic tool to check for model inadequacy.

Wendelberger, J. G.↗
NASA NTRS1989

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 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 (1978) scheme in terms of accuracy, stability, computer time and storage requirements, 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 results obtained using the conventional Beam-Warming algorithm.

Lawrence, Scott L.↗
NASA NTRS1980

Remote sensing of soil moisture content over bare fields at 1.4 GHz frequency

A simple method of estimating moisture content (W) of a bare soil from the observed brightness temperature (T sub B) at 1.4 GHz is discussed. The method is based on a radiative transfer model calculation, which has been successfully used in the past to account for many observational results, with some modifications to take into account the effect of surface roughness. Besides the measured T sub B's, the three additional inputs required by the method are the effective soil thermodynamic temperature, the precise relation between W and the smooth field brightness temperature T sub B and a parameter specifying the surface roughness characteristics. The soil effective temperature can be readily measured and the procedures of estimating surface roughness parameter and obtaining the relation between W and smooth field brightness temperature are discussed in detail. Dual polarized radiometric measurements at an off-nadir incident angle are sufficient to estimate both surface roughness parameter and W, provided that the relation between W and smooth field brightness temperature at the same angle is known. The method of W estimate is demonstrated with two sets of experimental data, one from a controlled field experiment by a mobile tower and the other, from aircraft overflight. The results from both data sets are encouraging when the estimated W's are compared with the acquired ground truth of W's in the top 2 cm layer. An offset between the estimated and the measured W's exists in the results of the analyses, but that can be accounted for by the presently poor knowledge of the relationship between W and smooth field brightness temperature for various types of soils. An approach to quantify this relationship for different soils and thus improve the method of W estimate is suggested.

Wang, J. R.↗
DOE OSTI2024

Riemannian Optimization Applied to AC Optimal Power Flow: Preprint

The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. They demonstrate that these are viable computational alternatives to interior point methods. This is done by using Julia and the packages PowerModels.jl and Manopt.jl.

manifold optimization↗
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↗
NASA NTRS1996

The Newton Modified Barrier Method for QP Problems

The Modified Barrier Functions (MBF) have elements of both Classical Lagrangians (CL) and Classical Barrier Functions (CBF). The MBF methods find an unconstrained minimizer of some smooth barrier function in primal space and then update the Lagrange multipliers, while the barrier parameter either remains fixed or can be updated at each step. The numerical realization of the MBF method leads to the Newton MBF method, where the primal minimizer is found by using Newton's method. This minimizer is then used to update the Lagrange multipliers. In this paper, we examine the Newton MBF method for the Quadratic Programming (QP) problem. It will be shown that under standard second-order optimality conditions, there is a ball around the primal solution and a cut cone in the dual space such that for a set of Lagrange multipliers in this cut cone, the method converges quadratically to the primal minimizer from any point in the aforementioned ball, and continues to do so after each Lagrange multiplier update. The Lagrange multipliers remain within the cut cone and converge linearly to their optimal values. Any point in this ball will be called a "hot start". Starting at such a "hot start", at most Omicron(1n 1n epsilon(exp -1)) Newton steps are sufficient to perform the primal minimization which is necessary for the Lagrange multiplier update. Here, epsilon > 0 is the desired accuracy. Because of the linear convergence of the Lagrange multipliers, this means that only Omicron(1n epsilon(exp -1))omicron(ln 1n epsilon(exp-1)) Newton steps are required to reach an epsilon-approximation to the solution from any "hot start". In order to reach the "hot start", one has to perform Omicron(square root(m) 1n C) Newton steps, where m characterizes the size of the problem and C > 0 is the condition number of the QP problem. This condition number will be characterized explicitly in terms of key parameters of the QP problem, which in turn depend on the input data and the size of the problem.

Melman, A.↗
NASA NTRS1993

Simulations of particle acceleration in parallel shocks: Direct comparison between Monte Carlo and one-dimensional hybrid codes

We have made a direct comparison between two different computer simulations of a plane, parallel, collisionless shock including particle acceleration to energies typical of those of diffuse ions observed at the earth bow shock. Despite the fact that the one-dimensional hybrid and Monte Carlo techniques employ entirely different algorithms, they give surprisingly close agreement in the overall shapes of the complete distribution functions for protons as well as heavier ions. Both methods show that energetic ions emerge smoothly from the background thermal plasma with approximately the same relative injection rate and that the fraction of the incoming plasma's energy flux that is converted into downstream enthalpy flux of the accelerated population (i.e., the acceleration efficiency) is similar in the two cases. The fraction of the downstream proton distribution made up of superthermal particles is quite large, with at least 10% of the energy flux going into protons with energies above 10 keV. In addition, an upstream precursor, produced by backstreaming energetic particles, is present in both shocks, although the Monte Carlo precursor is considerably longer than that produced in the hybrid shock. These results offer convincing evidence that, at least in these ways, the two simulations are consistent in their description of parallel shock structure and particle acceleration, and they lay the groundwork for development of shock models employing a combination of both methods.

Ellison, Donald C.↗
NASA NTRS2012

Method for Pre-Conditioning a Measured Surface Height Map for Model Validation

This software allows one to up-sample or down-sample a measured surface map for model validation, not only without introducing any re-sampling errors, but also eliminating the existing measurement noise and measurement errors. Because the re-sampling of a surface map is accomplished based on the analytical expressions of Zernike-polynomials and a power spectral density model, such re-sampling does not introduce any aliasing and interpolation errors as is done by the conventional interpolation and FFT-based (fast-Fourier-transform-based) spatial-filtering method. Also, this new method automatically eliminates the measurement noise and other measurement errors such as artificial discontinuity. The developmental cycle of an optical system, such as a space telescope, includes, but is not limited to, the following two steps: (1) deriving requirements or specs on the optical quality of individual optics before they are fabricated through optical modeling and simulations, and (2) validating the optical model using the measured surface height maps after all optics are fabricated. There are a number of computational issues related to model validation, one of which is the "pre-conditioning" or pre-processing of the measured surface maps before using them in a model validation software tool. This software addresses the following issues: (1) up- or down-sampling a measured surface map to match it with the gridded data format of a model validation tool, and (2) eliminating the surface measurement noise or measurement errors such that the resulted surface height map is continuous or smoothly-varying. So far, the preferred method used for re-sampling a surface map is two-dimensional interpolation. The main problem of this method is that the same pixel can take different values when the method of interpolation is changed among the different methods such as the "nearest," "linear," "cubic," and "spline" fitting in Matlab. The conventional, FFT-based spatial filtering method used to eliminate the surface measurement noise or measurement errors can also suffer from aliasing effects. During re-sampling of a surface map, this software preserves the low spatial-frequency characteristic of a given surface map through the use of Zernike-polynomial fit coefficients, and maintains mid- and high-spatial-frequency characteristics of the given surface map by the use of a PSD model derived from the two-dimensional PSD data of the mid- and high-spatial-frequency components of the original surface map. Because this new method creates the new surface map in the desired sampling format from analytical expressions only, it does not encounter any aliasing effects and does not cause any discontinuity in the resultant surface map.

Sidick, Erkin↗
NASA NTRS2004

A Study of Penalty Function Methods for Constraint Handling with Genetic Algorithm

COMETBOARDS (Comparative Evaluation Testbed of Optimization and Analysis Routines for Design of Structures) is a design optimization test bed that can evaluate the performance of several different optimization algorithms. A few of these optimization algorithms are the sequence of unconstrained minimization techniques (SUMT), sequential linear programming (SLP) and the sequential quadratic programming techniques (SQP). A genetic algorithm (GA) is a search technique that is based on the principles of natural selection or "survival of the fittest". Instead of using gradient information, the GA uses the objective function directly in the search. The GA searches the solution space by maintaining a population of potential solutions. Then, using evolving operations such as recombination, mutation and selection, the GA creates successive generations of solutions that will evolve and take on the positive characteristics of their parents and thus gradually approach optimal or near-optimal solutions. By using the objective function directly in the search, genetic algorithms can be effectively applied in non-convex, highly nonlinear, complex problems. The genetic algorithm is not guaranteed to find the global optimum, but it is less likely to get trapped at a local optimum than traditional gradient-based search methods when the objective function is not smooth and generally well behaved. The purpose of this research is to assist in the integration of genetic algorithm (GA) into COMETBOARDS. COMETBOARDS cast the design of structures as a constrained nonlinear optimization problem. One method used to solve constrained optimization problem with a GA to convert the constrained optimization problem into an unconstrained optimization problem by developing a penalty function that penalizes infeasible solutions. There have been several suggested penalty function in the literature each with there own strengths and weaknesses. A statistical analysis of some suggested penalty functions is performed in this study. Also, a response surface approach to robust design is used to develop a new penalty function approach. This new penalty function approach is then compared with the other existing penalty functions.

Ortiz, Francisco↗
DOE OSTI2021

Modeling Turbulence in Galactic Centers

Turbulence is a prevalent phenomenon in the interstellar medium, and in particular, the environment at the centers of galaxies. For example, detailed observations of the Milky Way’s Central Molecular Zone (CMZ) revealed that it has a complex and turbulent structure. Turbulence on galactic scales is often modeled using star formation and feedback. However, these effects do not appear to be sufficient for explaining the high-velocity dispersion observed in the CMZ, indicating that additional gas-stirring processes are likely to be operating. Here we introduce a proof-of-concept method to drive turbulence in gas that orbits under the influence of a galactic potential. Instead of relying on a particular physical mechanism, we have adopted a Fourier forcing module and have applied it using a smoothed particle hydrodynamics code. To test our method, we performed simulations of a simplistic model of the CMZ. Our turbulence injection method is capable of balancing the self-gravity of the gas, which allows us to run the simulations for long timescales and thereby follow the evolution of the CMZ. Our results show that turbulence induces a flocculent spiral pattern in our model, analogous to that found in galactic-scale simulations. Furthermore, we find that our turbulence injection method induces inward migration of gas, a result consistent with previous numerical simulations. We submit that this injection method is a promising new tool to simulate turbulence in galactic centers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1985

Gravity Field of Venus and Comparison with Earth

The acceleration (gravity) anomaly estimates by spacecraft tracking, determined from Doppler residuals, are components of the gravity field directed along the spacecraft Earth line of sight (LOS). These data constitute a set of vector components of a planet's gravity field, the specific component depending upon where the Earth happened to be at the time of each measurement, and they are at varying altitudes above the planet surface. From this data set the gravity field vector components were derived using the method of harmonic splines which imposes a smoothness criterion to select a gravity model compatible with the LOS data. Given the piecewise model it is now possible to upward and downward continue the field quantities desired with a few parameters unlike some other methods which must return to the full dataset for each desired calculation.

Bowin, C.↗
DOE OSTI2022

A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations

Many applications require minimizing the sum of smooth and nonsmooth functions. For example, basis pursuit denoising problems in data science require minimizing a measure of data misfit plus an $\ell^1$-regularizer. Similar problems arise in the optimal control of partial differential equations (PDEs) when sparsity of the control is desired. Here, we develop a novel trust-region method to minimize the sum of a smooth nonconvex function and a nonsmooth convex function. Our method is unique in that it permits and systematically controls the use of inexact objective function and derivative evaluations. When using a quadratic Taylor model for the trust-region subproblem, our algorithm is an inexact, matrix-free proximal Newton-type method that permits indefinite Hessians. We prove global convergence of our method in Hilbert space and demonstrate its efficacy on three examples from data science and PDE-constrained optimization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Entropy Stable Conservative Flux Form Neural Networks

We propose an entropy-stable conservative flux form neural network (CFN) to predict the dynamics of unknown governing conservation laws. The design of the network is based on the entropy-stable, second-order, and non-oscillatory Kurganov-Tadmor (KT) scheme. The proposed entropy-stable CFN, hereafter referred to as ESCFN, uses slope limiting as a denoising mechanism, ensuring accurate predictions in both noisy and sparse observation environments, as well as in both smooth and discontinuous regions. Importantly, our method is designed to predict long term dynamics of the unknown conservation law exclusively from a short temporal window of observed data, that is, without oracle knowledge of the PDE or later-time solution profiles. Numerical experiments demonstrate that the ESCFN achieves both stability and conservation while maintaining accuracy over extended time domains, and successfully predicts shock propagation speeds in long-term simulations. Furthermore, it is also robust to both noisy and sparse data environments.

Hyperbolic conservation laws↗