Efficient Trefftz collocation algorithms for elliptic problems in circular domains.
Andreas KarageorghisPublished in: Numer. Algorithms (2013)
Keyphrases
- optimization problems
- computationally efficient
- np hard problems
- highly efficient
- benchmark problems
- computationally expensive
- problems in computer vision
- efficient solutions
- computationally intensive
- test problems
- real world
- exact and approximate
- practical problems
- efficient implementation
- application domains
- search methods
- computationally complex
- convex optimization problems
- data sets
- computational problems
- data structure
- related problems
- heuristic methods
- orders of magnitude
- machine learning algorithms
- tunable parameters
- huge data sets
- combinatorial optimization
- run times
- planning problems
- parallel architectures
- learning algorithm
- computational geometry
- exact algorithms
- objective function
- theoretical analysis
- continuous domains
- complex domains
- significant improvement
- worst case