Analysis of non-overlapping domain decomposition algorithms with inexact solves.
James H. BrambleJoseph E. PasciakApostol T. VassilevPublished in: Math. Comput. (1998)
Keyphrases
- computational cost
- recently developed
- computationally efficient
- theoretical analysis
- domain specific
- significant improvement
- orders of magnitude
- statistical analysis
- computationally expensive
- times faster
- multiscale
- case study
- image processing
- databases
- neural network
- decomposition method
- computational efficiency
- worst case
- np hard
- computational complexity
- learning algorithm
- information retrieval