𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient computational algorithms for forward and backward analysis of a dynamic pavement system

✍ Scribed by Robert Y. Liang; J.X. Zhu

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
477 KB
Volume
69
Category
Article
ISSN
0045-7949

No coin nor oath required. For personal study only.

✦ Synopsis

A simple dynamic analysis algorithm is presented in this paper for both forward and backward calculations of a pavement system consisting of an asphalt concrete layer, underlain by a uniform subgrade to a depth H wherein the bedrock is located. The subgrade soil is represented by a higher-order continuum modelÐthe modi®ed Vlasov model. The asphalt concrete layer is represented by a three-parameter complex compliance function in a frequency domain. The governing equations of the dynamic pavement system, along with the solution algorithms for both forward and backward computations, are presented in detail. A numerical example is provided to illustrate the importance of considering dynamic eect in predicting pavement response under dynamic load. In addition, numerical examples are given to demonstrate the use of nondestructive testing data to back calculate the material properties, such as the modulus, damping, creep compliance and fatigue cracking speed for an asphalt concrete layer and the modulus damping for the subgrade layer.

📜 SIMILAR VOLUMES

Extension of forward-backward method wit
Extension of forward-backward method with DFT-based acceleration algorithm for the efficient analysis of large periodic arrays with arbitrary boundaries
✍ Özlem Aydin Civi; Vakur B. Ertürk; Hsi-Tseng Chou 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 467 KB

An extension of the discrete Fourier transform (DFT)based forward-backward algorithm is developed using the virtual-element approach to provide a fast and accurate analysis of electromagnetic radiation/scattering from electrically large, planar, periodic, finite (phased) arrays with arbitrary bounda

Extension of forward-backward method wit
Extension of forward-backward method with a DFT-based acceleration algorithm for efficient analysis of radiation/scattering from large finite-printed dipole arrays
✍ Özlem Aydın Çivi 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 473 KB

## Abstract A discrete‐Fourier‐transform (DFT) based forward‐backward (FB) algorithm has been developed for the fast and accurate analysis of electrically large freestanding dipole arrays [1]. In this paper, an extension of the FB method (FBM) with a DFT‐based acceleration approach is presented to