Problems of Distance Geometry and Convex Properties of Quadratic Maps.
A.I. Barvinok (1995)
Discrete & computational geometry
Similarity:
A.I. Barvinok (1995)
Discrete & computational geometry
Similarity:
A. Florian (1986)
Discrete & computational geometry
Similarity:
A.I. Barvinok (1993)
Discrete & computational geometry
Similarity:
W. Weil, S. Campi, D. Haas (1994)
Discrete & computational geometry
Similarity:
Michael A. Bennett, Yann Bugeaud (2012)
Acta Arithmetica
Similarity:
Jean-Louis Colliot-Thélène, Fei Xu (2013)
Acta Arithmetica
Similarity:
Krzysztof B. Janiszowski (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
The paper presents a novel approach to approximation of a linear transfer function model, based on dynamic properties represented by a frequency response, e.g., determined as a result of discrete-time identification. The approximation is derived for minimization of a non-quadratic performance index. This index can be determined as an exponent or absolute norm of an error. Two algorithms for determination of the approximation coefficients are considered, a batch processing one and a recursive...
Abedallah Rababah (2016)
Open Mathematics
Similarity:
In this article, the issue of the best uniform approximation of circular arcs with parametrically defined polynomial curves is considered. The best uniform approximation of degree 2 to a circular arc is given in explicit form. The approximation is constructed so that the error function is the Chebyshev polynomial of degree 4; the error function equioscillates five times; the approximation order is four. For θ = π/4 arcs (quarter of a circle), the uniform error is 5.5 × 10−3. The numerical...
Strebel, Kurt (1993)
Annales Academiae Scientiarum Fennicae. Series A I. Mathematica
Similarity:
Olof Widlund (1977)
Publications mathématiques et informatique de Rennes
Similarity:
Heima Hayashi (2011)
Acta Arithmetica
Similarity: