Searching globally optimal parameter sequence for defeating Runge phenomenon by immunity genetic algorithm
From MaRDI portal
Publication:1659632
DOI10.1016/J.AMC.2015.04.069zbMATH Open1410.90270OpenAlexW232862978MaRDI QIDQ1659632FDOQ1659632
Publication date: 22 August 2018
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.04.069
Recommendations
- Defeating the Runge phenomenon for equispaced polynomial interpolation via Tikhonov regularization
- Divergence (Runge phenomenon) for least-squares polynomial approximation on an equispaced grid and mock-Chebyshev subset interpolation
- A simple regularization of the polynomial interpolation for the resolution of the Runge phenomenon
- A kind of \(C^{n+k}\) polynomial interpolation with least-squares errors
- The Runge phenomenon and spatially variable shape parameters in RBF interpolation
Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59) Numerical interpolation (65D05)
Cites Work
- Mersenne twister
- Title not available (Why is that?)
- Title not available (Why is that?)
- Practical Genetic Algorithms
- Improved immune algorithm for global numerical optimization and job-shop scheduling problems
- Impossibility of Fast Stable Approximation of Analytic Functions from Equispaced Samples
- A Stable Algorithm for Flat Radial Basis Functions on a Sphere
- On the Gibbs Phenomenon and Its Resolution
- Title not available (Why is that?)
- Polynomials and Potential Theory for Gaussian Radial Basis Function Interpolation
- Divergence (Runge phenomenon) for least-squares polynomial approximation on an equispaced grid and mock-Chebyshev subset interpolation
- Chebyshev interpolation with approximate nodes of unrestricted multiplicity
- Integrating particle swarm optimization with genetic algorithms for solving nonlinear optimization problems
- Adaptive quadrature -- Revisited
- On the Runge Example
- Exponentially-convergent strategies for defeating the Runge phenomenon for the approximation of non-periodic functions. II: Multi-interval polynomial schemes and multidomain Chebyshev interpolation
- Evolutionary design by computers
- Bounds for polynomials with a unit discrete norm
- Trouble with Gegenbauer reconstruction for defeating Gibbs' phenomenon: Runge phenomenon in the diagonal limit of Gegenbauer polynomial approximations
- A hybrid Fourier-Chebyshev method for partial differential equations
- Defeating the Runge phenomenon for equispaced polynomial interpolation via Tikhonov regularization
- IGA-based point cloud fitting using B-spline surfaces for reverse engineering
- Title not available (Why is that?)
- Exponentially accurate Runge-free approximation of non-periodic functions from samples on an evenly spaced grid
- Visualization of curvature plots and evaluation of fairness: an analysis of the effect of `scaling'
Uses Software
This page was built for publication: Searching globally optimal parameter sequence for defeating Runge phenomenon by immunity genetic algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1659632)
