Sparse polynomial prediction

被引:1
|
作者
Maruri-Aguilar, Hugo [1 ]
Wynn, Henry [2 ]
机构
[1] Queen Mary Univ London, Sch Math Sci, Mile End Rd, London E1 4NS, England
[2] London Sch Econ, Dept Stat, Houghton St, London WC2A 2AE, England
关键词
Smolyak grids; Sparse designs; Inclusion-exclusion; Betti numbers; INTERPOLATION;
D O I
10.1007/s00362-023-01439-8
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
In numerical analysis, sparse grids are point configurations used in stochastic finite element approximation, numerical integration and interpolation. This paper is concerned with the construction of polynomial interpolator models in sparse grids. Our proposal stems from the fact that a sparse grid is an echelon design with a hierarchical structure that identifies a single model. We then formulate the model and show that it can be written using inclusion-exclusion formul AE. At this point, we deploy efficient methodologies from the algebraic literature that can simplify considerably the computations. The methodology uses Betti numbers to reduce the number of terms in the inclusion-exclusion while achieving the same result as with exhaustive formul AE.
引用
收藏
页码:1233 / 1249
页数:17
相关论文
共 50 条
  • [41] SPARSE SETS, TALLY SETS, AND POLYNOMIAL REDUCIBILITIES
    BOOK, RV
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 324 : 1 - 13
  • [42] THE POLYNOMIAL-TIME HIERARCHY AND SPARSE ORACLES
    BALCAZAR, JL
    BOOK, RV
    SCHONING, U
    JOURNAL OF THE ACM, 1986, 33 (03) : 603 - 617
  • [43] Complexity of sparse polynomial solving 2: renormalization
    Malajovich, Gregorio
    IMA JOURNAL OF NUMERICAL ANALYSIS, 2023, 43 (04) : 2001 - 2114
  • [44] Algorithms and Data Structures for Sparse Polynomial Arithmetic
    Asadi, Mohammadali
    Brandt, Alexander
    Moir, Robert H. C.
    Maza, Marc Moreno
    MATHEMATICS, 2019, 7 (05)
  • [45] A New Sparse Polynomial GCD by Separating Terms
    Huang, Qiao-Long
    Monagan, Michael
    PROCEEDINGS OF THE 2024 INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION, ISSAC 2024, 2024, : 134 - 142
  • [46] Sparse Estimation of Polynomial and Rational Dynamical Models
    Rojas, Cristian R.
    Toth, Roland
    Hjalmarsson, Hakan
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2014, 59 (11) : 2962 - 2977
  • [47] Sparse Bayesian Identification of Polynomial NARX Models
    Jacobs, William R.
    Baldacchino, Tara
    Anderson, Sean R.
    IFAC PAPERSONLINE, 2015, 48 (28): : 172 - 177
  • [48] Parallel Sparse Polynomial Multiplication Using Heaps
    Monagan, Michael
    Pearce, Roman
    ISSAC2009: PROCEEDINGS OF THE 2009 INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION, 2009, : 263 - 269
  • [49] A POLYHEDRAL METHOD FOR SOLVING SPARSE POLYNOMIAL SYSTEMS
    HUBER, B
    STURMFELS, B
    MATHEMATICS OF COMPUTATION, 1995, 64 (212) : 1541 - 1555
  • [50] Solving degenerate sparse polynomial systems faster
    Rojas, JM
    JOURNAL OF SYMBOLIC COMPUTATION, 1999, 28 (1-2) : 155 - 186