ON THE PROBLEM OF APPROXIMATING THE INTERSECTION OF ELLIPSOIDS

被引:0
|
作者
POKOTILO, BG
机构
来源
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Considers the problem of constructing an ellipsoid of minimal volume containing the intersection of two given ellipsoids. A solution of this problem is obtained for the case of similar ellipsoids, when the matrices defining these ellipsoids differ only by a scalar factor. This result serves as a basis for a new method of constructing an ellipsoid, quasioptimal with respect to the volume, which approximates the intersection of two arbitrary ellipsoids. This method provides better results than known ones, and can be used for construction of minimax filters in dynamic systems.
引用
收藏
页码:74 / 79
页数:6
相关论文
共 50 条
  • [31] Detecting redundancy in optimization problems over intersection of ellipsoids
    Jibrin, Shafiu
    Journal of Interdisciplinary Mathematics, 2002, 5 (02) : 183 - 194
  • [32] ON Lp INTERSECTION MEAN ELLIPSOIDS AND AFFINE ISOPERIMETRIC INEQUALITIES
    Cai, Xin
    Chen, Fangwei
    MATHEMATICAL INEQUALITIES & APPLICATIONS, 2021, 24 (04): : 1075 - 1092
  • [33] ON THE LATTICE POINT PROBLEM FOR ELLIPSOIDS
    BENTKUS, V
    GOTZE, F
    DOKLADY AKADEMII NAUK, 1995, 343 (04) : 439 - 440
  • [34] On the lattice point problem for ellipsoids
    Bentkus, V
    Gotze, F
    ACTA ARITHMETICA, 1997, 80 (02) : 101 - 125
  • [35] Approximating centroids for the maximum intersection of spherical polygons
    Ha, JS
    Yoo, KH
    COMPUTER-AIDED DESIGN, 2005, 37 (08) : 783 - 790
  • [36] On maximization of quadratic form over intersection of ellipsoids with common center
    Nemirovski, A
    Roos, C
    Terlaky, T
    MATHEMATICAL PROGRAMMING, 1999, 86 (03) : 463 - 473
  • [37] APPROXIMATING THE BIRTHDAY PROBLEM
    SCHWARZ, W
    AMERICAN STATISTICIAN, 1988, 42 (03): : 195 - 196
  • [38] On maximization of quadratic form over intersection of ellipsoids with common center
    A. Nemirovski
    C. Roos
    T. Terlaky
    Mathematical Programming, 1999, 86 : 463 - 473
  • [39] On Approximating a Scheduling Problem
    Pierluigi Crescenzi
    Xiaotie Deng
    Christos H. Papadimitriou
    Journal of Combinatorial Optimization, 2001, 5 : 287 - 297
  • [40] On approximating a scheduling problem
    Crescenzi, P
    Deng, XT
    Papadimitriou, CH
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2001, 5 (03) : 287 - 297