Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:cs/0207015v1

Help | Advanced Search

Computer Science > Computational Engineering, Finance, and Science

arXiv:cs/0207015v1 (cs)
[Submitted on 4 Jul 2002 ]

Title: New advances in dual reciprocity and boundary-only RBF methods

Title: 双互易和仅边界径向基函数方法的新进展

Authors:W. Chen, M. Tanaka
Abstract: This paper made some significant advances in the dual reciprocity and boundary-only RBF techniques. The proposed boundary knot method (BKM) is different from the standard boundary element method in a number of important aspects. Namely, it is truly meshless, exponential convergence, integration-free (of course, no singular integration), boundary-only for general problems, and leads to symmetric matrix under certain conditions (able to be extended to general cases after further modified). The BKM also avoids the artificial boundary in the method of fundamental solution. An amazing finding is that the BKM can formulate linear modeling equations for nonlinear partial differential systems with linear boundary conditions. This merit makes it circumvent all perplexing issues in the iteration solution of nonlinear equations. On the other hand, by analogy with Green's second identity, this paper also presents a general solution RBF (GSR) methodology to construct efficient RBFs in the dual reciprocity and domain-type RBF collocation methods. The GSR approach first establishes an explicit relationship between the BEM and RBF itself on the ground of the weighted residual principle. This paper also discusses the RBF convergence and stability problems within the framework of integral equation theory.
Abstract: 本文在对偶乘法和仅边界径向基函数技术方面取得了一些重要的进展。 所提出的边界节点法(BKM)在多个重要方面与标准边界元法不同。 即,它是真正的无网格方法,具有指数收敛性,无需积分(当然,没有奇异积分),对于一般问题仅需要边界条件,并且在某些条件下会导致对称矩阵(在进一步修改后可以扩展到一般情况)。 BKM还避免了基本解法中的人工边界。 一个令人惊讶的发现是,BKM可以为具有线性边界条件的非线性偏微分系统建立线性建模方程。 这一优点使其能够避开非线性方程迭代求解中的所有复杂问题。 另一方面,通过类比格林第二恒等式,本文还提出了一种通用解径向基函数(GSR)方法,以在对偶乘法和域型径向基函数配置方法中构建高效的径向基函数。 GSR方法首先基于加权残差原理,建立了边界元法和径向基函数本身之间的显式关系。 本文还讨论了在积分方程理论框架下的径向基函数收敛性和稳定性问题。
Subjects: Computational Engineering, Finance, and Science (cs.CE) ; Computational Geometry (cs.CG)
ACM classes: G1.3, G1.8
Cite as: arXiv:cs/0207015 [cs.CE]
  (or arXiv:cs/0207015v1 [cs.CE] for this version)
  https://doi.org/10.48550/arXiv.cs/0207015
arXiv-issued DOI via DataCite
Journal reference: Proc. of BEM technique confer., Vol. 10, 17-22, Tokyo, Japan, 2000

Submission history

From: Wen Chen [view email]
[v1] Thu, 4 Jul 2002 12:10:06 UTC (354 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
view license
Current browse context:
cs.CE
< prev   |   next >
new | recent | 2002-07

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号