Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “iterative smoothing”

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 145 records · Page 8

Robust Airfoil Optimization in High Resolution Design Space

The robust airfoil shape optimization is a direct method for drag reduction over a given range of operating conditions and has three advantages: (1) it prevents severe degradation in the off-design performance by using a smart descent direction in each optimization iteration, (2) it uses a large number of B-spline control points as design variables yet the resulting airfoil shape is fairly smooth, and (3) it allows the user to make a trade-off between the level of optimization and the amount of computing time consumed. The robust optimization method is demonstrated by solving a lift-constrained drag minimization problem for a two-dimensional airfoil in viscous flow with a large number of geometric design variables. Our experience with robust optimization indicates that our strategy produces reasonable airfoil shapes that are similar to the original airfoils, but these new shapes provide drag reduction over the specified range of Mach numbers. We have tested this strategy on a number of advanced airfoil models produced by knowledgeable aerodynamic design team members and found that our strategy produces airfoils better or equal to any designs produced by traditional design methods.

Li, Wu↗

On the Implementation of 3D Galerkin Boundary Integral Equations

In this article, a reverse contribution technique is proposed to accelerate the construction of the dense influence matrices associated with a Galerkin approximation of singular and hypersingular boundary integral equations of mixed-type in potential theory. In addition, a general-purpose sparse preconditioner for boundary element methods has also been developed to successfully deal with ill-conditioned linear systems arising from the discretization of mixed boundary-value problems on non-smooth surfaces. The proposed preconditioner, which originates from the precorrected-FFT method, is sparse, easy to generate and apply in a Krylov subspace iterative solution of discretized boundary integral equations. Moreover, an approximate inverse of the preconditioner is implicitly built by employing an incomplete LU factorization. Numerical experiments involving mixed boundary-value problems for the Laplace equation are included to illustrate the performance and validity of the proposed techniques.

97 MATHEMATICS AND COMPUTING↗

Flag varieties, toric varieties, and suspensions: Three instances of infinite transitivity

We say that a group G acts infinitely transitively on a set X if for every m element of N the induced diagonal action of G is transitive on the cartesian mth power X{sup m} backslash {Delta} with the diagonals removed. We describe three classes of affine algebraic varieties such that their automorphism groups act infinitely transitively on their smooth loci. The first class consists of normal affine cones over flag varieties, the second of nondegenerate affine toric varieties, and the third of iterated suspensions over affine varieties with infinitely transitive automorphism groups. Bibliography: 42 titles.

97 MATHEMATICS AND COMPUTING↗

Multilevel Algorithm for Atmospheric Data Assimilation

A multiscale algorithm for the problem of optimal statistical interpolation of observed data has been developed. This problem includes the calculation of the vector of the 'analyzed' (best estimated) atmosphere flow field w(sup a) by the formula: w(sup a) = w(sup f) + P(sup f) H(sup T) y, where the quantity y is defined by the equation (H P(sup f) H(sup T) + R)y = w(sup o) - H w(sup f), using the given model forecast first guess w(sup f) and the vector of observations w(sup o); H is an interpolation operator from the regular grid to the observation network, P(sup f) is the forecast error covariance matrix, and R is the observation error covariance matrix. At this initial stage the case of univariate analysis of single level radiosonde height data is considered. The matrix R is assumed to be diagonal, and the matrix P(sup f) is assumed to be given by the formula P(sub ij)(sup f) = sigma(sub i)(sup f) mu(sub ij) sigma(sub j)(sub f), where mu(sub ij) is a smooth, decreasing function of the distance between the i-th and the j-th points. In this paper we describe a multiscale iterative process based on a multiresolution, simultaneous displacement technique and a localized variational calculation of iteration parameters.

Brandt, Achi↗

Options for Robust Airfoil Optimization under Uncertainty

