Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “domain decomposition method”

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 307 records · Page 17

Iterative methods for elliptic finite element equations on general meshes

Iterative methods for arbitrary mesh discretizations of elliptic partial differential equations are surveyed. The methods discussed are preconditioned conjugate gradients, algebraic multigrid, deflated conjugate gradients, an element-by-element techniques, and domain decomposition. Computational results are included.

Nicolaides, R. A.↗

Efficient Solution Methods for Large-scale Optimization Problems Constrained by Time-dependent Partial Differential Equations (Final Report)

The objectives of this project are to devise and analyze efficient solvers for several classes of PDE- constrained optimization problems. The project was initially focused on, but not restricted to time- dependent PDE-constraints such as parabolic equations, time-dependent fluid flows (Navier-Stokes equations), hyperbolic equations (Burgers equation, shallow water equations). Other constraints considered are PDEs with stochastic coefficients. Additional elements of interest are the handling of problems with control and/or state inequality constraints or non-differentiable regularization terms, and boundary controls. A direction of work not initially listed among the goals, which was triggered by conversations with DOE scientists from the Sandia National Labs, is to develop efficient solvers for optimization- based domain-decomposition PDE-solvers. Also targeted in the project are a number of technical issues necessary for facilitating the integration of the methods resulted from this project with existing high-performance packages developed at DOE national labs; this integration is expected to further enable the scientific community to use the novel methods. An example of such a task is the need to develop algebraic multigrid (AMG) versions of the algorithms. A list of accomplishments in several areas is detailed as well as a list of publications.

97 MATHEMATICS AND COMPUTING↗

An Envelope Time Synchronous Averaging for Wind Turbine Gearbox Fault Diagnosis

Vibration-based condition monitoring techniques are widely used for diagnosing faults in rotating machines. These techniques are implemented in the time domain, the frequency domain, or both. However, the composite and noisy nature of the raw data collected requires a preprocessing stage such as filtering and decomposition using in-depth processing techniques. Moreover, these methods require good frequency resolution and involve examining a broad frequency range to discern both healthy and faulty cases. In this work, we introduce a simple and fast diagnostic scheme for wind turbine gear teeth wear based on time domain analysis. The proposed method is based on the local minima interpolation of a filtered version of the vibration signal following time synchronous averaging (TSA) technique. Given tachometer signal, the TSA of the vibration data is performed using MTALAB software. Then, local minima of the filtered signal are interpolated using the Piecewise Cubic Hermite Interpolating Polynomial (PCHIP) function. The variance of the interpolated curve built a gear fault index. The derived fault index resulting of the proposed technique allows a substantial distinction between the healthy and faulty cases. Its efficiency is validated using 10 real-world datasets of vibration stemmed from a wind turbine planetary gearbox. The proposed method boasts a low computation time and ease of interpretation, specifically beneficial for gearbox fault diagnosis purposes.

fault diagnosis↗

A RADIATION TRANSFER SOLVER FOR ATHENA USING SHORT CHARACTERISTICS

We describe the implementation of a module for the Athena magnetohydrodynamics (MHD) code that solves the time-independent, multi-frequency radiative transfer (RT) equation on multidimensional Cartesian simulation domains, including scattering and non-local thermodynamic equilibrium (LTE) effects. The module is based on well known and well tested algorithms developed for modeling stellar atmospheres, including the method of short characteristics to solve the RT equation, accelerated Lambda iteration to handle scattering and non-LTE effects, and parallelization via domain decomposition. The module serves several purposes: it can be used to generate spectra and images, to compute a variable Eddington tensor (VET) for full radiation MHD simulations, and to calculate the heating and cooling source terms in the MHD equations in flows where radiation pressure is small compared with gas pressure. For the latter case, the module is combined with the standard MHD integrators using operator splitting: we describe this approach in detail, including a new constraint on the time step for stability due to radiation diffusion modes. Implementation of the VET method for radiation pressure dominated flows is described in a companion paper. We present results from a suite of test problems for both the RT solver itself and for dynamical problems that include radiative heating and cooling. These tests demonstrate that the radiative transfer solution is accurate and confirm that the operator split method is stable, convergent, and efficient for problems of interest. We demonstrate there is no need to adopt ad hoc assumptions of questionable accuracy to solve RT problems in concert with MHD: the computational cost for our general-purpose module for simple (e.g., LTE gray) problems can be comparable to or less than a single time step of Athena's MHD integrators, and only few times more expensive than that for more general (non-LTE) problems.

