2020
DOI: 10.2495/cmem-v8-n4-289-315
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of two algorithms for locating computational nodes in the complex variable boundary element method (CVBEM)

Abstract: In this paper, we introduce a new node positioning algorithm (NPA) for determining suitable locations of the computational nodes that are a typical feature of mesh reduction numerical methods for partial differential equations-specifically, the Complex Variable Boundary Element Method (CVBEM). The novelty of the introduced NPA is a 'position refinement' procedure, which facilitates the relocation of nodes that are already being used in the current CVBEM model when such relocation reduces the maximum error of t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(14 citation statements)
references
References 19 publications
(29 reference statements)
0
9
0
Order By: Relevance
“…On the other hand, only a subset of the boundary data are used in the collocation approach. The refinement decision refers to the distinction between NPAs 1 and 2, as defined in [8]. When nodal position refinement is used, the algorithm is referred to as NPA2.…”
Section: The Collocation Approachmentioning
confidence: 99%
See 4 more Smart Citations
“…On the other hand, only a subset of the boundary data are used in the collocation approach. The refinement decision refers to the distinction between NPAs 1 and 2, as defined in [8]. When nodal position refinement is used, the algorithm is referred to as NPA2.…”
Section: The Collocation Approachmentioning
confidence: 99%
“…Additionally, Tikhonov regularization can improve the condition of the matrix A, which may lead to more numerically stable solutions for the coefficients. The improved conditioning is a consequence of pre-pending a scalar multiple of the identity matrix on top of the standard least squares matrix, as indicated in eqn (8). That is, the lower N B rows of the matrix equation in eqn (8) are exactly the same as in eqn ( 5), but the first 2n rows are a scalar multiple of the identity matrix.…”
Section: The Least Squares Adpproachmentioning
confidence: 99%
See 3 more Smart Citations