The Complexity of Linear Tensor Product Problems in (Anti-) Symmetric Hilbert Spaces

Details The Complexity of Linear Tensor Product Problems in (Anti-) Symmetric Hilbert Spaces The Complexity of Linear Tensor Product Problems in (Anti-) Symmetric Hilbert Spaces

2011-10-31

arxiv.org/abs/1111.0057v1

Mathematics

Numerical Analysis

Extended version (52 pages)

Scientific paper

We study linear problems defined on tensor products of Hilbert spaces with an additional (anti-) symmetry property. We construct a linear algorithm that uses finitely many continuous linear functionals and show an explicit formula for its worst case error in terms of the singular values of the univariate problem. Moreover, we show that this algorithm is optimal with respect to a wide class of algorithms and investigate its complexity. We clarify the influence of different (anti-) symmetry conditions on the complexity, compared to the classical unrestricted problem. In particular, for symmetric problems we give characterizations for polynomial tractability and strong polynomial tractability in terms of the amount of the assumed symmetry. Finally, we apply our results to the approximation problem of solutions of the electronic Schr\"odinger equation.

Affiliated with

Also associated with

No associations

Rating

The Complexity of Linear Tensor Product Problems in (Anti-) Symmetric Hilbert Spaces does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Complexity of Linear Tensor Product Problems in (Anti-) Symmetric Hilbert Spaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Complexity of Linear Tensor Product Problems in (Anti-) Symmetric Hilbert Spaces will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-466772