Efficient MFS algorithms in regular polygonal domains (Q1014364)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5547601
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient MFS algorithms in regular polygonal domains |
scientific article; zbMATH DE number 5547601 |
Statements
Efficient MFS algorithms in regular polygonal domains (English)
0 references
27 April 2009
0 references
numerical examples
0 references
circulant matrices
0 references
Laplace equation
0 references
biharmonic equation
0 references
method of fundamental solutions
0 references
fast Fourier transform
0 references
matrix decomposition algorithms
0 references
0 references
0 references
0 references
0 references
0.8569834232330322
0 references
0.8302775621414185
0 references
0.818811297416687
0 references
0.8084511756896973
0 references
0.8076165914535522
0 references
