Effective spatial domain decomposition for discrete ordinate (Sn) neutron transport calculations has been critical for exploiting massively parallel architectures typified by the ASCI White computer at Lawrence Livermore National Laboratory. A combination of geometrical and computational constraints has posed a unique challenge as problems have been scaled up to several thousand processors. Car...

Protection of digital images from unauthorized access is the main purpose of this paper. A reliable approach to encrypt a digital image in spatial domain is presented here. Our algorithm is based on the singular value decomposition and one dimensional cellular automata. First, we calculate the singular value decomposition (SVD) of the original image in which the features of the image are extrac...

We report a domain decomposition molecular dynamics (MD) for simulation on metallic systems based on distributed parallel computers. The method is a development of a spatial decomposition in 3-D space with the combination of link-cell and neighbor list techniques for enhanced efficiency. The algorithm has been successfully implemented on the Origin2000, Wolf, HP Examplar etc. various platforms....

Most parallel processing methods developed for geographic analyses bind the design of domain decomposition and task scheduling to specific parallel computer architectures. These methods are not adaptable to emerging distributed computing environments that are based on Grid computing and peer-to-peer technologies. This paper presents a theory to support the development of adaptable parallel proc...

In this paper, we study domain decomposition preconditioners for multiscale flows in high contrast media. Our problems are motivated by porous media applications where low conductivity regions play an important role in determining flow patterns. We consider flow equations governed by elliptic equations in heterogeneous media with large contrast between high and low conductivity regions. This co...

Molecular dynamics simulation is an important method for the research of thermophysics. But it is difficult to implement the simulation with traditional serial algorithms because of a complex numerical calculation. A cluster-based spatial decomposition algorithm for solving large-scale Molecular Dynamics simulation of thermophysics is proposed in this paper. With the efficient strategy of domai...

We consider a Schur complement BPS-like domain decomposition algorithm for the 2D drift-diiusion equations arising from semiconductor modeling. In particular, we focus on two problems: anisotropic phenomena and large changes in the PDE coeecients as one moves spatial within the domain. The preconditioners that we discuss are essentially BPS preconditioners 2] where the interface coupling is app...

A novel Non-negative Matrix Factorization (NMF) based subband decomposition in frequency-spatial domain for acoustic source localization using a microphone array. The proposed method decomposes source and noise subband and emphasizes source dominant frequency bins for more accurate source representation. By employing NMF, we extract Delay Basis Vectors (DBV) and their subband information in fre...

Parallel computing of the transient radiative transfer process in the three-dimensional homogeneous and nonhomogeneous participating media is studied with an integral equation model. The model can be used for analyzing the ultra-short light pulse propagation within the highly scattering media. Two numerical quadratures are used: the discrete rectangular volume (DRV) method and YIX method. The p...

Sparse hyperspectral unmixing from large spectral libraries has been considered to circumvent limitations of endmember extraction algorithms in many applications. This strategy often leads to ill-posed inverse problems, which can benefit from spatial regularization strategies. While existing spatial regularization methods improve the problem conditioning and promote piecewise smooth solutions, ...