Search

Your search keyword '"Pereira da Silva, Alex"' showing total 7 results
Start Over Author "Pereira da Silva, Alex"
7 results on '"Pereira da Silva, Alex"'

1. STABILITY ANALYSIS OF A DELAY DIFFERENTIAL KALDOR’S MODEL WITH GOVERNMENT POLICIES

Author

Universidad de Sevilla. Departamento de Ecuaciones Diferenciales y Análisis Numérico, Ministerio de Economía y Competitividad (MINECO). España, European Commission (EC). Fondo Europeo de Desarrollo Regional (FEDER), Junta de Andalucía, Caraballo Garrido, Tomás, Pereira da Silva, Alex, Universidad de Sevilla. Departamento de Ecuaciones Diferenciales y Análisis Numérico, Ministerio de Economía y Competitividad (MINECO). España, European Commission (EC). Fondo Europeo de Desarrollo Regional (FEDER), Junta de Andalucía, Caraballo Garrido, Tomás, and Pereira da Silva, Alex

Abstract

This paper is devoted to analyze the stability of the economy according to an extended version of Kaldor's economic growth model. We consider the role of the government and its simultaneous monetary and scal policies and we study whether or not a time delay between the recognition and the implementation of its scal policy can a ect the economic stability. Numerical simulations provide further conclusions about the long-term behavior of the four variables modeled - namely, national income, capacity of production, bonds value and money supply.

Published
2020

2. Resolubility of linear Cauchy problems on Fréchet spaces and a delayed Kaldor’s model

Author

Pereira da Silva, Alex, Caraballo Garrido, Tomás, and Universidad de Sevilla. Departamento de Ecuaciones Diferenciales y Análisis Numérico

Subjects
Delay differential equations, Ecuaciones diferenciales con retraso, Fréchetspaces, Kaldor’s model, Operadores pseudodiferenciales, Espacios de Fréchet, Pseudodifferentialoperators, Linear Cauchy problems, Modelo de Kaldor, Problemas de Cauchy lineales
Abstract

The long-run aim of this thesis is to solve delay differential equations with infinite delay of the type d dt u(t) = Au(t)+Zt −∞ u(s)k(t−s)ds+ ft,u(t) , on Fréchet spaces under an extended theory of groups of linear operators; where A is a linear operator, k(s) ⩾ 0 satisfiesR∞ 0 k(s)ds = 1 and f is a nonlinear map. In order to pursue such a goal we study a discrete delay model which explains the natural economic fluctuations considering how economic stability is affected by the role of the fiscal and monetary policies and a possible government inefficiency concerning its fiscal policy decision-making. On the other hand, we start to develop such an extended theory by considering linear Cauchy problems associated to a continuous linear operator on Fréchet spaces, for which we establish necessary and sufficient conditions for generation of a uniformly continuous group which provides the unique solution. Further consequences arises by considering pseudodifferential operators with constant coefficients defined on a particular Fréchet space of distributions, namely FL2loc, and special attention is given to the distributional solution of the heat equation on FL2loc for all time, which extends the standard solution on Hilbert spaces for positive time. El objetivo a largo plazo de esta tesis doctoral es resolver ecuaciones diferenciales de la forma d dt u(t) = Au(t)+Zt −∞ u(s)k(t−s)ds+ ft,u(t) ,en espacios de Fréchet extendiendo la teoria de grupos de operadores lineales; siendo A un operador linear, k(s)⩾0 satisfaceR∞ 0 k(s)ds = 1 y f una función no linear. Persiguiendo tal fin, estudiamos un modelo con retraso que enseña las fluctuaciones de la economía considerandocomolaestabilidadeconómicaesafectadaporlaactuacióndelgobierno,sus políticasfiscalymonetariayunaposibleineficienciadelgobiernoenloqueserefierealasu tomadedecisión.Porotrolado,damosinicioalareferidaextensióndelateoríadegrupos puesto que consideramos problemas de Cauchy lineales asociados a operadores lineales contínuos en espacios de Fréchet, para los cuales establecimos condiciones necessarias y suficientes para la generación de un grupo uniformemente contínuo en tal espacio y que proporcionelaúnicasolucióndelproblema.Consequenciasadicionalessurgencuando se considera operadores pseudodiferenciales con coeficientes constantes definidos en un particular espacio de Fréchet de distribuciones, a saber FL2loc, y una atención especial es dada a la solución distribucional de la ecuación del calor en FL2loc para todo el tiempo, la cual extiende la solución usual en espacios de Hilbert para tiempo positivo.

Published
2019

4. A Greedy Sparse Method Suitable for Spectral-Line Estimation

Author

Sahnoun, Souleymen, Comon, Pierre, Pereira Da Silva, Alex, Sahnoun, Souleymen, GIPSA - Communication Information and Complex Systems (GIPSA-CICS), Département Images et Signal (GIPSA-DIS), Grenoble Images Parole Signal Automatique (GIPSA-lab ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Grenoble Images Parole Signal Automatique (GIPSA-lab ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), and GIPSA-lab

Subjects
matching pursuit, compressive sensing, sparse approximation, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, exact recovery, spectral analysis, [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing
Abstract

Rapport interne de GIPSA-lab; This letter presents a variant of Matching Pursuit (MP) method for compressive sensing and sparse signal reconstruction. As an extension of MP, the proposed algorithm incorporates a new backward technique to maintain or replace the previous selected atoms in the case of coherent dictionaries. Computer simulations using Fourier dictionaries are conducted to show the effectiveness of the proposed method compared to some other sparse approximation methods.

Published
2016

5. Rank-1 Tensor Approximation Methods and Application to Deflation

Author

Pereira Da Silva, Alex, Comon, Pierre, De Almeida, André, GIPSA - Communication Information and Complex Systems (GIPSA-CICS), Département Images et Signal (GIPSA-DIS), Grenoble Images Parole Signal Automatique (GIPSA-lab), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Stendhal - Grenoble 3-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Stendhal - Grenoble 3-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Grenoble Images Parole Signal Automatique (GIPSA-lab), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Stendhal - Grenoble 3-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Stendhal - Grenoble 3-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS), Wireless Telecom Research Group [Fortaleza] (GTEL), Universidade Federal do Ceará = Federal University of Ceará (UFC), GIPSA-lab, European Project: 320594,EC:FP7:ERC,ERC-2012-ADG_20120216,DECODA(2013), Université Stendhal - Grenoble 3-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Stendhal - Grenoble 3-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Grenoble Images Parole Signal Automatique (GIPSA-lab), and Université Stendhal - Grenoble 3-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Stendhal - Grenoble 3-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)

Subjects
decomposition, [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, iterative deflation, blind source separation, rank-1 approximation, tensor
Abstract

Rapport interne de GIPSA-lab; Because of the attractiveness of the canonical polyadic (CP) tensor decomposition in various applications, several algorithms have been designed to compute it, but efficient ones are still lacking. Iterative deflation algorithms based on successive rank-1 approximations can be used to perform this task, since the latter are rather easy to compute. We first present an algebraic rank-1 approximation method that performs better than the standard higher-order singular value decomposition (HOSVD) for three-way tensors. Second, we propose a new iterative rank-1 approximation algorithm that improves any other rank-1 approximation method. Third, we describe a geometric framework allowing to study the convergence of deflation CP decomposition (DCPD) algorithms based on successive rank-1 approximations. A set of computer experiments then validates theoretical results and demonstrates the efficiency of DCPD algorithms compared to other ones.

Published
2015

Catalog

Books, media, physical & digital resources
See catalog results