The real positive definite completion problem : cycle completability
Author(s)
Bibliographic Information
The real positive definite completion problem : cycle completability
(Memoirs of the American Mathematical Society, no. 584)
American Mathematical Society, 1996
Available at 20 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
"July 1996, volume 122, number 584 (fourth of 5 numbers)" -- T.p
Includes bibliographical references (p. 68-69)
Description and Table of Contents
Description
Given a partial symmetric matrix, the positive definite completion problem asks if the unspecified entries in the matrix can be chosen so as to make the resulting matrix positive definite.... FROM LONG DESCRIPTION
by "Nielsen BookData"