349 citations to 10.1007/BF02124742 (Crossref Cited-By Service)
  1. Francisco Chinesta, Pierre Ladeveze, Elías Cueto, “A Short Review on Model Order Reduction Based on Proper Generalized Decomposition”, Arch Computat Methods Eng, 18, № 4, 2011, 395  crossref
  2. Qiuhui Chen, Weixiong Mai, Liming Zhang, Wen Mi, “System identification by discrete rational atoms”, Automatica, 56, 2015, 53  crossref
  3. A. V. Dereventsov, “Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms”, Math Notes, 92, № 3-4, 2012, 485  crossref
  4. Евгений Давидович Лившиц, Evgenii Davidovich Livshits, “О скорости сходимости чисто жадного алгоритма”, Матем. заметки, 76, № 4, 2004, 539  crossref
  5. Francisco Chinesta, Antonio Huerta, Gianluigi Rozza, Karen Willcox, Encyclopedia of Computational Mechanics Second Edition, 2017, 1  crossref
  6. Wenxiang Mao, Zhiwei Li, Zhibin Wang, Peiling Li, Yan Zhu, Jingxin Hou, “GNSS Ground deformation observation network optimization assisted using prior InSAR-derived ground surface deformation and multiscale iteration estimation”, International Journal of Digital Earth, 17, № 1, 2024, 2329348  crossref
  7. Benjamin Acar, Marc Guerreiro Augusto, Marius Sterling, Fikret Sivrikaya, Sahin Albayrak, “A Survey on the Use of Container Technologies in Autonomous Driving and the Case of BeIntelli”, IEEE Open J. Intell. Transp. Syst., 4, 2023, 800  crossref
  8. You Gao, Min Ku, Tao Qian, “Fast algorithm of adaptive Fourier series”, Math Methods in App Sciences, 41, № 7, 2018, 2654  crossref
  9. Hrushikesh N. Mhaskar, Tong Mao, “Tractability of approximation by general shallow networks”, Anal. Appl., 22, № 03, 2024, 535  crossref
  10. D. Leviatan, V. N. Temlyakov, “Simultaneous approximation by greedy algorithms”, Adv Comput Math, 25, № 1-3, 2006, 73  crossref
Предыдущая
1
2
3
4
5
6
7
8
35
Следующая