Time-dependent behaviour of reinforced concrete slabs

In this thesis is studied the long-term behaviour of steel reinforced slabs paying particular attention to the effects due to shrinkage and creep. Despite the universal popularity of using this kind of slabs for simply construction floors, the major world codes focus their attention in a design based on the ultimate limit state, restraining the exercise limit state to a simply verification after the design. For Australia, on the contrary, this is not true. In fact, since this country is not subjected to seismic effects, the main concern is related to the long-term behaviour of the structure. Even if there are a lot of studies about long-term effects of shrinkage and creep, up to date, there are not so many studies concerning the behaviour of slabs with a cracked cross section and how shrinkage and creep influence it. For this reason, a series of ten full scale reinforced slabs was prepared and monitored under laboratory conditions to investigate this behaviour. A wide range of situations is studied in order to cover as many cases as possible, as for example the use of a fog room able to reproduce an environment of 100% humidity. The results show how there is a huge difference in terms of deflections between the case of slabs which are subjected to both shrinkage and creep effects soon after the partial cracking of the cross section, and the case of slabs which have already experienced shrinkage effects for several weeks, when the section has not still cracked, and creep effects only after the cracking.

Weighted geometric mean of large-scale matrices: numerical analysis and algorithms

Computing the weighted geometric mean of large sparse matrices is an operation that tends to become rapidly intractable, when the size of the matrices involved grows. However, if we are not interested in the computation of the matrix function itself, but just in that of its product times a vector, the problem turns simpler and there is a chance to solve it even when the matrix mean would actually be impossible to compute. Our interest is motivated by the fact that this calculation has some practical applications, related to the preconditioning of some operators arising in domain decomposition of elliptic problems. In this thesis, we explore how such a computation can be efficiently performed. First, we exploit the properties of the weighted geometric mean and find several equivalent ways to express it through real powers of a matrix. Hence, we focus our attention on matrix powers and examine how well-known techniques can be adapted to the solution of the problem at hand. In particular, we consider two broad families of approaches for the computation of f(A) v, namely quadrature formulae and Krylov subspace methods, and generalize them to the pencil case f(A\B) v. Finally, we provide an extensive experimental evaluation of the proposed algorithms and also try to assess how convergence speed and execution time are influenced by some characteristics of the input matrices. Our results suggest that a few elements have some bearing on the performance and that, although there is no best choice in general, knowing the conditioning and the sparsity of the arguments beforehand can considerably help in choosing the best strategy to tackle the problem.