We propose a new method for the efficient approximation of a class of highly oscillatory weighted integrals where the oscillatory function depends on the frequency parameter $ω\geq 0$, typically varying in a large interval. Our approach is based, for fixed but arbitrary oscillator, on the pre-computation and low-parametric approximation of certain $ω$-dependent prototype functions whose evaluation leads in a straightforward way to recover the target integral. The difficulty that arises is that these prototype functions consist of oscillatory integrals and are itself oscillatory which makes them both difficult to evaluate and to approximate. Here we use the quantized-tensor train (QTT) approximation method for functional $m$-vectors of logarithmic complexity in $m$ in combination with a cross-approximation scheme for TT tensors. This allows the accurate approximation and efficient storage of these functions in the wide range of grid and frequency parameters. Numerical examples illustrate the efficiency of the QTT-based numerical integration scheme on various examples in one and several spatial dimensions.
Computing the density of states for optical spectra by low-rank and QTT tensor approximation
Max Planck Institute for Dynamics of Complex Systems(马克斯·普朗克复杂动态系统研究所);Max Planck Institute for Mathematics in the Sciences(马克斯·普朗克科学数学研究所);Berkeley Labs(伯克利实验室)
Skolkovo Institute of Science and Technology(斯科尔科沃科学技术研究所);Moscow Institute of Physics and Technology(莫斯科物理技术学院);Institute of Numerical Mathematics of Russian Academy of Sciences(俄罗斯科学院计算数学研究所)
Fast iterative solution of the Bethe-Salpeter eigenvalue problem using low-rank and QTT tensor approximation
Max Planck Institute for Dynamics of Complex Technical Systems(马克斯·普朗克复杂技术系统动力学研究所);University of Bath(巴斯大学);Max Planck Institute for Mathematics in the Sciences(马克斯·普朗克科学数学研究所)
Quantized-CP Approximation and Sparse Tensor Interpolation of Function Generated Data
Max-Planck-Institute for Mathematics in the Sciences(马克斯·普朗克科学促进部数学研究所);Birla Institute of Technology and Science Pilani, Hyderabad Campus(比拉理工学院皮拉尼分校海德拉巴校区);Westsächsische Hochschule Zwickau(茨维考西萨克森应用技术大学)
Efficient Tensor Completion Algorithms for Highly Oscillatory Operators
Department of Computer Science, University of Illinois, Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校计算机科学系);Lawrence Berkeley National Laboratory(伯克利国家实验室);Applied Mathematics and Computational Research Division(应用数学与计算研究部)