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 127 records · Page 7

A Framework for Parallel Unstructured Grid Generation for Complex Aerodynamic Simulations

A framework for parallel unstructured grid generation targeting both shared memory multi-processors and distributed memory architectures is presented. The two fundamental building-blocks of the framework consist of: (1) the Advancing-Partition (AP) method used for domain decomposition and (2) the Advancing Front (AF) method used for mesh generation. Starting from the surface mesh of the computational domain, the AP method is applied recursively to generate a set of sub-domains. Next, the sub-domains are meshed in parallel using the AF method. The recursive nature of domain decomposition naturally maps to a divide-and-conquer algorithm which exhibits inherent parallelism. For the parallel implementation, the Master/Worker pattern is employed to dynamically balance the varying workloads of each task on the set of available CPUs. Performance results by this approach are presented and discussed in detail as well as future work and improvements.

Zagaris, George↗

A Schwarz generalized eigen-oscillation spectral element method (GeSEM) for 2-D high frequency electromagnetic scattering in dispersive inhomogeneous media

In this paper, we propose a parallel Schwarz generalized eigen-oscillation spectral element method (GeSEM) for 2-D complex Helmholtz equations in high frequency wave scattering in dispersive inhomogeneous media. This method is based on the spectral expansion of complex generalized eigen-oscillations for the electromagnetic fields and the Schwarz non-overlapping domain decomposition iteration method. The GeSEM takes advantages of a special real orthogonality property of the complex eigen-oscillations and a new radiation interface condition for the system of equations for the spectral expansion coefficients. Numerical results validate the high resolution and the flexibility of the method for various materials.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A pseudo-spectral method for the simulation of poro-elastic seismic wave propagation in 2D polar coordinates using domain decomposition

We present a novel numerical approach for the comprehensive, flexible, and accurate simulation of poro-elastic wave propagation in 2D polar coordinates. An important application of this method and its extensions will be the modeling of complex seismic wave phenomena in fluid-filled boreholes, which represents a major, and as of yet largely unresolved, computational problem in exploration geophysics. In view of this, we consider a numerical mesh, which can be arbitrarily heterogeneous, consisting of two or more concentric rings representing the fluid in the center and the surrounding porous medium. The spatial discretization is based on a Chebyshev expansion in the radial direction and a Fourier expansion in the azimuthal direction and a Runge–Kutta integration scheme for the time evolution. A domain decomposition method is used to match the fluid–solid boundary conditions based on the method of characteristics. This multi-domain approach allows for significant reductions of the number of grid points in the azimuthal direction for the inner grid domain and thus for corresponding increases of the time step and enhancements of computational efficiency. The viability and accuracy of the proposed method has been rigorously tested and verified through comparisons with analytical solutions as well as with the results obtained with a corresponding, previously published, and independently benchmarked solution for 2D Cartesian coordinates. Finally, the proposed numerical solution also satisfies the reciprocity theorem, which indicates that the inherent singularity associated with the origin of the polar coordinate system is adequately handled.

97 MATHEMATICS AND COMPUTING↗

Performance of asynchronous optimized Schwarz with one-sided communication

In asynchronous iterative methods on distributed-memory computers, processes update their local solutions using data from other processes without an implicit or explicit global synchronization that corresponds to advancing the global iteration counter. Here in this work, we test the asynchronous optimized Schwarz domain-decomposition iterative method using various one-sided (remote direct memory access) communication schemes with passive target completion. The results show that when one-sided communication is well-supported, the asynchronous version of optimized Schwarz can outperform the synchronous version even for perfectly balanced partitionings of the problem on a supercomputer with uniform nodes.

97 MATHEMATICS AND COMPUTING↗

FROSch Preconditioners for Land Ice Simulations of Greenland and Antarctica

