Non-intrusive Tensor Reconstruction for High-Dimensional Random PDEs

References

[1] P.-A. Absil, R. Mahony and R. Sepulchre, Optimization Algorithms on Matrix Manifolds, Princeton University Press, Princeton, 2009. 10.1515/9781400830244Search in Google Scholar

[2] I. Babuška, F. Nobile and R. Tempone, A stochastic collocation method for elliptic partial differential equations with random input data, SIAM J. Numer. Anal. 45 (2007), no. 3, 1005–1034. 10.1137/050645142Search in Google Scholar

[3] I. Babuška, R. Tempone and G. E. Zouraris, Solving elliptic boundary value problems with uncertain coefficients by the finite element method: the stochastic formulation, Comput. Methods Appl. Mech. Engrg. 194 (2005), no. 12–16, 1251–1294. 10.1016/j.cma.2004.02.026Search in Google Scholar

[4] M. Bachmayr, A. Cohen and W. Dahmen, Parametric PDEs: Sparse or low-rank approximations?, preprint (2016), https://arxiv.org/abs/1607.04444. 10.1093/imanum/drx052Search in Google Scholar

[5] M. Bachmayr, R. Schneider and A. Uschmajew, Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations, Found. Comput. Math. 2016 (2016), 1–50. 10.1007/s10208-016-9317-9Search in Google Scholar

[6] J. Ballani, L. Grasedyck and M. Kluge, Black box approximation of tensors in hierarchical Tucker format, Linear Algebra Appl. 438 (2013), no. 2, 639–657. 10.1016/j.laa.2011.08.010Search in Google Scholar

[7] E. J. Candes and Y. Plan, Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements, IEEE Trans. Inform. Theory 57 (2011), no. 4, 2342–2359. 10.1109/TIT.2011.2111771Search in Google Scholar

[8] E. J. Candès and T. Tao, The power of convex relaxation: Near-optimal matrix completion, IEEE Trans. Inform. Theory 56 (2010), no. 5, 2053–2080. 10.1109/TIT.2010.2044061Search in Google Scholar

[9] S. Dolgov, B. N. Khoromskij, A. Litvinenko and H. G. Matthies, Computation of the response surface in the tensor train data format, preprint (2014). Search in Google Scholar

[10] S. Dolgov, B. N. Khoromskij, A. Litvinenko and H. G. Matthies, Polynomial chaos expansion of random coefficients and the solution of stochastic partial differential equations in the tensor train format, preprint (2015), https://arxiv.org/abs/1503.03210. 10.1137/140972536Search in Google Scholar

[11] S. Dolgov and R. Scheichl, A hybrid alternating least squares – TT cross algorithm for parametric PDEs, preprint (2017), https://arxiv.org/abs/1707.04562. 10.1137/17M1138881Search in Google Scholar

[12] S. V. Dolgov, B. N. Khoromskij, I. V. Oseledets and D. V. Savostyanov, Computation of extreme eigenvalues in higher dimensions using block tensor train format, Comput. Phys. Commun. 185 (2014), no. 4, 1207–1216. 10.1016/j.cpc.2013.12.017Search in Google Scholar

[13] M. Eigel, C. J. Gittelson, C. Schwab and E. Zander, Adaptive stochastic Galerkin FEM, Comput. Methods Appl. Mech. Engrg. 270 (2014), 247–269. 10.1016/j.cma.2013.11.015Search in Google Scholar

[14] M. Eigel, C. J. Gittelson, C. Schwab and E. Zander, A convergent adaptive stochastic Galerkin finite element method with quasi-optimal spatial meshes, ESAIM Math. Model. Numer. Anal. 49 (2015), no. 5, 1367–1398. 10.1051/m2an/2015017Search in Google Scholar

[15] M. Eigel and C. Merdon, Local equilibration error estimators for guaranteed error control in adaptive stochastic higher-order Galerkin FEM, WIAS preprint (2014). Search in Google Scholar

