{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T05:01:50Z","timestamp":1775019710631,"version":"3.50.1"},"reference-count":25,"publisher":"Pleiades Publishing Ltd","issue":"4","license":[{"start":{"date-parts":[[2023,7,28]],"date-time":"2023-07-28T00:00:00Z","timestamp":1690502400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,28]],"date-time":"2023-07-28T00:00:00Z","timestamp":1690502400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Program Comput Soft"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1134\/s0361768823040060","type":"journal-article","created":{"date-parts":[[2023,7,28]],"date-time":"2023-07-28T09:02:21Z","timestamp":1690534941000},"page":"295-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Approximation of Multidimensional Tensors Using GPUs"],"prefix":"10.1134","volume":"49","author":[{"given":"N. S.","family":"Kapralov","sequence":"first","affiliation":[]},{"given":"A. Yu.","family":"Morozov","sequence":"additional","affiliation":[]},{"given":"S. P.","family":"Nikulin","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2023,7,28]]},"reference":[{"key":"3743_CR1","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1134\/S0374064118070130","volume":"54","author":"A.Yu. Morozov","year":"2018","unstructured":"Morozov, A.Yu. and Reviznikov, D.L., Adaptive interpolation algorithm based on a kd-tree for numerical integration of ordinary differential equations systems with interval initial conditions, Differ. Uravn., 2018, vol. 54, no. 7, pp. 963\u2013974. https:\/\/doi.org\/10.1134\/S0374064118070130","journal-title":"Differ. Uravn."},{"key":"3743_CR2","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1134\/S0374064120070122","volume":"56","author":"A.Yu. Morozov","year":"2020","unstructured":"Morozov, A.Yu., Zhuravlev, A.A., and Reviznikov, D.L., Analysis and optimization of an adaptive interpolation algorithm for the numerical solution of an ordinary differential equations system with interval parameters, Differ. Uravn., 2020, vol. 56, no. 7, pp. 960\u2013974. https:\/\/doi.org\/10.1134\/S0374064120070122","journal-title":"Differ. Uravn."},{"key":"3743_CR3","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1134\/S0965542521090098","volume":"61","author":"V.Yu. Gidaspov","year":"2021","unstructured":"Gidaspov, V.Yu., Morozov, A.Yu., and Reviznikov, D.L., Adaptive interpolation algorithm using TT-decomposition for modeling dynamical systems with interval parameters, Comput. Math. Math. Phys., 2021, vol. 61, no.\u00a09, pp. 1387\u20131401. https:\/\/doi.org\/10.1134\/S0965542521090098","journal-title":"Comput. Math. Math. Phys."},{"key":"3743_CR4","doi-asserted-by":"publisher","first-page":"69","DOI":"10.17587\/prin.10.69-76","volume":"10","author":"A.Yu. Morozov","year":"2019","unstructured":"Morozov, A.Yu. and Reviznikov, D.L., Modelling of dynamic systems with interval parameters, Program. Inzh., 2019, vol. 10, no. 2, pp. 69\u201376. https:\/\/doi.org\/10.17587\/prin.10.69-76","journal-title":"Program. Inzh."},{"key":"3743_CR5","doi-asserted-by":"publisher","unstructured":"Morozov, A.Yu., Parallel adaptive interpolation algorithm based on sparse grids for modeling dynamic systems with interval parameters, Program. Inzh., 2021, vol. 12, no. 8. https:\/\/doi.org\/10.17587\/prin.12.395-403","DOI":"10.17587\/prin.12.395-403"},{"key":"3743_CR6","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1137\/090752286","volume":"33","author":"I.V. Oseledets","year":"2011","unstructured":"Oseledets, I.V., Tensor-train decomposition, SIAM J. Sci. Comput., 2011, vol. 33, no. 5, pp. 2295\u20132317.","journal-title":"SIAM J. Sci. Comput."},{"key":"3743_CR7","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.laa.2009.07.024","volume":"432","author":"I. Oseledets","year":"2010","unstructured":"Oseledets, I. and Tyrtyshnikov, E., TT-cross approximation for multidimensional arrays, Lin. Algebra Its Appl., 2010, vol. 432, no. 1, pp. 70\u201388. https:\/\/doi.org\/10.1016\/j.laa.2009.07.024","journal-title":"Lin. Algebra Its Appl."},{"key":"3743_CR8","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1002\/sapm192761164","volume":"6","author":"F.L. Hitchcock","year":"1927","unstructured":"Hitchcock, F.L., The expression of a tensor or a polyadic as a sum of products, J. Math. Phys., 1927, vol. 6, no.\u00a01, pp. 164\u2013189. https:\/\/doi.org\/10.1002\/sapm192761164","journal-title":"J. Math. Phys."},{"key":"3743_CR9","volume-title":"2.6 Singular Value Decomposition. Numerical Recipes in C","author":"W.H. Press","year":"1992","unstructured":"Press, W.H., Teukolsky, S.A., Vetterling, W.T., and Flannery, B.P., 2.6 Singular Value Decomposition. Numerical Recipes in C, 2nd ed., Cambridge: Cambridge Univ. Press, 1992."},{"key":"3743_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.4213\/sm747","volume":"194","author":"E.E. Tyrtyshnikov","year":"2003","unstructured":"Tyrtyshnikov, E.E., Tensor approximations for matrices generated by asymptotically smooth functions, Mat. Sb., 2003, vol. 194, no. 6, pp. 147\u2013160. https:\/\/doi.org\/10.4213\/sm747","journal-title":"Mat. Sb."},{"key":"3743_CR11","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1134\/S0965542519080165","volume":"59","author":"E.E. Tyrtyshnikov","year":"2019","unstructured":"Tyrtyshnikov, E.E. and Shcherbakova, E.M., Methods for nonnegative matrix factorization based on low-rank cross approximations, Comput. Math. Math. Phys., 2019, vol. 59, no. 8, pp. 1251\u20131267. https:\/\/doi.org\/10.1134\/S0965542519080165","journal-title":"Comput. Math. Math. Phys."},{"key":"3743_CR12","doi-asserted-by":"publisher","first-page":"369","DOI":"10.26089\/NumMet.v16r336","volume":"16","author":"D.A. Zheltkov","year":"2015","unstructured":"Zheltkov, D.A. and Tyrtyshnikov, E.E., Matrix cross approximation method: parallel implementation, Vychisl. Metody Program., 2015, vol. 16, pp. 369\u2013375. https:\/\/doi.org\/10.26089\/NumMet.v16r336","journal-title":"Vychisl. Metody Program."},{"key":"3743_CR13","doi-asserted-by":"publisher","first-page":"619","DOI":"10.4213\/MZM1644","volume":"62","author":"S.A. Goreinov","year":"1997","unstructured":"Goreinov, S.A., Zamarashkin, N.L., and Tyrtyshnikov,\u00a0E.E., Pseudo-skeleton approximations with the help of submatrices of maximal volume, Mat. Zametki, 1997, vol. 62, no. 4, pp. 619\u2013623. https:\/\/doi.org\/10.4213\/MZM1644","journal-title":"Mat. Zametki"},{"key":"3743_CR14","unstructured":"CUDA Zone. https:\/\/developer.nvidia.com\/cuda-zone."},{"key":"3743_CR15","volume-title":"The C Programming Language","author":"B.W. Keringhan","year":"1978","unstructured":"Keringhan, B.W. and Ritchie, D.M., The C Programming Language, Prentice Hall, 1978."},{"key":"3743_CR16","volume-title":"The C++ Standard Library: a Tutorial and Reference","author":"N.M. Josuttis","year":"2012","unstructured":"Josuttis, N.M., The C++ Standard Library: a Tutorial and Reference, Addison-Wesley Pro., 2012."},{"key":"3743_CR17","unstructured":"Matrix Algebra on GPU and Multicore Architectures (MAGMA). https:\/\/icl.cs.utk.edu\/magma."},{"key":"3743_CR18","unstructured":"cuBLAS. https:\/\/docs.nvidia.com\/cuda\/cublas."},{"key":"3743_CR19","unstructured":"ScaLAPACK. http:\/\/www.netlib.org\/scalapack."},{"key":"3743_CR20","unstructured":"MATLAB. http:\/\/www.mathworks.com\/help\/matlab."},{"key":"3743_CR21","unstructured":"Oseledets, I.V., Tensor methods and their applications, Doctoral Sci. (Phys.-Math.) Dissertation, Moscow: Marchuk Institute of Numeriical Mathematics RAS, 2009."},{"key":"3743_CR22","doi-asserted-by":"publisher","DOI":"10.1142\/9789812836021_0015","volume-title":"How to Find a Good Submatrix","author":"S.A. Goreinov","year":"2008","unstructured":"Goreinov, S.A., Oseledets, I.V., Savostyanov, D.V., and Tyrtyshnikov, E.E., How to Find a Good Submatrix, Institute for Computational Mathematics Hong Kong Baptist Univ., 2008. https:\/\/doi.org\/10.1142\/9789812836021_0015"},{"key":"3743_CR23","unstructured":"LAPACK. http:\/\/www.netlib.org\/lapack."},{"key":"3743_CR24","volume-title":"Matrix Computations on the GPU","author":"A. Chrzeszczyk","year":"2017","unstructured":"Chrzeszczyk, A. and Anders, J., Matrix Computations on the GPU, Jan Kochanowski Univ., 2017."},{"key":"3743_CR25","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF00933356","volume":"34","author":"A.O. Griewank","year":"1981","unstructured":"Griewank, A.O., Generalized decent for global optimization, J. Optim. Theory Appl., 1981, vol. 34, pp. 11\u201339. https:\/\/doi.org\/10.1007\/BF00933356","journal-title":"J. Optim. Theory Appl."}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768823040060.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768823040060","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768823040060.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:05:31Z","timestamp":1775012731000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768823040060"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,28]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["3743"],"URL":"https:\/\/doi.org\/10.1134\/s0361768823040060","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,28]]},"assertion":[{"value":"17 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}