Sparse solutions to underdetermined Kronecker product systems

DOI10.1016/J.LAA.2009.08.005zbMath1181.65058arXiv0902.4587OpenAlexW1986184145MaRDI QIDQ1039753

Volker Mehrmann, Sadegh Jokar

Publication date: 23 November 2009

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0902.4587

zbMATH Keywords

Kronecker productcompressed sensingunderdetermined systemrestricted isometry propertysparkmutual incoherencesparse solution of linear systemsbasis pursuit algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Determinants, permanents, traces, other special matrix functions (15A15) Linear equations (linear algebraic aspects) (15A06) Canonical forms, reductions, classification (15A21)

Related Items (6)

A tensor decomposition based multiway structured sparse SAR imaging algorithm with Kronecker constraint ⋮ Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases ⋮ 2D compressed learning: support matrix machine with bilinear random projections ⋮ Hierarchical compressed sensing ⋮ Sparse recovery of sound fields using measurements from moving microphones ⋮ Hierarchical isometry properties of hierarchical measurements

Uses Software

• PDCO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hadamard matrices and their applications: progress 2007--2010
• The restricted isometry property and its implications for compressed sensing
• Inertia characteristics of self-adjoint matrix polynomials
• Grassmannian frames with applications to coding and communication
• Quantitative robust uncertainty principles and optimally sparse decompositions
• Compressed sensing and best 𝑘-term approximation
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Decoding by Linear Programming
• Stable recovery of sparse overcomplete representations in the presence of noise
• Recovery of Exact Sparse Representations in the Presence of Bounded Noise
• Sparse representations in unions of bases
• Greed is Good: Algorithmic Results for Sparse Approximation
• Atomic Decomposition by Basis Pursuit
• Uncertainty principles and ideal atomic decomposition
• A generalized uncertainty principle and sparse representation in pairs of bases
• Sparse Approximate Solutions to Linear Systems
• Exact and Approximate Sparse Solutions of Underdetermined Linear Equations
• Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing

This page was built for publication: Sparse solutions to underdetermined Kronecker product systems