Premium
Some Comparisions of Least‐square and Chebyshev Approximation Techniques Applied for Synthesis of Straight‐Line Generating Mechanisms
Author(s) -
Ibrayev S. M.
Publication year - 2000
Publication title -
zamm ‐ journal of applied mathematics and mechanics / zeitschrift für angewandte mathematik und mechanik
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.449
H-Index - 51
eISSN - 1521-4001
pISSN - 0044-2267
DOI - 10.1002/zamm.20000801447
Subject(s) - chebyshev filter , chebyshev polynomials , square (algebra) , path (computing) , mathematics , line (geometry) , chebyshev pseudospectral method , chebyshev equation , approximation theory , scheme (mathematics) , chebyshev iteration , mathematical analysis , computer science , geometry , classical orthogonal polynomials , orthogonal polynomials , programming language
The experience on the application of least‐square and Chebyshev approximation (LSA and CA) based techniques for synthesis of path generating mechanisms examplified by Chebyshev's “ljambda‐mechanism” is summarized in this article.