9 resultados para Matrix-Vector Multiplication

em Reposit


Relevância:

80.00% 80.00%

Publicador:

Resumo:

General Fierz-type identities are examined and their well-known connection with completeness relations in matrix vector spaces is shown. In particular, I derive the chiral Fierz identities in a simple and systematic way by using a chiral basis for the complex 4 X 4 matrices. Other completeness relations for the fundamental representations of SU(N) algebras can be extracted using the same reasoning. (c) 2005 American Association of Physics Teachers.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

In this article, we propose new control charts for monitoring the mean vector and the covariance matrix of bivariate processes. The traditional tools used for this purpose are the T (2) and the |S| charts. However, these charts have two drawbacks: (1) the T (2) and the |S| statistics are not easy to compute, and (2) after a signal, they do not distinguish the variable affected by the assignable cause. As an alternative to (1), we propose the MVMAX chart, which only requires the computation of sample means and sample variances. As an alternative to (2), we propose the joint use of two charts based on the non-central chi-square statistic (NCS statistic), named as the NCS charts. Once the NCS charts signal, the user can immediately identify the out-of-control variable. In general, the synthetic MVMAX chart is faster than the NCS charts and the joint T (2) and |S| charts in signaling processes disturbances.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Final-state qq̄ interactions give origin to nonzero values of the off-diagonal element ρ1,-1 of the helicity density matrix of vector mesons produced in e+e- annihilations, as has been confirmed by recent OPAL data on φ, D*, and K*. New predictions are given for ρ1,-1 of several mesons produced at large XE and small pT - i.e., collinear with the parent jet - in the annihilation of polarized e+ and e-; the results depend strongly on the elementary dynamics and allow further nontrivial tests of the standard model.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

The MRMAX chart is a single chart based on the standardized sample means and sample ranges for monitoring the mean vector and the covariance matrix of multivariate processes. User's familiarity with the computation of these statistics is a point in favor of the MRMAX chart. As a single chart, the recently proposed MRMAX chart is very appropriate for supplementary runs rules. In this article, we compare the supplemented MRMAX chart and the synthetic MRMAX chart with the standard MRMAX chart. The supplementary and the synthetic runs rules enhance the performance of the MRMAX chart. © 2013 Elsevier Ltd.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

30.00% 30.00%

Publicador:

Resumo:

This paper deals with approaches for sparse matrix substitutions using vector processing. Many publications have used the W-matrix method to solve the forward/backward substitutions on vector computer. Recently a different approach has been presented using dependency-based substitution algorithm (DBSA). In this paper the focus is on new algorithms able to explore the sparsity of the vectors. The efficiency is tested using linear systems from power systems with 118, 320, 725 and 1729 buses. The tests were performed on a CRAY Y MP2E/232. The speedups for a fast-forward/fast-backward using a 1729-bus system are near 19 and 14 for real and complex arithmetic operations, respectively. When forward/backward is employed the speedups are about 8 and 6 to perform the same simulations.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

This paper describes a methodology for solving efficiently the sparse network equations on multiprocessor computers. The methodology is based on the matrix inverse factors (W-matrix) approach to the direct solution phase of A(x) = b systems. A partitioning scheme of W-matrix , based on the leaf-nodes of the factorization path tree, is proposed. The methodology allows the performance of all the updating operations on vector b in parallel, within each partition, using a row-oriented processing. The approach takes advantage of the processing power of the individual processors. Performance results are presented and discussed.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)