19 citations to https://www.mathnet.ru/rus/zvmmf392
  1. I. E. Kaporin, “Finding Complex-Valued Solutions of Brent Equations Using Nonlinear Least Squares”, Comput. Math. and Math. Phys., 64:9 (2024), 1881  crossref
  2. Igor Kaporin, Communications in Computer and Information Science, 1739, Advances in Optimization and Applications, 2022, 3  crossref
  3. Igor Kaporin, Lecture Notes in Computer Science, 13078, Optimization and Applications, 2021, 217  crossref
  4. Kaporin I., “Preconditioned Subspace Descent Methods For the Solution of Nonlinear Systems of Equations”, Optimization and Applications, Optima 2019, Communications in Computer and Information Science, 1145, ed. Jacimovic M. Khachay M. Malkova V. Posypkin M., Springer International Publishing Ag, 2020, 164–179  crossref  mathscinet  isi
  5. Kaporin I., “Preconditioned Subspace Descent Method For Nonlinear Systems of Equations”, Open Comput. Sci., 10:1 (2020), 71–81  crossref  isi
  6. Espig M., Hackbusch W., Litvinenko A., Matthies H.G., Zander E., “Iterative Algorithms For the Post-Processing of High-Dimensional Data”, J. Comput. Phys., 410 (2020), 109396  crossref  isi
  7. Igor Kaporin, Lecture Notes in Computer Science, 12422, Optimization and Applications, 2020, 184  crossref
  8. Georgieva I., Hofreither C., “Greedy Low-Rank Approximation in Tucker Format of Solutions of Tensor Linear Systems”, J. Comput. Appl. Math., 358 (2019), 206–220  crossref  mathscinet  isi  scopus
  9. Vannieuwenhoven N., “Condition Numbers For the Tensor Rank Decomposition”, Linear Alg. Appl., 535 (2017), 35–86  crossref  mathscinet  zmath  isi  scopus
  10. Vannieuwenhoven N., Meerbergen K., Vandebril R., “Computing the Gradient in Optimization Algorithms For the Cp Decomposition in Constant Memory Through Tensor Blocking”, SIAM J. Sci. Comput., 37:3 (2015), C415–C438  crossref  mathscinet  zmath  isi  elib  scopus
1
2
Следующая