Approximating a symmetric matrix

DOI10.1007/BF02294615zbMATH Open0721.65018OpenAlexW2085477326MaRDI QIDQ2641074FDOQ2641074

Authors: R. A. Bailey, John C. Gower 

Publication date: 1990

Published in: Psychometrika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02294615

Recommendations

• The inertia of the symmetric approximation for low-rank matrices
• Approximating the inverse of a symmetric positive definite matrix
• Approximation by matrices positive semidefinite on a subspace
• A note on the approximated inverse of a non-negative symmetric matrix
• Low rank approximation of the symmetric positive semidefinite matrix

zbMATH Keywords

least squaressymmetric matricesmatrix approximationscritical dichotomypositive semi- definite

Mathematics Subject Classification ID

Hermitian, skew-Hermitian, and related matrices (15B57) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Cites Work

• Nonmetric individual differences multidimensional scaling: An alternating least squares method with optimal scaling features
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some properties of estimated scale invariant covariance structures
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (14)

• A note on the approximated inverse of a non-negative symmetric matrix
• Title not available (Why is that?)
• A Symmetry Preserving Algorithm for Matrix Scaling
• Weighted least squares fitting using ordinary least squares algorithms
• Approximating orthogonal matrices by permutation matrices
• An approximate solution for a system with a symmetric matrix
• Biplots: quantitative data
• Approximating the inverse of a symmetric positive definite matrix
• The inertia of the symmetric approximation for low-rank matrices
• Title not available (Why is that?)
• Properties of individual differences scaling and its interpretation
• The tunneling method for global optimization in multidimensional scaling
• On the behaviour of \(K\)-means clustering of a dissimilarity matrix by means of full multidimensional scaling
• Improved Approximation and Visualization of the Correlation Matrix

This page was built for publication: Approximating a symmetric matrix

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