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 343 records · Page 19

Parallel Implicit Algorithms for CFD

The main goal of this project was efficient distributed parallel and workstation cluster implementations of Newton-Krylov-Schwarz (NKS) solvers for implicit Computational Fluid Dynamics (CFD.) "Newton" refers to a quadratically convergent nonlinear iteration using gradient information based on the true residual, "Krylov" to an inner linear iteration that accesses the Jacobian matrix only through highly parallelizable sparse matrix-vector products, and "Schwarz" to a domain decomposition form of preconditioning the inner Krylov iterations with primarily neighbor-only exchange of data between the processors. Prior experience has established that Newton-Krylov methods are competitive solvers in the CFD context and that Krylov-Schwarz methods port well to distributed memory computers. The combination of the techniques into Newton-Krylov-Schwarz was implemented on 2D and 3D unstructured Euler codes on the parallel testbeds that used to be at LaRC and on several other parallel computers operated by other agencies or made available by the vendors. Early implementations were made directly in Massively Parallel Integration (MPI) with parallel solvers we adapted from legacy NASA codes and enhanced for full NKS functionality. Later implementations were made in the framework of the PETSC library from Argonne National Laboratory, which now includes pseudo-transient continuation Newton-Krylov-Schwarz solver capability (as a result of demands we made upon PETSC during our early porting experiences). A secondary project pursued with funding from this contract was parallel implicit solvers in acoustics, specifically in the Helmholtz formulation. A 2D acoustic inverse problem has been solved in parallel within the PETSC framework.

Keyes, David E.↗

SpF: Enabling Petascale Performance for Pseudospectral Dynamo Models

Pseudospectral (PS) methods possess a number of characteristics (e.g., efficiency, accuracy, natural boundary conditions) that are extremely desirable for dynamo models. Unfortunately, dynamo models based upon PS methods face a number of daunting challenges, which include exposing additional parallelism, leveraging hardware accelerators, exploiting hybrid parallelism, and improving the scalability of global memory transposes. Although these issues are a concern for most models, solutions for PS methods tend to require far more pervasive changes to underlying data and control structures. Further, improvements in performance in one model are difficult to transfer to other models, resulting in significant duplication of effort across the research community.We have developed an extensible software framework for pseudospectral methods called SpF that is intended to enable extreme scalability and optimal performance. High-level abstractions provided by SpF unburden applications of the responsibility of managing domain decomposition and load balance while reducing the changes in code required to adapt to new computing architectures. The key design concept in SpF is that each phase of the numerical calculation is partitioned into disjoint numerical kernels that can be performed entirely in-processor. The granularity of domain-decomposition provided by SpF is only constrained by the data-locality requirements of these kernels. SpF builds on top of optimized vendor libraries for common numerical operations such as transforms, matrix solvers, etc., but can also be configured to use open source alternatives for portability. SpF includes several alternative schemes for global data redistribution and is expected to serve as an ideal testbed for further research into optimal approaches for different network architectures.In this presentation, we will describe the basic architecture of SpF as well as preliminary performance data and experience with adapting legacy dynamo codes. We will conclude with a discussion of planned extensions to SpF that will provide pseudospectral applications with additional flexibility with regard to time integration, linear solvers, and discretization in the radial direction.

Pseudospectral (PS)↗

Direct Vlasov solvers with high-order spectral element method.

This paper presents the development of parallel direct Vlasov solvers using the Spectral Element Method (SEM). Instead of the standard Particle-In-Cell (PIC) approach for kinetic space plasma simulation, i.e. solving the Vlasov-Maxwell equations, the direct method has been used in this paper. There are several benefits to solve the Vlasov equation directly, such as avoiding noise associated with the finite number of particles and the capability to capture the fine structure in the plasma, etc. The most challenging part of direct Vlasov solver comes from high dimension, as the computational cost increases as N{sup 2d}, where d is the dimension of the physical space. Recently due to fast development of supercomputers, the possibility of high dimensions becomes more realistic. A significant effort has been devoted to solve the Vlasov equation in low dimensions so far, now more interests focus on higher dimensions. Different numerical methods have been tried so far, such as finite difference method, Fourier spectral method, finite volume method, etc. In this paper SEM has been successfully applied to construct these solvers. SEM has shown several advantages, such as easy interpolation due to local element structure and long time integration due to its high order accuracy. Domain decomposition in high dimensions have been used for parallelization, these include scalable parallel 1D and 2D Poisson solvers. Benchmark results have been shown and simulation results have been reported for two different cases: one dimension (1P1V), and two dimensions (2P2V) in both physical and velocity spaces.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A novel partitioning method for block-structured adaptive meshes