79 ASTRONOMY AND ASTROPHYSICS↗

Scalable direct Vlasov solver with discontinuous Galerkin method on unstructured mesh.

This paper presents the development of parallel direct Vlasov solvers with discontinuous Galerkin (DG) method for beam and plasma simulations in four dimensions. Both physical and velocity spaces are in two dimesions (2P2V) with unstructured mesh. Contrary to the standard particle-in-cell (PIC) approach for kinetic space plasma simulations, i.e., solving Vlasov-Maxwell equations, direct method has been used in this paper. There are several benefits to solving a Vlasov equation directly, such as avoiding noise associated with a finite number of particles and the capability to capture fine structure in the plasma. The most challanging part of a direct Vlasov solver comes from higher dimensions, as the computational cost increases as N{sup 2d}, where d is the dimension of the physical space. Recently, due to the fast development of supercomputers, the possibility has become more realistic. Many efforts have been made to solve Vlasov equations in low dimensions before; now more interest has focused on higher dimensions. Different numerical methods have been tried so far, such as the finite difference method, Fourier Spectral method, finite volume method, and spectral element method. This paper is based on our previous efforts to use the DG method. The DG method has been proven to be very successful in solving Maxwell equations, and this paper is our first effort in applying the DG method to Vlasov equations. DG has shown several advantages, such as local mass matrix, strong stability, and easy parallelization. These are particularly suitable for Vlasov equations. Domain decomposition in high dimensions has been used for parallelization; these include a highly scalable parallel two-dimensional Poisson solver. Benchmark results have been shown and simulation results will be reported.

99 GENERAL AND MISCELLANEOUS↗

High-performance parallel analysis of coupled problems for aircraft propulsion

Applications are described of high-performance parallel, computation for the analysis of complete jet engines, considering its multi-discipline coupled problem. The coupled problem involves interaction of structures with gas dynamics, heat conduction and heat transfer in aircraft engines. The methodology issues addressed include: consistent discrete formulation of coupled problems with emphasis on coupling phenomena; effect of partitioning strategies, augmentation and temporal solution procedures; sensitivity of response to problem parameters; and methods for interfacing multiscale discretizations in different single fields. The computer implementation issues addressed include: parallel treatment of coupled systems; domain decomposition and mesh partitioning strategies; data representation in object-oriented form and mapping to hardware driven representation, and tradeoff studies between partitioning schemes and fully coupled treatment.

Felippa, C. A.↗

Flow simulations about steady-complex and unsteady moving configurations using structured-overlapped and unstructured grids

The limiting factor in simulating flows past realistic configurations of interest has been the discretization of the physical domain on which the governing equations of fluid flow may be solved. In an attempt to circumvent this problem, many Computational Fluid Dynamic (CFD) methodologies that are based on different grid generation and domain decomposition techniques have been developed. However, due to the costs involved and expertise required, very few comparative studies between these methods have been performed. In the present work, the two CFD methodologies which show the most promise for treating complex three-dimensional configurations as well as unsteady moving boundary problems are evaluated. These are namely the structured-overlapped and the unstructured grid schemes. Both methods use a cell centered, finite volume, upwind approach. The structured-overlapped algorithm uses an approximately factored, alternating direction implicit scheme to perform the time integration, whereas, the unstructured algorithm uses an explicit Runge-Kutta method. To examine the accuracy, efficiency, and limitations of each scheme, they are applied to the same steady complex multicomponent configurations and unsteady moving boundary problems. The steady complex cases consist of computing the subsonic flow about a two-dimensional high-lift multielement airfoil and the transonic flow about a three-dimensional wing/pylon/finned store assembly. The unsteady moving boundary problems are a forced pitching oscillation of an airfoil in a transonic freestream and a two-dimensional, subsonic airfoil/store separation sequence. Accuracy was accessed through the comparison of computed and experimentally measured pressure coefficient data on several of the wing/pylon/finned store assembly's components and at numerous angles-of-attack for the pitching airfoil. From this study, it was found that both the structured-overlapped and the unstructured grid schemes yielded flow solutions of comparable accuracy for these simulations. This study also indicated that, overall, the structured-overlapped scheme was slightly more CPU efficient than the unstructured approach.

