Pages that link to "Item:Q2655225"
From MaRDI portal
The following pages link to Barycentric-Remez algorithms for best polynomial approximation in the chebfun system (Q2655225):
Displaying 16 items.
- Modeling probability densities with sums of exponentials via polynomial approximation (Q495127) (← links)
- Extremal polynomials and entire functions of exponential type (Q1990802) (← links)
- Generalized operational matrices and error bounds for polynomial basis (Q1998024) (← links)
- Asymptotics of polynomial interpolation and the Bernstein constants (Q2038852) (← links)
- An algorithm for best generalised rational approximation of continuous functions (Q2158826) (← links)
- Bremmer series for the multimodal sound propagation in inhomogeneous waveguides (Q2186204) (← links)
- Generalised rational approximation and its application to improve deep learning classifiers (Q2660361) (← links)
- Rational Minimax Approximation via Adaptive Barycentric Representations (Q4580291) (← links)
- Proxy-GMRES: Preconditioning via GMRES in Polynomial Space (Q5006454) (← links)
- Padua points and fake nodes for polynomial approximation: old, new and open problems (Q5078980) (← links)
- A Robust and Scalable Implementation of the Parks-McClellan Algorithm for Designing FIR Filters (Q5270769) (← links)
- Uniformly self-justified equilibria (Q6072253) (← links)
- Bernstein-type constants for approximation of \(| x |^\alpha\) by partial Fourier-Legendre and Fourier-Chebyshev sums (Q6105852) (← links)
- Solving maxmin optimization problems via population games (Q6536843) (← links)
- Reducing the truncation error in Taylor model multiplication (Q6618230) (← links)
- Optimal estimation of Schatten norms of a rectangular matrix (Q6621525) (← links)
