Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1511.02036

Change of variable in spaces of mixed smoothness and numerical integration of multivariate functions on the unit cube

Van Kien Nguyen·Mario Ullrich·Tino Ullrich
View original source ↗Read source document ↗Export metadata ↓

Abstract

In a recent article by two of the present authors it turned out that Frolov's cubature formulae are optimal and universal for various settings (Besov-Triebel-Lizorkin spaces) of functions with dominating mixed smoothness. Those cubature formulae go well together with functions supported inside the unit cube $[0,1]^d$. The question for the optimal numerical integration of multivariate functions with non-trivial boundary data, in particular non-periodic functions, arises. In this paper we give a general result that the asymptotic rate of the minimal worst-case integration error is not affected by boundary conditions in the above mentioned spaces. In fact, we propose two tailored modifications of Frolov's cubature formulae suitable for functions supported on the cube (not in the cube) which provide the same minimal worst-case error up to a constant. This constant involves the norms of a ``change of variable'' and a ``pointwise multiplication'' mapping, respectively, between the function spaces of interest. In fact, we complement, extend and improve classical results by Bykovskii, Dubinin and Temlyakov on the boundedness of change of variable mappings in Besov-Sobolev spaces of mixed smoothness. Our proof technique relies on a new characterization via integral means of mixed differences and maximal function techniques, general enough to treat Besov and Triebel-Lizorkin spaces at once. The second modification, which only tackles the case of periodic functions, is based on a pointwise multiplication and is therefore most likely more suitable for applications than the (traditional) ``change of variable'' approach. These new theoretical insights are expected to be useful for the design of new (and robust) cubature rules for multivariate functions on the cube.

Explore related subjects

math.NAcs.NAmath.FA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Van Kien Nguyen, Mario Ullrich, Tino Ullrich. 2015-11-06. Change of variable in spaces of mixed smoothness and numerical integration of multivariate functions on the unit cube. https://doi.org/10.1007/s00365-017-9371-9

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

How many continuous measurements are needed to learn a vector?

One can recover vectors from $\mathbb{R}^m$ with arbitrary precision, using only $\lceil \log_2(m)\rceil +1$ continuous measurements that are chosen adaptively. This surprising result is explained and discussed, and we present applications to infinite-dimensional approximation problems.

math.NA↗
arXiv2026

IterativeCUR: Large Rank-Adaptive Approximation From a Small Recycled Sketch

The computation of accurate low-rank matrix approximations is central to improving the scalability of various techniques in machine learning, uncertainty quantification, and control. Traditionally, low-rank approximations are constructed using SVD-based approaches such as truncated SVD or Randomized SVD. Although these SVD approaches---especially Randomized SVD---have proven to be very computationally efficient, other low-rank approximation methods can offer even greater performance. One such approach is the CUR decomposition, which forms a low-rank approximation using direct row and column subsets of a matrix. Because CUR uses direct matrix subsets, it is also often better able to preserve native matrix structures like sparsity or non-negativity than SVD-based approaches and can facilitate data interpretation in many contexts. This paper introduces IterativeCUR, which draws on previous work in randomized numerical linear algebra to build a new algorithm that is highly competitive compared to prior work. IterativeCUR is adaptive in the sense that it takes as an input parameter the desired tolerance $ε$ and outputs (with arbitrarily high probability) an approximation of error bounded by $ε$, rather than requiring an a priori guess of the numerical rank. IterativeCUR typically runs significantly faster than both existing CUR algorithms and techniques such as Randomized SVD. Its asymptotic complexity is $\mathcal{O}(mn + (m+n)r^2)$ for an $m\times n$ matrix of output rank $r$. IterativeCUR relies on a single small sketch from the matrix that is successively downdated as the algorithm proceeds. We demonstrate through extensive experiments that IterativeCUR achieves up to $4\times$ speed-up over state-of-the-art pivoting-on-sketch approaches with no loss of accuracy, and up to $40\times$ speed-up over rank-adaptive randomized SVD approaches.

math.NA↗
arXiv2026

Multigrid with Linear Storage Complexity

As the discretization error for the solution of a partial differential equation (PDE) decreases, the precision required to store the corresponding coefficients naturally increases. Storing the solution's finite element coefficients explicitly requires $\mathcal O(n \log n)$ bits of storage, where $n$ is the number of degrees of freedom (DoFs). This paper presents a full multigrid method to compute the solution in a compressed format that reduces the storage complexity of the solution and intermediate vectors to $\mathcal O(n)$ bits. This reduction allows a matrix-free implementation to solve elliptic PDEs with an overall linear space complexity. For problems limited by the memory capacity of current supercomputers, we expect a memory footprint reduction of about an order of magnitude compared to state-of-the-art mixed-precision methods. We demonstrate the applicability of our algorithm by solving two model problems. Depending on the PDE and polynomial degree, but irrespective of the problem size, the solution vector on the finest grid requires between 4 and 12 bits per DoF, and the residual and correction require 3 to 6 bits each. Additional data is stored on the coarse grids with modestly increasing bit widths toward coarser grids.

math.NA↗