JSTOR Daily

Computing Invariant Subspaces of a General Matrix when the Eigensystem is Poorly Conditioned

The problem of calculating the eigensystem of a general complex matrix is well known. In many cases, however, the eigensystem is poorly determined numerically in the sense that small changes in the ...
IEEE

Affine Subspace Robust Low-Rank Self-Representation: From Matrix to Tensor

Abstract: Low-rank self-representation based subspace learning has confirmed its great effectiveness in a broad range of applications. Nevertheless, existing studies mainly focus on exploring the ...
IEEE

Subspace Representation Learning for Sparse Linear Arrays to Localize More Sources Than Sensors: A Deep Learning Methodology

Abstract: Localizing more sources than sensors with a sparse linear array (SLA) has long relied on minimizing a distance between two covariance matrices and recent algorithms often utilize ...
JSTOR Daily

Matrix transforms of subspaces of summability domains of matrices defined by speed of convergence

Let X, Y be two subspaces of summability domains of matrices with real or complex entries determined by speeds of the convergence, i.e.; by monotonically increasing positive sequences λ and μ. In this ...
GitHub

Data Integration Via Analysis of Subspaces (DIVAS)

Main function: DJIVEMainJP(), takes in the datablocks as a cell array, a MATLAB struct object containing tuning parameters, and an optional third argument for "true signal" for diagnostic use.