6 citations · 13 across the 5 of their papers we have counts for
6 papers
On the Parenthesisations of Matrix Chains: All are Useful, Few Are Essential
Francisco López, Lars Karlsson, Paolo Bientinesi
The product of a matrix chain consisting of matrices can be computed in (Catalan's number) different ways, each identified by a distinct parenthesisation of the chain…
FLOPs as a Discriminant for Dense Linear Algebra Algorithms
Francisco López, Lars Karlsson, Paolo Bientinesi
Expressions that involve matrices and vectors, known as linear algebra expressions, are commonly evaluated through a sequence of invocations to highly optimised kernels provided in…
Accelerating jackknife resampling for the Canonical Polyadic Decomposition
Christos Psarras, Lars Karlsson, Rasmus Bro +1
The Canonical Polyadic (CP) tensor decomposition is frequently used as a model in applications in a variety of different fields. Using jackknife resampling to estimate parameter un…
The landscape of software for tensor computations
Christos Psarras, Lars Karlsson, Jiajia Li +1
Tensors (also commonly seen as multi-linear operators or as multi-dimensional arrays) are ubiquitous in scientific computing and in data science, and so are the software efforts fo…
Concurrent Alternating Least Squares for multiple simultaneous Canonical Polyadic Decompositions
Christos Psarras, Lars Karlsson, Rasmus Bro +1
Tensor decompositions, such as CANDECOMP/PARAFAC (CP), are widely used in a variety of applications, such as chemometrics, signal processing, and machine learning. A broadly used m…
A Householder-based algorithm for Hessenberg-triangular reduction
Zvonimir Bujanović, Lars Karlsson, Daniel Kressner
The QZ algorithm for computing eigenvalues and eigenvectors of a matrix pencil requires that the matrices first be reduced to Hessenberg-triangular (HT) form. The current…