Handle URI:
http://hdl.handle.net/10754/597603
Title:
Approximation of High-Dimensional Rank One Tensors
Authors:
Bachmayr, Markus; Dahmen, Wolfgang; DeVore, Ronald; Grasedyck, Lars
Abstract:
Many real world problems are high-dimensional in that their solution is a function which depends on many variables or parameters. This presents a computational challenge since traditional numerical techniques are built on model classes for functions based solely on smoothness. It is known that the approximation of smoothness classes of functions suffers from the so-called 'curse of dimensionality'. Avoiding this curse requires new model classes for real world functions that match applications. This has led to the introduction of notions such as sparsity, variable reduction, and reduced modeling. One theme that is particularly common is to assume a tensor structure for the target function. This paper investigates how well a rank one function f(x 1,...,x d)=f 1(x 1)⋯f d(x d), defined on Ω=[0,1]d can be captured through point queries. It is shown that such a rank one function with component functions f j in W∞ r([0,1]) can be captured (in L ∞) to accuracy O(C(d,r)N -r) from N well-chosen point evaluations. The constant C(d,r) scales like d dr. The queries in our algorithms have two ingredients, a set of points built on the results from discrepancy theory and a second adaptive set of queries dependent on the information drawn from the first set. Under the assumption that a point z∈Ω with nonvanishing f(z) is known, the accuracy improves to O(dN -r). © 2013 Springer Science+Business Media New York.
Citation:
Bachmayr M, Dahmen W, DeVore R, Grasedyck L (2013) Approximation of High-Dimensional Rank One Tensors. Constructive Approximation 39: 385–395. Available: http://dx.doi.org/10.1007/s00365-013-9219-x.
Publisher:
Springer Science + Business Media
Journal:
Constructive Approximation
KAUST Grant Number:
KUS-C1-016-04
Issue Date:
12-Nov-2013
DOI:
10.1007/s00365-013-9219-x
Type:
Article
ISSN:
0176-4276; 1432-0940
Sponsors:
This research was supported by the Office of Naval Research Contracts ONR N00014-08-1-1113, ONR N00014-09-1-0107, and ONR N00014-11-1-0712; the AFOSR Contract FA95500910500; the NSF Grants DMS-0810869, and DMS 0915231; and the DFG Special Priority Program SPP-1324. This research was done when R. D. was a visiting professor at RWTH and the AICES Graduate Program. This publication is based in part on work supported by Award No. KUS-C1-016-04 made by King Abdullah University of Science and Technology (KAUST).
Appears in Collections:
Publications Acknowledging KAUST Support

Full metadata record

DC FieldValue Language
dc.contributor.authorBachmayr, Markusen
dc.contributor.authorDahmen, Wolfgangen
dc.contributor.authorDeVore, Ronalden
dc.contributor.authorGrasedyck, Larsen
dc.date.accessioned2016-02-25T12:42:53Zen
dc.date.available2016-02-25T12:42:53Zen
dc.date.issued2013-11-12en
dc.identifier.citationBachmayr M, Dahmen W, DeVore R, Grasedyck L (2013) Approximation of High-Dimensional Rank One Tensors. Constructive Approximation 39: 385–395. Available: http://dx.doi.org/10.1007/s00365-013-9219-x.en
dc.identifier.issn0176-4276en
dc.identifier.issn1432-0940en
dc.identifier.doi10.1007/s00365-013-9219-xen
dc.identifier.urihttp://hdl.handle.net/10754/597603en
dc.description.abstractMany real world problems are high-dimensional in that their solution is a function which depends on many variables or parameters. This presents a computational challenge since traditional numerical techniques are built on model classes for functions based solely on smoothness. It is known that the approximation of smoothness classes of functions suffers from the so-called 'curse of dimensionality'. Avoiding this curse requires new model classes for real world functions that match applications. This has led to the introduction of notions such as sparsity, variable reduction, and reduced modeling. One theme that is particularly common is to assume a tensor structure for the target function. This paper investigates how well a rank one function f(x 1,...,x d)=f 1(x 1)⋯f d(x d), defined on Ω=[0,1]d can be captured through point queries. It is shown that such a rank one function with component functions f j in W∞ r([0,1]) can be captured (in L ∞) to accuracy O(C(d,r)N -r) from N well-chosen point evaluations. The constant C(d,r) scales like d dr. The queries in our algorithms have two ingredients, a set of points built on the results from discrepancy theory and a second adaptive set of queries dependent on the information drawn from the first set. Under the assumption that a point z∈Ω with nonvanishing f(z) is known, the accuracy improves to O(dN -r). © 2013 Springer Science+Business Media New York.en
dc.description.sponsorshipThis research was supported by the Office of Naval Research Contracts ONR N00014-08-1-1113, ONR N00014-09-1-0107, and ONR N00014-11-1-0712; the AFOSR Contract FA95500910500; the NSF Grants DMS-0810869, and DMS 0915231; and the DFG Special Priority Program SPP-1324. This research was done when R. D. was a visiting professor at RWTH and the AICES Graduate Program. This publication is based in part on work supported by Award No. KUS-C1-016-04 made by King Abdullah University of Science and Technology (KAUST).en
dc.publisherSpringer Science + Business Mediaen
dc.subjectHigh-dimensional approximationen
dc.subjectQuery algorithmsen
dc.subjectRate of approximationen
dc.subjectSeparable functionsen
dc.titleApproximation of High-Dimensional Rank One Tensorsen
dc.typeArticleen
dc.identifier.journalConstructive Approximationen
dc.contributor.institutionRheinisch-Westfalische Technische Hochschule Aachen, Aachen, Germanyen
dc.contributor.institutionTexas A and M University, College Station, United Statesen
kaust.grant.numberKUS-C1-016-04en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.