Name
Affiliation
Papers
JULIEN LANGOU
Department of Mathematical Sciences, University of Colorado, Denver, CO, USA
51
Collaborators
Citations 
PageRank 
93
1028
71.98
Referers 
Referees 
References 
1770
800
599
Search Limit
1001000
Title
Citations
PageRank
Year
Low synchronization GMRES algorithms.00.342018
Bidiagonalization and R-Bidiagonalization: Parallel Tiled Algorithms, Critical Paths and Distributed-Memory Implementation10.352017
Bidiagonalization with Parallel Tiled Algorithms.00.342016
A Makespan Lower Bound for the Scheduling of the Tiled Cholesky Factorization based on ALAP scheduling00.342015
A Backward/Forward Recovery Approach for the Preconditioned Conjugate Gradient Method30.452015
Mixing LU and QR factorization algorithms to design high-performance dense linear algebra solvers10.362015
Level-3 Cholesky Factorization Routines Improve Performance of Many Cholesky Algorithms20.452013
A Greedy Algorithm for Optimally Pipelining a Reduction.00.342013
Hierarchical QR factorization algorithms for multi-core clusters190.832013
Topic 10: Parallel Numerical Algorithms - (Introduction).00.342013
Communication-optimal Parallel and Sequential QR and LU Factorizations1055.332012
Hierarchical QR Factorization Algorithms for Multi-core Cluster Systems70.532012
Flexible Variants of Block Restarted GMRES Methods with Application to Geophysics140.602012
Poster: Matrices over Runtime Systems at Exascale40.432012
Abstract: Matrices Over Runtime Systems at Exascale00.342012
Any admissible cycle-convergence behavior is possible for restarted GMRES at its initial cycles.50.562011
LU factorization for accelerator-based systems311.612011
Tiled QR factorization algorithms140.762011
Flexible Development of Dense Linear Algebra Algorithms on Massively Parallel Architectures with DPLASMA401.642011
QCG-OMPI: MPI applications on grids60.592011
A Critical Path Approach to Analyzing Parallelism of Algorithmic Variants. Application to Cholesky Inversion40.432010
Towards an efficient tile matrix inversion of symmetric positive definite matrices on multicore architectures110.722010
Rectangular full packed format for cholesky's algorithm: factorization, solution, and inversion70.602010
Accelerating scientific computations with mixed precision algorithms473.692009
QR factorization of tall and skinny matrices in a grid computing environment261.262009
QR factorization of tall and skinny matrices in a grid computing environment261.262009
Computing the conditioning of the components of a linear least-squares solution90.682009
A class of parallel tiled linear algebra algorithms for multicore architectures21813.662009
The Problem With the Linpack Benchmark 1.0 Matrix Generator20.372009
Communication-avoiding parallel and sequential QR factorizations181.622008
Algorithm-based fault tolerance applied to high performance computing892.292008
Advanced MPI Programming00.342007
Mixed Precision Iterative Refinement Techniques for the Solution of Dense Linear Systems425.012007
A Distributed Packed Storage For Large Dense Parallel In-Core Calculations00.342007
Recovery Patterns for Iterative Methods in a Parallel Unstable Environment341.442007
Performance Optimization and Modeling of Blocked Sparse Kernels211.612007
Parallel tiled QR factorization for multicore architectures312.272007
A note on the error analysis of classical Gram–Schmidt50.612006
Recent advances in dense linear algebra: minisymposium abstract00.342006
The impact of multicore on math software483.832006
Conjugate-gradient eigenvalue solvers in computing electronic properties of nanostructure architectures70.722006
Prospectus for the next LAPACK and ScaLAPACK libraries71.802006
Tools and techniques for performance - Exploiting the performance of 32 bit floating point arithmetic in obtaining 64 bit accuracy (revisiting iterative refinement for linear systems)30.872006
Exploiting Mixed Precision Floating Point Hardware in Scientific Computations.60.562006
Hash functions for datatype signatures in MPI20.442005
Fault tolerant high performance computing by a coding approach603.202005
Algorithm 842: A set of GMRES routines for real and complex arithmetics on high performance computers202.112005
Rounding error analysis of the classical Gram-Schmidt orthogonalization process282.052005
Comparison of nonlinear conjugate-gradient methods for computing the electronic properties of nanostructure architectures10.382005
A Rank-k Update Procedure for Reorthogonalizing the Orthogonal Factor from Modified Gram-Schmidt.10.432004
  • 1
  • 2