[16] M. Eigel, M. Pfeffer and R. Schneider, Adaptive stochastic Galerkin FEM with hierarchical tensor representations, Numer. Math. (2015), 1–39. 10.1007/s00211-016-0850-xSearch in Google Scholar

[17] M. Espig, W. Hackbusch, A. Litvinenko, H. G. Matthies and P. Wähnert, Efficient low-rank approximation of the stochastic Galerkin matrix in tensor formats, preprint (2012). 10.1016/j.camwa.2012.10.008Search in Google Scholar

[18] M. Espig, W. Hackbusch, A. Litvinenko, H. G. Matthies and P. Wähnert, Efficient low-rank approximation of the stochastic Galerkin matrix in tensor formats, Comput. Math. Appl. 67 (2014), no. 4, 818–829. 10.1016/j.camwa.2012.10.008Search in Google Scholar

[19] M. Espig, W. Hackbusch, A. Litvinenko, H. G. Matthies and E. Zander, Efficient analysis of high dimensional data in tensor formats, Sparse Grids and Applications, Springer, Cham (2013), 31–56. 10.1007/978-3-642-31703-3_2Search in Google Scholar

[20] R. G. Ghanem and P. D. Spanos, Stochastic Finite Elements: A Spectral Approach, Springer, New York, 1991. 10.1007/978-1-4612-3094-6Search in Google Scholar

[21] L. Grasedyck and W. Hackbusch, An introduction to hierarchical (H-)rank and TT-rank of tensors with examples, Comput. Methods Appl. Math. 11 (2011), no. 3, 291–304. 10.2478/cmam-2011-0016Search in Google Scholar

[22] L. Grasedyck, M. Kluge and S. Krämer, Alternating directions fitting (ADF) of hierarchical low rank tensors, preprint (2013), http://www.dfg-spp1324.de/download/preprints/preprint149.pdf. Search in Google Scholar

[23] L. Grasedyck and S. Krämer, Stable als approximation in the TT-format for rank-adaptive tensor completion, preprint (2017), https://arxiv.org/abs/1701.08045. 10.1007/s00211-019-01072-4Search in Google Scholar

[24] L. Grasedyck, D. Kressner and C. Tobler, A literature survey of low-rank tensor approximation techniques, GAMM-Mitt. 36 (2013), no. 1, 53–78. 10.1002/gamm.201310004Search in Google Scholar

[25] M. D. Gunzburger, C. G. Webster and G. Zhang, Stochastic finite element methods for partial differential equations with random input data, Acta Numer. 23 (2014), 521–650. 10.1017/S0962492914000075Search in Google Scholar

[26] W. Hackbusch, Tensor Spaces and Numerical Tensor Calculus, Springer Ser. Comput. Math. 42, Springer, Berlin, 2012. 10.1007/978-3-642-28027-6Search in Google Scholar

[27] W. Hackbusch and S. Kühn, A new scheme for the tensor representation, J. Fourier Anal. Appl. 15 (2009), no. 5, 706–722. 10.1007/s00041-009-9094-9Search in Google Scholar

[28] S. Holtz, T. Rohwedder and R. Schneider, On manifolds of tensors of fixed TT-rank, Numer. Math. 120 (2012), no. 4, 701–731. 10.1007/s00211-011-0419-7Search in Google Scholar

[29] S. Holtz, T. Rohwedder and R. Schneider, The alternating linear scheme for tensor optimization in the tensor train format, SIAM J. Sci. Comput. 34 (2012), no. 2, A683–A713. 10.1137/100818893Search in Google Scholar

[30] B. Huber and S. Wolf, Xerus – A General Purpose Tensor Library, 2014–2017. Search in Google Scholar

[31] B. N. Khoromskij and I. V. Oseledets, Quantics-TT collocation approximation of parameter-dependent and stochastic elliptic PDEs, Comput. Methods Appl. Math. 10 (2010), no. 4, 376–394. 10.2478/cmam-2010-0023Search in Google Scholar