A robust optimization method is developed to overcome point-optimization at the sampled design points. This method combines the best features from several preliminary methods proposed by the authors and their colleagues. The robust airfoil shape optimization is a direct method for drag reduction over a given range of operating conditions and has three advantages: (1) it prevents severe degradation in the off-design performance by using a smart descent direction in each optimization iteration, (2) it uses a large number of spline control points as design variables yet the resulting airfoil shape does not need to be smoothed, and (3) it allows the user to make a tradeoff between the level of optimization and the amount of computing time consumed. For illustration purposes, the robust optimization method is used to solve a lift-constrained drag minimization problem for a two-dimensional (2-D) airfoil in Euler flow with 20 geometric design variables.

Padula, Sharon L.↗

Convergence analysis for a nonlocal gradient descent method via directional Gaussian smoothing

We analyze the convergence of a nonlocal gradient descent method for minimizing a class of high-dimensional non-convex functions, where a directional Gaussian smoothing (DGS) is proposed to define the nonlocal gradient (also referred to as the DGS gradient). The method was first proposed in [Zhang et al., Enabling long-range exploration in minimization of multimodal functions, UAI 2021], in which multiple numerical experiments showed that replacing the traditional local gradient with the DGS gradient can help the optimizers escape local minima more easily and significantly improve their performance. However, a rigorous theory for the efficiency of the method on nonconvex landscape is lacking. In this work, we investigate the scenario where the objective function is composed of a convex function, perturbed by deterministic oscillating noise. We provide a convergence theory under which the iterates exponentially converge to a tightened neighborhood of the solution, whose size is characterized by the noise wavelength. Here, we also establish a correlation between the optimal values of the Gaussian smoothing radius and the noise wavelength, thus justifying the advantage of using moderate or large smoothing radii with the method. Furthermore, if the noise level decays to zero when approaching the global minimum, we prove that DGS-based optimization converges to the exact global minimum with linear rates, similarly to standard gradient-based methods in optimizing convex functions. Several numerical experiments are provided to confirm our theory and illustrate the superiority of the approach over those based on the local gradient.

