145 resultados para transport equations
Resumo:
We prove global well-posedness in the strong sense for stochastic generalized porous media equations driven by locally square integrable martingales with stationary independent increments.
Resumo:
Scholars and local planners are increasingly interested in tourism contribution to economic and social development. To this regard, several European cities lead the world rankings on tourist arrivals, and their governments have promoted tourism activity. Mobility is an essential service for tourists visiting large cities, since it is a crucial factor for their comfort. In addition, it facilitates the spread of benefits across the city. The aim of this study is to determine whether city planners respond to this additional urban transport demand pressure by extending supply services. We use an international database of European cities. Our results confirm that tourism intensity is a demand enhancing factor on urban transport. Contrarily, cities do not seem to address this pressure by increasing service supply. This suggests that tourism exerts a positive externality on public transport since it provides additional funding for these services, but it imposes as well external costs on resident users because of congestion given supply constraints.
Resumo:
Suburbanization is changing the urban spatial structure and less monocentric metropolitan regions are becoming the new urban reality. Focused only on centers, most works have studied these spatial changes neglecting the role of transport infrastructure and its related location model, the “accessibility city”, in which employment and population concentrate in low-density settlements and close to transport infrastructure. For the case of Barcelona, we consider this location model and study the population spatial structure between 1991 and 2006. The results reveal a mix between polycentricity and the accessibility city, with movements away from the main centers, but close to the transport infrastructure.
Resumo:
We present a new a-priori estimate for discrete coagulation fragmentation systems with size-dependent diffusion within a bounded, regular domain confined by homogeneous Neumann boundary conditions. Following from a duality argument, this a-priori estimate provides a global L2 bound on the mass density and was previously used, for instance, in the context of reaction-diffusion equations. In this paper we demonstrate two lines of applications for such an estimate: On the one hand, it enables to simplify parts of the known existence theory and allows to show existence of solutions for generalised models involving collision-induced, quadratic fragmentation terms for which the previous existence theory seems difficult to apply. On the other hand and most prominently, it proves mass conservation (and thus the absence of gelation) for almost all the coagulation coefficients for which mass conservation is known to hold true in the space homogeneous case.
Resumo:
"Vegeu el resum a l'inici del document del fitxer adjunt."
Resumo:
Transport costs in address models of differentiation are usually modeled as separable of the consumption commodity and with a parametric price. However, there are many sectors in an economy where such modeling is not satisfactory either because transportation is supplied under oligopolistic conditions or because there is a difference (loss) between the amount delivered at the point of production and the amount received at the point of consumption. This paper is a first attempt to tackle these issues proposing to study competition in spatial models using an iceberg-like transport cost technology allowing for concave and convex melting functions.
Resumo:
We describe an algorithm that computes explicit models of hyperelliptic Shimura curves attached to an indefinite quaternion algebra over Q and Atkin-Lehner quotients of them. It exploits Cerednik-Drinfeld’s nonarchimedean uniformisation of Shimura curves, a formula of Gross and Zagier for the endomorphism ring of Heegner points over Artinian rings and the connection between Ribet’s bimodules and the specialization of Heegner points, as introduced in [21]. As an application, we provide a list of equations of Shimura curves and quotients of them obtained by our algorithm that had been conjectured by Kurihara.
Stabilized Petrov-Galerkin methods for the convection-diffusion-reaction and the Helmholtz equations
Resumo:
We present two new stabilized high-resolution numerical methods for the convection–diffusion–reaction (CDR) and the Helmholtz equations respectively. The work embarks upon a priori analysis of some consistency recovery procedures for some stabilization methods belonging to the Petrov–Galerkin framework. It was found that the use of some standard practices (e.g. M-Matrices theory) for the design of essentially non-oscillatory numerical methods is not feasible when consistency recovery methods are employed. Hence, with respect to convective stabilization, such recovery methods are not preferred. Next, we present the design of a high-resolution Petrov–Galerkin (HRPG) method for the 1D CDR problem. The problem is studied from a fresh point of view, including practical implications on the formulation of the maximum principle, M-Matrices theory, monotonicity and total variation diminishing (TVD) finite volume schemes. The current method is next in line to earlier methods that may be viewed as an upwinding plus a discontinuity-capturing operator. Finally, some remarks are made on the extension of the HRPG method to multidimensions. Next, we present a new numerical scheme for the Helmholtz equation resulting in quasi-exact solutions. The focus is on the approximation of the solution to the Helmholtz equation in the interior of the domain using compact stencils. Piecewise linear/bilinear polynomial interpolation are considered on a structured mesh/grid. The only a priori requirement is to provide a mesh/grid resolution of at least eight elements per wavelength. No stabilization parameters are involved in the definition of the scheme. The scheme consists of taking the average of the equation stencils obtained by the standard Galerkin finite element method and the classical finite difference method. Dispersion analysis in 1D and 2D illustrate the quasi-exact properties of this scheme. Finally, some remarks are made on the extension of the scheme to unstructured meshes by designing a method within the Petrov–Galerkin framework.
Resumo:
We study preconditioning techniques for discontinuous Galerkin discretizations of isotropic linear elasticity problems in primal (displacement) formulation. We propose subspace correction methods based on a splitting of the vector valued piecewise linear discontinuous finite element space, that are optimal with respect to the mesh size and the Lamé parameters. The pure displacement, the mixed and the traction free problems are discussed in detail. We present a convergence analysis of the proposed preconditioners and include numerical examples that validate the theory and assess the performance of the preconditioners.
Resumo:
Desenvolupament d'un Sistema d'Informació Geogràfica (SIG), que permeti analitzar les funcions dels jaciments romans de la zona del riu Llobregat i consultar els jaciments, emmagatzemats en una base de dades de forma espacial.
Resumo:
Quantitatively assessing the importance or criticality of each link in a network is of practical value to operators, as that can help them to increase the network's resilience, provide more efficient services, or improve some other aspect of the service. Betweenness is a graph-theoretical measure of centrality that can be applied to communication networks to evaluate link importance. However, as we illustrate in this paper, the basic definition of betweenness centrality produces inaccurate estimations as it does not take into account some aspects relevant to networking, such as the heterogeneity in link capacity or the difference between node-pairs in their contribution to the total traffic. A new algorithm for discovering link centrality in transport networks is proposed in this paper. It requires only static or semi-static network and topology attributes, and yet produces estimations of good accuracy, as verified through extensive simulations. Its potential value is demonstrated by an example application. In the example, the simple shortest-path routing algorithm is improved in such a way that it outperforms other more advanced algorithms in terms of blocking ratio
Resumo:
Aquest projecte es centra en la realització d’un estudi de la mobilitat en diferents xarxes de transport públic. En particular, aquest estudi pretén ser una anàlisi comparativa de conceptes relacionats amb la topologia i navegabilitat de xarxes de metro de diferents països des d’un punt de vista innovador, tot realitzant una aproximació interdisciplinària a l’anàlisi de les xarxes.Es tracta d’un estudi centrat sobretot en conceptes i mètodes desenvolupats últimament en el camps de les Xarxes Complexes i de la Teoria de la Informació. Això ens ha permès focalitzar les nostres conclusions en les mesures de navegabilitat de les diferents xarxes així com en els paràmetres topològics que ens les defineixen, sense basar-nos en dades geogràfiques ni operatives. Els sistemes de metro estudiats en el present treball són els de Barcelona, Moscou, París i Nova York. Són sistemes que s’han desenvolupat en ambients històrics i culturals molt diversos fet que pot donar lloc a veure si aquesta circumstància és causant de diferències estructurals i de funcionament entre ells o bési pel contrari segueixen uns patrons de comportament semblants