On low-complexity approximation of matrices

DOI10.1016/0024-3795(94)90383-2zbMATH Open0803.65054OpenAlexW2115862150MaRDI QIDQ1329962FDOQ1329962

Authors: Alle-Jan van der Veen, Patrick M. Dewilde 

Publication date: 15 August 1994

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

Full work available at URL: http://resolver.tudelft.nl/uuid:e150e1ab-b545-4ba7-a24e-f154820326e9

Recommendations

• scientific article; zbMATH DE number 4201485
• Generalized low rank approximations of matrices
• scientific article; zbMATH DE number 4109951
• Complexity of linear problems with a fixed output basis
• Computing lower rank approximations of matrix polynomials

zbMATH Keywords

closed form solutionlow-complexity approximation of matricesmatrix of lower computational complexity

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20)

Cites Work

• All optimal Hankel-norm approximations of linear multivariable systems and theirL,^∞-error bounds†
• Title not available (Why is that?)
• ANALYTIC PROPERTIES OF SCHMIDT PAIRS FOR A HANKEL OPERATOR AND THE GENERALIZED SCHUR-TAKAGI PROBLEM
• Interpolation of rational matrix functions
• Title not available (Why is that?)
• Displacement ranks of matrices and linear equations
• Optimal Hankel-norm model reductions: Multivariable systems
• On the Hankel-norm approximation of upper-triangular operators and matrices
• Title not available (Why is that?)
• Fast Parallel Algorithms for QR and Triangular Factorization
• A two-variable approach to the model reduction problem with Hankel norm criterion
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Parametric interpolation, H ^∞-control and model reduction
• Title not available (Why is that?)

Cited In (11)

• Squeezing a Matrix into Half Precision, with an Application to Solving Linear Systems
• Embedding of time-varying contractive systems in lossless realizations
• On a Problem of Weighted Low-Rank Approximation of Matrices
• Inner-outer factorization and the inversion of locally finite systems of equations
• Low-Rank Matrix Approximation Using Point-Wise Operators
• Matrix rounding with low error in small submatrices
• Low-complexity inverse square root approximation for baseband matrix operations
• Title not available (Why is that?)
• Approximation Schemes for Low-rank Binary Matrix Approximation Problems
• Approximating Matrix Multiplication for Pattern Recognition Tasks
• Complexity reduction of least squares problems involving special Vandermonde matrices

This page was built for publication: On low-complexity approximation of matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329962)