activity
20132021
most citedRobust Near-Separable Nonnegative Matrix Factorization Using Linear Optimization

81 citations · 234 across the 14 of their papers we have counts for

collaborators
Showing math.NAShow all

7 papers · 1 filter

math.NA2021★ 1 cited

On the rational approximation of Markov functions,with applications to the computation of Markovfunctions of Toeplitz matrices

Bernhard Beckermann, Joanna Bisch, Robert Luce

We investigate the problem of approximating the matrix function by , with a Markov function, a rational interpolant of , and a symmetric Toeplitz matrix…

math.NA2017

Using incomplete indefinite preconditioning for inexact interior point methods for linear programming

Robert Luce

Most linear algebra kernels in interior point methods for linear programming require the solution of linear systems of equation with the matrix (or ),…

math.NA2016★ 24 cited

Fast computation of the matrix exponential for a Toeplitz matrix

Daniel Kressner, Robert Luce

The computation of the matrix exponential is a ubiquitous operation in numerical mathematics, and for a general, unstructured matrix it can be computed in $\mathcal{O}(…

math.NA2016★ 27 cited

Using separable non-negative matrix factorization techniques for the analysis of time-resolved Raman spectra

Robert Luce, Peter Hildebrandt, Uwe Kuhlmann +1

The key challenge of time-resolved Raman spectroscopy is the identification of the constituent species and the analysis of the kinetics of the underlying reaction network. In this…

math.NA2015

Finite element formulation of general boundary conditions for incompressible flows

Roland Becker, Daniela Capatina, Robert Luce +1

We study the finite element formulation of general boundary conditions for incompressible flow problems. Distinguishing between the contributions from the inviscid and viscid parts…

math.NA2014

Fast Recovery and Approximation of Hidden Cauchy Structure

Jörg Liesen, Robert Luce

We derive an algorithm of optimal complexity which determines whether a given matrix is a Cauchy matrix, and which exactly recovers the Cauchy points defining a Cauchy matrix from…

math.NA2013★ 14 cited

On the minimum FLOPs problem in the sparse Cholesky factorization

Robert Luce, Esmond Ng

Prior to computing the Cholesky factorization of a sparse, symmetric positive definite matrix, a reordering of the rows and columns is computed so as to reduce both the number of f…