Numerical simulations of Greenland and Antarctic ice sheets involve the solution of large-scale highly nonlinear systems of equations on complex shallow geometries. This work is concerned with the construction of Schwarz preconditioners for the solution of the associated tangent problems, which are challenging for solvers mainly because of the strong anisotropy of the meshes and wildly changing boundary conditions that can lead to poorly constrained problems on large portions of the domain. In this study, two-level generalized Dryja--Smith--Widlund (GDSW)--type Schwarz preconditioners are applied to different land ice problems, i.e., a velocity problem, a temperature problem, as well as the coupling of the former two problems. We employ the message passing interface (MPI)--parallel implementation of multilevel Schwarz preconditioners provided by the package FROSch (fast and robust Schwarz) from the Trilinos library. The strength of the proposed preconditioner is that it yields out-of-the-box scalable and robust preconditioners for the single physics problems. To the best of our knowledge, this is the first time two-level Schwarz preconditioners have been applied to the ice sheet problem and a scalable preconditioner has been used for the coupled problem. The preconditioner for the coupled problem differs from previous monolithic GDSW preconditioners in the sense that decoupled extension operators are used to compute the values in the interior of the subdomains. Additionally, several approaches for improving the performance, such as reuse strategies and shared memory OpenMP parallelization, are explored. In our numerical study we target both uniform meshes of varying resolution for the Antarctic ice sheet as well as nonuniform meshes for the Greenland ice sheet. We present several weak and strong scaling studies confirming the robustness of the approach and the parallel scalability of the FROSch implementation. Among the highlights of the numerical results are a weak scaling study for up to 32,K processor cores (8,K MPI ranks and 4 OpenMP threads) and 566,M degrees of freedom for the velocity problem as well as a strong scaling study for up to 4,K processor cores (and MPI ranks) and 68,M degrees of freedom for the coupled problem.

97 MATHEMATICS AND COMPUTING↗

FROSch Preconditioners for Land Ice Simulations of Greenland and Antarctica

Numerical simulations of Greenland and Antarctic ice sheets involve the solution of large-scale highly nonlinear systems of equations on complex shallow geometries. This work is concerned with the construction of Schwarz preconditioners for the solution of the associated tangent problems, which are challenging for solvers mainly because of the strong anisotropy of the meshes and wildly changing boundary conditions that can lead to poorly constrained problems on large portions of the domain. Here, two-level GDSW (Generalized Dryja–Smith–Widlund) type Schwarz preconditioners are applied to different land ice problems, i.e., a velocity problem, a temperature problem, as well as the coupling of the former two problems. We employ the MPI-parallel implementation of multi-level Schwarz preconditioners provided by the package FROSch (Fast and Robust Schwarz)from the Trilinos library. The strength of the proposed preconditioner is that it yields out-of-the-box scalable and robust preconditioners for the single physics problems. To our knowledge, this is the first time two-level Schwarz preconditioners are applied to the ice sheet problem and a scalable preconditioner has been used for the coupled problem. The pre-conditioner for the coupled problem differs from previous monolithic GDSW preconditioners in the sense that decoupled extension operators are used to compute the values in the interior of the sub-domains. Several approaches for improving the performance, such as reuse strategies and shared memory OpenMP parallelization, are explored as well. In our numerical study we target both uniform meshes of varying resolution for the Antarctic ice sheet as well as non uniform meshes for the Greenland ice sheet are considered. We present several weak and strong scaling studies confirming the robustness of the approach and the parallel scalability of the FROSch implementation. Among the highlights of the numerical results are a weak scaling study for up to 32 K processor cores (8 K MPI-ranks and 4 OpenMP threads) and 566 M degrees of freedom for the velocity problem as well as a strong scaling study for up to 4 K processor cores (and MPI-ranks) and 68 M degrees of freedom for the coupled problem.

58 GEOSCIENCES↗

Viscous flow simulations of internal store carriage and separation

The internal carriage of stores by the military aircraft is an option for possible reductions in the aerodynamic drag and the observability. Trade studies of this option require considering the aircraft and the stores together. In an effort to develop a computational fluid dynamic (CFD) code for such studies, an investigation was conducted from 1986 to 1990. The study was divided into five building-block steps. First, a full Navier-Stokes code was developed to simulate the unsteady, three-dimensional cavity flow. As the second step, this code was then used to simulate the flows past various missile configurations at angles of attack up to 44 deg. The effects of incidence as well as the turbulence on the leeside flows were computationally captured. The objective of this study has involved the interference flows of rather complex configurations with multiple, joint or disjoint, components of nonsimilar geometries. Hence, a hybrid domain decomposition (HDD) method was developed as the third step of the investigation. The strengths of the multiblock, zonal, and overlapped grids were judiciously combined and employed for the present problem. In the fourth step, the interference flow past a missile near a flat-plate wing was simulated using the HDD method. Finally, the fifth step involved the simulation of the internal store carriage and separation. Four different cases for two different configurations were simulated. The computational results of all five steps were successfully compared with the available wind tunnel test data. The unsteady aerodynamic forces on the separating store were computationally predicted. The CFD code developed for this project is called Viscous Internal Store Carriage Code (VISCC).

Baysal, Oktay↗

Computational analysis of methods for reduction of induced drag

