\(L^{\infty}\) estimation of tensor truncations (Q380326): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
Tensor truncation techniques are based on singular value decompositions. They are often advisable to approximate multivariate (grid) functions by appropriate tensor formats in order to perform inexpensive point-wise evaluations that require error estimates. Due to the huge dimensions of the tensor spaces, a direct estimate is difficult. In this paper, the author proves that, in cases where the function to be approximated is smooth, reasonable error estimates can be derived from the Gagliardo-Nirenberg inequality because of the special nature of the singular value decomposition truncation. | |||
Property / review text: Tensor truncation techniques are based on singular value decompositions. They are often advisable to approximate multivariate (grid) functions by appropriate tensor formats in order to perform inexpensive point-wise evaluations that require error estimates. Due to the huge dimensions of the tensor spaces, a direct estimate is difficult. In this paper, the author proves that, in cases where the function to be approximated is smooth, reasonable error estimates can be derived from the Gagliardo-Nirenberg inequality because of the special nature of the singular value decomposition truncation. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Reginald P. Tewarson / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65F20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 15A69 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 15A18 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6226643 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
tensor truncation | |||
Property / zbMATH Keywords: tensor truncation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
singular value decomposition | |||
Property / zbMATH Keywords: singular value decomposition / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
error estimate | |||
Property / zbMATH Keywords: error estimate / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Gagliardo-Nirenberg inequality | |||
Property / zbMATH Keywords: Gagliardo-Nirenberg inequality / rank | |||
Normal rank |
Revision as of 11:36, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | \(L^{\infty}\) estimation of tensor truncations |
scientific article |
Statements
\(L^{\infty}\) estimation of tensor truncations (English)
0 references
13 November 2013
0 references
Tensor truncation techniques are based on singular value decompositions. They are often advisable to approximate multivariate (grid) functions by appropriate tensor formats in order to perform inexpensive point-wise evaluations that require error estimates. Due to the huge dimensions of the tensor spaces, a direct estimate is difficult. In this paper, the author proves that, in cases where the function to be approximated is smooth, reasonable error estimates can be derived from the Gagliardo-Nirenberg inequality because of the special nature of the singular value decomposition truncation.
0 references
tensor truncation
0 references
singular value decomposition
0 references
error estimate
0 references
Gagliardo-Nirenberg inequality
0 references