Iterative thresholding low-rank time integration for high-dimensional problems
Markus Bachmayr, Tianyu Jin, Polina Sachsenmaier, Federico Vismara
Abstract
This work analyzes a method for time integration of high-dimensional linear Schrödinger-type problems based on hierarchical tensor approximations. In particular, this method provides a balance between error bounds and associated approximation ranks, using a scheme for iterative refinement with soft thresholding of tensors. The practical performance of the method is illustrated by numerical tests on coupled oscillators.
Create a lesson
Related papers
Graph lattice sums and graph zeta functions for long-range interacting quantum lattice models
Andreas Alexander Buchheit, Andreas Rupp
A numerical benchmark for fluid--structure--contact interaction
Daniele Corti, Jakub Fara, Miguel Angel Fernández et al.
Largest-dihedral-angle bisection algorithm does not preserve mesh regularity for tetrahedral partitions
Sergey Korotov, Jérôme Michaud
A Highly Scalable Quantized Tensor-Train FDTD Framework for the Simulation of Three-Dimensional Electromagnetic Scattering Problems
Daan Vanhaecke, Emile Vanderstraeten, Dries Vande Ginste
Pressure-robustness by commuting interpolation operators for Stokes discretizations with continuous pressures
Philip L. Lederer, Theresa Vock
A Reynolds-Semi-Robust, Globally Divergence-Free HDG Method for the Smagorinsky Model
Shuaijun Liu, Xiaoping Xie