We employ the density matrix renormalization group (DMRG) and the wave function factorization method for the numerical solution of large scale nuclear structure problems. The DMRG exhibits an improved convergence for problems with realistic interactions due to the implementation of the finite algorithm. The wave function factorization of fpg-shell nuclei yields rapidly converging approximations...

Probabilistic approaches for tensor factorization aim to extract meaningful structure from incomplete data by postulating low rank constraints. Recently, variational Bayesian (VB) inference techniques have successfully been applied to large scale models. This paper presents full Bayesian inference via VB on both single and coupled tensor factorization models. Our method can be run even for very...

in this paper, we study the arens regularity properties of module actions and we extend some proposition from baker, dales, lau and others into general situations. we establish some relationships between the topological centers of module actions and factorization properties of them with some results in group algebras. in 1951 arens shows that the second dual of banach algebra endowed with the e...

We show that there exist infinitely many examples of pairs of knots, K1 and K2, that have no epimorphism π1(S 3 \K1)→ π1(S \K2) preserving peripheral structure although their A-polynomials have the factorization AK2(L,M) | AK1(L,M). Our construction accounts for most of the known factorizations of this form for knots with 10 or fewer crossings. In particular, we conclude that while an epimorphi...

In this paper we present an improve m e nt to o ur s e que nti al i nco re i m pl e mentation of a sparse Cholesky factorization based on a hypermatrix storage structure. We allow the inclusion of additional zeros in data submatrices to create larger blocks and in this way use more efficient routines for matrix multiplication. Since matrix multiplication takes about 90% of the total factorizati...

Classes of‎ ‎Abaffy-Broyden-Spedicato (ABS) methods have been introduced for‎ ‎solving linear systems of equations‎. ‎The algorithms are powerful methods for developing matrix‎ ‎factorizations and many fundamental numerical linear algebra processes‎. ‎Here‎, ‎we show how to apply the ABS algorithms to devise algorithms to compute the WZ and ZW‎ ‎factorizations of a nonsingular matrix as well as...

Due to the low spatial resolution of sensors, hyperspectral images contain mixed pixels. The purpose unmixing is decompose pixels into a series endmembers and abundance fractions. In order improve performance nonlinear algorithm for images, method, i.e., constrained multi-layer kernel non-negative matrix factorization (AC-MLKNMF), presented. Firstly, MLKNMF presented iteratively structure, then...

We used QCD factorization for the hadronic matrix elements to show that the existing data, in particular the branching ratios BR ( ?J/?K) and BR ( ?J/??), can be accounted for this approach. We analyzed the decay within the framework of QCD factorization. We have complete calculation of the relevant hard-scattering kernels for twist-2 and twist-3. We calculated this decays in a special scale ...

In this paper we present a comprehensive analysis of the performance of a variety of sparse Cholesky factorization methods on hierarchical-memory machines. We investigate methods that vary along two different axes. Along the first axis, we consider three different high-level approaches to sparse factorization: leftlooking, right-looking, and muhi.frontal. Along the second axis, we consider the ...

The implications of the positivity constraint on the presently unknown polarized structure function of the photon, g 1 (x,Q 2), are studied in detail. In particular the non–trivial consequences of this constraint, |g 1 (x,Q 2)| ≤ F γ 1 (x,Q 2), in the next– to–leading order analysis of g 1 are pointed out by employing appropriate (DIS) factorization schemes related to g 1 and F γ 1 (rather than...