Multiple point evaluation on combined tensor product supports

DOI10.1007/S11075-012-9624-4zbMATH Open1273.65021OpenAlexW2094112360MaRDI QIDQ2376366FDOQ2376366

Authors: Yanyan Li 

Publication date: 21 June 2013

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11850/60885

Recommendations

• Multi-point evaluation in higher dimensions
• Fast evaluation of system matrices w.r.t. multi-tree collections of tensor product refinable basis functions
• Fast algorithms for multivariate interpolation and evaluation at special points
• Fast evaluation of nonlinear functionals of tensor product wavelet expansions
• Fast calculation of coefficients in the Smolyak algorithm

zbMATH Keywords

adaptive sparse tensor product approximationmultiple point evaluation

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15)

Cites Work

• Title not available (Why is that?)
• Sparse adaptive finite elements for radiative transfer
• Geometric data structures for computer graphics.
• A Direct and Accurate Adaptive Semi-Lagrangian Scheme for the Vlasov-Poisson Equation

Cited In (3)

• Fast evaluation of system matrices w.r.t. multi-tree collections of tensor product refinable basis functions
• Multi-point evaluation in higher dimensions
• Approximation of function evaluation over sequence arguments via specialized data structures

This page was built for publication: Multiple point evaluation on combined tensor product supports

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376366)