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 415 records · Page 23

Preconditioned implicit solvers for the Navier-Stokes equations on distributed-memory machines

The GMRES method is parallelized, and combined with local preconditioning to construct an implicit parallel solver to obtain steady-state solutions for the Navier-Stokes equations of fluid flow on distributed-memory machines. The new implicit parallel solver is designed to preserve the convergence rate of the equivalent 'serial' solver. A static domain-decomposition is used to partition the computational domain amongst the available processing nodes of the parallel machine. The SPMD (Single-Program Multiple-Data) programming model is combined with message-passing tools to develop the parallel code on a 32-node Intel Hypercube and a 512-node Intel Delta machine. The implicit parallel solver is validated for internal and external flow problems, and is found to compare identically with flow solutions obtained on a Cray Y-MP/8. A peak computational speed of 2300 MFlops/sec has been achieved on 512 nodes of the Intel Delta machine,k for a problem size of 1024 K equations (256 K grid points).

Ajmani, Kumud↗

Transfer learning of memory kernels for transferable coarse-graining of polymer dynamics

The present work concerns the transferability of coarse-grained (CG) modeling in reproducing the dynamic properties of the reference atomistic systems across a range of parameters. In particular, we focus on implicit-solvent CG modeling of polymer solutions. The CG model is based on the generalized Langevin equation, where the memory kernel plays the critical role in determining the dynamics in all time scales. Thus, we propose methods for transfer learning of memory kernels. The key ingredient of our methods is Gaussian process regression. By integration with the model order reduction via proper orthogonal decomposition and the active learning technique, the transfer learning can be practically efficient and requires minimum training data. Through two example polymer solution systems, we demonstrate the accuracy and efficiency of the proposed transfer learning methods in the construction of transferable memory kernels. The transferability allows for out-of-sample predictions, even in the extrapolated domain of parameters. Built on the transferable memory kernels, the CG models can reproduce the dynamic properties of polymers in all time scales at different thermodynamic conditions (such as temperature and solvent viscosity) and for different systems with varying concentrations and lengths of polymers.

Ma, Zhan↗

A spectral analysis of the domain decomposed Monte Carlo method for linear systems

The domain decomposed behavior of the adjoint Neumann-Ulam Monte Carlo method for solving linear systems is analyzed using the spectral properties of the linear oper- ator. Relationships for the average length of the adjoint random walks, a measure of convergence speed and serial performance, are made with respect to the eigenvalues of the linear operator. In addition, relationships for the effective optical thickness of a domain in the decomposition are presented based on the spectral analysis and diffusion theory. Using the effective optical thickness, the Wigner rational approxi- mation and the mean chord approximation are applied to estimate the leakage frac- tion of random walks from a domain in the decomposition as a measure of parallel performance and potential communication costs. The one-speed, two-dimensional neutron diffusion equation is used as a model problem in numerical experiments to test the models for symmetric operators with spectral qualities similar to light water reactor problems. We find, in general, the derived approximations show good agreement with random walk lengths and leakage fractions computed by the numerical experiments.

97 MATHEMATICS AND COMPUTING↗

Tensor factorization for elucidating mechanisms of piezoresponse relaxation via dynamic Piezoresponse Force Spectroscopy

Spatially resolved time and voltage-dependent polarization dynamics in PbTiO 3 thin films is explored using dynamic piezoresponse force microscopy (D-PFM) in conjunction with interferometric displacement sensing. This approach gives rise to 4D data sets containing information on bias-dependent relaxation dynamics at each spatial location without long-range electrostatic artifacts. To interpret these data sets in the absence of defined physical models, we employ a non-negative tensor factorization method which clearly presents the data as a product of simple behaviors allowing for direct physics interpretation. Correspondingly, we perform phase-field modeling finding the existence of ‘hard’ and ‘soft’ domain wall edges. This approach can be extended to other multidimensional spectroscopies for which even exploratory data analysis leads to unsatisfactory results due to many components in the decomposition.

36 MATERIALS SCIENCE↗

Task Decomposition in Human Reliability Analysis

