Cultural capital and demand

In this paper we develop a theoretical model that investigates the demand for cultural goods under the assumption of cultural capital and rational addiction. We also consider the effect of a policy intervention in order to raise the initial stock of cultural capital of a given individual, both on individual demand and on supply. Finally, we discuss on the effectiveness of such policies by translating our model to a dynamic framework.cultural capital

A domain decomposing parallel sparse linear system solver

The solution of large sparse linear systems is often the most time-consuming part of many science and engineering applications. Computational fluid dynamics, circuit simulation, power network analysis, and material science are just a few examples of the application areas in which large sparse linear systems need to be solved effectively. In this paper we introduce a new parallel hybrid sparse linear system solver for distributed memory architectures that contains both direct and iterative components. We show that by using our solver one can alleviate the drawbacks of direct and iterative solvers, achieving better scalability than with direct solvers and more robustness than with classical preconditioned iterative solvers. Comparisons to well-known direct and iterative solvers on a parallel architecture are provided.Comment: To appear in Journal of Computational and Applied Mathematic

Demand for Cultural Heritage

Prepared for the Handbook of the Economics of Cultural Heritage. Forthcoming in Edgard Elgar Publisher. Anna Mignosa and Ilde Rizzo (editors)cultural economics, demand, cultural heritage, participation in the arts, SPPA2008

Computational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis

The multi-frontal direct solver is the state of the art for the direct solution of linear systems. This paper provides computational complexity and memory usage estimates for the application of the multi-frontal direct solver algorithm on linear systems resulting from p finite elements. Specifically we provide the estimates for systems resulting from C0 polynomial spaces spanned by B-splines. The structured grid and uniform polynomial order used in isogeometric meshes simplifies the analysis. © 2011 Published by Elsevier Ltd

PT-Scotch: A tool for efficient parallel graph ordering

The parallel ordering of large graphs is a difficult problem, because on the one hand minimum degree algorithms do not parallelize well, and on the other hand the obtainment of high quality orderings with the nested dissection algorithm requires efficient graph bipartitioning heuristics, the best sequential implementations of which are also hard to parallelize. This paper presents a set of algorithms, implemented in the PT-Scotch software package, which allows one to order large graphs in parallel, yielding orderings the quality of which is only slightly worse than the one of state-of-the-art sequential algorithms. Our implementation uses the classical nested dissection approach but relies on several novel features to solve the parallel graph bipartitioning problem. Thanks to these improvements, PT-Scotch produces consistently better orderings than ParMeTiS on large numbers of processors

Forecasting accuracy of behavioural models for participation in the arts

A first version of this paper was presented at the University of Catania, 2011 and at the fifth European Workshop on Applied Cultural Economics in Dublin, 2011.forecasting, count data, prediction intervals, Brier scores, bootstrapping, arts