Sciweavers

24 search results - page 2 / 5
» Computing Rank-Revealing QR Factorizations of Dense Matrices
Sort
View
PDP
2008
IEEE
14 years 1 months ago
Scheduling of QR Factorization Algorithms on SMP and Multi-Core Architectures
This paper examines the scalable parallel implementation of QR factorization of a general matrix, targeting SMP and multi-core architectures. Two implementations of algorithms-by-...
Gregorio Quintana-Ortí, Enrique S. Quintana...
IPPS
2010
IEEE
13 years 5 months ago
QR factorization of tall and skinny matrices in a grid computing environment
Emmanuel Agullo, Camille Coti, Jack Dongarra, Thom...
PPOPP
2003
ACM
14 years 18 days ago
Factorization with morton-ordered quadtree matrices for memory re-use and parallelism
Quadtree matrices using Morton-order storage provide natural blocking on every level of a memory hierarchy. Writing the natural recursive algorithms to take advantage of this bloc...
Jeremy D. Frens, David S. Wise
MOC
2011
13 years 2 months ago
Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
Using the concept of Geometric Weakly Admissible Meshes (see §2 below) together with an algorithm based on the classical QR factorization of matrices, we compute efficient points...
Len Bos, Jean-Paul Calvi, Norman Levenberg, Alvise...
PPAM
2007
Springer
14 years 1 months ago
New Data Structures for Matrices and Specialized Inner Kernels: Low Overhead for High Performance
Dense linear algebra codes are often expressed and coded in terms of BLAS calls. This approach, however, achieves suboptimal performance due to the overheads associated to such cal...
José R. Herrero