Newman, James C., III↗

Noise suppression for dual-energy CT via penalized weighted least-square optimization with similarity-based regularization

Purpose: Dual-energy CT (DECT) expands applications of CT imaging in its capability to decompose CT images into material images. However, decomposition via direct matrix inversion leads to large noise amplification and limits quantitative use of DECT. Their group has previously developed a noise suppression algorithm via penalized weighted least-square optimization with edge-preservation regularization (PWLS-EPR). In this paper, the authors improve method performance using the same framework of penalized weighted least-square optimization but with similarity-based regularization (PWLS-SBR), which substantially enhances the quality of decomposed images by retaining a more uniform noise power spectrum (NPS). Methods: The design of PWLS-SBR is based on the fact that averaging pixels of similar materials gives a low-noise image. For each pixel, the authors calculate the similarity to other pixels in its neighborhood by comparing CT values. Using an empirical Gaussian model, the authors assign high/low similarity value to one neighboring pixel if its CT value is close/far to the CT value of the pixel of interest. These similarity values are organized in matrix form, such that multiplication of the similarity matrix to the image vector reduces image noise. The similarity matrices are calculated on both high- and low-energy CT images and averaged. In PWLS-SBR, the authors include a regularization term to minimize the L-2 norm of the difference between the images without and with noise suppression via similarity matrix multiplication. By using all pixel information of the initial CT images rather than just those lying on or near edges, PWLS-SBR is superior to the previously developed PWLS-EPR, as supported by comparison studies on phantoms and a head-and-neck patient. Results: On the line-pair slice of the Catphan{sup ©}600 phantom, PWLS-SBR outperforms PWLS-EPR and retains spatial resolution of 8 lp/cm, comparable to the original CT images, even at 90% reduction in noise standard deviation (STD). Similar performance on spatial resolution is observed on an anthropomorphic head phantom. In addition, results of PWLS-SBR show substantially improved image quality due to preservation of image NPS. On the Catphan{sup ©}600 phantom, NPS using PWLS-SBR has a correlation of 93% with that via direct matrix inversion, while the correlation drops to −52% for PWLS-EPR. Electron density measurement studies indicate high accuracy of PWLS-SBR. On seven different materials, the measured electron densities calculated from the decomposed material images using PWLS-SBR have a root-mean-square error (RMSE) of 1.20%, while the results of PWLS-EPR have a RMSE of 2.21%. In the study on a head-and-neck patient, PWLS-SBR is shown to reduce noise STD by a factor of 3 on material images with image qualities comparable to CT images, whereas fine structures are lost in the PWLS-EPR result. Additionally, PWLS-SBR better preserves low contrast on the tissue image. Conclusions: The authors propose improvements to the regularization term of an optimization framework which performs iterative image-domain decomposition for DECT with noise suppression. The regularization term avoids calculation of image gradient and is based on pixel similarity. The proposed method not only achieves a high decomposition accuracy, but also improves over the previous algorithm on NPS as well as spatial resolution.

60 APPLIED LIFE SCIENCES↗

A Survey of Singular Value Decomposition Methods for Distributed Tall/Skinny Data

The Singular Value Decomposition (SVD) is one of the most important matrix factorizations, enjoying a wide variety of applications across numerous application domains. In statistics and data analysis, the common applications of SVD inclue Principal Components Analysis (PCA) and regression. Usually these applications arise on data that has far more rows than columns, so-called "tall/skinny" matrices. In the big data analytics context, this may take the form of hundreds of millions to billions of rows with only a few hundred columns. There is a need, therefore, for fast, accurate, and scalable tall/skinny SVD implementations which can fully utilize modern computing resources. To that end, we present a survey of three different algorithms for computing the SVD for these kinds of tall/skinny data layouts using MPI for communication. We contextualize these with common big data analytics techniques. Finally, we present both CPU and GPU timing results from the Summit supercomputer, and discuss possible alternative approaches.

