Efficient multiple time-stepping algorithms of higher order.
Abdullah DemirelJens NiegemannKurt BuschMarlis HochbruckPublished in: J. Comput. Phys. (2015)
Keyphrases
- higher order
- computationally efficient
- computationally expensive
- theoretical analysis
- data structure
- orders of magnitude
- computationally intensive
- computationally complex
- efficient implementation
- learning algorithm
- worst case
- computational complexity
- highly efficient
- complexity analysis
- computational cost
- recently developed
- feature selection
- parallel architectures
- computationally demanding
- database