The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a ...

In particular, we consider block row Kronecker-structured linear systems with a low multilinear rank multilinear singular value decomposition, a low-rank canonical polyadic decomposition or a low ...

While hierarchically low-rank compression methods are now commonly available in both dense and sparse direct solvers, their usage for the direct solution of coupled sparse/dense linear systems has ...

We show that when the linear system is modeled by a covariance matrix, the time complexity is O (logN) or O (1). In the case of sparse positive-definite linear systems, the time complexity is solely ...

There are three possible settings (X a full-rank matrix): X is underdetermined, m < n, then there are indefinitely many solutions and we are interested in the least Euclidean norm solution of the full ...

An n × n complex matrix A is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix P if A = PAP (A = — PAP). The reflexive and anti-reflexive matrices have ...

Abstract Many applications in fluid mechanics require the numerical solution of sequences of linear systems typically issued from finite element discretization of the Navier-Stokes equations. The ...