The Bézier representation of homogenous polynomials has little and not the usual geometric meaning if we consider the graph of these polynomials over the sphere. However the graph can be seen as a rational surface and has an ordinary rational Bézier representation. As I will show, both Bézier representations are closely related. Further I consider rational spline constructions for spherical surfaces and other closed manifolds with a projective or hyperbolic structure.[-]

Tensor methods have emerged as an indispensable tool for the numerical solution of high-dimensional problems in computational science, and in particular problems arising in stochastic and parametric analyses. In many practical situations, the approximation of functions of multiple parameters (or random variables) is made computationally tractable by using low-rank tensor formats. Here, we present some results on rank-structured approximations and we discuss the connection between best approximation problems in tree-based low-rank formats and the problem of finding optimal low-dimensional subspaces for the projection of a tensor. Then, we present constructive algorithms that adopt a subspace point of view for the computation of sub-optimal low-rank approximations with respect to a given norm. These algorithms are based on the construction of sequences of suboptimal but nested subspaces.

Keywords: high dimensional problems - tensor numerical methods - projection-based model order reduction - low-rank tensor formats - greedy algorithms - proper generalized decomposition - uncertainty quantification - parametric equations[-]