Efficient solution of multiple cracks in great number using eigen COD boundary integral equations with iteration procedure

A newly developed computational approach is proposed in the paper for the analysis of multiple crack problems based on the eigen crack opening displacement (COD) boundary integral equations. The eigen COD particularly refers to a crack in an infinite domain under fictitious traction acting on the crack surface. With the concept of eigen COD, the multiple cracks in great number can be solved by using the conventional displacement discontinuity boundary integral equations in an iterative fashion with a small size of system matrix to determine all the unknown CODs step by step. To deal with the interactions among cracks for multiple crack problems, all cracks in the problem are divided into two groups, namely the adjacent group and the far-field group, according to the distance to the current crack in consideration. The adjacent group contains cracks with relatively small distances but strong effects to the current crack, while the others, the cracks of far-field group are composed of those with relatively large distances. Correspondingly, the eigen COD of the current crack is computed in two parts. The first part is computed by using the fictitious tractions of adjacent cracks via the local Eshelby matrix derived from the traction boundary integral equations in discretized form, while the second part is computed by using those of far-field cracks so that the high computational efficiency can be achieved in the proposed approach. The numerical results of the proposed approach are compared not only with those using the dual boundary integral equations (D-BIE) and the BIE with numerical Green's functions (NGF) but also with those of the analytical solutions in literature. The effectiveness and the efficiency of the proposed approach is verified. Numerical examples are provided for the stress intensity factors of cracks, up to several thousands in number, in both the finite and infinite plates.

Artefact and iteration : circular entanglements

In this workshop proposal I discuss a case study physical computing environment named Talk2Me. This work was exhibited in February 2006 at The Block, Brisbane as an interactive installation in the early stages of its development. The major artefact in this work is a 10 metre wide X 3 metre high light-permeable white dome. There are other technologies and artefacts contained within the dome that make up this interactive environment. The dome artefact has impacted heavily on the design process, including shaping the types of interactions involved, the kinds of technologies employed, and the choice of other artefacts. In this workshop paper, I chart some of the various iterations Talk2Me has undergone in the design process.

A Spectral Iteration Technique For The Analysis Of Yagi-Uda Arrays

The paper present a spectral iteration technique for the analysis of linear arrays of unequally spaced dipoles of unequal lengths. As an example, the Yagi-Uda array is considered for illustration. Analysis is carried out in both the spatial as well as the spectral domains, the two being linked by the Fourier transform. The fast Fourier transform algorithm is employed to obtain an iterative solution to the electric field integral equation and the need for matrix inversion is circumvented. This technique also provides a convenient means for testing the satisfaction of the boundary conditions on the array elements. Numerical comparison of the input impedance and radiation pattern have been made with results deduced elsewhere by other methods. The computational efficency of this technique has been found to be significant for large arrays.

Velocity and acceleration analysis of complex mechanisms by graphical iteration

A simple graphical method is presented for velocity and acceleration analysis of complex mechanisms possessing low or high degree of complexity. The method is iterative in character and generally yields the solution within a few iterations. Several examples have been worked out to illustrate the method.

Profiling k-Iteration Paths : A Generalization of the Ball-Larus Profiling Algorithm

The Ball-Larus path-profiling algorithm is an efficient technique to collect acyclic path frequencies of a program. However, longer paths -those extending across loop iterations - describe the runtime behaviour of programs better. We generalize the Ball-Larus profiling algorithm for profiling k-iteration paths - paths that can span up to to k iterations of a loop. We show that it is possible to number suchk-iteration paths perfectly, thus allowing for an efficient profiling algorithm for such longer paths. We also describe a scheme for mixed-mode profiling: profiling different parts of a procedure with different path lengths. Experimental results show that k-iteration profiling is realistic.

Solution of MDPS using simulation-based value iteration

This article proposes a three-timescale simulation based algorithm for solution of infinite horizon Markov Decision Processes (MDPs). We assume a finite state space and discounted cost criterion and adopt the value iteration approach. An approximation of the Dynamic Programming operator T is applied to the value function iterates. This 'approximate' operator is implemented using three timescales, the slowest of which updates the value function iterates. On the middle timescale we perform a gradient search over the feasible action set of each state using Simultaneous Perturbation Stochastic Approximation (SPSA) gradient estimates, thus finding the minimizing action in T. On the fastest timescale, the 'critic' estimates, over which the gradient search is performed, are obtained. A sketch of convergence explaining the dynamics of the algorithm using associated ODEs is also presented. Numerical experiments on rate based flow control on a bottleneck node using a continuous-time queueing model are performed using the proposed algorithm. The results obtained are verified against classical value iteration where the feasible set is suitably discretized. Over such a discretized setting, a variant of the algorithm of [12] is compared and the proposed algorithm is found to converge faster.

Improving the convergence rate of the inverse iteration method

Solution of generalized eigenproblem, K phi = lambda M phi, by the classical inverse iteration method exhibits slow convergence for some eigenproblems. In this paper, a modified inverse iteration algorithm is presented for improving the convergence rate. At every iteration, an optimal linear combination of the latest and the preceding iteration vectors is used as the input vector for the next iteration. The effectiveness of the proposed algorithm is demonstrated for three typical eigenproblems, i.e. eigenproblems with distinct, close and repeated eigenvalues. The algorithm yields 29, 96 and 23% savings in computational time, respectively, for these problems. The algorithm is simple and easy to implement, and this renders the algorithm even more attractive.

Ancient Chinese algorithm: The Ying Buzu Shu (method of surplus and deficiency) vs Newton iteration method

Air exploratory discussion of an ancient Chinese algorithm, the Ying Buzu Shu, in about 2nd century BC, known as the rule of double false position in the West is given. In addition to pointing out that the rule of double false position is actually a translation version of the ancient Chinese algorithm, a comparison with well-known Newton iteration method is also made. If derivative is introduced, the ancient Chinese algorithm reduces to the Newton method. A modification of the ancient Chinese algorithm is also proposed, and some of applications to nonlinear oscillators are illustrated.

Results on proximal and generalized weak proximal contractions including the case of iteration-dependent range sets

This paper presents some further results on proximal and asymptotic proximal contractions and on a class of generalized weak proximal contractions in metric spaces. The generalizations are stated for non-self-mappings of the forms for and , or , subject to and , such that converges uniformly to T, and the distances are iteration-dependent, where , , and are non-empty subsets of X, for , where is a metric space, provided that the set-theoretic limit of the sequences of closed sets and exist as and that the countable infinite unions of the closed sets are closed. The convergence of the sequences in the domain and the image sets of the non-self-mapping, as well as the existence and uniqueness of the best proximity points, are also investigated if the metric space is complete. Two application examples are also given, being concerned, respectively, with the solutions through pseudo-inverses of both compatible and incompatible linear algebraic systems and with the parametrical

Scaling POMDPs for dialog management with composite summary point-based value iteration (CSPBVI)

Although partially observable Markov decision processes (POMDPs) have shown great promise as a framework for dialog management in spoken dialog systems, important scalability issues remain. This paper tackles the problem of scaling slot-filling POMDP-based dialog managers to many slots with a novel technique called composite point-based value iteration (CSPBVI). CSPBVI creates a "local" POMDP policy for each slot; at runtime, each slot nominates an action and a heuristic chooses which action to take. Experiments in dialog simulation show that CSPBVI successfully scales POMDP-based dialog managers without compromising performance gains over baseline techniques and preserving robustness to errors in user model estimation. Copyright © 2006, American Association for Artificial Intelligence (www.aaai.org). All rights reserved.