Tran, Hoang [Oak Ridge National Laboratory (ORNL),↗

Short initial length quench on CICC of ITER TF coils

Previous quench studies performed for the International Thermonuclear Experimental Reactor (ITER) Toroidal Field (TF) Coils have led to identify two extreme families of quench: first 'severe' quenches over long initial lengths in high magnetic field, and second smooth quenches over short initial lengths in low field region. Detailed analyses and results on smooth quench propagation and detectability on one TF Cable In Conduit Conductor (CICC) with a lower propagation velocity are presented here. The influence of the initial quench energy is shown and results of computations with either a Fast Discharge (FD) of the magnet or without (failure of the voltage quench detection system) are reported. The influence of the central spiral of the conductor on the propagation velocity is also detailed. In the cases of a regularly triggered FD, the hot spot temperature criterion of 150 K (with helium and jacket) is fulfilled for an initial quench length of 1 m, whereas this criterion is exceed (Tmax ≈ 200 K) for an extremely short length of 5 cm. These analyses were carried out using both the Supermagnet(trade mark, serif) and Venecia codes and the comparisons of the results are also discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mesh-connected processor arrays for the transitive closure problem

The main purpose in this paper is to lay a theoretical foundation for the design of mesh-connected processor arrays for the transitive closure problem. Using a simple path-algebraic formulation of the problem and observing its similarity to certain well-known smoothing problems that occur in digital signal processing, it is shown how to draw upon existing techniques from the signal processing literature to derive regular iterative algorithms for determining the transitive closure of the graph. The regular iterative algorithms that are derived using these considerations, are then analyzed and synthesized on mesh-connected processor arrays. Among the vast number of mesh-connected processor arrays that can be designed using this unified approach, the systolic arrays reported in the literature for this problem are shown to be special cases.

Rao, S. K.↗

Simultaneous segmentation and reconstruction: A level set method approach for limited view computed tomography

Purpose: An iterative tomographic reconstruction algorithm that simultaneously segments and reconstructs the reconstruction domain is proposed and applied to tomographic reconstructions from a sparse number of projection images. Methods: The proposed algorithm uses a two-phase level set method segmentation in conjunction with an iterative tomographic reconstruction to achieve simultaneous segmentation and reconstruction. The simultaneous segmentation and reconstruction is achieved by alternating between level set function evolutions and per-region intensity value updates. To deal with the limited number of projections, a priori information about the reconstruction is enforced via penalized likelihood function. Specifically, smooth function within each region (piecewise smooth function) and bounded function intensity values for each region are assumed. Such a priori information is formulated into a quadratic objective function with linear bound constraints. The level set function evolutions are achieved by artificially time evolving the level set function in the negative gradient direction; the intensity value updates are achieved by using the gradient projection conjugate gradient algorithm. Results: The proposed simultaneous segmentation and reconstruction results were compared to ''conventional'' iterative reconstruction (with no segmentation), iterative reconstruction followed by segmentation, and filtered backprojection. Improvements of 6%-13% in the normalized root mean square error were observed when the proposed algorithm was applied to simulated projections of a numerical phantom and to real fan-beam projections of the Catphan phantom, both of which did not satisfy the a priori assumptions. Conclusions: The proposed simultaneous segmentation and reconstruction resulted in improved reconstruction image quality. The algorithm correctly segments the reconstruction space into regions, preserves sharp edges between different regions, and smoothes the noise within each region. The proposed algorithm framework has the flexibility to be adapted to different a priori constraints while maintaining the benefits achieved by the simultaneous segmentation and reconstruction.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

WE-D-9A-01: A Novel Mesh-Based Deformable Surface-Contour Registration

Purpose: Initial guess is vital for 3D-2D deformable image registration (DIR) while dealing with large deformations for adaptive radiation therapy. A fast procedure has been developed to deform body surface to match 2D body contour on projections. This surface-contour DIR will provide an initial deformation for further complete 3D DIR or image reconstruction. Methods: Both planning CT images and come-beam CT (CBCT) projections are preprocessed to create 0–1 binary mask. Then the body surface and CBCT projection body contours are extracted by Canny edge detector. A finite element modeling system was developed to automatically generate adaptive meshes based on the image surface. After that, the projections of the CT surface voxels are computed and compared with corresponding 2D projection contours from CBCT scans. As a result, the displacement vector field (DVF) on mesh vertices around the surface was optimized iteratively until the shortest Euclidean distance between the pixels on the projections of the deformed CT surface and the corresponding CBCT projection contour is minimized. With the help of the tetrahedral meshes, we can smoothly diffuse the deformation from the surface into the interior of the volume. Finally, the deformed CT images are obtained by the optimal DVF applied on the original planning CT images. Results: The accuracy of the surface-contour registration is evaluated by 3D normalized cross correlation increased from 0.9176 to 0.9957 (sphere-ellipsoid phantom) and from 0.7627 to 0.7919 (H and N cancer patient data). Under the GPU-based implementation, our surface-contour-guided method on H and N cancer patient data takes 8 seconds/iteration, about 7.5 times faster than direct 3D method (60 seconds/iteration), and it needs fewer optimization iterations (30 iterations vs 50 iterations). Conclusion: The proposed surface-contour DIR method can substantially improve both the accuracy and the speed of reconstructing volumetric images, which is helpful for applying in adaptive radiotherapy. This research is supported by CPRIT individual investigator award RP110329.

60 APPLIED LIFE SCIENCES↗

Minimum-Energy Conical Intersections by Compressed Multistate Pair-Density Functional Theory

Compressed multistate pair-density functional theory (CMS-PDFT) is a multistate version of multiconfiguration pair-density functional theory that can capture the correct topology of coupled potential energy surfaces (PESs) around conical intersections. Here, in this work, we develop interstate coupling vectors (ISCs) for CMS-PDFT in the OpenMolcas and PySCF/mrh electronic structure packages. Yet, the main focus of this work is using ISCs to calculate minimum-energy conical intersections (MECIs) by CMS-PDFT. This is performed using the projected constrained optimization method in OpenMolcas, which uses ISCs to restrain the iterations to the conical intersection seam. We optimize the S 1 /S 0 MECIs for ethylene, butadiene, and benzene and show that CMS-PDFT gives smooth PESs in the vicinities of the MECIs. Furthermore, the CMS-PDFT MECIs are in good agreement with the MECI calculated by the more expensive XMS-CASPT2 method.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Efficient First-Order Algorithms for Large-Scale, Non-Smooth Maximum Entropy Models with Application to Wildfire Science

Maximum entropy (MaxEnt) models are a class of statistical models that use the maximum entropy principle to estimate probability distributions from data. Due to the size of modern data sets, MaxEnt models need efficient optimization algorithms to scale well for big data applications. State-of-the-art algorithms for MaxEnt models, however, were not originally designed to handle big data sets; these algorithms either rely on technical devices that may yield unreliable numerical results, scale poorly, or require smoothness assumptions that many practical MaxEnt models lack. In this paper, we present novel optimization algorithms that overcome the shortcomings of state-of-the-art algorithms for training large-scale, non-smooth MaxEnt models. Our proposed first-order algorithms leverage the Kullback–Leibler divergence to train large-scale and non-smooth MaxEnt models efficiently. For MaxEnt models with discrete probability distribution of n elements built from samples, each containing m features, the stepsize parameter estimation and iterations in our algorithms scale on the order of O(mn) operations and can be trivially parallelized. Moreover, the strong ℓ1 convexity of the Kullback–Leibler divergence allows for larger stepsize parameters, thereby speeding up the convergence rate of our algorithms. To illustrate the efficiency of our novel algorithms, we consider the problem of estimating probabilities of fire occurrences as a function of ecological features in the Western US MTBS-Interagency wildfire data set. Our numerical results show that our algorithms outperform the state of the art by one order of magnitude and yield results that agree with physical models of wildfire occurrence and previous statistical analyses of wildfire drivers.

Physics↗

Numerical Study of Multigrid Methods with Various Smoothers for the Elliptical Grid Generation Equations

A robust solver for the elliptic grid generation equations is sought via a numerical study. The system of PDEs is discretized with finite differences, and multigrid methods are applied to the resulting nonlinear algebraic equations. Multigrid iterations are compared with respect to the robustness and efficiency. Different smoothers are tried to improve the convergence of iterations. The methods are applied to four 2D grid generation problems over a wide range of grid distortions. The results of the study help to select smoothing schemes and the overall multigrid procedures for elliptic grid generation.

Golik, W. L.↗

Nonlinear variants of the TR/BDF2 method for thermal radiative diffusion

We apply the Trapezoidal/BDF2 (TR/BDF2) temporal discretization scheme to nonlinear grey radiative diffusion. This is a scheme that is not well-known within the radiation transport community, but we show that it offers many desirable characteristics relative to other second-order schemes. Several nonlinear variants of the TR/BDF2 scheme are defined and computationally compared with the Crank-Nicholson scheme. It is found for our test problems that the most accurate TR/BDF2 schemes are those that are fully iterated to nonlinear convergence, but the most efficient TR/BDF2 scheme is one based upon a single Newton iteration. It is also shown that neglecting the contributions to the Jacobian matrix from the cross-sections, which is often done due to a lack of smooth interpolations for tabular cross-section data, has a significant impact upon efficiency.

97 MATHEMATICS AND COMPUTING↗

Derivative-free stochastic optimization via adaptive sampling strategies

In this paper, we present a novel derivative-free framework for solving unconstrained stochastic optimization problems. Many problems in fields ranging from simulation optimization to reinforcement learning to quantum computing involve settings where only stochastic function values are obtained via a zeroth-order oracle, which has no available gradient information and necessitates the usage of derivative-free optimization methodologies. Our approach includes estimating gradients using stochastic function evaluations and integrating adaptive sampling techniques to control the accuracy in these stochastic approximations. Our framework encapsulates several gradient estimation techniques, including standard finite-difference, Gaussian smoothing, sphere smoothing, randomized coordinate finite-difference, and randomized subspace finite-difference methods. We provide theoretical convergence guarantees for our framework and analyze the worst-case iteration and sample complexities associated with each gradient estimation method. Finally, we demonstrate the empirical performance of the methods on logistic regression and nonlinear least squares problems.

Adaptive sampling↗

Multigrid Acceleration of Time-Accurate DNS of Compressible Turbulent Flow

An efficient scheme for the direct numerical simulation of 3D transitional and developed turbulent flow is presented. Explicit and implicit time integration schemes for the compressible Navier-Stokes equations are compared. The nonlinear system resulting from the implicit time discretization is solved with an iterative method and accelerated by the application of a multigrid technique. Since we use central spatial discretizations and no artificial dissipation is added to the equations, the smoothing method is less effective than in the more traditional use of multigrid in steady-state calculations. Therefore, a special prolongation method is needed in order to obtain an effective multigrid method. This simulation scheme was studied in detail for compressible flow over a flat plate. In the laminar regime and in the first stages of turbulent flow the implicit method provides a speed-up of a factor 2 relative to the explicit method on a relatively coarse grid. At increased resolution this speed-up is enhanced correspondingly.

Broeze, Jan↗

Dynamic mesh adaptation for front evolution using discontinuous Galerkin based weighted condition number relaxation

A new mesh smoothing method designed to cluster cells near a dynamically evolving interface is presented. The method is based on weighted condition number mesh relaxation with the weight function computed from a level set representation of the interface. The weight function is expressed as a Taylor series based discontinuous Galerkin projection, which makes the computation of the derivatives of the weight function needed during the condition number optimization process a trivial matter. For cases when a level set is not available, a fast method for generating a low-order level set from discrete cell-centered fields, such as a volume fraction or index function, is provided. Results show that the low-order level set works equally well as the actual level set for mesh smoothing. Meshes generated for a number of interface geometries are presented, including cases with multiple level sets. Lastly, dynamic cases with moving interfaces show the new method is capable of maintaining a desired resolution near the interface with an acceptable number of relaxation iterations per time step, which demonstrates the method's potential to be used as a mesh relaxer for arbitrary Lagrangian Eulerian (ALE) methods.

97 MATHEMATICS AND COMPUTING↗

MODELING THE Ly α FOREST IN COLLISIONLESS SIMULATIONS

Cosmological hydrodynamic simulations can accurately predict the properties of the intergalactic medium (IGM), but only under the condition of retaining the high spatial resolution necessary to resolve density fluctuations in the IGM. This resolution constraint prohibits simulating large volumes, such as those probed by BOSS and future surveys, like DESI and 4MOST. To overcome this limitation, we present “Iteratively Matched Statistics” (IMS), a novel method to accurately model the Ly α forest with collisionless N -body simulations, where the relevant density fluctuations are unresolved. We use a small-box, high-resolution hydrodynamic simulation to obtain the probability distribution function (PDF) and the power spectrum of the real-space Ly α forest flux. These two statistics are iteratively mapped onto a pseudo-flux field of an N -body simulation, which we construct from the matter density. We demonstrate that our method can reproduce the PDF, line of sight and 3D power spectra of the Ly α forest with good accuracy (7%, 4%, and 7% respectively). We quantify the performance of the commonly used Gaussian smoothing technique and show that it has significantly lower accuracy (20%–80%), especially for N -body simulations with achievable mean inter-particle separations in large-volume simulations. In addition, we show that IMS produces reasonable and smooth spectra, making it a powerful tool for modeling the IGM in large cosmological volumes and for producing realistic “mock” skies for Ly α forest surveys.

79 ASTRONOMY AND ASTROPHYSICS↗