Bisection methodRoot-finding methodFix point problemsArtificial Bee Colony algorithmIn this work, with combination Bisection method and Artificial bee colony algorithm together(BIS-ABC), We introduce the novel iteration method to solve the real-valued fix point problem f(x) = x,x G [a,b] ? R...
Bisection methodRoot-finding methodFix point problemsArtificial Bee Colony algorithmIn this work, with combination Bisection method and Artificial bee colony algorithm together(BIS-ABC), We introduce the novel iteration method to solve the real-valued fix point problem f(x) = x, x ∈ [a, b R...
Examples are included to illustrate performance of the proposed method. The results are compared to those of the subdomain approach.A KavehA DavaranComputers & StructuresKaveh, A. and Davaran, A., Spectral bisection of adaptive finite element meshes for parallel processing, Computers and Structures,...
This method makes use of the level structure defined by the bisection. Under certain conditions we get a lower bound depending on λ 2 β | V | with 1/2 ≤β < 1. We also present examples of graphs for which our new bounds are tight up to a constant factor. As a by-product, we...
To demonstrate the potential of the proposed algorithm a method for designing fixed-structure controllers that minimize an upper bound on the singular value 碌 is presented. The problem considered here is of significant practical interest, since many industrial controllers are constrained in order/...
In the present work, we provide an exact method to efficiently compute the similarity classes based on the edge-based data structure. Detecting if a new tetrahedron belongs to a similarity class already obtained is straightforward using an integer-based data structure. This consists of an integer ...
This matrix is then used in the formation of an eigenvalue problem. The first eigenvector is calculated, and an approximate Fiedler vector is constructed for the bisection of G 0 . The performance of the method is illustrated by some practical examples....