An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages.
Stephane RedonMing C. LinPublished in: Comput. Aided Des. (2006)
Keyphrases
- linear complexity
- times faster
- detection algorithm
- computationally intensive
- approximation ratio
- k means
- improved algorithm
- computational cost
- experimental evaluation
- dynamic programming
- search space
- preprocessing
- computational complexity
- neural network
- error function
- approximation algorithms
- error bounds
- closed form
- error rate
- computationally efficient
- linear programming
- cost function
- polynomial time approximation
- error tolerance
- minimum error
- approximation error
- prediction error
- expectation maximization
- data structure
- similarity measure
- learning algorithm