default search action
Dmitry V. Savostyanov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Sergey Dolgov, Dmitry V. Savostyanov
:
Tensor product approach to modelling epidemics on networks. Appl. Math. Comput. 460: 128290 (2024) - [j14]Sergey Dolgov, Dmitry V. Savostyanov:
Tensor product algorithms for inference of contact network from epidemiological data. BMC Bioinform. 25(1): 285 (2024) - [j13]Ioannis Chatzigeorgiou
Guessing Random Additive Noise Decoding of Network Coded Data Transmitted Over Burst Error Channels. IEEE Trans. Veh. Technol. 73(9): 12842-12857 (2024) - [i3]Sergey Dolgov, Dmitry V. Savostyanov:
Tensor product algorithms for inference of contact network from epidemiological data. CoRR abs/2401.15031 (2024) - 2022
- [i2]Sergey V. Dolgov, Dmitry V. Savostyanov:
Tensor product approach to modelling epidemics on networks. CoRR abs/2209.03756 (2022) - 2020
- [j12]Sergey Dolgov
Parallel cross interpolation for high-precision calculation of high-dimensional integrals. Comput. Phys. Commun. 246 (2020)
2010 – 2019
- 2016
- [j11]Sergey Dolgov
Fast tensor product solvers for optimization problems with fractional differential equations as constraints. Appl. Math. Comput. 273: 604-623 (2016) - 2014
- [j10]Sergey V. Dolgov
Computation of extreme eigenvalues in higher dimensions using block tensor train format. Comput. Phys. Commun. 185(4): 1207-1216 (2014) - [j9]Jason A. Roberts, Dmitry V. Savostyanov
Superfast solution of linear convolutional Volterra equations using QTT approximation. J. Comput. Appl. Math. 260: 434-448 (2014) - [j8]Neville J. Ford
On the Decay of the Elements of Inverse Triangular Toeplitz Matrices. SIAM J. Matrix Anal. Appl. 35(4): 1288-1302 (2014) - [j7]Sergey Dolgov
Alternating Minimal Energy Methods for Linear Systems in Higher Dimensions. SIAM J. Sci. Comput. 36(5) (2014) - 2013
- [c2]Sergey Dolgov, Dmitry V. Savostyanov
Corrected One-Site Density Matrix Renormalization Group and Alternating Minimal Energy Algorithm. ENUMATH 2013: 335-343 - 2012
- [j6]Dmitry V. Savostyanov
Fast truncation of mode ranks for bilinear tensor operations. Numer. Linear Algebra Appl. 19(1): 103-111 (2012) - [j5]Sergei A. Goreinov, Ivan V. Oseledets
Wedderburn Rank Reduction and Krylov Subspace Method for Tensor Approximation. Part 1: Tucker Case. SIAM J. Sci. Comput. 34(1) (2012) - 2011
- [c1]Dmitry V. Savostyanov
Fast adaptive interpolation of multi-dimensional arrays in tensor train format. nDS 2011: 1-8 - 2010
- [j4]Ivan V. Oseledets
Cross approximation in tensor electron density computations. Numer. Linear Algebra Appl. 17(6): 935-952 (2010) - [i1]Sergei A. Goreinov, Ivan V. Oseledets, Dmitry V. Savostyanov:
Wedderburn rank reduction and Krylov subspace method for tensor approximation. Part 1: Tucker case. CoRR abs/1004.1986 (2010)
2000 – 2009
- 2009
- [j3]Ivan V. Oseledets
Linear algebra for tensor problems. Computing 85(3): 169-188 (2009) - [j2]Ivan V. Oseledets
Fast Simultaneous Orthogonal Reduction to Triangular Matrices. SIAM J. Matrix Anal. Appl. 31(2): 316-330 (2009) - 2008
- [j1]Ivan V. Oseledets
Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time. SIAM J. Matrix Anal. Appl. 30(3): 939-956 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: