Some continuous programming problems in numerical analysis
From MaRDI portal
Publication:877593
DOI10.1016/j.ejor.2005.08.032zbMath1123.90075OpenAlexW1998316606MaRDI QIDQ877593
Publication date: 3 May 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.08.032
convergence accelerationnumerical quadraturelinear functionalsemi-infinite programmingcontinuous programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
- Sequence transformations and their applications
- Algorithm 38. Two computer codes for convergence acceleration
- Extrapolation methods theory and practice
- Convergence acceleration on a general class of power series
- On summation formulas due to Plana, Lindelöf and Abel, and related Gauss-Christoffel rules. I
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- Recent contributions to linear semi-infinite optimization
- On the Convergence and Stability of the Epsilon Algorithm
- Algorithm 726: ORTHPOL–a package of routines for generating orthogonal polynomials and Gauss-type quadrature rules
- Convergence acceleration by means of numerical quadrature
- Convergence acceleration from the point of view of linear programming
- On the Maximum Errors of Polynomial Approximations Defined by Interpolation and by Least Squares Criteria
- A Method of Computing Limit Values
- What is the Laplace Transform?
This page was built for publication: Some continuous programming problems in numerical analysis