On low-complexity approximation of matrices
type: Item
instance of: scholarly article
title: On low-complexity approximation of matrices
zbMATH Open document ID: 0803.65054
DOI: 10.1016/0024-3795(94)90383-2
published in: Linear Algebra and its Applications
publication date: 1994-08-15T00:00:00Z
review text: A closed form solution to the problem of approximating a matrix which represents a linear transformation by a matrix of lower computational complexity is presented. Numerical results are not given.
reviewed by: S.Filippi
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 614137
zbMATH Keywords: low-complexity approximation of matrices
zbMATH Keywords: closed form solution
zbMATH Keywords: matrix of lower computational complexity
author: Alle-Jan van der Veen
author: Patrick M. Dewilde
MaRDI profile type: Publication
OpenAlex ID: W2115862150
cites work: Q4775961
cites work: Fast Parallel Algorithms for QR and Triangular Factorization
cites work: Displacement ranks of matrices and linear equations
cites work: Q3723149
cites work: ANALYTIC PROPERTIES OF SCHMIDT PAIRS FOR A HANKEL OPERATOR AND THE GENERALIZED SCHUR-TAKAGI PROBLEM
cites work: All optimal Hankel-norm approximations of linear multivariable systems and theirL,∞-error bounds†
cites work: Optimal Hankel-norm model reductions: Multivariable systems
cites work: A two-variable approach to the model reduction problem with Hankel norm criterion
cites work: Interpolation of rational matrix functions
cites work: Parametric interpolation, H ∞-control and model reduction
cites work: Q3769845
cites work: Q3805770
cites work: Q3211196
cites work: Q3349459
cites work: Q4012899
cites work: On the Hankel-norm approximation of upper-triangular operators and matrices
cites work: Q4840494
description: scientific article; zbMATH DE number 614137