A tensor approximation method based on ideal minimal residual formulations for the solution of high-dimensional problems ∗ [PDF]
In this paper, we propose a method for the approximation of the solution of high- dimensional weakly coercive problems formulated in tensor spaces using low-rank approximation for- mats.
Marie Billaud-Friess, A. Nouy, O. Zahm
semanticscholar +1 more source
On the two-dimensional rotational body of maximal Newtonian resistance [PDF]
We investigate, by means of computer simulations, shapes of nonconvex bodies that maximize resistance to their motion through a rarefied medium, considering that bodies are moving forward and at the same time slowly rotating.
A Yu Plakhov +11 more
core +2 more sources
Polynomial spline collocation methods for second‐order Volterra integrodifferential equations
We have presented a method for the construction of an approximation to the initial‐value second‐order Volterra integrodifferential equation (VIDE). The polynomial spline collocation methods described here give a superconvergence to the solution of the equation.
Edris Rawashdeh +2 more
wiley +1 more source
Tensor product approximations of high dimensional potentials [PDF]
The paper is devoted to the efficient computation of high-order cubature formulas for volume potentials obtained within the framework of approximate approximations. We combine this approach with modern methods of structured tensor product approximations.
Lanzara, Flavia +2 more
core +3 more sources
PIS for n‐coupled nonlinear systems
A numerical algorithm dealing with solutions of equations with one variable may not be extended to solve nonlinear systems with n unknowns. Even when such extensions are possible, properties of these two similar algorithms are, in general, different.
S. K. Dey
wiley +1 more source
Rate of Convergence and Tractability of the Radial Function Approximation Problem [PDF]
This article studies the problem of approximating functions belonging to a Hilbert space Hd with an isotropic or anisotropic Gaussian reproducing kernel, Kd(x, t) = exp ( − d ∑ l=1 γ l (xl − tl)2 ) for all x, t ∈ R.
G. Fasshauer +2 more
semanticscholar +1 more source
Modifications of the continuation method for the solution of systems of nonlinear equations
Modifications are proposed to the Davidenko‐Broyden algorithm for the solution of a system of nonlinear equations. The aim of the modifications is to reduce the overall number of function evaluations by limiting the number of function evaluations for any one subproblem. To do this alterations are made to the strategy used in determining the subproblems
G. R. Lindfield, D. C. Simpson
wiley +1 more source
Partition of unity interpolation using stable kernel-based techniques [PDF]
In this paper we propose a new stable and accurate approximation technique which is extremely effective for interpolating large scattered data sets.
Cavoretto, R. +4 more
core +1 more source
On best rank one approximation of tensors [PDF]
In this paper we suggest a new algorithm for the computation of a best rank one approximation of tensors, called alternating singular value decomposition.
Cartwright +9 more
core +3 more sources
Quantum (q, h)-Bézier surfaces based on bivariate (q, h)-blossoming
We introduce the (q, h)-blossom of bivariate polynomials, and we define the bivariate (q, h)-Bernstein polynomials and (q, h)-Bézier surfaces on rectangular domains using the tensor product.
Jegdić Ilija +2 more
doaj +1 more source

