This paper introduces a new sweeping preconditioner for the iterative solution of the variable coefficient Helmholtz equation in two and three dimensions. The algorithms follow the general structure of constructing an approximate LDLt factorization by eliminating the unknowns layer by layer starting from an absorbing layer or boundary condition. The central idea of this paper is to approximate ...

Alpha-divergence-based nonnegative tensor factorization (NTF) is applied to blind multispectral image (MSI) decomposition. The matrix of spectral profiles and the matrix of spatial distributions of the materials resident in the image are identified from the factors in Tucker3 and PARAFAC models. NTF preserves local structure in the MSI that is lost as a result of vectorization of the image when...

Using an eikonal structure for the scattering amplitude, Block and Kaidalov[1] have derived factorization theorems for nucleon-nucleon, γp and γγ scattering at high energies, using only some very general assumptions. We present here an analysis giving experimental confirmation for factorization of cross sections, nuclear slope parameters B and ρ-values (ratio of real to imaginary portion of for...

A Bayesian network consists of a directed acyclic graph (DAG) and a set of conditional probability distributions (CPDs); they together define a joint probability distribution (jpd). The structure of the DAG dictates how a jpd can be factorized as a product of CPDs. This CPD factorization view of Bayesian networks has been well recognized and studied in the uncertainty community. In this article...

In this paper, we describe a scalable parallel algorithm for sparse matrix factorization, analyze their performance and scalability, and present experimental results for up to 1024 processors on a Cray T3D parallel computer. Through our analysis and experimental results, we demonstrate that our algorithm substantially improves the state of the art in parallel direct solution of sparse linear sy...

This paper proposes a novel framework using geometric information on parallelograms for camera calibration and scene modeling (Fig 1). In the images captured in man-made environments, there are many primitives giving the geometric information. Among primitives, parallelograms and parallepipeds are frequently present in the scene, such as the architecture. The scene’s affine structure is embedde...

Generally, data mining in larger datasets consists of certain limitations in identifying the relevant datasets for the given queries. The limitations include: lack of interaction in the required objective space, inability to handle the data sets or discrete variables in datasets, especially in the presence of missing variables and inability to classify the records as per the given query, and fi...