Information-based complexity
On the average complexity of multivariate problems
Journal of Complexity
The computational complexity of differential and integral equations: an information-based approach
The computational complexity of differential and integral equations: an information-based approach
Explicit cost bounds of algorithms for multivariate tensor product problems
Journal of Complexity
Complexity and information
Weighted tensor product algorithms for linear multivariate problems
Journal of Complexity
Applicability of Smolyak's algorithms to certain banach spaces of multivariate functions
Journal of Complexity
Tractability of Approximation for Weighted Korobov Spaces on Classical and Quantum Computers
Foundations of Computational Mathematics
Lattice rule algorithms for multivariate approximation in the average case setting
Journal of Complexity
Multivariate L∞ approximation in the worst case setting over reproducing kernel Hilbert spaces
Journal of Approximation Theory
Linear information versus function evaluations for L2-approximation
Journal of Approximation Theory
Multivariate L∞ approximation in the worst case setting over reproducing kernel Hilbert spaces
Journal of Approximation Theory
New averaging technique for approximating weighted integrals
Journal of Complexity
On the approximation of smooth functions using generalized digital nets
Journal of Complexity
Tractability through increasing smoothness
Journal of Complexity
Liberating the dimension for function approximation: Standard information
Journal of Complexity
Tractability results for weighted Banach spaces of smooth functions
Journal of Complexity
On Dimension-independent Rates of Convergence for Function Approximation with Gaussian Kernels
SIAM Journal on Numerical Analysis
Hi-index | 0.00 |
For the standard symplectic forms on Jacobi and CMV matrices, we compute Poisson brackets of OPRL and OPUC, and relate these to other basic Poisson brackets and to Jacobians of basic changes of variable.