Domain decomposition algorithms for mixed methods for second-order elliptic problems.
Zhangxin ChenRichard E. EwingRaytcho D. LazarovPublished in: Math. Comput. (1996)
Keyphrases
- methods can be applied
- problems in computer vision
- difficult problems
- methods outperform
- search methods
- heuristic methods
- computational cost
- decomposition methods
- computational challenges
- computationally expensive
- benchmark datasets
- practical problems
- numerical methods
- alternative methods
- methods require
- optimization problems
- exact and approximate
- small data sets
- huge data sets
- optimization methods
- specific problems
- structured prediction problems
- benchmark problems
- significant improvement
- domain independent
- computationally efficient
- data mining
- computationally demanding
- preprocessing
- worst case
- theoretical guarantees
- combinatorial optimization
- synthetic and real datasets
- dynamical systems
- complex domains
- computationally intensive
- partial solutions
- machine learning methods
- greedy algorithms
- convergence analysis
- statistical methods
- data structure
- constrained problems
- optimal solution
- objective function
- decision trees
- data mining tasks