On theoretical and numerical aspects of symplectic Gram-Schmidt-like algorithms.
Ahmed SalamPublished in: Numer. Algorithms (2005)
Keyphrases
- theoretical analysis
- data structure
- recently developed
- times faster
- machine learning algorithms
- benchmark datasets
- orders of magnitude
- exact and approximate
- significant improvement
- np complete
- learning algorithm
- computationally efficient
- memory requirements
- sensitivity analysis
- upper bound
- np hard
- artificial neural networks
- computational complexity
- search engine