Uniformly exponentially stable approximations for a class of damped systems
We consider time semi-discrete approximations of a class of exponentially stable infinite-dimensional systems modeling, for instance, damped vibrations. It has recently been proved that for time semi-discrete systems, due to high frequency spurious components, the exponential decay property may be l...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2009 |
| País: | España |
| Institución: | Basque Center for Applied Mathematics (BCAM) |
| Repositorio: | BIRD. BCAM's Institutional Repository Data |
| OAI Identifier: | oai:bird.bcamath.org:20.500.11824/504 |
| Acceso en línea: | http://hdl.handle.net/20.500.11824/504 |
| Access Level: | acceso abierto |
| Palabra clave: | Damped systems Stabilization Time semi-discretizations |
| Sumario: | We consider time semi-discrete approximations of a class of exponentially stable infinite-dimensional systems modeling, for instance, damped vibrations. It has recently been proved that for time semi-discrete systems, due to high frequency spurious components, the exponential decay property may be lost as the time step tends to zero. We prove that adding a suitable numerical viscosity term in the numerical scheme, one obtains approximations that are uniformly exponentially stable. This result is then combined with previous ones on space semi-discretizations to derive similar results on fully-discrete approximation schemes. Our method is mainly based on a decoupling argument of low and high frequencies, the low frequency observability property for time semi-discrete approximations of conservative linear systems and the dissipativity of the numerical viscosity on the high frequency components. Our methods also allow to deal directly with stabilization properties of fully discrete approximation schemes without numerical viscosity, under a suitable CFL type condition on the time and space discretization parameters. © 2008 Elsevier Masson SAS. All rights reserved. |
|---|