The University of Southampton
University of Southampton Institutional Repository

Greedy unsymmetric collocation

Greedy unsymmetric collocation
Greedy unsymmetric collocation
We present greedy unsymmetric collocation schemes for solving linear elliptic partial differential equations using radial basis functions. The proposed approach circumvents the illconditioning problem associated with the standard collocation technique and enables the efficient solution of problems requiring a large set of collocation points. Numerical studies indicate that the accuracy of greedy algorithms incorporating shape parameter tuning can be significantly better than the standard collocation scheme.
radial basis functions, collocation, greedy algorithms
972-99289-1-6
A44.1-A44.6
DM-IST
Nair, P.B.
d4d61705-bc97-478e-9e11-bcef6683afe7
Leitão, V.M.A
Alves, C.J.S.
Duarte, C.A.
Nair, P.B.
d4d61705-bc97-478e-9e11-bcef6683afe7
Leitão, V.M.A
Alves, C.J.S.
Duarte, C.A.

Nair, P.B. (2005) Greedy unsymmetric collocation. Leitão, V.M.A, Alves, C.J.S. and Duarte, C.A. (eds.) In Proceedings of the ECCOMAS Thematic Conference on Meshless Methods. DM-IST. A44.1-A44.6 .

Record type: Conference or Workshop Item (Paper)

Abstract

We present greedy unsymmetric collocation schemes for solving linear elliptic partial differential equations using radial basis functions. The proposed approach circumvents the illconditioning problem associated with the standard collocation technique and enables the efficient solution of problems requiring a large set of collocation points. Numerical studies indicate that the accuracy of greedy algorithms incorporating shape parameter tuning can be significantly better than the standard collocation scheme.

This record has no associated files available for download.

More information

Published date: 2005
Additional Information: European Community on Computational Methods in Applied Sciences
Venue - Dates: ECCOMAS Thematic Conference on Meshless Methods, Lisbon, Portugal, 2005-07-10 - 2005-07-13
Keywords: radial basis functions, collocation, greedy algorithms

Identifiers

Local EPrints ID: 23313
URI: http://eprints.soton.ac.uk/id/eprint/23313
ISBN: 972-99289-1-6
PURE UUID: 165870f4-7c8f-435f-9b0d-3bb8d51490e4

Catalogue record

Date deposited: 24 Mar 2006
Last modified: 11 Dec 2021 14:44

Export record

Contributors

Author: P.B. Nair
Editor: V.M.A Leitão
Editor: C.J.S. Alves
Editor: C.A. Duarte

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×