ON THE PROBLEM OF APPROXIMATING THE INTERSECTION OF ELLIPSOIDS

被引：0
|
作者：
POKOTILO, BG
机构：
来源：
SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES | 1991年 / 29卷 / 01期
关键词：
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 条
  • [41] REAPPRAISAL OF PROBLEM OF CONGRUENT DARWIN ELLIPSOIDS
    WIITA, PJ
    BULLETIN OF THE AMERICAN PHYSICAL SOCIETY, 1975, 20 (04): : 632 - 632
  • [42] Approximating dependency grammars through intersection of regular languages
    Yli-Jyrä, A
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2005, 3317 : 281 - 292
  • [43] On the Interference Problem for Ellipsoids: Experiments and Applications
    Caravantes, Jorge
    Gonzalez-Vega, Laureano
    MATHEMATICAL SOFTWARE - ICMS 2018, 2018, 10931 : 89 - 97
  • [44] SUMMATION OF ELLIPSOIDS IN THE GUARANTEED ESTIMATION PROBLEM
    RESHETNYAK, YN
    PMM JOURNAL OF APPLIED MATHEMATICS AND MECHANICS, 1989, 53 (02): : 193 - 197
  • [45] On equivalence of major relaxation methods for minimum ellipsoid covering intersection of ellipsoids
    Wang, Zhiguo
    Shen, Xiaojing
    Zhu, Yunmin
    AUTOMATICA, 2019, 103 : 337 - 345
  • [46] On approximating the Incremental Knapsack Problem
    Della Croce, Federico
    Pferschy, Ulrich
    Scatamacchia, Rosario
    DISCRETE APPLIED MATHEMATICS, 2019, 264 : 26 - 42
  • [47] Approximating the product knapsack problem
    Ulrich Pferschy
    Joachim Schauer
    Clemens Thielen
    Optimization Letters, 2021, 15 : 2529 - 2540
  • [48] Approximating the traffic grooming problem
    Flammini, M
    Moscardelli, L
    Shalom, M
    Zaks, S
    ALGORITHMS AND COMPUTATION, 2005, 3827 : 915 - 924
  • [49] Approximating the traffic grooming problem
    Flammini, Michele
    Moscardelli, Luca
    Shalom, Mordechai
    Zaks, Shmuel
    JOURNAL OF DISCRETE ALGORITHMS, 2008, 6 (03) : 472 - 479
  • [50] Approximating the Advertisement Placement Problem
    Ari Freund
    Joseph (Seffi) Naor
    Journal of Scheduling, 2004, 7 : 365 - 374
12345