A note on Wall's modification of the Schur algorithm and linear pencils of Jacobi matrices.
Maxim S. DerevyaginPublished in: J. Approx. Theory (2017)
Keyphrases
- convergence rate
- optimization algorithm
- cost function
- k means
- significant improvement
- closed form
- objective function
- times faster
- computational complexity
- improved algorithm
- detection algorithm
- dynamic programming
- linear complexity
- worst case
- computational cost
- search space
- iterative algorithms
- pseudo inverse
- convex optimization
- clustering method
- input data
- high accuracy
- preprocessing