Computation of best \(L^{\infty }\) exponential sums for \(1 / x\) by Remez' algorithm
From MaRDI portal
Publication:6163771
DOI10.1007/s00791-018-00308-4OpenAlexW2778567917MaRDI QIDQ6163771
Publication date: 30 June 2023
Published in: Computing and Visualization in Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00791-018-00308-4
Related Items (6)
Numerical approximation of Poisson problems in long domains ⋮ Exact reconstruction of extended exponential sums using rational approximation of their Fourier coefficients ⋮ A low-rank isogeometric solver based on Tucker tensors ⋮ Interpolation by generalized exponential sums with equal weights ⋮ Modifications of Prony's method for the recovery and sparse approximation with generalized exponential sums ⋮ Functional Tucker Approximation Using Chebyshev Interpolation
Cites Work
- Unnamed Item
- Approximation of \(1/\| x-y \|\) by exponentials for wavelet applications
- Vorlesung über Approximationstheorie
- On the Remez algorithm for non-linear families
- Hierarchical Matrices: Algorithms and Analysis
- Tensor Spaces and Numerical Tensor Calculus
- On the efficient computation of high-dimensional integrals and the approximation by exponential sums
- On Least Squares Exponential Sum Approximation With Positive Coefficients
- Least Squares Approximation of Completely Monotonic Functions by Sums of Exponentials
- Chebyshev Approximation of Completely Monotonic Functions by Sums of Exponentials
- An Introduction to Numerical Analysis
- On Fitting Exponentials by Nonlinear Least Squares
- Approximation of 1/x by exponential sums in [1, ∞)
This page was built for publication: Computation of best \(L^{\infty }\) exponential sums for \(1 / x\) by Remez' algorithm
