Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire du LRI
Lazy BLAS-3 Reduction to Banded Upper Triangular
Gary Howell

15 September 2011, 10h30 - 15 September 2011, 12h00
Salle/Bat : 455/PCRI-N
Contact :

Activités de recherche :

Résumé :
In a "Lazy" or "Just in Time" decomposition algorithm, updates are deferred until columns or rows (row blocks .. column blocks) are to be eliminated. A one-sided example is the GMRES algorithm (corresponding to orthogonal reduction to Hessenberg form). Here we consider reduction by Householder transformations to bidiagonal or to banded triangular form. Because the only accesses to original matrix are extraction of blocks and mutliplication by it, the lazy algorithm is easy to apply to sparse matrices. For a reduction to banded form, almost all the operations are BLAS-3. One use is determining a set of largest singular values of a sparse matrix.

Pour en savoir plus :
Séminaires
A Two-level Auction for Resource Allocation in Mul
Réseaux sans fil et mobiles
Friday 09 March 2018 - 14h30
Salle : 445 - PCRI-N
Mira Morcos .............................................

Binary pattern of length greater than 14 are abeli
Combinatoire
Friday 09 February 2018 - 14h30
Salle : 445 - PCRI-N
Matthieu Rosenfeld .............................................

Approximate Bayesian Computation and Random Forest
Thursday 08 February 2018 - 00h00
Salle : 455 - PCRI-N
Valentin Thouzeau .............................................

A concurrent lock-free algorithm for computing a f
Combinatoire
Friday 12 January 2018 - 14h30
Salle : 445 - PCRI-N
James Mitchell .............................................

Acyclic Partitioning of Large Directed Acyclic Gra
Calcul à haute performance
Tuesday 09 January 2018 - 10h30
Salle : 465 - PCRI-N
Julien Herrmann .............................................