Krylov subspace methods for solving large unsymmetric linear systems /

"COO-2383-0077"--P. 1 of cover.

Time trials on second-order and variable-learning-rate algorithms

The performance of seven minimization algorithms are compared on five neural network problems. These include a variable-step-size algorithm, conjugate gradient, and several methods with explicit analytic or numerical approximations to the Hessian.

Using interior point algorithms for the solution of linear programs with special structural features

Linear Programming (LP) is a powerful decision making tool extensively used in various economic and engineering activities. In the early stages the success of LP was mainly due to the efficiency of the simplex method. After the appearance of Karmarkar's paper, the focus of most research was shifted to the field of interior point methods. The present work is concerned with investigating and efficiently implementing the latest techniques in this field taking sparsity into account. The performance of these implementations on different classes of LP problems is reported here. The preconditional conjugate gradient method is one of the most powerful tools for the solution of the least square problem, present in every iteration of all interior point methods. The effect of using different preconditioners on a range of problems with various condition numbers is presented. Decomposition algorithms has been one of the main fields of research in linear programming over the last few years. After reviewing the latest decomposition techniques, three promising methods were chosen the implemented. Sparsity is again a consideration and suggestions have been included to allow improvements when solving problems with these methods. Finally, experimental results on randomly generated data are reported and compared with an interior point method. The efficient implementation of the decomposition methods considered in this study requires the solution of quadratic subproblems. A review of recent work on algorithms for convex quadratic was performed. The most promising algorithms are discussed and implemented taking sparsity into account. The related performance of these algorithms on randomly generated separable and non-separable problems is also reported.

A variational method and approximations of a Cauchy problem for elliptic equations

A Cauchy problem for general elliptic second-order linear partial differential equations in which the Dirichlet data in H½(?1 ? ?3) is assumed available on a larger part of the boundary ? of the bounded domain O than the boundary portion ?1 on which the Neumann data is prescribed, is investigated using a conjugate gradient method. We obtain an approximation to the solution of the Cauchy problem by minimizing a certain discrete functional and interpolating using the finite diference or boundary element method. The minimization involves solving equations obtained by discretising mixed boundary value problems for the same operator and its adjoint. It is proved that the solution of the discretised optimization problem converges to the continuous one, as the mesh size tends to zero. Numerical results are presented and discussed.

Reconstruction of a stationary flow from boundary data using iterative methods

In this paper, three iterative procedures (Landweber-Fridman, conjugate gradient and minimal error methods) for obtaining a stable solution to the Cauchy problem in slow viscous flows are presented and compared. A section is devoted to the numerical investigations of these algorithms. There, we use the boundary element method together with efficient stopping criteria for ceasing the iteration process in order to obtain stable solutions.

A variational method for identifying a spacewise-dependent heat source

The inverse problem of determining a spacewise-dependent heat source for the parabolic heat equation using the usual conditions of the direct problem and information from one supplementary temperature measurement at a given instant of time is studied. This spacewise-dependent temperature measurement ensures that this inverse problem has a unique solution, but the solution is unstable and hence the problem is ill-posed. We propose a variational conjugate gradient-type iterative algorithm for the stable reconstruction of the heat source based on a sequence of well-posed direct problems for the parabolic heat equation which are solved at each iteration step using the boundary element method. The instability is overcome by stopping the iterative procedure at the first iteration for which the discrepancy principle is satisfied. Numerical results are presented which have the input measured data perturbed by increasing amounts of random noise. The numerical results show that the proposed procedure yields stable and accurate numerical approximations after only a few iterations.

Optimal Control of a Second Order Parabolic Heat Equation

In this paper, we are concerned with the optimal control boundary control of a second order parabolic heat equation. Using the results in [Evtushenko, 1997] and spatial central finite difference with diagonally implicit Runge-Kutta method (DIRK) is applied to solve the parabolic heat equation. The conjugate gradient method (CGM) is applied to solve the distributed control problem. Numerical results are reported.

Inverse space-dependent force problems for the wave equation

The determination of the displacement and the space-dependent force acting on a vibrating structure from measured final or time-average displacement observation is thoroughly investigated. Several aspects related to the existence and uniqueness of a solution of the linear but ill-posed inverse force problems are highlighted. After that, in order to capture the solution a variational formulation is proposed and the gradient of the least-squares functional that is minimized is rigorously and explicitly derived. Numerical results obtained using the Landweber method and the conjugate gradient method are presented and discussed illustrating the convergence of the iterative procedures for exact input data. Furthermore, for noisy data the semi-convergence phenomenon appears, as expected, and stability is restored by stopping the iterations according to the discrepancy principle criterion once the residual becomes close to the amount of noise. The present investigation will be significant to researchers concerned with wave propagation and control of vibrating structures.

Quality balancing for parallel adaptive FEM

We present a dynamic distributed load balancing algorithm for parallel, adaptive finite element simulations using preconditioned conjugate gradient solvers based on domain-decomposition. The load balancer is designed to maintain good partition aspect ratios. It can calculate a balancing flow using different versions of diffusion and a variant of breadth first search. Elements to be migrated are chosen according to a cost function aiming at the optimization of subdomain shapes. We show how to use information from the second step to guide the first. Experimental results using Bramble's preconditioner and comparisons to existing state-ot-the-art load balancers show the benefits of the construction.

Load balancing for parallel adaptive FEM

We present a dynamic distributed load balancing algorithm for parallel, adaptive finite element simulations using preconditioned conjugate gradient solvers based on domain-decomposition. The load balancer is designed to maintain good partition aspect ratios. It calculates a balancing flow using different versions of diffusion and a variant of breadth first search. Elements to be migrated are chosen according to a cost function aiming at the optimization of subdomain shapes. We show how to use information from the second step to guide the first. Experimental results using Bramble's preconditioner and comparisons to existing state-of-the-art balancers show the benefits of the construction.

