Difference between revisions of "Positioning of computational nodes"
| Line 3: | Line 3: | ||
We want to form set of algorithms that can cover our arbitrary domain in n dimensions. First set of algorithms deals with filling the domain with nodes. Second set is denoted to improving of the nodal distributions and a last set of algorithms deals with the refinement of the nodal distribution. | We want to form set of algorithms that can cover our arbitrary domain in n dimensions. First set of algorithms deals with filling the domain with nodes. Second set is denoted to improving of the nodal distributions and a last set of algorithms deals with the refinement of the nodal distribution. | ||
| − | + | ||
| + | = Filling the domain with nodes = | ||
| + | |||
*[[Relax|Relaxation of the nodal distribution]] | *[[Relax|Relaxation of the nodal distribution]] | ||
*[[Refinement|More details on refinement of the nodal distribution]] | *[[Refinement|More details on refinement of the nodal distribution]] | ||
Revision as of 20:22, 15 January 2018
Although the meshless methods do not require any topological relations between nodes and even randomly distributed nodes could be used, it is well-known that using regularly distributed nodes leads to more accurate and more stable results. So despite meshless seeming robustness regarding the nodal distribution, a certain effort has to be invested into the positioning of the nodes and following discussion, to some extent, deals with this problem.
We want to form set of algorithms that can cover our arbitrary domain in n dimensions. First set of algorithms deals with filling the domain with nodes. Second set is denoted to improving of the nodal distributions and a last set of algorithms deals with the refinement of the nodal distribution.
