Algorithm for estimating error of symbolic simplification

被引:0
作者
Kolka, Zdenek [1 ]
Biolkova, Viera [1 ]
Dobes, Josef [2 ]
Horak, Martin [1 ]
机构
[1] Brno Univ Technol, Dept Radio Elect, Brno, Czech Republic
[2] Czech Tech Univ, Dept Radioelect, Prague, Czech Republic
来源
2020 2ND INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE COMMUNICATION AND NETWORK SECURITY (CSCNS2020) | 2021年 / 336卷
关键词
D O I
10.1051/matecconf/202133606023
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The paper deals with an improved algorithm for estimating errors during approximate symbolic analysis. A linear system can be solved symbolically. However, the size of the resulting formula grows exponentially with the matrix size. The approximate symbolic analysis omits insignificant terms of the exact formula to decrease its size, which, on the other hand, limits the validity of the approximate result. The proposed algorithm estimates, in a computationally feasible way, the approximation error over a region of system parameters. This makes it possible to maintain the validity of the results even if the tolerances of the system parameters are defined. The method is based on the first-order approximation of error functions. The algorithm is demonstrated using the SNAP symbolic analyzer, which has been developed by the authors.
引用
收藏
页数:8
相关论文
共 50 条
[31]   A new algorithm for calculating ventilation network reliability based on truncation error theory and network simplification [J].
Jia Jin-zhang ;
Zang Guang-wei ;
Zhou Qian ;
Feng Xiao .
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON MINING SCIENCE & TECHNOLOGY (ICMST2009), 2009, 1 (01) :169-172
[32]   Surface simplification with rendering error metrics [J].
Zhou, K ;
Shi, JY ;
Pan, ZG .
CAD/GRAPHICS '2001: PROCEEDINGS OF THE SEVENTH INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN AND COMPUTER GRAPHICS, VOLS 1 AND 2, 2001, :125-131
[33]   An efficient algorithm for terrain simplification [J].
Agarwal, PK ;
Desikan, PK .
PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, :139-147
[34]   A Progressive Line Simplification Algorithm [J].
Christoph Brandenberger ;
Lorenz Hurni .
Geo-Spatial Information Science, 2002, (03) :41-45
[35]   A comparison of mesh simplification algorithm [J].
Cignoni, P ;
Montani, C ;
Scopigno, R .
COMPUTERS & GRAPHICS-UK, 1998, 22 (01) :37-54
[36]   Superfaces: Polygonal mesh simplification with bounded error [J].
Kalvin, AD ;
Taylor, RH .
IEEE COMPUTER GRAPHICS AND APPLICATIONS, 1996, 16 (03) :64-77
[37]   Surface Simplification using Intrinsic Error Metrics [J].
Liu, Hsueh-Ti Derek ;
Gillespie, Mark ;
Chislett, Benjamin ;
Sharp, Nicholas ;
Jacobson, Alec ;
Crane, Keenan .
ACM TRANSACTIONS ON GRAPHICS, 2023, 42 (04)
[38]   Simplification of tetrahedral meshes with accurate error evaluation [J].
Cignoni, P ;
Costanza, D ;
Montani, C ;
Rocchini, C ;
Scopigno, R .
VISUALIZATION 2000, PROCEEDINGS, 2000, :85-92
[39]   Static polyhedron simplification using error measurements [J].
Veron, P ;
Leon, JC .
COMPUTER-AIDED DESIGN, 1997, 29 (04) :287-298
[40]   Error measures in greedy insertion simplification methods [J].
Montenegro, AA ;
Gattass, M ;
Carvalho, PCP .
SIBGRAPI '98 - INTERNATIONAL SYMPOSIUM ON COMPUTER GRAPHICS, IMAGE PROCESSING, AND VISION, PROCEEDINGS, 1998, :78-85