Optimization via Chebyshev polynomials
DOI10.1007/s12190-016-1076-xzbMath1386.65156arXiv1603.00863OpenAlexW3098848238MaRDI QIDQ1743371
Publication date: 13 April 2018
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.00863
Chebyshev polynomialspseudospectral methodline searchadaptivedifferentiation matrixone-dimensional optimization
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Numerical interpolation (65D05)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving boundary value problems, integral, and integro-differential equations using Gegenbauer integration matrices
- A method for numerical integration on an automatic computer
- Optimal Gegenbauer quadrature over arbitrary integration nodes
- Improving the accuracy of the matrix differentiation method for arbitrary collocation points
- On the computation of high order pseudospectral derivatives
- A new robust line search technique based on Chebyshev polynomials
- Fast, accurate, and small-scale direct trajectory optimization using a Gegenbauer transcription method
- Higher order pseudospectral differentiation matrices
- High-order numerical solution of second-order one-dimensional hyperbolic telegraph equation using a shifted Gegenbauer pseudospectral method
- Implementing Spectral Methods for Partial Differential Equations
- From Electrostatics to Almost Optimal Nodal Sets for Polynomial Interpolation in a Simplex
- Spectral Differencing with a Twist
- Zeros of linear combinations of orthogonal polynomials
- Roots of Polynomials Expressed in Terms of Orthogonal Polynomials
This page was built for publication: Optimization via Chebyshev polynomials