Numerical solution of static and dynamic problems of imprecisely defined structural systems

Static and dynamic problems with deterministic structural parameters are well studied. In this regard, good number of investigations have been done by many authors. Usually, structural analysis depends upon the system parameters such as mass, geometry, material properties, external loads and boundary conditions which are defined exactly or considered as deterministic. But, rather than the deterministic or exact values we may have only the vague, imprecise and incomplete informations about the variables and parameters being a result of errors in measurements, observations, experiments, applying different operating conditions or it may be due to maintenance induced errors, etc. which are uncertain in nature. Hence, it is an important issue to model these types of uncertainties. Basically these may be modelled through a probabilistic, interval or fuzzy approach. Unfortunately, probabilistic methods may not be able to deliver reliable results at the required precision without sufficient experimental data. It may be due to the probability density functions involved in it. As such, in recent decades, interval analysis and fuzzy theory are becoming powerful tools. In these approaches, the uncertain variables and parameters are represented by interval and fuzzy numbers, vectors or matrices.In general, structural problems for uncertain static analysis with interval or fuzzy parameters simplify to interval or fuzzy system of linear equations whereas interval or fuzzy eigenvalue problem may be obtained for the dynamic analysis. Accordingly, this thesis develops new methods for finding the solution of fuzzy and interval system of linear equations and eigenvalue problems. Various methods based on fuzzy centre, radius, addition, subtraction, linear programming approach and double parametric form of fuzzy numbers have been proposed for the solution of system of linear equations with fuzzy parameters. An algorithm based on fuzzy centre has been proposed for solving the generalized fuzzy eigenvalue problem. Moreover, a fuzzy based iterative scheme with Taylor series expansion has been developed for the identification of structural parameters from uncertain dynamic data. Also, dynamic responses of fractionally damped discrete and continuous structural systems with crisp and fuzzy initial conditions have been obtained using homotopy perturbation method based on the proposed double parametric form of fuzzy numbers. Numerical examples and application problems are solved to demonstrate the efficiency and capabilities of the developed methods. In this regard, imprecisely defined structures such as bar, beam, truss, simplified bridge, rectangular sheet with fuzzy/interval material and geometric properties along with uncertain external forces have been considered for the static analysis. Fuzzy and interval finite element method have been applied to obtain the uncertain static responses. Structural problems viz. multistorey shear building, spring mass mechanical system and stepped beam structures with uncertain structural parameters have been considered for dynamic analysis. In the identification problem, column stiffnesses of a multistorey frame structure have been identified using uncertain dynamic data based on the proposed algorithm. In order to get the dynamic responses, a single degree of freedom fractionally damped spring-mass mechanical system and fractionally damped viscoelastic continuous beam with crisp and fuzzy initial conditions are also investigated.Obtained results are compared in special cases for the validation of proposed methods

Uncertainty and Imprecision in Safety Assessment of Offshore Structures.

Ph.DDOCTOR OF PHILOSOPH

Rigorous solution techniques for numerical constraint satisfaction problems

A constraint satisfaction problem (e.g., a system of equations and inequalities) consists of a finite set of constraints specifying which value combinations from given variable domains are admitted. It is called numerical if its variable domains are continuous. Such problems arise in many applications, but form a difficult problem class since they are NP-hard. Solving a constraint satisfaction problem is to find one or more value combinations satisfying all its constraints. Numerical computations on floating-point numbers in computers often suffer from rounding errors. The rigorous control of rounding errors during numerical computations is highly desired in many applications because it would benefit the quality and reliability of the decisions based on the solutions found by the computations. Various aspects of rigorous numerical computations in solving constraint satisfaction problems are addressed in this thesis: search, constraint propagation, combination of inclusion techniques, and post-processing. The solution of a constraint satisfaction problem is essentially performed by a search. In this thesis, we propose a new complete search technique (i.e., it can find all solutions within a predetermined tolerance) for numerical constraint satisfaction problems. This technique is general and can be used in place of branching steps in most branch-and-prune methods. Moreover, this new technique speeds up the most recent general search strategy (often by an order of magnitude) and provides a concise representation of solutions. To make a constraint satisfaction problem easier to solve, a major approach, called constraint propagation, in the constraint programming1 field is often used to reduce the variable domains (by discarding redundant value combinations from the domains). Basing on directed acyclic graphs, we propose a new constraint propagation technique and a method for coordinating constraint propagation and search. More importantly, we propose a novel generic scheme for combining multiple inclusion techniques2 in numerical constraint propagation. This scheme allows bringing into the constraint propagation framework the strengths of various techniques coming from different fields. To illustrate the flexibility and efficiency of the generic scheme, we base on this scheme and devise several specific combination strategies for rigorous numerical constraint propagation using interval constraint propagation, interval arithmetic, affine arithmetic, and linear programming. Our experiments show that the new propagation techniques outperform previously available methods by 1 to 4 orders of magnitude or more in speed. We also propose several post-processing techniques for the representation of continuums of solutions. Based on connectedness, they allow grouping each cluster of connected solution subsets into a larger subset, thus allowing getting additional grouping information. Potentially, these techniques enable interval-based solution techniques to be alternatives to bounding-volume techniques in applications such as collision detection and interactive graphics. __________________________________________________ 1 Constraint programming is an approach to programming that relies on both reasoning and computing. 2 An inclusion technique is to include a set of interest into enclosures. It is also called an enclosure technique

On the Solution of Interval Linear Systems

In the literature efficient algorithms have been described for calculating guaranteed inclusions for the solution of a number of standard numerical problems [3], [4], [8], [11], [12], [13]. The inclusions are given by means of a set containing the solution. In [12], [13] this set is calculated using an affine iteration which is stopped when a nonempty and compact set is mapped into itself. For exactly given input data (point data) it has been shown that this iteration stops if and only if the iteration matrix is convergent (cf. [13]). In this paper we give a necessary and sufficient stopping criterion for the above mentioned iteration for interval input data and interval operations. Stopping is equivalent to the fact that the algorithm presented in [12] for solving interval linear systems computes an inclusion of the solution. An algorithm given by Neumaier is discussed and an algorithm is proposed combining the advantages of our algorithm and a modification of Neumaier's. The combined algorithm yields tight bounds for input intervals of small and large diameter. Using a paper by Jansson [6], [7] we give a quite different geometrical interpretation of inclusion methods. It can be shown that our inclusion methods are optimal in a specified geometrical sense. For another class of sets, for standard simplices, we give some interesting examples