[32] B. N. Khoromskij and C. Schwab, Tensor-structured Galerkin approximation of parametric and stochastic elliptic PDEs, SIAM J. Sci. Comput. 33 (2011), no. 1, 364–385. 10.1137/100785715Search in Google Scholar

[33] D. Kressner, M. Steinlechner and B. Vandereycken, Low-rank tensor completion by riemannian optimization, BIT 54 (2014), no. 2, 447–468. 10.1007/s10543-013-0455-zSearch in Google Scholar

[34] M. Loève, Probability Theory. I, 4th ed., Grad. Texts in Math. 45, Springer, New York, 1977. 10.1007/978-1-4684-9464-8Search in Google Scholar

[35] G. J. Lord, C. E. Powell and T. Shardlow, An Introduction to Computational Stochastic PDEs, Cambridge Texts Appl. Math., Cambridge University Press, Cambridge, 2014. 10.1017/CBO9781139017329Search in Google Scholar

[36] C. Lubich, I. V. Oseledets and B. Vandereycken, Time integration of tensor trains, SIAM J. Numer. Anal. 53 (2015), no. 2, 917–941. 10.1137/140976546Search in Google Scholar

[37] H. G. Matthies, A. Litvinenko, O. Pajonk, B. V. Rosić and E. Zander, Parametric and uncertainty computations with tensor product representations, Uncertainty Quantification in Scientific Computing, Springer, (Cham) (2012), 139–150. 10.1007/978-3-642-32677-6_9Search in Google Scholar

[38] F. Nobile, R. Tempone and C. G. Webster, A sparse grid stochastic collocation method for partial differential equations with random input data, SIAM J. Numer. Anal. 46 (2008), no. 5, 2309–2345. 10.1137/060663660Search in Google Scholar

[39] I. V. Oseledets, Tensor-train decomposition, SIAM J. Sci. Comput. 33 (2011), no. 5, 2295–2317. 10.1137/090752286Search in Google Scholar

[40] I. V. Oseledets and E. Tyrtyshnikov, TT-cross approximation for multidimensional arrays, Linear Algebra Appl. 432 (2010), no. 1, 70–88. 10.1016/j.laa.2009.07.024Search in Google Scholar

[41] S. Oymak, A. Jalali, M. Fazel, Y. C. Eldar and B. Hassibi, Simultaneously structured models with application to sparse and low-rank matrices, IEEE Trans. Inform. Theory 61 (2015), no. 5, 2886–2908. 10.1109/TIT.2015.2401574Search in Google Scholar

[42] D. Perez-Garcia, F. Verstraete, M. M. Wolf and J. I. Cirac, Matrix product state representations, preprint (2006), https://arxiv.org/abs/quant-ph/0608197. 10.26421/QIC7.5-6-1Search in Google Scholar

[43] H. Rauhut, R. Schneider and Z. Stojanac, Low rank tensor recovery via iterative hard thresholding, preprint (2016), https://arxiv.org/abs/1602.05217. 10.1016/j.laa.2017.02.028Search in Google Scholar

[44] B. Recht, M. Fazel and P. A. Parrilo, Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization, SIAM Rev. 52 (2010), no. 3, 471–501. 10.1137/070697835Search in Google Scholar

[45] D. Savostyanov and I. V. Oseledets, Fast adaptive interpolation of multi-dimensional arrays in tensor train format, 7th International Workshop on Multidimensional (nD) Systems (nDs), IEEE Press, Piscataway (2011), 1–8. 10.1109/nDS.2011.6076873Search in Google Scholar

[46] C. Schwab and C. J. Gittelson, Sparse tensor discretizations of high-dimensional parametric and stochastic PDEs, Acta Numer. 20 (2011), 291–467. 10.1017/S0962492911000055Search in Google Scholar

[47] C. Schwab and R. A. Todor, Karhunen–Loève approximation of random fields by generalized fast multipole methods, J. Comput. Phys. 217 (2006), no. 1, 100–122. 10.1016/j.jcp.2006.01.048Search in Google Scholar