In the probabilistic safety assessments (PSAs) used in the nuclear industry, human failure events (HFEs) are determined as a subset of hardware failures, namely those hardware failures that could be triggered by human action or inaction. This approach is top-down, starting with hardware faults and deducing human contributions to those faults. Elsewhere, more traditionally human factors driven approaches would tend to look at opportunities for human errors first in a task analysis and then identify which of those errors is risk significant. The intersection of top-down and bottom-up approaches to defining HFEs has not been carefully studied. Ideally, both approaches should arrive at the same set of HFEs. This question remains central as human reliability analysis (HRA) methods are generalized to new domains like oil and gas. The HFEs used in nuclear PSAs tend to be top-down— defined as a subset of the PSA—whereas the HFEs used in petroleum quantitative risk assessments (QRAs) are more likely to be bottom-up—derived from a task analysis conducted by human factors experts. The marriage of these approaches is necessary in order to ensure that HRA methods developed for top-down HFEs are also sufficient for bottom-up applications.

error of commission↗

Self-force with (3+1) codes: A primer for numerical relativists

Prescriptions for numerical self-force calculations have traditionally been designed for frequency-domain or (1+1) time-domain codes which employ a mode decomposition to facilitate in carrying out a delicate regularization scheme. This has prevented self-force analyses from benefiting from the powerful suite of tools developed and used by numerical relativists for simulations of the evolution of comparable-mass black hole binaries. In this work, we revisit a previously-introduced (3+1) method for self-force calculations and demonstrate its viability by applying it to the test case of a scalar charge moving in a circular orbit around a Schwarzschild black hole. Two (3+1) codes originally developed for numerical relativity applications were independently employed, and in each we were able to compute the two independent components of the self-force and the energy flux correctly to within <1%. We also demonstrate consistency between the t component of the self-force and the scalar energy flux. Our results constitute the first successful calculation of a self-force in a (3+1) framework, and thus open opportunities for the numerical relativity community in self-force analyses and the perturbative modeling of extreme-mass-ratio inspirals.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Memory-efficient emulation of physical tabular data using quadtree decomposition

Computationally expensive functions are sometimes replaced in simulations with an emulator that approx-imates the true function (e.g., equations of state, wavelength-dependent opacity, or composition-dependent materials properties). For functions that have a constrained domain of interest, this can be done by discretizing the domain and performing a local interpolation on the tabulated function values of each local domain. For these so-called tabular data methods, the method of discretizing the domain and mapping the input space to each subdomain can drastically influence the memory and computational costs of the emulator. This is especially true for functions that vary drastically in different regions. We present a method for domain discretization and mapping that utilizes quadtrees, which results in significant reductions in the size of the emulator with minimal increases to computational costs or loss of global accuracy. We apply our method to the electron-positron Helmholtz free energy equation of state and show over an order of magnitude reduction in memory costs for reasonable levels of numerical accuracy.

97 MATHEMATICS AND COMPUTING↗

NSR&D FY14 Final Report: Friction/Impact Modeling

The LANL-developed CartaBlanca code uses advanced techniques, including the Dual Domain Material Point (DDMP) method, to calculate fluid, solid motions and fluid-structure interactions. In the last year we have implemented the ViscoSCRAM material model in CartaBlanca based on Clements’ Abaqus-Explicit Finite Element implementation. In this fiscal year, we study numerical properties of this implementation. To consider coupled mechanical, thermal and chemical effects, we have implemented Henson’s HE decomposition model to couple with the thermal and mechanical packages in CartaBlanca. We have also developed porous media flow modules to consider heat convection effects of the reaction product gas inside pores of HE. The next immediate step is to perform numerical simulations to study interactions among these different mechanisms. We have started such calculation and obtained interesting initial results at the end of this fiscal year.

97 MATHEMATICS AND COMPUTING↗

Optimal mapping of irregular finite element domains to parallel processors

Mapping the solution domain of n-finite elements into N-subdomains that may be processed in parallel by N-processors is an optimal one if the subdomain decomposition results in a well-balanced workload distribution among the processors. The problem is discussed in the context of irregular finite element domains as an important aspect of the efficient utilization of the capabilities of emerging multiprocessor computers. Finding the optimal mapping is an intractable combinatorial optimization problem, for which a satisfactory approximate solution is obtained here by analogy to a method used in statistical mechanics for simulating the annealing process in solids. The simulated annealing analogy and algorithm are described, and numerical results are given for mapping an irregular two-dimensional finite element domain containing a singularity onto the Hypercube computer.

Flower, J.↗

Bulk Electrical Cable Non-Destructive Examination Methods for Nuclear Power Plant Cable Aging Management Programs

This Pacific Northwest National Laboratory milestone report describes progress to date on the investigation of nondestructive test methods focusing particularly on bulk electrical test methods that provide key indicators of cable aging and damage. The work includes a review of relevant literature as well as hands-on experimental verification of inspection capabilities. As nuclear power plants consider applying for second, or subsequent, license renewal to extend their operating period from 60 years to 80 years, it is important to understand how the materials installed in plant systems and components will age during that time and develop aging management programs to assure continued safe operation under normal and design basis events (DBE). Normal component and system tests typically confirm the cables can perform their normal operational function. The focus of the cable test program, however, is directed toward the more demanding challenge of assuring the cable function under accident or DBE. The industry has adopted 50% elongation at break (EAB) relative to the un-aged cable condition as the acceptability standard. All tests are benchmarked against the cable EAB test. EAB, however, is a destructive test so the test programs must apply an array of other nondestructive examination (NDE) tests to assure or infer the overall set of cable’s system integrity. Assessment of cable integrity is further complicated in many cases by vendor’s use of dissimilar material for jacket and insulation. Frequently the jacket will degrade more rapidly than the underlying insulation. Although this can serve as an early alert to cable damage, direct test of the cable insulation without violating the protective jacket becomes problematic. This report addresses the range of bulk electrical NDE cable tests that are or could be practically implemented in a field-test situation with a particular focus on frequency domain reflectometry (FDR). The FDR test method offers numerous advantages over many other bulk electrical tests. Two commercial FDR systems plus a laboratory vector network analyzer are used to test an array of aged and un-aged cables under identical conditions. Several conclusions are set forth, and a number of knowledge gaps are identified.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Stability of constant gain systems with vector feedback

The state space, the controllability, and the observability concepts are discussed in connection with the proposed stability analysis which permits drastic dimensional reductions for a vector feedback problem. Any constant gain system's stability can thus be analyzed in the frequency domain with a single Nyquist plot. The analysis considers the total system with all loops closed, a disturbance vector as input, and the feedback vector as output. All constant gain systems are shown to be decomposable into stable subsystems where the degree of the decomposition determines the dimensions. The maximum decomposition results in the state-space approach which is the limit case. The method is demonstrated with the stability analysis of the pogo phenomenon, an oscillatory interaction between the propulsion and the structure of a space vehicle. This problem, with eigenvalues over a hundred, was drastically but rigorously reduced to a stability analysis of a 4x4 matrix.

Vonpragenau, G. L.↗

A two-level GPU-accelerated incomplete LU preconditioner for general sparse linear systems

This paper presents a parallel preconditioning approach based on incomplete LU (ILU) factorizations in the framework of Domain Decomposition (DD) for general sparse linear systems. We focus on distributed memory parallel architectures, specifically, those that are equipped with graphic processing units (GPUs). In addition to block-Jacobi, we present general purpose two-level ILU Schur complement-based approaches, where different strategies are presented to solve the coarse-level reduced system. These strategies are combined with modified ILU methods in the construction of the coarse-level operator, in order to effectively remove smooth errors by targeting an algebraically smooth vector. We leverage available GPU-based sparse matrix kernels to accelerate the setup and the solve phases of the proposed ILU preconditioner. We evaluate the efficiency of the proposed methods as a smoother for algebraic multigrid (AMG) and as a preconditioner for Krylov subspace methods on challenging anisotropic diffusion problems and a collection of general sparse matrices.

97 MATHEMATICS AND COMPUTING↗

The numerical simulation of steady transonic rotational flow using a dual potential formulation

A finite-difference method is presented that simulates steady transonic rotational flow of an inviscid fluid by representing the velocity field as the sum of scalar and vector potentials. This dual potential velocity decomposition extends the validity of the scalar (full) velocity potential to include vorticity. The inclusion of a vector potential also permits an alternate treatment of lift that does not require a circulation wake cut. This is accomplished by specifying the vector potential as a constant on the airfoil surface in order to satisfy a Kutta condition. The governing equations are solved as iteratively decoupled scalar equations using approximate factorization techniques, and the overall efficiency approaches that of the full potential equation. The governing equations are able to convect entropy and vorticity throughout the flow field and are equivalent to the Euler equations in continuous flow domains, however at shocks the Rankine-Hugoniot entropy jump must be supplied. An entropy correction method is presented and verified with transonic airfoil solutions of the Euler equations.

Chaderjian, N. M.↗

Porting LAMMPS to GPUs.