We propose a novel partitioning method for block-structured adaptive meshes utilizing the meshless Lagrangian particle concept. With the observation that an optimum partitioning has high analogy to the relaxation of a multi-phase fluid to steady state, physically motivated model equations are developed to characterize the background mesh topology and are solved by multi-phase smoothed-particle hydrodynamics. In contrast to well established partitioning approaches, all optimization objectives are implicitly incorporated and achieved during the particle relaxation to stationary state. Distinct partitioning sub-domains are represented by colored particles and separated by a sharp interface with a surface tension model. In order to obtain the particle relaxation, special viscous and skin friction models, coupled with a tailored time integration algorithm are proposed. Numerical experiments show that the present method has several important properties: generation of approximately equal-sized partitions without dependence on the mesh-element type, optimized interface communication between distinct partitioning sub-domains, continuous domain decomposition which is physically localized and implicitly incremental. Therefore it is particularly suitable for load-balancing of high-performance CFD simulations.

97 MATHEMATICS AND COMPUTING↗

Development of a large scale Chimera grid system for the Space Shuttle Launch Vehicle

The application of CFD techniques to large problems has dictated the need for large team efforts. This paper offers an opportunity to examine the motivations, goals, needs, problems, as well as the methods, tools, and constraints that defined NASA's development of a 111 grid/16 million point grid system model for the Space Shuttle Launch Vehicle. The Chimera approach used for domain decomposition encouraged separation of the complex geometry into several major components each of which was modeled by an autonomous team. ICEM-CFD, a CAD based grid generation package, simplified the geometry and grid topology definition by provoding mature CAD tools and patch independent meshing. The resulting grid system has, on average, a four inch resolution along the surface.

Pearce, Daniel G.↗

Wing-Body Aeroelasticity Using Finite-Difference Fluid/Finite-Element Structural Equations on Parallel Computers

This paper presents a procedure for computing the aeroelasticity of wing-body configurations on multiple-instruction, multiple-data (MIMD) parallel computers. In this procedure, fluids are modeled using Euler equations discretized by a finite difference method, and structures are modeled using finite element equations. The procedure is designed in such a way that each discipline can be developed and maintained independently by using a domain decomposition approach. A parallel integration scheme is used to compute aeroelastic responses by solving the coupled fluid and structural equations concurrently while keeping modularity of each discipline. The present procedure is validated by computing the aeroelastic response of a wing and comparing with experiment. Aeroelastic computations are illustrated for a High Speed Civil Transport type wing-body configuration.

Byun, Chansup↗

Wing-Body Aeroelasticity on Parallel Computers

This article presents a procedure for computing the aeroelasticity of wing-body configurations on multiple-instruction, multiple-data parallel computers. In this procedure, fluids are modeled using Euler equations discretized by a finite difference method, and structures are modeled using finite element equations. The procedure is designed in such a way that each discipline can be developed and maintained independently by using a domain decomposition approach. A parallel integration scheme is used to compute aeroelastic responses by solving the coupled fluid and structural equations concurrently while keeping modularity of each discipline. The present procedure is validated by computing the aeroelastic response of a wing and comparing with experiment. Aeroelastic computations are illustrated for a high speed civil transport type wing-body configuration.

Guruswamy, Guru P.↗

Discretization and Preconditioning Algorithms for the Euler and Navier-Stokes Equations on Unstructured Meshes

Several stabilized discretization procedures for conservation law equations on triangulated domains will be considered. Specifically, numerical schemes based on upwind finite volume, fluctuation splitting, Galerkin least-squares, and space discontinuous Galerkin discretization will be considered in detail. A standard energy analysis for several of these methods will be given via entropy symmetrization. Next, we will present some relatively new theoretical results concerning congruence relationships for left or right symmetrized equations. These results suggest new variants of existing FV, DG, GLS and FS methods which are computationally more efficient while retaining the pleasant theoretical properties achieved by entropy symmetrization. In addition, the task of Jacobian linearization of these schemes for use in Newton's method is greatly simplified owing to exploitation of exact symmetries which exist in the system. These variants have been implemented in the "ELF" library for which example calculations will be shown. The FV, FS and DG schemes also permit discrete maximum principle analysis and enforcement which greatly adds to the robustness of the methods. Some prevalent limiting strategies will be reviewed. Next, we consider embedding these nonlinear space discretizations into exact and inexact Newton solvers which are preconditioned using a nonoverlapping (Schur complement) domain decomposition technique. Elements of nonoverlapping domain decomposition for elliptic problems will be reviewed followed by the present extension to hyperbolic and elliptic-hyperbolic problems. Other issues of practical relevance such the meshing of geometries, code implementation, turbulence modeling, global convergence, etc. will be addressed as needed.