The purpose of this effort was to perform a computational flow analysis of a design concept centered around induced drag reduction and tip-vortex energy recovery. The flow model solves the unsteady three-dimensional Euler equations, discretized as a finite-volume method, utilizing a high-resolution approximate Riemann solver for cell interface flux definitions. The numerical scheme is an approximately-factored block LU implicit Newton iterative-refinement method. Multiblock domain decomposition is used to partition the field into an ordered arrangement of blocks. Three configurations are analyzed: a baseline fuselage-wing, a fuselage-wing-nacelle, and a fuselage-wing-nacelle-propfan. Aerodynamic force coefficients, propfan performance coefficients, and flowfield maps are used to qualitatively access design efficacy. Where appropriate, comparisons are made with available experimental data.

Janus, J. M.↗

Parallelized Characteristic Basis Finite Element Method (CBFEM-MPI)-A non-iterative domain decomposition algorithm for electromagnetic scattering problems

In this paper, we introduce a parallelized version of a novel, non-iterative domain decomposition algorithm, called Characteristic Basis Finite Element Method (CBFEM-MPI), for efficient solution of large-scale electromagnetic scattering problems, by utilizing a set of specially defined characteristic basis functions (CBFs). This approach is based on the decomposition of the computational domain into a number of non-overlapping subdomains wherein the CBFs are generated by employing a novel procedure, which differs from all those that have been used in the past. Clearly, the CBFs are obtained by calculating the fields radiated by a finite number of dipole-type sources, which are placed hypothetically along the boundary of the conducting object. The major advantages of the proposed technique are twofold: (i) it provides a substantial reduction in the matrix size, and thus, makes use of direct solvers efficiently and (ii) it enables the utilization of parallel processing techniques that considerably decrease the overall computation time. We illustrate the application of the proposed approach via several 3D electromagnetic scattering problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Fundamentally New Coupled Approach to Contact Mechanics via the Dirichlet‐Neumann Schwarz Alternating Method

Contact phenomena are crucial for understanding the behavior of mechanical systems. However, existing computational approaches for simulating mechanical contact often face numerical challenges, such as inaccurate physical predictions, energy conservation errors, and unwanted oscillations. Here, we introduce an alternative technique for simulating dynamic contact based on the non‐overlapping Schwarz alternating method, originally developed for domain decomposition. In multibody contact scenarios, this method treats each body as a separate, non‐overlapping domain and prevents interpenetration using an alternating Dirichlet–Neumann iterative process. This approach has a strong theoretical foundation, eliminates the need for contact constraints, and offers flexibility, making it ideal for multiscale and multiphysics applications. We conducted a numerical comparison between the Schwarz method and traditional methods, such as the Lagrange multiplier and penalty methods, focusing on a benchmark impact problem. Our results indicate that the Schwarz alternating method outperforms traditional methods in several key areas: it provides more accurate predictions for various measurable quantities and demonstrates exceptional energy conservation capabilities. To address unwanted oscillations in contact velocities and forces, we explored various algorithms and stabilization techniques, ultimately opting for the naïve‐stabilized Newmark scheme for its simplicity and effectiveness. Additionally, we validated the efficiency of the Schwarz method in a three‐dimensional impact problem, highlighting its inherent capacity to accommodate different mesh topologies, time‐integration schemes, and time steps for each interacting body.

Schwarz alternating method↗

Statistical CT noise reduction with multiscale decomposition and penalized weighted least squares in the projection domain

Purposes: The suppression of noise in x-ray computed tomography (CT) imaging is of clinical relevance for diagnostic image quality and the potential for radiation dose saving. Toward this purpose, statistical noise reduction methods in either the image or projection domain have been proposed, which employ a multiscale decomposition to enhance the performance of noise suppression while maintaining image sharpness. Recognizing the advantages of noise suppression in the projection domain, the authors propose a projection domain multiscale penalized weighted least squares (PWLS) method, in which the angular sampling rate is explicitly taken into consideration to account for the possible variation of interview sampling rate in advanced clinical or preclinical applications. Methods: The projection domain multiscale PWLS method is derived by converting an isotropic diffusion partial differential equation in the image domain into the projection domain, wherein a multiscale decomposition is carried out. With adoption of the Markov random field or soft thresholding objective function, the projection domain multiscale PWLS method deals with noise at each scale. To compensate for the degradation in image sharpness caused by the projection domain multiscale PWLS method, an edge enhancement is carried out following the noise reduction. The performance of the proposed method is experimentally evaluated and verified using the projection data simulated by computer and acquired by a CT scanner. Results: The preliminary results show that the proposed projection domain multiscale PWLS method outperforms the projection domain single-scale PWLS method and the image domain multiscale anisotropic diffusion method in noise reduction. In addition, the proposed method can preserve image sharpness very well while the occurrence of 'salt-and-pepper' noise and mosaic artifacts can be avoided. Conclusions: Since the interview sampling rate is taken into account in the projection domain multiscale decomposition, the proposed method is anticipated to be useful in advanced clinical and preclinical applications where the interview sampling rate varies.

