Skip to main content

Positive Semidefinite

  • Reference work entry
Encyclopedia of Machine Learning
  • 102 Accesses

Synonyms

Positive definite

Definition

A symmetric m ×m matrix K satisfying ∀x ∈ c m : x * Kx ≥ 0 is called positive semidefinite. If the equality only holds for \(x =\vec{ 0}\) the matrix is positive definite.

A function k : X ×X → c, X≠∅, is positive (semi-) definite if for all m ∈ n and all x 1, …, x m ∈ X the m ×m matrix \(\vec{K}\) with elements K ij : = k(x i , x j ) is positive (semi-) definite.

Sometimes the term strictly positive definite is used instead of positive definite, and positive definite refers then to positive semidefiniteness.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this entry

Cite this entry

(2011). Positive Semidefinite. In: Sammut, C., Webb, G.I. (eds) Encyclopedia of Machine Learning. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30164-8_646

Download citation

Publish with us

Policies and ethics