Computational geometry of positive definiteness

DOI10.1016/J.LAA.2012.05.002MaRDI QIDQ445814zbMATH OpenOpenAlexFDO

Authors Marko Huhtanen, Otto Seiskari

Publication date 27 August 2012

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

Full work available at URL https://doi.org/10.1016/j.laa.2012.05.002

zbMATH Keywords

computational geometryconvex analysisnumerical experimentseigenvalue optimizationjoint numerical rangepositive definitenessellipsoid methodsHermitian matrix subspaceperceptron algorithm

Mathematics Subject Classification ID

Positive matrices and their generalizations; cones of matrices (15B48) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Operator spaces (= matricially normed spaces) (47L25) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Effective recursive algorithm for judging the positive-definiteness of matrices of high dimension
• Definite triples of Hermitian matrices and matrix polynomials
• Determining subspaces on which a matrix is nonnegative definite
• The properties and discrimination of the positive definite matrices
• Conditionally definite matrices

Cites work

• scientific article; zbMATH DE number 5131267 (Why is no real title available?)
• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• scientific article; zbMATH DE number 1544066 (Why is no real title available?)
• scientific article; zbMATH DE number 1849957 (Why is no real title available?)
• scientific article; zbMATH DE number 1860211 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• scientific article; zbMATH DE number 3200675 (Why is no real title available?)
• A deep cut ellipsoid algorithm for convex programming: Theory and applications
• A finite-step global convergence algorithm for the parameter estimation of multichannel MA processes
• A remark on the convexity and positive definiteness concerning Hermitian matrices
• Algorithms in real algebraic geometry
• Approximate factoring of the inverse
• Canonical Forms for Hermitian Matrix Pairs under Strict Equivalence and Congruence
• Computing the numerical radius
• Convexity of the joint numerical range: Topological and differential geometric viewpoints.
• Detecting a definite Hermitian pair and a hyperbolic or elliptic quadratic eigenvalue problem, and associated nearness problems
• Differential geometry of matrix inversion
• Differential topology of numerical range
• Factoring matrices into the product of two matrices
• Hermitian Forms and the Fibration of Spheres
• Large margin classification using the perceptron algorithm
• Linear Matrix Inequalities in System and Control Theory
• Positive definite combination of symmetric matrices
• Semidefinite optimization
• The mathematics of eigenvalue optimization
• The nearest definite pair for the Hermitian generalized eigenvalue problem

Cited in

(5)

• Sinkhorn-Knopp theorem for PPT states
• Generalized autocovariance matrices for multivariate time series
• An Improved Arc Algorithm for Detecting Definite Hermitian Pairs
• Generalised cepstral models for the spectrum of vector time series
• On the complexity of detecting positive eigenvectors of nonlinear cone maps

This page was built for publication: Computational geometry of positive definiteness

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