Reduction of the computational burden of POD models with polynomial nonlinearities

This paper presents a technique for making the evaluation of POD models with polynomial nonlinearities less intensive. Regularly, Proper Orthogonal Decomposition (POD) and Galerkin projection have been employed to reduce the highdimensionality of the discretized systems used to approximate Partial Differential Equations (PDEs). Although a large modelorder reduction can be obtained with these techniques, the computational saving during simulation is small when we have to deal with nonlinear or Linear Time Variant (LTV) models. In this paper, we present a method that exploits the polynomial nature of POD models derived from input-affine high-dimensional systems with polynomial nonlinearities, for generating compact and efficient representations that can be evaluated much faster. Furthermore, we show how the use of the feature selection techniques can lead to a significant computational saving

• Autores: Agudelo Mañozca, Oscar Mauricio; Espinosa, Jairo Jose; De Moor, Bart
• Tipo de recurso: Article of journal
• Fecha de publicación: 2010
• Institución: Universidad Autónoma de Occidente
• Repositorio: RED: Repositorio Educativo Digital UAO
• Idioma: eng
• OAI Identifier: oai:red.uao.edu.co:10614/12001
• Acceso en línea: http://red.uao.edu.co//handle/10614/12001
• Palabra clave: Computational modeling; Polynomials; Mathematical model; Reduced order systems; Approximation methods
• Rights: openAccess
• License: Derechos Reservados - Universidad Autónoma de Occidente