A technique for generating adapted discretizations to solve partial differential equations with the generalized finite difference method.
[EN]The generalized finite difference method is a meshless method for solving partial differential equations that allows arbitrary discretizations of points. Typically, the discretizations have the same density of points in the domain. We propose a technique to get adapted discretizations for the so...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2022 |
| País: | España |
| Institución: | Universidad de Salamanca (USAL) |
| Repositorio: | GREDOS. Repositorio Institucional de la Universidad de Salamanca |
| OAI Identifier: | oai:gredos.usal.es:10366/156365 |
| Acceso en línea: | http://hdl.handle.net/10366/156365 |
| Access Level: | acceso abierto |
| Palabra clave: | Adapted discretization Fourth-order approximations Generalized finite difference method 12 Matemáticas |
| Sumario: | [EN]The generalized finite difference method is a meshless method for solving partial differential equations that allows arbitrary discretizations of points. Typically, the discretizations have the same density of points in the domain. We propose a technique to get adapted discretizations for the solution of partial differential equations. This strategy allows using a smaller number of points and, therefore, a lower computational cost, to achieve the same accuracy that would be obtained with a regular discretization. |
|---|