Schmidt, Drew↗

General CMB and primordial trispectrum estimation

In this paper we present trispectrum estimation methods which can be applied to general nonseparable primordial and CMB trispectra. We review the relationship between the reduced CMB trispectrum and the reduced primordial trispectrum. We present a general optimal estimator for the connected part of the trispectrum, for which we derive a quadratic term to incorporate the effects of inhomogeneous noise and masking. We describe a general algorithm for creating simulated maps with given arbitrary (and independent) power spectra, bispectra, and trispectra. We propose a universal definition of the trispectrum parameter T{sub NL}, so that the integrated trispectrum on the observational domain can be consistently compared between theoretical models. We define a shape function for the primordial trispectrum, together with a shape correlator and a useful parametrization for visualizing the trispectrum; these methods might also be applied to the late-time trispectrum for large-scale structure. We derive separable analytic CMB solutions in the large-angle limit for constant and local models. We present separable mode decompositions which can be used to describe any primordial or CMB trispectra on their respective wave number or multipole domains. By extracting coefficients of these separable basis functions from an observational map, we are able to present an efficient estimator for any given theoretical model with a nonseparable trispectrum. The estimator has two manifestations, comparing the theoretical and observed coefficients at either primordial or late times, thus encompassing a wider range of models, such as secondary anisotropies, lensing, and cosmic strings. We show that these mode decomposition methods are numerically tractable with order l{sup 5} operations for the CMB estimator and approximately order l{sup 6} for the general primordial estimator (reducing to order l{sup 3} in both cases for a special class of models). We also demonstrate how the trispectrum can be reconstructed from observational maps using these methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Tracking Energy Flow Using a Volumetric Acoustic Intensity Imager (VAIM)

A new measurement device has been invented at the Naval Research Laboratory which images instantaneously the intensity vector throughout a three-dimensional volume nearly a meter on a side. The measurement device consists of a nearly transparent spherical array of 50 inexpensive microphones optimally positioned on an imaginary spherical surface of radius 0.2m. Front-end signal processing uses coherence analysis to produce multiple, phase-coherent holograms in the frequency domain each related to references located on suspect sound sources in an aircraft cabin. The analysis uses either SVD or Cholesky decomposition methods using ensemble averages of the cross-spectral density with the fixed references. The holograms are mathematically processed using spherical NAH (nearfield acoustical holography) to convert the measured pressure field into a vector intensity field in the volume of maximum radius 0.4 m centered on the sphere origin. The utility of this probe is evaluated in a detailed analysis of a recent in-flight experiment in cooperation with Boeing and NASA on NASA s Aries 757 aircraft. In this experiment the trim panels and insulation were removed over a section of the aircraft and the bare panels and windows were instrumented with accelerometers to use as references for the VAIM. Results show excellent success at locating and identifying the sources of interior noise in-flight in the frequency range of 0 to 1400 Hz. This work was supported by NASA and the Office of Naval Research.

Klos, Jacob↗

Accurate modeling of plasma acceleration with arbitrary order pseudo-spectral particle-in-cell methods

Particle in Cell (PIC) simulations are a widely used tool for the investigation of both laser- and beam-driven plasma acceleration. It is a known issue that the beam quality can be artificially degraded by numerical Cherenkov radiation (NCR) resulting primarily from an incorrectly modeled dispersion relation. Pseudo-spectral solvers featuring infinite order stencils can strongly reduce NCR - or even suppress it - and are therefore well suited to correctly model the beam properties. For efficient parallelization of the PIC algorithm, however, localized solvers are inevitable. Arbitrary order pseudo-spectral methods provide this needed locality. Yet, these methods can again be prone to NCR. Here in this paper, we show that acceptably low solver orders are sufficient to correctly model the physics of interest, while allowing for parallel computation by domain decomposition.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