Cálculo de constantes ópticas de películas delgadas de Cu3BiS3 a través del método de Wolfe

Se calculó la obtención de las constantes ópticas usando el método de Wolfe. Dichas contantes: coeficiente de absorción (α), índice de refracción (n) y espesor de una película delgada (d ), son de importancia en el proceso de caracterización óptica del material. Se realizó una comparación del método del Wolfe con el método empleado por R. Swanepoel. Se desarrolló un modelo de programación no lineal con restricciones, de manera que fue posible estimar las constantes ópticas de películas delgadas semiconductoras, a partir únicamente, de datos de transmisión conocidos. Se presentó una solución al modelo de programación no lineal para programación cuadrática. Se demostró la confiabilidad del método propuesto, obteniendo valores de α = 10378.34 cm−1, n = 2.4595, d =989.71 nm y Eg = 1.39 Ev, a través de experimentos numéricos con datos de medidas de transmitancia espectral en películas delgadas de Cu3BiS3.

Swarm intelligence-based solver for parameter estimation of laboratory through-diffusion transport of contaminants

Theoretical approaches are of fundamental importance to predict the potential impact of waste disposal facilities on ground water contamination. Appropriate design parameters are generally estimated be fitting theoretical models to data gathered from field monitoring or laboratory experiments. Transient through-diffusion tests are generally conducted in the laboratory to estimate the mass transport parameters of the proposed barrier material. Thes parameters are usually estimated either by approximate eye-fitting calibration or by combining the solution of the direct problem with any available gradient-based techniques. In this work, an automated, gradient-free solver is developed to estimate the mass transport parameters of a transient through-diffusion model. The proposed inverse model uses a particle swarm optimization (PSO) algorithm that is based on the social behavior of animals searching for food sources. The finite difference numerical solution of the forward model is integrated with the PSO algorithm to solve the inverse problem of parameter estimation. The working principle of the new solver is demonstrated and mass transport parameters are estimated from laboratory through-diffusion experimental data. An inverse model based on the standard gradient-based technique is formulated to compare with the proposed solver. A detailed comparative study is carried out between conventional methods and the proposed solver. The present automated technique is found to be very efficient and robust. The mass transport parameters are obtained with great precision.

A New Deformation Theory with Strain Gradient Effects

A new phenomenological deformation theory with strain gradient effects is proposed. This theory, which belongs to nonlinear elasticity, fits within the framework of general couple stress theory and involves a single material length scale l. In the present theory three rotational degrees of freedom omega(i) are introduced in addition to the conventional three translational degrees of freedom u(i). omega(i) has no direct dependence upon ui and is called the micro-rotation, i.e. the material rotation theta(i) plus the particle relative rotation. The strain energy density is assumed to only be a function of the strain tensor and the overall curvature tensor, which results in symmetric Cauchy stresses. Minimum potential principle is developed for the strain gradient deformation theory version. In the limit of vanishing 1, it reduces to the conventional counterparts: J(2) deformation theory. Equilibrium equations, constitutive relations and boundary conditions are given in details. Comparisons between the present theory and the theory proposed by Shizawa and Zbib (Shizawa, K., Zbib, H.M., 1999. A thermodynamical theory gradient elastoplasticity with dislocation density Censor: fundamentals. Int. J. Plast. 15, 899) are given. With the same hardening law as Fleck et al. (Fleck, N.A., Muller, G.H., Ashby, M.F., Hutchinson, JW., 1994 Strain gradient plasticity: theory and experiment. Acta Metall. Mater 42, 475), the new strain gradient deformation theory is used to investigate two typical examples, i.e. thin metallic wire torsion and ultra-thin metallic beam bend. The results are compared with those given by Fleck et al, 1994 and Stolken and Evans (Stolken, J.S., Evans, A.G., 1998. A microbend test method for measuring the plasticity length scale. Acta Mater. 46, 5109). In addition, it is explained for a unit cell that the overall curvature tensor produced by the overall rotation vector is the work conjugate of the overall couple stress tensor. (C) 2002 Elsevier Science Ltd. All rights reserved.

Strain gradient theory based on a new framework of non-local model

A new framework of non-local model for the strain energy density is proposed in this paper. The global strain energy density of the representative volume element is treated as a non-local variable and can be obtained through a special integral of the local strain energy density. The local strain energy density is assumed to be dependent on both the strain and the rotation-gradient. As a result of the non-local model, a new strain gradient theory is derived directly, in which the first and second strain gradients, as well as the triadic and tetradic stress, are introduced in the context of work conjugate. For power law hardening materials, size effects in thin metallic wire torsion and ultra-thin cantilever beam bend are investigated. It is found that the result predicted by the theoretical model is well consistent with the experimental data for the thin wire torsion. On the other hand, the calculation result for the micro-cantilever beam bend clearly shows the size effect.

On a regular convex solver potential for an elastic-damage constitutive model: a theoretical analysis

This work is related with the proposition of a so-called regular or convex solver potential to be used in numerical simulations involving a certain class of constitutive elastic-damage models. All the mathematical aspects involved are based on convex analysis, which is employed aiming a consistent variational formulation of the potential and its conjugate one. It is shown that the constitutive relations for the class of damage models here considered can be derived from the solver potentials by means of sub-differentials sets. The optimality conditions of the resulting minimisation problem represent in particular a linear complementarity problem. Finally, a simple example is present in order to illustrate the possible integration errors that can be generated when finite step analysis is performed. (C) 2003 Elsevier Ltd. All rights reserved.