Computational geometry of positive definiteness

DOI10.1016/J.LAA.2012.05.002zbMATH Open1269.65020OpenAlexW2083461068MaRDI QIDQ445814FDOQ445814

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

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

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)

Cites Work

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

Cited In (5)

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

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)