2-D seismic wave propagation using the distributional finite-difference method: further developments and potential for global seismology

SUMMARY We present a time-domain distributional finite-difference scheme based on the Lebedev staggered grid for the numerical simulation of wave propagation in acoustic and elastic media. The central aspect of the proposed method is the representation of the stresses and displacements with different sets of B-splines functions organized according to the staggered grid. The distributional finite-difference approach allows domain-decomposition, heterogeneity of the medium, curvilinear mesh, anisotropy, non-conformal interfaces, discontinuous grid and fluid–solid interfaces. Numerical examples show that the proposed scheme is suitable to model wave propagation through the Earth, where sharp interfaces separate large, relatively homogeneous layers. A few domains or elements are sufficient to represent the Earth’s internal structure without relying on advanced meshing techniques. We compare seismograms obtained with the proposed scheme and the spectral element method, and we show that our approach offers superior accuracy, reduced memory usage, and comparable efficiency.

Geochemistry & Geophysics↗

Implementation of CMFD Acceleration Scheme in PROTEUS-MOC

The PROTEUS-MOC code is a three-dimensional (3D) transport code, which is being developed at Argonne National Laboratory under the DOE-NE's Nuclear Energy Advanced Modeling and Simulation (NEAMS) program. It provides a fully consistent 3D discretization of the transport equation by combining the two-dimensional (2D) method of characteristics (MOC) for the planar direction with the discontinuous Galerkin method for the treatment of the axial variable. PROTEUS-MOC uses the unstructured finite element method (FEM) and thus allows the explicit representation of any extruded geometries. It also has a capability of massively parallel computation in energy group, angle, plane, and space using a top-level GMRES linear algebra solver. For parallel computation in space, it uses an unstructured domain decomposition by adapting METIS. The computational burden for direct heterogeneous core calculations based on unstructured geometries is excessive for practical reactor problems, and hence it is essential to implement an efficient acceleration scheme in PROTEUS-MOC. Recently, the coarse mesh finite difference (CMFD) method, which was originally applied to the nodal diffusion methods, has been successfully applied to the MOC transport solvers, resulting in a remarkable reduction in the number of fission source iterations. In addition, a modified CMFD method has been developed to overcome the limitation of the conventional CMFD that is applicable only to neutronics solvers with a conservative discretization. This CMFD method was derived to be consistent with the FEM, which is based on a nonconservative discretization. In this method, the neutron balance in each coarse mesh is enforced by introducing a pseudo absorption cross section (PAXS), and the well-established alternating solution process of CMFD and transport calculations is employed to accelerate source convergence. This modified CMFD acceleration scheme was adopted in PROTEUS-MOC to accelerate the fission source iteration. Pin-cell and assembly based CMFD schemes have been implemented by defining individual pin cells or assemblies as a coarse mesh. For this, an algorithm to map the finite elements to coarse meshes was developed, and the routines were developed to determine the coupling coefficients and PAXS of the CMFD equations from the transport solution. Preliminary performance tests were carried out using the C5G7 benchmark problem. This paper presents the main features of this CMFD acceleration scheme and the preliminary test results.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Uniform Subspace Correction Preconditioners for Discontinuous Galerkin Methods with hp-Refinement

In this paper, we develop subspace correction preconditioners for discontinuous Galerkin (DG) discretizations of elliptic problems with hp-refinement. These preconditioners are based on the decomposition of the DG finite element space into a conforming subspace, and a set of small nonconforming edge spaces. The conforming subspace is preconditioned using a matrix-free low-order refined technique, which in this work, we extend to the hp-refinement context using a variational restriction approach. The condition number of the resulting linear system is independent of the granularity of the mesh h, and the degree of the polynomial approximation p. The method is amenable to use with meshes of any degree of irregularity and arbitrary distribution of polynomial degrees. Furthermore, numerical examples are shown on several test cases involving adaptively and randomly refined meshes, using both the symmetric interior penalty method and the second method of Bassi and Rebay (BR2).

