Please use this identifier to cite or link to this item: https://doi.org/10.2495/BE06008
DC FieldValue
dc.titleA meshfree minimum length method
dc.contributor.authorLiu, G.R.
dc.contributor.authorDai, K.Y.
dc.contributor.authorHan, X.
dc.date.accessioned2014-06-19T05:30:29Z
dc.date.available2014-06-19T05:30:29Z
dc.date.issued2006
dc.identifier.citationLiu, G.R., Dai, K.Y., Han, X. (2006). A meshfree minimum length method. WIT Transactions on Modelling and Simulation 42 : 69-77. ScholarBank@NUS Repository. https://doi.org/10.2495/BE06008
dc.identifier.isbn1845641647
dc.identifier.issn1743355X
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/73040
dc.description.abstractA meshfree minimum length method (MLM) has been proposed for solids mechanics and heat conduction problems. In this method, both polynomial terms as well as modified radial basis functions (RBFs) are used to construct shape functions using arbitrarily distributed nodes based on the minimum length procedure. The shape functions constructed possess delta function property. The numerical examples show that the method achieves better accuracy than the finite element method especially for problems with steep gradients. Some numerical implementation issues for MLM are also discussed in detail.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.2495/BE06008
dc.sourceScopus
dc.subjectInterpolation function
dc.subjectMeshftee method
dc.subjectMeshless method
dc.subjectMinimum length method
dc.subjectRadial basis function (RBF)
dc.typeConference Paper
dc.contributor.departmentMECHANICAL ENGINEERING
dc.contributor.departmentINSTITUTE OF ENGINEERING SCIENCE
dc.description.doi10.2495/BE06008
dc.description.sourcetitleWIT Transactions on Modelling and Simulation
dc.description.volume42
dc.description.page69-77
dc.identifier.isiut000237450600008
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.