The Solution to a Structured Matrix Approximation Problem Using GrassmanCoordinates

DOI10.1137/S0895479898335453MaRDI QIDQ4702279zbMATH OpenOpenAlexFDO

Authors Craig S. MacInnes

Publication date 24 November 1999

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895479898335453

zbMATH Keywords

best approximationGrassman vectorHankel matrixprincipal anglesymmetric polynomial

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Canonical forms, reductions, classification (15A21) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Hermitian, skew-Hermitian, and related matrices (15B57) Best approximation, Chebyshev systems (41A50)

Recommendations

• Solution of the determinantal assignment problem using the Grassmann matrices
• scientific article; zbMATH DE number 5004921
• scientific article; zbMATH DE number 4165563
• Optimization algorithms on the Grassmann manifold with application to matrix eigenvalue problems
• scientific article; zbMATH DE number 4159337
• Grassmann algorithms for low rank approximation of matrices with missing values
• Approximate iterations for structured matrices
• Exact solutions in structured low-rank approximation
• scientific article; zbMATH DE number 89042
• The core inverse and constrained matrix approximation problem

Cited in

(3)

• A class of weighted low rank approximation of the positive semidefinite Hankel matrix
• Input matrix construction and approximation using a graphic approach
• Solving Hankel matrix approximation problem using semidefinite programming

This page was built for publication: The Solution to a Structured Matrix Approximation Problem Using GrassmanCoordinates

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