OPTIMAL LOW-DIMENSIONAL DYNAMIC APPROXIMATIONS

被引:33
|
作者
SIROVICH, L
KNIGHT, BW
RODRIGUEZ, JD
机构
关键词
D O I
10.1090/qam/1074969
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:535 / 548
页数:14
相关论文
共 50 条
  • [1] Optimal Stopping Problems in Low-Dimensional Feature Spaces: Lossless Conditions and Approximations
    van Zutphen, M. J. T. C.
    Heemels, W. P. M. H.
    Antunes, D. J.
    2023 62ND IEEE CONFERENCE ON DECISION AND CONTROL, CDC, 2023, : 1776 - 1781
  • [2] Low-dimensional approximations of random vibration systems
    Wunderlich, R
    vom Scheidt, J
    Starkloff, HJ
    ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK, 2001, 81 : S651 - S652
  • [3] A low-dimensional approximation of optimal confidence
    Le Denmat, Pierre
    Verguts, Tom
    Desender, Kobe
    PERCEPTION, 2022, 51 : 6 - 7
  • [4] A low-dimensional approximation of optimal confidence
    Le Denmat, Pierre
    Verguts, Tom
    Desender, Kobe
    PLOS COMPUTATIONAL BIOLOGY, 2024, 20 (07)
  • [5] Low-Dimensional Approximations of High-Dimensional Asset Price Models
    Redmann, Martin
    Bayer, Christian
    Goyal, Pawan
    SIAM JOURNAL ON FINANCIAL MATHEMATICS, 2021, 12 (01): : 1 - 28
  • [6] Dynamic polarizability of low-dimensional excitons
    Pedersen, Thomas Garm
    PHYSICAL REVIEW B, 2021, 104 (15)
  • [7] Adaptive Geometric Multiscale Approximations for Intrinsically Low-dimensional Data
    Liao, Wenjing
    Maggioni, Mauro
    JOURNAL OF MACHINE LEARNING RESEARCH, 2019, 20
  • [8] LOW-DIMENSIONAL GALERKIN APPROXIMATIONS OF NONLINEAR DELAY DIFFERENTIAL EQUATIONS
    Chekroun, Mickael D.
    Ghil, Michael
    Liu, Honghu
    Wang, Shouhong
    DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS, 2016, 36 (08) : 4133 - 4177
  • [9] Adaptive geometric multiscale approximations for intrinsically low-dimensional data
    Liao, Wenjing
    Maggioni, Mauro
    Journal of Machine Learning Research, 2019, 20
  • [10] Optimal Permutation Routing for Low-dimensional Hypercubes
    Laing, Ambrose K.
    Krumme, David W.
    NETWORKS, 2010, 55 (02) : 149 - 167