Efficient Kansa-type MFS algorithm for elliptic problems.
Andreas KarageorghisPublished in: Numer. Algorithms (2010)
Keyphrases
- single pass
- benchmark problems
- preprocessing
- experimental evaluation
- dynamic programming
- times faster
- optimization algorithm
- np hard
- optimal solution
- improved algorithm
- simulated annealing
- computationally feasible
- highly efficient
- search space
- computational complexity
- computational cost
- particle swarm optimization
- expectation maximization
- computationally efficient
- learning algorithm
- test problems
- theoretical guarantees
- input data
- detection algorithm
- high accuracy
- worst case
- cost function
- significant improvement
- incremental algorithms
- optimal or near optimal
- computational geometry
- iterative algorithms
- efficient solutions
- space complexity
- convergence rate
- constraint satisfaction problems
- multi objective
- similarity measure