97 MATHEMATICS AND COMPUTING↗

Predicting Flows of Rarefied Gases

DSMC Analysis Code (DAC) is a flexible, highly automated, easy-to-use computer program for predicting flows of rarefied gases -- especially flows of upper-atmospheric, propulsion, and vented gases impinging on spacecraft surfaces. DAC implements the direct simulation Monte Carlo (DSMC) method, which is widely recognized as standard for simulating flows at densities so low that the continuum-based equations of computational fluid dynamics are invalid. DAC enables users to model complex surface shapes and boundary conditions quickly and easily. The discretization of a flow field into computational grids is automated, thereby relieving the user of a traditionally time-consuming task while ensuring (1) appropriate refinement of grids throughout the computational domain, (2) determination of optimal settings for temporal discretization and other simulation parameters, and (3) satisfaction of the fundamental constraints of the method. In so doing, DAC ensures an accurate and efficient simulation. In addition, DAC can utilize parallel processing to reduce computation time. The domain decomposition needed for parallel processing is completely automated, and the software employs a dynamic load-balancing mechanism to ensure optimal parallel efficiency throughout the simulation.

LeBeau, Gerald J.↗

WE-AB-207A-04: Random Undersampled Cone Beam CT: Theoretical Analysis and a Novel Reconstruction Method

Purpose: Reducing x-ray exposure and speeding up data acquisition motived studies on projection data undersampling. It is an important question that for a given undersampling ratio, what the optimal undersampling approach is. In this study, we propose a new undersampling scheme: random-ray undersampling. We will mathematically analyze its projection matrix properties and demonstrate its advantages. We will also propose a new reconstruction method that simultaneously performs CT image reconstruction and projection domain data restoration. Methods: By representing projection operator under the basis of singular vectors of full projection operator, matrix representations for an undersampling case can be generated and numerical singular value decomposition can be performed. We compared properties of matrices among three undersampling approaches: regular-view undersampling, regular-ray undersampling, and the proposed random-ray undersampling. To accomplish CT reconstruction for random undersampling, we developed a novel method that iteratively performs CT reconstruction and missing projection data restoration via regularization approaches. Results: For a given undersampling ratio, random-ray undersampling preserved mathematical properties of full projection operator better than the other two approaches. This translates to advantages of reconstructing CT images at lower errors. Different types of image artifacts were observed depending on undersampling strategies, which were ascribed to the unique singular vectors of the sampling operators in the image domain. We tested the proposed reconstruction algorithm on a Forbid phantom with only 30% of the projection data randomly acquired. Reconstructed image error was reduced from 9.4% in a TV method to 7.6% in the proposed method. Conclusion: The proposed random-ray undersampling is mathematically advantageous over other typical undersampling approaches. It may permit better image reconstruction at the same undersampling ratio. The novel algorithm suitable for this random-ray undersampling was able to reconstruct high-quality images.

60 APPLIED LIFE SCIENCES↗

Self-force via m-mode regularization and 2+1D evolution. II. Scalar-field implementation on Kerr spacetime

This is the second in a series of papers aimed at developing a practical time-domain method for self-force calculations in Kerr spacetime. The key elements of the method are (i) removal of a singular part of the perturbation field with a suitable analytic 'puncture' based on the Detweiler-Whiting decomposition, (ii) decomposition of the perturbation equations in azimuthal (m-)modes, taking advantage of the axial symmetry of the Kerr background, (iii) numerical evolution of the individual m-modes in 2+1 dimensions with a finite-difference scheme, and (iv) reconstruction of the physical self-force from the mode sum. Here we report an implementation of the method to compute the scalar-field self-force along circular equatorial geodesic orbits around a Kerr black hole. This constitutes a first time-domain computation of the self-force in Kerr geometry. Our time-domain code reproduces the results of a recent frequency-domain calculation by Warburton and Barack, but has the added advantage of being readily adaptable to include the backreaction from the self-force in a self-consistent manner. In a forthcoming paper--the third in the series--we apply our method to the gravitational self-force (in the Lorenz gauge).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