Matrix decomposition MFS algorithms
Copyright policy )Matrix decomposition MFS algorithms
We describe the application of the Method of Fundamental Solutions (MFS) to elliptic boundary value problems in rotationally symmetric problems. In particular, we show how efficient matrix decomposition MFS algorithms can be developed for such problems. The efficiency of these algorithms is optimized by using Fast Fourier Transforms (FFTs).
Sponsors: Int. Journal of Eng. Analysis with Boundary Elements (EABE)
Conference code: 69557
Cited By :1
42
61
68
- University of Cyprus Cyprus
Optimization, Boundary value problems, Problem solving, Matrix decomposition, Method of Fundamental Solutions (MFS), Elliptic boundary value problems, Matrix algebra, Algorithms, Fourier transforms
Optimization, Boundary value problems, Problem solving, Matrix decomposition, Method of Fundamental Solutions (MFS), Elliptic boundary value problems, Matrix algebra, Algorithms, Fourier transforms
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!