60 APPLIED LIFE SCIENCES↗

An angular multigrid method for computing mono-energetic particle beams in Flatland

Beams of microscopic particles penetrating scattering background matter play an important role in several applications. The parameter choices made here are motivated by the problem of electron-beam cancer therapy planning. Mathematically, a steady particle beam penetrating matter, or a configuration of several such beams, is modeled by a boundary value problem for a Boltzmann equation. Grid-based discretization of such a problem leads to a system of algebraic equations. This system is typically very large because of the large number of independent variables in the Boltzmann equation-six if no dimension-reducing assumptions other than time independence are made. If grid-based methods are to be practical for these problems, it is therefore necessary to develop very fast solvers for the discretized problems. For beams of mono-energetic particles interacting with a passive background, but not with each other, in two space dimensions, the first author proposed such a solver, based on angular domain decomposition, some time ago. Here, we propose and test an angular multigrid algorithm for the same model problem. Our numerical experiments show rapid, grid-independent convergence. For high-resolution calculations, our method is substantially more efficient than the angular domain decomposition method. In addition, unlike angular domain decomposition, the angular multigrid method works well even when the angular diffusion coefficient is fairly large.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Iterative stability analysis of spatial domain decomposition based on block Jacobi algorithm for the diamond-difference scheme

Here, we study convergence of the integral transport matrix method (ITMM) based on a parallel block Jacobi (PBJ) iterative strategy for solving particle transport problems. The ITMM is a spatial domain decomposition method proposed for massively parallel computations. AFourier analysis of the PBJ-based iterations applied to SN diamond-difference equations in 1D slab and 2D Cartesian geometries is performed. It is carried out for infinite-medium problems with homogeneous material properties. To analyze the performance of the ITMM with the PBJ algorithm and evaluate its potential in scalability we consider a limiting case of one spatial cell per subdomain. The analysis shows that in such limit the spectral radius of the iteration method is one without regard to values of the scattering ratio and optical thickness of the spatial cells. This implies lack of convergence in infinite medium. Numerical results of finite-medium problems are presented. They demonstrate effects of finite size of spatial domain on the performance of the iteration algorithm as well as its asymptotic behavior when the extent of the spatial domain increases. Finally, these numerical experiments also show that for finite domains iterative convergence to a finite criterion is achievable in a multiple of the sum of number of cells in each dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Domain decomposition preconditioners for the spectral collocation method

Several block iteration preconditioners are proposed and analyzed for the solution of elliptic problems by spectral collocation methods in a region partitioned into several rectangles. It is shown that convergence is achieved with a rate which does not depend on the polynomial degree of the spectral solution. The iterative methods here presented can be effectively implemented on multiprocessor systems due to their high degree of parallelism.

Quarteroni, Alfio↗

Performance enhancement of planar MOC calculation in hexagonal geometries by assembly-wise domain decomposition

The parallelization of planar Method of Characteristics (MOC) calculation with the higher order scattering in the hexagonal version of the nTRACER direct whole core calculation code is enhanced by adopting assembly-wise domain decomposition and other techniques. In order to augment the hexagonal domain decomposition, the three-color scheme, the angular decomposition, and the angular flux storage scheme are examined. The parallel performance assessed for the VVER benchmark problems demonstrates that the hexagonal assembly-wise domain decomposition significantly reduces the computing time in ray tracing by up to 64 %. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Automatic partitioning of unstructured meshes for the parallel solution of problems in computational mechanics

Most of the recently proposed computational methods for solving partial differential equations on multiprocessor architectures stem from the 'divide and conquer' paradigm and involve some form of domain decomposition. For those methods which also require grids of points or patches of elements, it is often necessary to explicitly partition the underlying mesh, especially when working with local memory parallel processors. In this paper, a family of cost-effective algorithms for the automatic partitioning of arbitrary two- and three-dimensional finite element and finite difference meshes is presented and discussed in view of a domain decomposed solution procedure and parallel processing. The influence of the algorithmic aspects of a solution method (implicit/explicit computations), and the architectural specifics of a multiprocessor (SIMD/MIMD, startup/transmission time), on the design of a mesh partitioning algorithm are discussed. The impact of the partitioning strategy on load balancing, operation count, operator conditioning, rate of convergence and processor mapping is also addressed. Finally, the proposed mesh decomposition algorithms are demonstrated with realistic examples of finite element, finite volume, and finite difference meshes associated with the parallel solution of solid and fluid mechanics problems on the iPSC/2 and iPSC/860 multiprocessors.

Farhat, Charbel↗