Sciweavers

25 search results - page 3 / 5
» A Family of High-Performance Matrix Multiplication Algorithm...
Sort
View
DAGSTUHL
2006
13 years 6 months ago
Using fast matrix multiplication to solve structured linear systems
Structured linear algebra techniques enable one to deal at once with various types of matrices, with features such as Toeplitz-, Hankel-, Vandermonde- or Cauchy-likeness. Following...
Éric Schost, Alin Bostan, Claude-Pierre Jea...
ICS
2007
Tsinghua U.
13 years 11 months ago
Representation-transparent matrix algorithms with scalable performance
Positive results from new object-oriented tools for scientific programming are reported. Using template classes, abstractions of matrix representations are available that subsume...
Peter Gottschling, David S. Wise, Michael D. Adams
TPDS
2010
174views more  TPDS 2010»
13 years 3 months ago
Parallel Two-Sided Matrix Reduction to Band Bidiagonal Form on Multicore Architectures
The objective of this paper is to extend, in the context of multicore architectures, the concepts of tile algorithms [Buttari et al., 2007] for Cholesky, LU, QR factorizations to t...
Hatem Ltaief, Jakub Kurzak, Jack Dongarra
ICASSP
2011
IEEE
12 years 9 months ago
Novel hierarchical ALS algorithm for nonnegative tensor factorization
The multiplicative algorithms are well-known for nonnegative matrix and tensor factorizations. The ALS algorithm for canonical decomposition (CP) has been proved as a “workhorse...
Anh Huy Phan, Andrzej Cichocki, Kiyotoshi Matsuoka...
ICASSP
2008
IEEE
13 years 11 months ago
Nonnegative Tucker decomposition with alpha-divergence
Nonnegative Tucker decomposition (NTD) is a recent multiway extension of nonnegative matrix factorization (NMF), where nonnegativity constraints are incorporated into Tucker model...
Yong-Deok Kim, Andrzej Cichocki, Seungjin Choi