LAMMPS is a classical molecular dynamics code, and an acronym for Large-scale Atomic/Molecular Massively Parallel Simulator. LAMMPS has potentials for soft materials (biomolecules, polymers) and solid-state materials (metals, semiconductors) and coarse-grained or mesoscopic systems. It can be used to model atoms or, more generically, as a parallel particle simulator at the atomic, meso, or continuum scale. LAMMPS runs on single processors or in parallel using message-passing techniques and a spatial-decomposition of the simulation domain. The code is designed to be easy to modify or extend with new functionality.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Security enrichment of optical image cryptosystem based on superposition technique using fractional Hartley and gyrator transform domains deploying equal modulus decomposition

In this paper, a symmetric cryptosystem has been suggested to increase security of double random phase encoding using superposition technique in fractional Hartley transform (FrHT) and gyrator transform (GT) domains. It uses structured phase mask (SPM) and hybrid mask (HM) deploying equal modulus decomposition (EMD). Related to original phase truncated Fourier transform (PTFT) based cryptosystem, the security of encoding and decoding is upgraded by using the superposition technique. With the usage of SPM we can increase the key space while encoding and can also overcome the axis alignment difficulty. Decoding is just the reversal of the encoding method. The proposed scheme has robustness against common attacks like: noise and occlusion attacks. With the help of numerical simulation results we also show that our cryptosystem is vulnerable to various attacks. Performance of the suggested method is calculated in terms of Mean Square Error (MSE) between original and decoded image and also the sensitivity of the SPM parameters and rotational angles of GT is investigated. The competence of the suggested method includes analysis on EMD, histogram and correlation coefficient. The suggested cryptosystem is also open to the occlusion attack and noise attack to analyze its performance and evenness.

42 ENGINEERING↗

Unified wavefront singularity characterization of three-dimensional elastodynamic time-domain half-space Green's function under impulsive boundary and internal loads

Founded on a novel analytical formulation that led to a rigorous yet compact path-integral representation of the time-domain elastodynamic half-space Green's function, a unified analysis of the possible occurrence of different singular wavefront behaviour in the response under arbitrary impulsive internal or surface point loads at arbitrary source-receiver locations is presented. With the decomposition of the general solution into distinct initiating and reflected wave group integrals that share a common factored format and simple contour definitions, the mathematical framework is shown to allow a straightforward identification of the specific conditions and the particular wave groups that are responsible for the singular wavefront phenomena without resorting to advanced analytic function theories or asymptotic methods. Analytic characterizations of the nature, strength and direction of all intrinsic singular wavefront behaviours of the three-dimensional Green's function in three canonical cases of source-receiver configurations are given in a dual integral-closed form format to facilitate their theoretical understanding as well as computational applications. Graphical illustrations of their variation with the source-receiver configuration and the medium's Poisson's ratio together with relevant comparison and clarifications of some classical treatments are included.

Green’s functions↗

3D Electromagnetic Plasma Particle Simulations on the Intel Delta Parallel Computer

A three-dimensional electromagnetic PIC code has been developed on the 512 node Intel Touchstone Delta MIMD parallel computer. This code is based on the General Concurrent PIC algorithm which uses a domain decomposition to divide the computation among the processors. The 3D simulation domain can be partitioned into 1-, 2-, or 3-dimensional subdomains. Particles must be exchanged between processors as they move among the subdomains.

PIC↗

Information criteria for quantifying loss of reversibility in parallelized KMC

Parallel Kinetic Monte Carlo (KMC) is a potent tool to simulate stochastic particle systems efficiently. However, despite literature on quantifying domain decomposition errors of the particle system for this class of algorithms in the short and in the long time regime, no study yet explores and quantifies the loss of time-reversibility in Parallel KMC. Inspired by concepts from non-equilibrium statistical mechanics, we propose the entropy production per unit time, or entropy production rate, given in terms of an observable and a corresponding estimator, as a metric that quantifies the loss of reversibility. Typically, this is a quantity that cannot be computed explicitly for Parallel KMC, which is why we develop a posteriori estimators that have good scaling properties with respect to the size of the system. Through these estimators, we can connect the different parameters of the scheme, such as the communication time step of the parallelization, the choice of the domain decomposition, and the computational schedule, with its performance in controlling the loss of reversibility. From this point of view, the entropy production rate can be seen both as an information criterion to compare the reversibility of different parallel schemes and as a tool to diagnose reversibility issues with a particular scheme. As a demonstration, we use Sandia Lab's SPPARKS software to compare different parallelization schemes and different domain (lattice) decompositions.

97 MATHEMATICS AND COMPUTING↗