Barth, Timothy↗

Goal-Oriented Discretization Error Control in Coupled Nearfield-Farfield Low-Boom Simulations

The method of adjoint weighted residuals is used to determine the level of discretization error in loudness predictions of sonic booms on the ground. We analyze the standard nearfied-farfield domain decomposition approach. In the nearfield domain, the three-dimensional Euler equations are solved to obtain a pressure signature generated by the aircraft. In the farfield, this waveform is propagated through the atmosphere to the ground by solving the augmented Burgers’ equation. Loudness is characterized using weighted sound-exposure-level metrics. We formulate discretization error estimates for the ground signature and loudness metrics for this one-way coupled system. Although the nearfield solution is independent of the farfield, the adjoint formulation for the coupled system provides feedback from the farfield to identify high-error regions in the nearfield. The results demonstrate that the discrete adjoint implementation is asymptotically consistent and provides reliable error estimates. Furthermore, we show how the error can be controlled through adaptive refinement of the nearfield mesh. The approach is evaluated on two- and three-dimensional problems, including the X-59 flight demonstration aircraft.

CST↗

Simulating the Effect of Fracture Connectivity on Repository Performance with GDSA Framework - 18589

This work examines the possible migration of radionuclides from a deep geologic nuclear waste repository sited in fractured crystalline host rock. The key safety concern is the potential effect on waste isolation of the inter-connectivity of the fracture network, which is primarily established by the temporal evolution of the temperature and stress fields at the time of original rock intrusion and cooling. Two end members are considered in these simulations, one with a high degree of connectivity to the biosphere, such that advective transport through the fracture and fault network controls radionuclide migration, and the other with a low degree of connectivity, such that slow diffusive transport through the crystalline rock matrix is the controlling process for radionuclide migration to the biosphere. Both end members have several areally extensive, high-transmissivity deformation zones, whose distance to the repository is an important factor for waste isolation capability. Uncertainties in fracture properties (transmissivity, orientation, radius) and fracture distribution also give rise to uncertainty in waste isolation capability (i.e., the overall connectivity of the repository with the surface biosphere). These types of natural system uncertainties are generally present in any geologic site-characterization program and thus represent an important factor in assessing repository performance in hard rock environments. The waste considered in these simulations are spent fuel rod assemblies from the U.S. commercial nuclear reactor fleet. Thermal output of the waste must be considered in the simulations and can influence the rate and timing of waste package failure, waste form degradation, and fluid flux due to thermal expansion around the repository horizon. To achieve a high-fidelity representation of radionuclide transport in fractures and rock matrix, combined with thermal energy transport and fluid flow in fractures and matrix, the mathematical model is solved numerically in a parallel high-performance computing (HPC) environment on a finite volume unstructured grid consisting of approximately 5 million cells, using Geologic Disposal Safety Assessment (GDSA) Framework (https://pa.sandia.gov), an open-source performance assessment tool for deep underground disposal of nuclear waste. GDSA Framework uses PFLOTRAN to solve the balance equations on a three-dimensional grid with heterogeneous properties, using multiple processors in a parallel configuration based on domain decomposition. The fracture networks in these simulations are originally generated as discrete fracture networks (DFNs), which are sets of two-dimensional planes distributed in a three-dimensional domain. The method used in GDSA Framework maps the stochastically generated DFN to an equivalent continuous porous medium (ECPM) domain that allows for the simulation of coupled heat flow, fluid flow, and radionuclide transport, including heat conduction through the matrix of the fractured rock, which is a process not easily modeled in a DFN representation. Computational efficiency is also greatly enhanced using the ECPM method, allowing for a realistic representation and analysis of uncertainties in a multi-realization performance assessment of a deep geologic repository. The effect of fracture connectivity on the waste isolation safety function, as brought to light by these GDSA Framework simulations, points to the importance of including a realistic representation of uncertainties in fracture properties and distribution (effectively, uncertainty in spatial heterogeneity) in repository safety assessment simulations. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Object detection with a multistatic array using singular value decomposition

A method and system for detecting the presence of subsurface objects within a medium is provided. In some embodiments, the detection system operates in a multistatic mode to collect radar return signals generated by an array of transceiver antenna pairs that is positioned across a surface and that travels down the surface. The detection system converts the return signals from a time domain to a frequency domain, resulting in frequency return signals. The detection system then performs a singular value decomposition for each frequency to identify singular values for each frequency. The detection system then detects the presence of a subsurface object based on a comparison of the identified singular values to expected singular values when no subsurface object is present.

47 OTHER INSTRUMENTATION↗

A tightly-coupled domain-decomposition approach for highly nonlinear stochastic multiphysics systems

Multiphysics simulations often involve nonlinear components that are driven by internally generated or externally imposed random fluctuations. When used with a domain-decomposition (DD) algorithm, such components have to be coupled in a way that both accurately propagates the noise between the subdomains and lends itself to a stable and cost-effective temporal integration. We develop a conservative DD approach in which tight coupling is obtained by using a Jacobian-free Newton–Krylov (JfNK) method with a generalized minimum residual iterative linear solver. This strategy is tested on a coupled nonlinear diffusion system forced by a truncated Gaussian noise at the boundary. Enforcement of path-wise continuity of the state variable and its flux, as opposed to continuity in the mean, at interfaces between subdomains enables the DD algorithm to correctly propagate boundary fluctuations throughout the computational domain. Reliance on a single Newton iteration (explicit coupling), rather than on the fully converged JfNK (implicit) coupling, may increase the solution error by an order of magnitude. Increase in communication frequency between the DD components reduces the explicit coupling's error, but makes it less efficient than the implicit coupling at comparable error levels for all noise strengths considered. Finally, the DD algorithm with the implicit JfNK coupling resolves temporally-correlated fluctuations of the boundary noise when the correlation time of the latter exceeds some multiple of an appropriately defined characteristic diffusion time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Tensor decompositions for count data that leverage stochastic and deterministic optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the maximum likelihood estimator (MLE) of the Poisson CPD model. Here, this work presents two new algorithms that extend state-of-the-art local methods for Poisson CPD. Hybrid GCP-CPAPR combines Generalized Canonical Decomposition (GCP) with stochastic optimization and CP Alternating Poisson Regression (CPAPR), a deterministic algorithm, to increase the probability of converging to the MLE over either method used alone. Restarted CPAPR with SVDrop uses a heuristic based on the singular values of the CPD model unfoldings to identify convergence toward optimizers that are not the MLE and restarts within the feasible domain of the optimization problem, thus reducing overall computational cost when using a multi-start strategy. We provide empirical evidence that indicates our approaches outperform existing methods with respect to converging to the Poisson CPD MLE.

CPAPR↗

Automatic Kalman-filter-based wavelet shrinkage denoising of 1D stellar spectra

We propose a non-parametric method to denoise 1D stellar spectra based on wavelet shrinkage followed by adaptive Kalman thresholding. Wavelet shrinkage denoising involves applying the discrete wavelet transform (DWT) to the input signal, ‘shrinking’ certain frequency components in the transform domain, and then applying inverse DWT to the reduced components. The performance of this procedure is influenced by the choice of base wavelet, the number of decomposition levels, and the thresholding function. Typically, these parameters are chosen by ‘trial and error’, which can be strongly dependent on the properties of the data being denoised. We here introduce an adaptive Kalman-filter-based thresholding method that eliminates the need for choosing the number of decomposition levels. We use the ‘Haar’ wavelet basis, which we found to provide excellent filtering for 1D stellar spectra, at a low computational cost. We introduce various levels of Poisson noise into synthetic PHOENIX spectra, and test the performance of several common denoising methods against our own. It proves superior in terms of noise suppression and peak shape preservation. Finally, we expect it may also be of use in automatically and accurately filtering low signal-to-noise galaxy and quasar spectra obtained from surveys such as SDSS, Gaia, LSST, PESSTO, VANDELS, LEGA-C, and DESI.

79 ASTRONOMY AND ASTROPHYSICS↗

Automatic Generation of Algorithms for the Statistical Analysis of Planetary Nebulae Images

Analyzing data sets collected in experiments or by observations is a Core scientific activity. Typically, experimentd and observational data are &aught with uncertainty, and the analysis is based on a statistical model of the conjectured underlying processes, The large data volumes collected by modern instruments make computer support indispensible for this. Consequently, scientists spend significant amounts of their time with the development and refinement of the data analysis programs. AutoBayes [GF+02, FS03] is a fully automatic synthesis system for generating statistical data analysis programs. Externally, it looks like a compiler: it takes an abstract problem specification and translates it into executable code. Its input is a concise description of a data analysis problem in the form of a statistical model as shown in Figure 1; its output is optimized and fully documented C/C++ code which can be linked dynamically into the Matlab and Octave environments. Internally, however, it is quite different: AutoBayes derives a customized algorithm implementing the given model using a schema-based process, and then further refines and optimizes the algorithm into code. A schema is a parameterized code template with associated semantic constraints which define and restrict the template s applicability. The schema parameters are instantiated in a problem-specific way during synthesis as AutoBayes checks the constraints against the original model or, recursively, against emerging sub-problems. AutoBayes schema library contains problem decomposition operators (which are justified by theorems in a formal logic in the domain of Bayesian networks) as well as machine learning algorithms (e.g., EM, k-Means) and nu- meric optimization methods (e.g., Nelder-Mead simplex, conjugate gradient). AutoBayes augments this schema-based approach by symbolic computation to derive closed-form solutions whenever possible. This is a major advantage over other statistical data analysis systems which use numerical approximations even in cases where closed-form solutions exist. AutoBayes is implemented in Prolog and comprises approximately 75.000 lines of code. In this paper, we take one typical scientific data analysis problem-analyzing planetary nebulae images taken by the Hubble Space Telescope-and show how AutoBayes can be used to automate the implementation of the necessary anal- ysis programs. We initially follow the analysis described by Knuth and Hajian [KHO2] and use AutoBayes to derive code for the published models. We show the details of the code derivation process, including the symbolic computations and automatic integration of library procedures, and compare the results of the automatically generated and manually implemented code. We then go beyond the original analysis and use AutoBayes to derive code for a simple image segmentation procedure based on a mixture model which can be used to automate a manual preproceesing step. Finally, we combine the original approach with the simple segmentation which yields a more detailed analysis. This also demonstrates that AutoBayes makes it easy to combine different aspects of data analysis.

Fischer, Bernd↗

Novel strategies for modal-based structural material identification

Here, we present modal-based methods for model calibration in structural dynamics, and address several key challenges in the solution of gradient-based optimization problems with eigenvalues and eigenvectors, including the solution of singular Helmholtz problems encountered in sensitivity calculations, non-differentiable objective functions caused by mode swapping during optimization, and cases with repeated eigenvalues. Unlike previous literature that relied on direct solution of the eigenvector adjoint equations, we present a parallel iterative domain decomposition strategy (Adjoint Computation via Modal Superposition with Truncation Augmentation) for the solution of the singular Helmholtz problems. For problems with repeated eigenvalues we present a novel Mode Separation via Projection algorithm, and in order to address mode swapping between inverse iterations we present a novel Injective mode ordering metric. We present the implementation of these methods in a massively parallel finite element framework with the ability to use measured modal data to extract unknown structural model parameters from large complex problems. A series of increasingly complex numerical examples are presented that demonstrate the implementation and performance of the methods in a massively parallel finite element framework [7], [5], using gradient-based optimization techniques in the Rapid Optimization Library (ROL) [21].

36 MATERIALS SCIENCE↗

Quasi-static analysis of elastic behavior for some systems having higher fracture densities.

Elastic behavior of geomechanical systems with interacting (but not intersecting) fractures is treated using generalizations of the Backus and the Schoenberg-Muir methods for analyzing layered systems whose layers are intrinsically anisotropic due to locally aligned fractures. By permitting the axis of symmetry of the locally anisotropic compliance matrix for individual layers to differ from that of the layering direction, we derive analytical formulas for interacting fractured regions with arbitrary orientations to each other. This procedure provides a systematic tool for studying how contiguous, but not yet intersecting, fractured domains interact, and provides a direct (though approximate) means of predicting when and how such interactions lead to more dramatic weakening effects and ultimately to failure of these complicated systems. The method permits decomposition of the system elastic behavior into specific eigenmodes that can all be analyzed, and provides a better understanding about which of these specific modes are expected to be most important to the evolving failure process.

54 ENVIRONMENTAL SCIENCES↗