The Solution to a Structured Matrix Approximation Problem Using GrassmanCoordinates

DOI10.1137/S0895479898335453zbMath0949.15035OpenAlexW1973280311MaRDI QIDQ4702279

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

Hankel matrixbest approximationsymmetric polynomialprincipal angleGrassman vector

Mathematics Subject Classification ID

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

Related Items (2)

A class of weighted low rank approximation of the positive semidefinite Hankel matrix ⋮ Solving Hankel matrix approximation problem using semidefinite programming

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