Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Approximation rates for the hierarchical tensor format in periodic Sobolev spaces
 
research article

Approximation rates for the hierarchical tensor format in periodic Sobolev spaces

Schneider, Reinhold
•
Uschmajew, Andre  
2014
Journal of Complexity

In this note we estimate the asymptotic rates for the L-2-error decay and the storage cost when approximating 2 pi-periodic, d-variate functions from isotropic and mixed Sobolev classes by the recent hierarchical tensor format as introduced by Hackbusch and Kuhn. To this end, we survey some results on bilinear approximation due to Temlyakov. The approach taken in this paper improves and generalizes recent results of Griebel and Harbrecht for the bi-variate case. (C) 2013 Elsevier Inc. All rights reserved.

  • Details
  • Metrics
Type
research article
DOI
10.1016/j.jco.2013.10.001
Web of Science ID

WOS:000332807400005

Author(s)
Schneider, Reinhold
Uschmajew, Andre  
Date Issued

2014

Publisher

Academic Press Inc Elsevier Science

Published in
Journal of Complexity
Volume

30

Issue

2

Start page

56

End page

71

Subjects

Approximation of multi-variate functions

•

Hierarchical tensor format

•

Hierarchical Tucker rank

•

High-order SVD

•

Bilinear approximation

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
ANCHP  
Available on Infoscience
May 2, 2014
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/103099
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés