The Real Positive Definite Completion Problem:Cycle Completability(Memoirs of the American Mathematical Society)

组合数学

售   价:
407.00
发货周期:外国库房发货,通常付款后3-5周到货
作      者
出版时间
1996年07月30日
装      帧
平装
ISBN
9780821804735
复制
页      码
69
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 50 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
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. Applications include probability and statistics, image enhancement, systems engineering, geophysics, and mathematical programming. The positive definite completion problem can also be viewed as a mechanism for addressing a fundamental problem in Euclidean geometry: which potential geometric configurations of vectors (i.e., configurations with angles between some vectors specified) are realizable in a Euclidean space. The positions of the specified entries in a partial matrix are naturally described by a graph. The question of existence of a positive definite completion was previously solved completely for the restrictive class of chordal graphs and this work solves the problem for the class of cycle completable graphs, a significant generalization of chordal graphs. These are the graphs for which knowledge of completability for induced cycles (and cliques) implies completability of partial symmetric matrices with the given graph.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个