๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the linearization of the microplane model

โœ Scribed by Ellen Kuhl; Ekkehard Ramm


Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
243 KB
Volume
3
Category
Article
ISSN
1082-5010

No coin nor oath required. For personal study only.

โœฆ Synopsis


The paper addresses the microplane model in the context of localization analysis. Capable of reproducing experimental results of concrete specimens, the microplane model includes anisotropic damage in a natural and conceptually simple and explicit way. However, the efficiency of former microplane implementations suffers from the expense of the solution procedure being based on the secant stiffness method. Within this paper, the macroscopic constitutive equation derived by kinematically constraining the microplane strains to the macroscopic strain tensor is consistently linearized resulting in quadratic convergence of the Newton-Raphson iteration for the equilibrium equations. A fully three-dimensional model will be presented and linearized incorporating the two-dimensional case in a natural fashion. Furthermore, the localization criterion is analysed, indicating locally the onset of localization in terms of the acoustic tensor. Several examples demonstrate the features of the microplane model in predicting the material behaviour of concrete in tension and compression as well as in shear.


๐Ÿ“œ SIMILAR VOLUMES


On the reconstruction of linear codes
โœ Philip Maynard; Johannes Siemons ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 160 KB ๐Ÿ‘ 1 views

For a linear code over GF (q) we consider two kinds of ''subcodes'' called residuals and punctures. When does the collection of residuals or punctures determine the isomorphism class of the code? We call such a code residually or puncture reconstructible. We investigate these notions of reconstructi

On the linear arboricity of planar graph
โœ Wu, Jian-Liang ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 188 KB ๐Ÿ‘ 1 views

The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. Akiyama, Exoo, and Harary conjectured for any simple graph G with maximum degree โˆ†. The conjecture has been proved to be true for graphs having โˆ† =

Convergence and the Constant Dynamic Lin
โœ P. J. Harrison ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 121 KB ๐Ÿ‘ 1 views

It is well known that, as calculated using the Kalman ยฎlter recurrence relationships, the posterior parameter variance and the adaptive vector of observable constant dynamic linear models converge to limiting values. However, most proofs are tortuous, some have subtle errors and some relate only to

Convergence to Normality of the Asymptot
โœ Sifa Mvoi; Yan-Xia Lin ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 180 KB

The asymptotic quasi-likelihood method is considered for the model y t f t q M t ; t 0; 1; . . . ; T where f t q is a linear predictable process of the parameter of interest q, M t is a martingale difference, and the nature of EM 2 t j p tร€1 is unknown. This paper is concerned with the limiting dist