• closedAccess   A mixed-precision algorithm for the solution of Lyapunov equations on hybrid CPU–GPU platforms 

      Benner, Peter; Ezzatti, Pablo; Kressner, Daniel; Quintana-Orti, Enrique S.; Remón Gómez, Alfredo Elsevier (2011)
      We describe a hybrid Lyapunov solver based on the matrix sign function, where the intensive parts of the computation are accelerated using a graphics processor (GPU) while executing the remaining operations on a general-purpose ...
    • openAccess   Efficient model order reduction of large-scale systems on multi-core platforms 

      Ezzatti, Pablo; Quintana-Orti, Enrique S.; Remón Gómez, Alfredo Springer (2011)
      We propose an efficient implementation of the Balanced Truncation (BT) method for model order reduction when the state-space matrix is symmetric (positive definite). Most of the computational effort required by this method ...
    • closedAccess   Exploiting thread-level parallelism in the iterative solution of sparse linear systems 

      Aliaga Estellés, José Ignacio; Bollhöfer, Matthias; Martín Huertas, Alberto F.; Quintana-Orti, Enrique S. Elsevier (2011)
      We investigate the efficient iterative solution of large-scale sparse linear systems on shared-memory multiprocessors. Our parallel approach is based on a multilevel ILU preconditioner which preserves the mathematical ...
    • closedAccess   Increasing data locality and introducing Level-3 BLAS in the Neville elimination 

      Alonso-Jordá, Pedro; Cortina Parajón, Raquel; Quintana-Orti, Enrique S.; Ranilla Pastor, José Elsevier (2011-12-01)
      In this paper we present two new algorithmic variants to compute the Neville elimination, with and without pivoting, which improve data locality and cast most of the computations in terms of high-performance Level 3 BLAS. ...
    • openAccess   Using graphics processors to accelerate the computation of the matrix inverse 

      Ezzatti, Pablo; Quintana-Orti, Enrique S.; Remón Gómez, Alfredo Springer Verlag (2011)
      We study the use of massively parallel architectures for computing a matrix inverse. Two different algorithms are reviewed, the traditional approach based on Gaussian elimination and the Gauss-Jordan elimination alternative, ...