bilum block versions of multielimination and multilevel ilu preconditioner for general sparse linear systems we introduce block versions of the multielimination incomplete lu ilum factorization preconditioning technique for solving general sparse unstructured linear systems these preconditioners have a multilevel structure and for certain types of problems may exhibit properties that are typically enjoyed by multigrid methods several heuristic strategies for forming blocks of independent sets are introduced and their relative merits are discussed the advantages of block ilum over point ilum include increased robustness and efficiency we compare several versions of the block ilum point ilum and the dual threshold based ilut preconditioners in particular tests with some convection diffusion problems show that it may be possible to obtain convergence that is nearly independent of the reynolds number as well as of the grid size

a monte carlo form finding method for large scale regular and irregular tensegrity structures we propose a monte carlo form finding method that employs a stochastic procedure to determine equilibrium configurations of a tensegrity structure this method does not involve complicated matrix operations or symmetry analysis works for arbitrary initial configurations and can handle large scale regular or irregular tensegrity structures with or without material geometrical constraints

articulated mechanism design with a degree of freedom constraint this paper deals with design of articulated mechanism using a truss based ground structure representation the proposed method can accommodate extremely large displacement by considering geometric non linearity in addition it can also control the mechanical degrees of freedom dof of the resultant mechanism by using a dof equation based on maxwell s rule the optimization is based on a relaxed formulation of an original integer problem and also involves developments directed at handling the redundancy inherent in the ground structure representation one planar test example is selected as the basis for the developments so as to compare the proposed method with other alternative approaches including a graph theoretical enumeration approach which guarantees the identification of the globally optimal solution also an inverter problem is treated where a continuation method is required in order to direct the optimization algorithm towards an integer solution copyright 2004 john wiley sons ltd

new parallel sor method by domain partitioning in this paper we propose and analyze a new parallel sor method the psor method formulated by using domain partitioning and interprocessor data communication techniques we prove that the psor method has the same asymptotic rate of convergence as the red black r b sor method for the five point stencil on both strip and block partitions and as the four color r b g o sor method for the nine point stencil on strip partitions we also demonstrate the parallel performance of the psor method on four different mimd multiprocessors a ksr1 an intel delta a paragon and an ibm sp2 finally we compare the parallel performance of psor r b sor and r b g o sor numerical results on the paragon indicate that psor is more efficient than r b sor and r b g o sor in both computation and interprocessor data communication

tensegrity deployment using infinitesimal mechanisms abstract kinematic properties of tensegrity structures reveal that an ideal way of motion is by using their infinitesimal mechanisms for example in motions along infinitesimal mechanisms there is no energy loss due to linearly kinetic tendon damping consequently a deployment strategy which exploits these mechanisms and uses the structure s nonlinear equations of motion is developed desired paths that are tangent to the directions determined by infinitesimal mechanisms are constructed and robust nonlinear feedback control is used for accurate tracking of these paths examples demonstrate the feasibility of this approach and further analysis reveals connections between the power and energy dissipated via damping infinitesimal mechanisms speed of the motion and deployment time

initial shape finding and modal analyses of cyclic frustum tensegrity modules initial equilibrium and modal analyses of kenneth snelson s cyclic frustum tensegrity modules with an arbitrary number of stages are presented there are m 3 bars at each stage the maxwell number of the modules is 6 2m and is independent of the number of stages in the axial direction calladine s relations reveals that there are 2 5m infinitesimal mechanism modes for multi stage modules the necessary conditions for axial assembly of one stage modules with the same internal element forces are investigated one stage modules with geometrically similar frustum modules satisfy the necessary conditions for pre stressed configurations modal analyses were conducted to investigate the mode shapes of infinitesimal mechanism modes

matrix analysis of statically and kinematically indeterminate frameworks abstract the paper is concerned with the structural mechanics of assemblies of bars and pinjoints particularly where they are simultaneously statically and kinematically indeterminate the physical significance of the four linear algebraic vector subspaces of the equilibrium matrix is examined and an algorithm is set up which determines the rank of the matrix and the bases for the four subspaces in particular this algorithm gives full details of any states of self stress and modes of inextensional deformation which an assembly may possess a scheme is devised for the segregation of inextensional modes into rigid body modes up to six of these may be allowed by the foundation constraints and internal mechanisms in some circumstances a state of self stress may impart first order stiffness to an inextensional mode a matrix method for detecting this effect is devised and it is shown that if there is no state of self stress which imparts first order stiffness to a given mode then that mode can undergo rather large distortion which involves either zero change in length of the bars or possibly changes in length of third or higher order in the displacements the significance of negative stiffness as indicated by the matrix method is discussed the paper contains simple examples which illustrate all of the main points of the work

symmetry adapted equilibrium matrices a number of authors have previously used group representation theory to block diagonalise the stiffness matrix of a symmetric structure this paper describes how similar techniques can be used to block diagonalise the equilibrium matrix of a symmetric structure this is shown to provide useful insight into the static and kinematic response of such systems in particular it simplifies finding and classifying states of self stress and mechanisms as well as reducing the computational effort required for a force method analysis

path generation of articulated mechanisms by shape and topology variations in non linear truss representation this paper presents studies on an optimization based method for path generation of articulated mechanisms an extended truss ground structure approach is taken in which both the shape and topology of the truss are designed using cross sectional areas and nodal positions as design variables this leads to a technique for simultaneous type and dimensional synthesis of articulated mechanisms for the analysis part it is essential to control the mechanism configuration so that the mechanism remains within a given configuration space thus stabilizing the optimization process and resulting in realistic solutions this can be achieved by using the levenberg marquardt method the design method is illustrated by a number of design cases for both closed and open input and output paths

initial prestress design and optimization of tensegrity systems based on symmetry and stiffness abstract this study mainly focuses on initial prestress design of tensegrity structures with given shapes for symmetric structures with multiple self stress modes two efficient methods respectively applying singular value decomposition on the constrained equilibrium matrix and performing eigenvalue analysis without manual classifications of member types are proposed to compute the independent states of self stress retaining full symmetry for structures with multiple symmetric states of self stress a novel optimization model for the purpose of maximizing the global rigidity of the structure is presented to determine the combination coefficients of the independent symmetric self stress states a penalty function is employed to consider both hard and soft constraints including stability conditions unilateral property of members and prestress distribution evenness the fitness ranking based genetic algorithms with and without incorporating isolation niche technique are developed to solve such optimization problem several numerical examples are tested to demonstrate the efficiency of the proposed methods

diagonally striped matrices and approximate inverse preconditioners the inverse of a banded matrix is in general dense if the structure of the original banded matrix is striped that is the non zero diagonals are separated by one or more zero diagonals the inverse may exhibit a similar striped structure the motivation for studying inverses of striped matrices is to obtain efficient preconditioners for systems arising from radiation transport equations whose matrices include dominant values along diagonal stripes linear systems whose system matrix has a striped inverse lend themselves to the use of a sparse approximate inverse spai preconditioner whose structure is derived from that of the actual inverse

when is a symmetric pin jointed framework isostatic maxwell s rule from 1864 gives a necessary condition for a framework to be isostatic in 2d or in 3d given a framework with point group symmetry group representation theory is exploited to provide further necessary conditions this paper shows how for an isostatic framework these conditions imply very simply stated restrictions on the numbers of those structural components that are unshifted by the symmetry operations of the framework in particular it turns out that an isostatic framework in 2d can belong to one of only six point groups some conjectures and initial results are presented that would give sufficient conditions in both 2d and 3d for a framework that is realized generically for a given symmetry group to be an isostatic framework

on the collapse of locally isostatic networks we examine the flexibility of periodic planar networks built from rigid corner connected equilateral triangles such systems are locally isostatic since for each triangle the total number of degre

how good is recursive bisection the most commonly used p way partitioning method is recursive bisection rb it first divides a graph or a mesh into two equal sized pieces by a good bisection algorithm and then recursively divides the two pieces ideally we would like to use an optimal bisection algorithm because the optimal bisection problem that partitions a graph into two equal sized subgraphs to minimize the number of edges cut is np complete practical rb algorithms use more efficient heuristics in place of an optimal bisection algorithm most such heuristics are designed to find the best possible bisection within allowed time we show that the rb method even when an optimal bisection algorithm is assumed may produce a p way partition that is very far way from the optimal one our negative result is complemented by two positive ones first we show that for some important classes of graphs that occur in practical applications such as well shaped finite element and finite difference meshes rb is within a constant factor of the optimal one almost always second we show that if the balance condition is relaxed so that each block in the p way partition is bounded by 2n p where n is the number of vertices of the graph then a modified rb finds an approximately balanced p way partition whose cost is within an o log p factor of the cost of the optimal p way partition

processor efficient sparse matrix vector multiplication abstract the matrix vector multiplication operation is the kernel of most numerical algorithms typically matrix vector multiplication algorithms exploit the sparsity of a matrix either to reduce the time taken or the memory used in the case of parallel implementations of numerical algorithms the sparsity of a matrix can also be used to reduce the number of processing elements pes required for example in leiserson s systolic array algorithm for matrix vector multiplication the nonzeros in the matrix are partitioned into bands and each band is fed into a different pe similarly in melhem s algorithm the nonzeros are partitioned into stripes and each stripe is fed into a distinct pe however in many practical applications such as the numerical solution of partial differential equations a matrix is much sparser than is indicated by its bandwidth or by its stripe width a new measure of sparsity of a matrix called staircase width is introduced a staircase in a matrix m mi j n n is a set of matrix positions s i j mi j 0 such that no position in s is strictly to the northeast of another position in s the staircase cover of a matrix is a partition of the positions of nonzero entries in the matrix into staircases and the staircase width of a matrix is the size of a smallest staircase cover of the matrix the staircase width of a matrix is never larger than the bandwidth or the stripe width of a matrix moreover it is significantly smaller than either for some commonly occurring types of matrices such as arrowhead matrices experiments with sparse matrices derived from a variety of engineering problems suggest that in practice the staircase width of a matrix is about half the stripe width of the matrix an efficient algorithm to compute a minimum width staircase cover of a matrix is presented staircase covers are used as the basis of a new parallel algorithm to compute a matrix vector product on a linear systolic array of pes this algorithm uses as many pes as the staircase width of the matrix and therefore saves on the number of pes relative to algorithms of leiserson and melhem it is shown that despite using fewer pes the algorithm uses no more time steps than leiserson s or melhem s algorithm

computation of kinematic paths and bifurcation points this article deals with the kinematic simulation of movable structures that go through special configurations of kinematic bifurcation as they move a series of algorithms are developed for structures that can be modelled using pin jointed bars and that admit a single parameter motion these algorithms are able to detect and locate any bifurcation points that exist along the path of the structure and at each bifurcation point can determine all possible motions of the structure the theory behind the algorithms is explained and the analysis of a simple example is discussed in detail then a simplified version of the particular problem that had motivated this work the simulation of the folding and deployment of a thin membrane structure forming a solar sail is analysed for the particular cases that are considered it is found that the entire process is inextensional but a detailed study of the simulation results shows that in more general cases it is likely that stretching or wrinkling will occur

log determinant relaxation for approximate inference in discrete markov random fields graphical models are well suited to capture the complex and non gaussian statistical dependencies that arise in many real world signals a fundamental problem common to any signal processing application of a graphical model is that of computing approximate marginal probabilities over subsets of nodes this paper proposes a novel method applicable to discrete valued markov random fields mrfs on arbitrary graphs for approximately solving this marginalization problem the foundation of our method is a reformulation of the marginalization problem as the solution of a low dimensional convex optimization problem over the marginal polytope exactly solving this problem for general graphs is intractable for binary markov random fields we describe how to relax it by using a gaussian bound on the discrete entropy and a semidefinite outer bound on the marginal polytope this combination leads to a log determinant maximization problem that can be solved efficiently by interior point methods thereby providing approximations to the exact marginals we show how a slightly weakened log determinant relaxation can be solved even more efficiently by a dual reformulation when applied to denoising problems in a coupled mixture of gaussian model defined on a binary mrf with cycles we find that the performance of this log determinant relaxation is comparable or superior to the widely used sum product algorithm over a range of experimental conditions

static and dynamic analyses of tensegrity structures part 1 nonlinear equations of motion abstract in order to present basic equations for static and dynamic analyses of a class of truss structures called tensegrity structures large deformation kinematics and kinetics were presented in both eulerian and lagrangian formulations the two sets of equations of motion yield the same values even if different stress and strain measures were employed for their computation the eulerian formulation was implemented in an updated lagrangian finite element code using newton s method with consistently linearized equations of motion by utilizing the linearized lagrangian equations of motion at pre stressed initial configurations harmonic modal analyses of a three bar tensegrity module and a six stage tensegrity beam were conducted in the second part of the paper linearized equations were utilized to investigate the equilibrium configurations of basic tensegrity modules and the stiffness of pre stressed tensegirty structures

determination of mechanism s order for kinematically and statically indetermined systems abstract this paper deals with the mechanisms in kinematically and statically indeterminate reticulated systems knowledge of length variation amplitude for members in association with an assigned mechanism allows determination of mechanism order this is a fundamental characteristic of these systems mainly for stability considerations we submit on one part simple tests allowing distinction between order one mechanisms and mechanisms of higher order and on the other part an algorithm giving access to order exact value for all mechanisms associated with a given reticulated system with this algorithm order one mechanisms and higher order mechanisms are identified simple examples are given in the text and illustrate these aspects in conclusion we submit a stop criterion for the algorithm which gives access to the finite mechanisms for most of constructive reticulated systems

reshaping of tensegrities using a geometrical variation approach abstract we propose a novel approach for the reshaping of tensegrities and pre stressed pin jointed frameworks both free standing and restrained frameworks are studied first a geometrical variation is introduced and considered as an initial geometrical change to a self equilibrated tensegrity a new nonlinear set of equilibrium equations is then established based on this variation and subsequently linearized using an expansion the linearization provides us with an underdetermined system of linear equations with a rectangular jacobian matrix which is derived in a very simple and compact matrix form the system is finally solved iteratively using a newton raphson method employing a moore penrose pseudo inverse operation to establish a new equilibrium state the method promises to generate very accurate results with a remarkable convergence rate the outstanding features and performance of the proposed method are demonstrated and studied comprehensively through three examples

symmetry and states of self stress in triangulated toroidal frames abstract a symmetry extension of maxwell s rule for rigidity of frames shows that every fully triangulated torus has at least six states of self stress with a well defined set of symmetries related to rotational and translational representations in the point group in contrast in trivalent polyhedral toroidal frames i e the duals of the deltahedra the rigid body motions plus the mechanisms are at least equal in number to the bars and their symmetry representation contains that of a set of vector slides along the bars

a symmetry extension of maxwell s rule for rigidity of frames a symmetry extension of maxwell s rule for rigidity of frames is found this rule subsumes and strengthens maxwell s 1864 rule by requiring that the internal and external degrees of freedom of a pin jointed structure are not only numerically equal but are also equisymmetric a number of special cases of maxwell s original rule are studied to show the improved insight that the symmetry adapted version can give

double link expandohedra a mechanical model for expansion of a virus double link expandohedra are introduced each is constructed from a parent polyhedron by replacing all faces with rigid plates adjacent plates being connected by a pair of spherically jointed bars powerful symmetry techniques are developed for mobility analysis of general double link expandohedra and when combined with numerical calculation and physical model building they demonstrate the existence of generic finite breathing expansion motions in many cases for icosahedrally symmetric trivalent parents with pentagonal and hexagonal faces only fullerene polyhedra the derived expandohedra provide a mechanical model for the experimentally observed swelling of viruses such as cowpea chlorotic mottle virus ccmv a fully symmetric swelling motion a finite mechanism is found for systems based on icosahedral fullerene polyhedra with odd triangulation number t 31 and is conjectured to exist for all odd triangulation numbers

a numerical analysis of infinitesimal mechanisms the paper presents a numerical algorithm based on koiter s theory of the elastic stability for detecting the order of infinitesimal mechanisms i e kinematically indeterminate systems of pin jointed bars in cases of one degree of indeterminacy the algorithm improves in terms of computational simplicity and efficiency an analogous algorithm proposed by salerno in 1992 this is shown to be due to the vanishing of the terms higher than the third order of the asymptotic expressions of the energy owing to the use of the green strain measure and a mixed displacement and stress formulation of the problem moreover the proposed algorithm is able to provide a correct definition of mechanism in cases of several degrees of indeterminacy mainly for structures like those first studied by connelly and servatius in 1994 which the paper will treat in depth

on computational procedures for the force method it is known that the matrix force method has certain advantages over the displacement method for a class of structural problems it is also known that the force method when carried out by the conventional gauss jordan procedure tends to fill in the problem data making the method unattractive for large size sparse problems this poor fill in property however is not necessarily inherent to the method and the sparsity may be maintained if one uses what we call the turn back lu procedure the purpose of this paper is two fold first it is shown that there exist some close relationships between the force method and the least squares problem and that many existing algebraic procedures to perform the force method can be regarded as applications extensions of certain well known matrix factorization schemes for the least squares problem secondly it is demonstrated that these algebraic procedures for the force method can be unified form the matrix factorization viewpoint included in this unification is the turn back lu procedure which was originally proposed by topcu in his thesis 8 it is explained why this procedure tends to produce sparse and banded self stress and flexibility matrices with small band width some computational results are presented to demonstrate the superiority of the turn back lu procedure over the other schemes considered in this paper

a new approach to the analytical and numerical form finding of tensegrity structures we develop a new formulation for the form finding of tensegrity structures in which the primary variables are the cartesian components of element lengths both an analytical and a numerical implementation of the formulation are described each require a description of the connectivity of the tensegrity with the iterative numerical method also requiring a random starting vector of member force densities the analytical and numerical form finding of tensegrity structures is demonstrated through six examples and the results obtained are compared and contrasted with those available in the literature to verify the accuracy and viability of the suggested methods

advanced form finding for cable strut structures a numerical method is presented for form finding of cable strut structures the topology and the types of members are the only information that is required in this form finding process dummy members are used to transform the cable strut structure with supports into self stressed system without supports the requirement on rank deficiencies of the force density and equilibrium matrices for the purpose of obtaining a non degenerate d dimensional self stressed structure has been explicitly discussed the spectral decomposition of the force density matrix and the singular value decomposition of the equilibrium matrix are performed iteratively to find the feasible sets of nodal coordinates and force densities which satisfy the minimum required rank deficiencies of the force density and equilibrium matrices respectively based on numerical examples it is found that the proposed method is very efficient robust and versatile in searching self equilibrium configurations of cable strut structures

decomposed block cholesky factorization in the karmarkar algorithm solving a class of super large lp problems abstract with the introduction of the karmarkar algorithm hope for optimally solving super large lp problems often encountered in the communication industry had risen high however a general code of the original karmarkar algorithm takes a long computation time to solve such problems employing proper factorization schemes substantially reduces the computation time of the karmarkar algorithm for solving super large linear programming lp problems in this paper a modified version of the karmarkar algorithm is described and the complexities involved in applying the algorithm to a class of super large lp problems are identified a factorization scheme decomposed block cholesky factorization is proposed in order to reduce the complexities of a matrix inversion operation that occurs within every iteration of the karmarkar algorithm the factorization scheme capitalizes on the generally well behaved block structure of the constraint matrix of the super large lp problems the computation time required for solving a class of super large lp problems using this scheme is estimated to be reduced by a factor of two orders of magnitude the proposed factorization scheme is even more promising in solving the super large lp problems on parallel processors using the karmarkar algorithm

synchronization optimal networks obtained using local structure information abstract in this paper the networks with optimal synchronizability are obtained using the local structure information in scale free networks a node will be coupled by its neighbors with maximal degree among the neighbors if and only if the maximal degree is larger than its own degree if the obtained coupled networks are connected they are synchronization optimal networks the connection probability of coupled networks is greatly affected by the average degree which usually increases with the average degree this method could be further generalized by taking into account the degree of next nearest neighbors which will sharply increase the connection probability compared to the other proposed methods that obtain synchronization optimal networks our method uses only local structure information and can hold the structure properties of the original scale free networks to some extent our method may present a useful way to manipulate the synchronizability of real world scale free networks

detection of finite mechanisms in symmetric structures abstract using group representation theory it is possible to block diagonalise the equilibrium matrix of a symmetric structure this analysis can identify the symmetry properties of any states of self stress or mechanisms present in the structure this paper will show that in some cases this linear analysis combined with symmetry arguments can show that particular mechanisms of a symmetric structure must be finite

network synchronization diffusion and the paradox of heterogeneity many complex networks display strong heterogeneity in the degree connectivity distribution heterogeneity in the degree distribution often reduces the average distance between nodes but paradoxically may suppress synchronization in networks of oscillators coupled symmetrically with uniform coupling strength here we offer a solution to this apparent paradox our analysis is partially based on the identification of a diffusive process underlying the communication between oscillators and reveals a striking relation between this process and the condition for the linear stability of the synchronized states we show that for a given degree distribution the maximum synchronizability is achieved when the network of couplings is weighted and directed and the overall cost involved in the couplings is minimum this enhanced synchronizability is solely determined by the mean degree and does not depend on the degree distribution and system size numerical verification of the main results is provided for representative classes of small world and scale free networks

a direct approach to design of geometry and forces of tensegrity systems in the process of designing a tensegrity system some constraints are usually introduced for geometry and or forces to ensure uniqueness of the solution because the tensegrity systems are underdetermined in most cases in this paper a new approach is presented to enable designers to specify independent sets of axial forces and nodal coordinates consecutively under the equilibrium conditions and the given constraints to satisfy the distinctly different requirements of architects and structural engineers the proposed method can be used very efficiently for practical applications because only linear algebraic equations are to be solved and no equation of kinematics or material property is needed some numerical examples are given to show not only efficiency of the proposed method but also its ability of searching new configurations

finite element network approximation of conductivity in particle composites a new finite element method computes conductivity in some unstructured particle reinforced composite material the 2 phase material under consideration is composed of a poorly conducting matrix material filled by highly conducting circular inclusions which are randomly dispersed the mathematical model is a poisson type problem with discontinuous coefficients the discontinuities are huge in contrast and quantity the proposed method generalizes classical continuous piecewise affine finite elements to special computational meshes which encode the particles in a network structure important geometric parameters such as the volume fraction are preserved exactly the computational complexity of the method is almost proportional to the number of inclusions this is minimal in the sense that the representation of the underlying geometry via the positions and radii of the inclusions is of the same complexity the discretization error is proportional to the distance of neighboring inclusions and independent of the conductivity contrast in the medium

statical and dynamical response of cable nets abstract the statical and the dynamical behaviour of cable nets is studied fully constrained and underconstrained cable nets are considered the conditions for initial stability and the prestressing of the nets are formulated a method for the analysis of the nodal displacements and the change in the internal forces in the cables due to static loads is proposed the cases where linear algebra can be used are discussed the method is extended to consider the dynamical behaviour of the net its free dynamical response and forced vibration are investigated

analysis of prestressed mechanisms abstract a new theory is presented for the matrix analysis of prestressed structural mechanisms made from pin jointed bars the response of a prestressed mechanism to any external action is decomposed into two almost separate parts which correspond to extensional and inextensional modes a matrix algorithm which treats these two modes separately is developed and tested it is shown that the equilibrium requirements for the assembly in its initial configuration as well as in deformed configurations which are obtained through infinitesimal inextensional displacements can be fully described by a square equilibrium matrix it is also shown that any set of extensional nodal displacements has to satisfy some equilibrium conditions as well as standard compatibility equations and that the resulting system of linear equations defines a square kinematic matrix theoretical as well as experimental evidence supporting this approach is given in the paper two simple experiments which were of crucial importance in arriving at the equilibrium conditions on the extensional displacements are described the interaction between the two modes of action of a prestressed mechanism is discussed together with a rapidly converging iterative procedure to handle it a study of the non linear effect by which the self stress level in a statically indeterminate assembly rapidly increases if an inextensional mode is excited supported by further experimental results concludes the paper this work is relevant to the analysis of most cable systems pneumatic domes fabric roofs and tensegrity frameworks

determination of stripe structures for finite element matrics stripe structures were introduced by the author parallel computing to appear as a means for the inclusion of the nonzero elements of a sparse matrix into a regular pattern which allows for efficient parallel manipulation in this paper the stripe structures of stiffness matrices resulting from irregular domains covered by regular grids are analyzed it is proved that the nonzero elements in these matrices may be covered by very few stripes and that these stripes may be nonoverlapping if the nodes of the grids are numbered appropriately the exact number of stripes which is independent of the size of the problem is derived for different types of grids and different numbering schemes the stripe structures of some irregular grids are also examined

adaptive force density method for form finding problem of tensegrity structures a numerical method is presented for form finding of tensegrity structures eigenvalue analysis and spectral decomposition are carried out iteratively to find the feasible set of force densities that satisfies the requirement on rank deficiency of the equilibrium matrix with respect to the nodal coordinates the equilibrium matrix is shown to correspond to the geometrical stiffness matrix in the conventional finite element formulation a unique and non degenerate configuration of the structure can then be obtained by specifying an independent set of nodal coordinates a simple explanation is given for the required rank deficiency of the equilibrium matrix that leads to a non degenerate structure several numerical examples are presented to illustrate the robustness as well as the strong ability of searching new configurations of the proposed method

zero stiffness tensegrity structures tension members with a zero rest length allow the construction of tensegrity structures that are in equilibrium along a continuous path of configurations and thus exhibit mechanism like properties equivalently they have zero stiffness the zero stiffness modes are not internal mechanisms as they involve first order changes in member length but are a direct result of the use of the special tension members these modes correspond to an infinitesimal affine transformation of the structure that preserves the length of conventional members they hold over finite displacements and are present if and only if the directional vectors of those members lie on a projective conic this geometric interpretation provides several interesting observations regarding zero stiffness tensegrity structures

static and dynamic analyses of tensegrity structures part ii quasi static analysis linearized lagrangian equations developed in the first part of the paper were employed for static analyses of cyclic cylindrical tensegrity modules linearized equilibrium equations at natural configurations were used to investigate initial shape static and kinematic indeterminancy pre stress and infinitesimal mechanism modes and the sensitivity analysis of initial geometry linearized equilibrium equations at pre stressed initial configurations were utilized to investigate pre stress stiffening and to distinguish first order mechanisms from higher order mechanisms to estimate critical loads for bar buckling and cable slacking nonlinear equilibrium equations were employed to compute element forces further the equivalence between the twist angle theorem obtained from a geometrical consideration and the equilibrium analysis was established for cyclic cylindrical tensegrity modules it is concluded that infinitesimal mechanism modes and pre stresses characterize the static and dynamic response of tensegrity structures

a symmetry treatment of danzerian rigidity for circle packing a symmetry extended mobility criterion that incorporates danzer s concept of bar and joint assemblies is derived and applied to the spherical circle packing problem the known scalar counting rule

lower eigenvalue bounds for singular pencils of matrices abstract beauwens procedure for obtaining lower eigenvalue bounds for regular pencils of matrices a b is simplified and extended to the singular case the theory is then compared through a particular perturbed modified incomplete factorization with notay s generalization of another approach initiated by gustafsson and developed by axelsson and barker and by wilmet

organization of growing random networks the organizational development of growing random networks is investigated these growing networks are built by adding nodes successively and linking each to an earlier node of degree k with an attachment probability a k when a k grows more slowly than linearly with k the number of nodes with k links n k t decays faster than a power law in k while for a k growing faster than linearly in k a single node emerges which connects to nearly all other nodes when a k is asymptotically linear n k t ensuremath sim mathrm tk ensuremath ensuremath nu with ensuremath nu dependent on details of the attachment probability but in the range 2l ensuremath nu l ensuremath infty the combined age and degree distribution of nodes shows that old nodes typically have a large degree there is also a significant correlation in the degrees of neighboring nodes so that nodes of similar degree are more likely to be connected the size distributions of the in and out components of the network with respect to a given node namely its descendants and ancestors are also determined the in component exhibits a robust s ensuremath 2 power law tail where s is the component size the out component has a typical size of order mathrm ln t and it provides basic insights into the genealogy of the network

an orthogonal self stress matrix for efficient analysis of cyclically symmetric space truss structures via force method abstract the analysis of structures is normally carried out through displacement method while the force method is considered as an alternative approach for this purpose and used on occasion the generation of compatibility conditions the transpose of self stress matrix is one of the major and complicated parts of any structural analysis using force method in this paper an efficient method is proposed for producing orthogonal self stress matrix related to space truss structures with cyclic symmetry this is actually performed by eigen decomposition of a special matrix having the same null basis as in equilibrium matrix then the advantages of the obtained compatibility conditions are demonstrated with respect to different formulations such as standard force method eigen force method and integrated force method finally the efficiency of the presented method is comprehensively compared with three well known numerical methods and tested on a set of practical examples the results indicate clearly the significant superiority of the proposed approach in terms of both computational time and the accuracy of the results

design of planar articulated mechanisms using branch and bound this paper considers an optimization model and a solution method for the design of two dimensional mechanical mechanisms the mechanism design problem is modeled as a nonconvex mixed integer program which allows the optimal topology and geometry of the mechanism to be determined simultaneously the underlying mechanical analysis model is based on a truss representation allowing for large displacements for mechanisms undergoing large displacements elastic stability is of major concern we derive conditions modeled by nonlinear matrix inequalities which guarantee that a stable equilibrium is found and that buckling is prevented the feasible set of the design problem is described by nonlinear differentiable and non differentiable constraints as well as nonlinear matrix inequalities to solve the mechanism design problem a branch and bound method based on convex relaxations is developed to guarantee convergence of the method two different types of convex relaxations are derived the relaxations are strengthened by adding valid inequalities to the feasible set and by solving bound contraction sub problems encouraging computational results indicate that the branch and bound method can reliably solve mechanism design problems of realistic size to global optimality

maximum performance at minimum cost in network synchronization we consider two optimization problems on synchronization of oscillator networks maximization of synchronizability and minimization of synchronization cost we first develop an extension of the well known master stability framework to the case of non diagonalizable laplacian matrices we then show that the solution sets of the two optimization problems coincide and are simultaneously characterized by a simple condition on the laplacian eigenvalues among the optimal networks we identify a subclass of hierarchical networks characterized by the absence of feedback loops and the normalization of inputs we show that most optimal networks are directed and non diagonalizable necessitating the extension of the framework we also show how oriented spanning trees can be used to explicitly and systematically construct optimal networks under network topological constraints our results may provide insights into the evolutionary origin of structures in complex networks for which synchronization plays a significant role

stability conditions for tensegrity structures stability conditions for tensegrity structures are derived based on positive definiteness of the tangent stiffness matrix which is the sum of the linear and geometrical stiffness matrices a necessary stability condition is presented by considering the affine motions that lie in the null space of the geometrical stiffness matrix the condition is demonstrated to be equivalent to that derived from the mathematical rigidity theory so as to resolve the discrepancy between the stability theories in the fields of engineering and mathematics furthermore it is shown that the structure is guaranteed to be stable if the structure satisfies the necessary stability condition and the geometrical stiffness matrix is positive semidefinite with the minimum rank deficiency for non degeneracy

a class of expandable polyhedral structures a class of expandable polyhedral structures the expandohedra consisting of prismatic faces linked along edges by hinged plates provides a model for the swelling of viruses the finite breathing mode of the expandohedra apparent in the model and from geometric arguments is not however detected by elementary counting techniques symmetry extended mobility criteria show that the breathing motion is part of a set of face mechanisms for many expandohedra numerical analysis using the singular value decomposition of the compatibility matrix confirms the completeness of the deductions from general symmetry theorems derived for expandohedra

prismatic tensegrity structures with additional cables integral symmetric states of self stress and cable controlled reconfiguration procedure abstract a simple energy method is put forward to determine the prestress distribution for symmetric tensegrity structures with multiple states of self stress and a class of prismatic tensegrities with additional cables are introduced to show the accuracy of presented method for the purpose of modifying structural shape as well as mechanical properties a cable controlled reconfiguration procedure is subsequently proposed for these structures by defining the length adjustments as the control parameters the reconfiguration procedure is regarded as a quasi static process consisting of a sequence of equilibrium configurations with varying control parameters then the nonlinear iterative algorithm based on the tangent stiffness of the structure is presented to simulate and follow this reconfiguration process by way of example a particular class of reconfigurations coined symmetrical reconfigurations are investigated carefully and the key features as well as the potential applications are given

on the evaluation of statical kinematic stiffness matrix for underconstrained structural systems abstract because of singularity of the elastic stiffness matrix analysis of underconstrained systems requires the comprehensive stiffness matrix comprising both kinds of first order structural stiffness elastic and statical kinematic the latter accounts for the role of the member forces induced in the system by the equilibrium part of the applied load as the source of the system resistance to the perturbation part of the same load evaluation of the sought member forces using orthogonal load resolution into equilibrium and perturbation components is awkward and computationally expensive a special modification of the singular elastic stiffness matrix simplifies the procedure and makes it amenable to the conventional tools of structural analysis the efficiency and accuracy of the procedure is illustrated by a detailed numerical example

the prestressability problem of tensegrity structures some analytical solutions in this paper we formulate the general prestressability conditions for tensegrity structures these conditions are expressed as a set of nonlinear equations and inequalities on the tendon tensions several examples of tensegrity structures for which the prestressability conditions can be analytically solved are then presented

first order infinitesimal mechanisms abstract this paper discusses the analytical conditions under which a pin jointed assembly which has s independent states of self stress and m independent mechanisms tightens up when its mechanisms are excited a matrix algorithm is set up to distinguish between first order infinitesimal mechanisms which are associated with second order changes of bar length and higher order infinitesimal or finite mechanisms it is shown that in general this analysis requires the computation of s quadratic forms in m variables which can be easily computed from the states of self stress and mechanisms of the assembly if any linear combination of these quadratic forms is sign definite then the mechanisms are first order infinitesimal an efficient and general algorithm to investigate these quadratic forms is given the calculations required are illustrated for some simple examples many assemblies of practical relevance admit a single state of self stress s 1 and in this case the algorithm proposed is straightforward to implement this work is relevant to the analysis and design of pre stressed mechanisms such as cable systems and tensegrity frameworks

synchronization is optimal in nondiagonalizable networks we consider maximization of the synchronizability of oscillator networks by assigning weights and directions to the links of a given interaction topology by extending the master stability formalism to all possible network structures we show that unless some oscillator is linked to all the others maximally synchronizable networks are necessarily nondiagonalizable and can always be obtained by imposing unidirectional information flow with normalized input strengths the results provide insights into hierarchical structures observed in complex networks in which synchronization is important

geometry the leading parameter for the poisson s ratio of bending dominated cellular solids control over the deformation behaviour that a cellular structure shows in response to imposed external forces is a requirement for the effective design of mechanical metamaterials in particular those with negative poisson s ratio this article sheds light on the old question of the relationship between geometric microstructure and mechanical response by comparison of the deformation properties of bar and joint frameworks with those of their realisation as a cellular solid made from linear elastic material for ordered planar tessellation models we find a classification in terms of the number of degrees of freedom of the framework model first in cases where the geometry uniquely prescribes a single deformation mode of the framework model the mechanical deformation and poisson s ratio of the linearly elastic cellular solid closely follow those of the unique deformation mode the result is a bending dominated deformation with negligible dependence of the effective poisson s ratio on the underlying material s poisson s ratio and small values of the effective young s modulus second in the case of rigid structures or when geometric degeneracy prevents the bending dominated deformation mode the effective poisson s ratio is material dependent and the young s modulus view the mathml sourcee cs large all analysed structures of this type have positive values of the poisson s ratio and large values of view the mathml sourcee cs third in the case where the framework has multiple deformation modes geometry alone does not suffice to determine the mechanical deformation these results clarify the relationship between mechanical properties of a linear elastic cellular solid and its corresponding bar and joint framework abstraction they also raise the question if in essence auxetic behaviour is restricted to the geometry guided class of bending dominated structures corresponding to unique mechanisms with inherently low values of the young s modulus

seismic waveform inversion in the frequency domain part 1 theory and verification in a physical scale model seismic waveforms contain much information that is ignored under standard processing schemes seismic waveform inversion seeks to use the full information content of the recorded wavefield in this paper i present apply and evaluate a frequency space domain approach to waveform inversion the method is a local descent algorithm that proceeds from a starting model to refine the model in order to reduce the waveform misfit between observed and model data the model data are computed using a full wave equation viscoacoustic frequency domain finite difference method ray asymptotics are avoided and higher order effects such as diffractions and multiple scattering are accounted for automatically the theory of frequency domain waveform wavefield inversion can be expressed compactly using a matrix formalism that uses finite difference finite element frequency domain modeling equations expressions for fast local descent inversion using back propagation techniques then follow naturally implementation of

static and dynamic characterization of regular truncated icosahedral and dodecahedral tensegrity modules static and dynamic properties of a pair of dual spherical tensegrity modules invented by buckminster fuller are investigated they are regular truncated icosahedral and dodecahedral tensegrity modules the computation of the maxwell number and the use of calladine s relation reveal that regular truncated icosahedral and dodecahedral tensegrity modules possess 55 infinitesimal mechanism modes a reduced equilibrium matrix is presented for the initial shape finding to economically impose the existence of a pre stress mode both the initial shape and the corresponding pre stress mode are analytically obtained by using graphs of the icosahedral group and the reduced equilibrium matrix for both icosahedral and dodecahedral modules the maximum values of the cable tension is always less than the absolute value of bar compression in order to classify a large number of infinitesimal mechanism modes modal analyses are conducted infinitesimal mechanism modes have the stiffness due to pre stress and are associated with lowest natural frequencies their natural frequencies increase proportionally to the square root of the amplitude of pre stress it is found that there are only 15 distinct natural frequencies associated with the infinitesimal mechanism modes

lu decomposition and numerical structure for solving large sparse nonsymmetric linear systems abstract in this work the solution of a large sparse linear system of equations with an arbitrary sparsity pattern is obtained by using lu decomposition method as well as numerical structure approach the lu decomposition method is based on doolittle s method while the numerical structure approach is based on cramer s rule the numerical structure approach produces direct solution without facing fill in problems as encountered in lu decomposition in order to reduce the fill ins in the decomposition the powers of a boolean matrix obtained from the coefficient matrix a are taken so that the fill ins in the structure of a can be known in advance the position of fill ins in a are thus determined in the best choice manner that is it is very effective and memory wise cheap we also outline a method by using numerical structure with reduced computation efforts finally experiments are performed on eight examples to compare the efficiency of the proposed methods the results obtained are reported in a table it is found that the lu decomposition method is much better than numerical structure the usefulness of numerical structure approach is also discussed

calculation of incompressible viscous flows by an unconditionally stable projection fem this paper investigates the numerical performance of a finite element implementation of a new incremental fractional step method to compute steady and unsteady incompressible viscous flows under general boundary conditions and using unstructured meshes a variational framework is adopted which accommodates two different spaces for representing and approximating the velocity fields calculated respectively in the viscous and inviscid phases of the method but which leads to a very simple numerical scheme in terms of only one discrete velocity field an unconditionally stable semi implicit approximation of the nonlinear term is used to eliminate any time step restriction as far as the numerical stability is concerned numerical results for five test problems in two dimensions are reported to illustrate the flexibility of the proposed method

algorithm for random close packing of spheres with periodic boundary conditions the isotropic algorithm is constructed for random close packing of equisized spheres with triply periodic boundary conditions all previously published packing methods with periodic boundaries were kinetics determined i e they contained a densification rate as an arbitrary parameter in contrast the present algorithm is kinetic independent and demonstrates an unambiguous convergence to the experimental results to suppress crystallization the main principles of our algorithm are 1 to form a contact network at an early stage and 2 retain contacts throughout the densification as far as possible the particles are allowed to swell by the numerical solution of the differential equations of densification the rhs of these equations is calculated efficiently from a linear system by a combination of conjugate gradient iterations and exact sparse matrix technology when an excessive contact occurs and one of the existing bonds should be broken to continue the densification an efficient criterion based on multidimensional simplex geometry is used for searching the separating bond the algorithm has a well defined termination point resulting in a perfect contact network with the average coordination number six for particle number n 1 and a system of normal reactions between the spheres maintaining the structure these forces are the counterpart of the algorithm and can be used to calculate small elastic particle deformations in a granular medium extensive calculations are presented for 50 n 5 400 and demonstrate very good agreement with the experimental packing density about 0 637 and structure

singular configurations of structural systems abstract a singular configuration of a structural system is characterized by rank deficiency of the equilibrium matrix and kinematic matrix the rank is lower than both the number of degrees of freedom and the number of constraints such configurations exist only in systems that are not geometrically invariant underconstrained structural systems most interesting among them are systems with infinitesimal mobility which attracted attention of many prominent researchers this paper puts the entire issue in a different perspective by addressing a critical yet so far unexplored aspect of singular configurations their realizability it turns out that the only generic physically realizable type of a singular configuration is a system with first order infinitesimal mobility and even this cannot be constructed without inducing prestress of finite magnitude all other singular configurations unprestressable first order mechanisms higher order mechanisms and singular configurations of finite mechanisms are unrealizable moreover short of exact or symbolic calculation they are also noncomputable and are just formal analytical constructs

a preconditioning technique for indefinite systems resulting from mixed approximations of elliptic problems this paper provides a preconditioned iterative technique for the solution of saddle point problems these problems typically arise in the numerical approximation of partial differential equations by lagrange multiplier techniques and or mixed methods the saddle point problem is reformulated as a symmetric positive definite system which is then solved by conjugate gradient iteration applications to the equations of elasticity and stokes are discussed and the results of numerical experiments are given

reduction of equilibrium compatibility and flexibility matrices in the force method this paper develops analytical expressions and numerical for reducing the structural matrices which are used in the force method of structural analysis two simple examples illustrate the calculations for pin jointed trusses two advanced applications a beam cross consisting of two coplanar beams which are linked by a shear connector and an equilibrium linear stress finite element are also presented

a parallel multithreaded sparse triangular linear system solver abstract we propose a parallel sparse triangular linear system solver based on the spike algorithm sparse triangular systems are required to be solved in many applications often they are a bottleneck due to their inherently sequential nature furthermore typically many successive systems with the same coefficient matrix and with different right hand side vectors are required to be solved the proposed solver decouples the problem at the cost of extra arithmetic operations as in the banded case compared to the banded case there are extra savings due to the sparsity of the triangular coefficient matrix we show the parallel performance of the proposed solver against the state of the art parallel sparse triangular solver in intel s math kernel library mkl on a multicore architecture we also show the effect of various sparse matrix reordering schemes numerical results show that the proposed solver outperforms mkl s solver in 80 of cases by a factor of 2 47 on average

effective insights into the geometric stability of symmetric skeletal structures under symmetric variations abstract geometric stability is a necessary criterion to guarantee stable equilibrium in engineering structures however we generally encounter enormous calculations to examine the geometric stability when we make variations on the geometry or the connectivity of a given kinematically and statically indeterminate structure this study describes how symmetry is utilized to enhance the mobility and geometric stability analysis of symmetric skeletal structures symmetry extended mobility distinguishes representations of the internal mechanisms and self stress states from relative mobility based on their inherent symmetries using group theoretic method thus it acts as an efficient tool to evaluate the order of internal mechanisms that may be indistinguishable by traditional structural approaches further it is used to gain effective insights into the mobility and geometric stability of a symmetric skeletal structure with symmetrically perturbed connectivity or geometry the first order changes of symmetry extended mobility are deduced to describe the changes induced by the variations of nodal coordinates members and kinematic constraints respectively examples are given to verify the correctness and effectiveness of the proposed method we show that the geometry or connectivity of kinematically indeterminate symmetric skeletal structures can be altered while at the same time retaining geometric stability and some or all of the original symmetry the results have potential application in the design of novel deployable structures

structural computations with the singular value decomposition of the equilibrium matrix abstract the singular value decomposition of the equilibrium matrix makes it possible to answer any question of a static kinematic or static kinematic nature for any structural assembly within a unified computational framework the paper introduces this decomposition relates it to the physical properties of a given assembly and derives formulae for stresses displacements etc a simple example illustrates the calculations

extended truss theory with simplex constraints this paper traces a way of generalization of the classical truss theory in addition to the kinematic constraint expressing the distance between two nodes connected by a bar element other similar constraints involving three and four nodes are introduced derived from energy principles a general tangent stiffness formulation is given possible mechanical interpretations as well as problems of pre stressing are also discussed

on the physical realizability of singular structural systems abstract analytical models of structural systems allow for exceptional singular geometric configurations characterized by rank deficiency of the equilibrium and kinematic matrix the feasibility of physical and numerical realization of such configurations depends on the type of singularity generic vs nongeneric it turns out that some interesting theoretically predicted and thoroughly studied types of singular configurations systems with simultaneous statical and kinematic indeterminacy unprestressable first order mechanisms all higher order mechanisms singular configurations of finite mechanisms and kinematically mobile closed polyhedral surfaces are nongeneric hence physically unrealizable and noncomputable except for exact or symbolic calculation thus in spite of their sometimes remarkable theoretical features these systems and configurations are just purely formal constructs moreover their attempted implementation would produce a generic prototype with essentially different properties including structural response a few of the somewhat unexpected implications of this observation are discussed and a complete set of analytical criteria for the four statical kinematic types of realizable structural systems is presented

on the rigidity of triangulated hyperbolic paraboloids the paper investigates the rigidity of two classes of three dimensional pin jointed assemblies which describe triangulated surfaces of hyperbolic paraboloidal shape type 1 with straight boundaries and type 2 with parabolic boundaries the two arrangements have identical horizontal plans the investigation begins with a brief historic review of techniques for detecting lack of rigidity the behaviour of both type 1 and type 2 assemblies depends on the number n of bars on each edge of the structure and although both geometric arrangements satisfy maxwell rule 3 j b where j is the number of joints and b is the number of bars for any value of n all type 1 assemblies with n even and greater than 2 and type 2 assemblies with n 1 are in fact not rigid this result is first proved for some specific cases by the zero load test and then for arbitrary values of n the equilibrium equations of each joint are written down in terms of a stress function and are then assembled in an equilibrium matrix whose rank is found by general matrix manipulations the number of inextensional mechanisms and static redundancies is also obtained the rigidity of assemblies consisting of four interconnected type 1 hyperbolic paraboloidal sheets is also discussed and it is concluded that they are equally prone to the same kind of misbehaviour

orthogonal load resolution and statical kinematic stiffness matrix the structural behavior of underconstrained systems is explored with an emphasis on statically indeterminate ones the roles of the elastic stiffness and the statical kinematic stiffness induced by prestress or an equilibrium load are investigated and compared the linearized response of a prestressed underconstrained system is shown to go beyond the simple notion of the first order stiffness induced by prestress and independent of the member stiffnesses some interesting features of structural behavior under a general load and stability under an equilibrium load are revealed and illustrated with an example of a quasi variant pin bar system finally a comprehensive stiffness matrix with coefficients representing various sources of first order stiffness is introduced to replace when necessary the conventional elastic stiffness matrix the comprehensive matrix is valid for structural systems of any type and is always invertible

enhanced synchronizability via age based coupling in this brief report we study the synchronization of growing scale free networks an asymmetrical age based coupling method is proposed with only one free parameter alpha although the coupling matrix is asymmetric our coupling method could guarantee that all the eigenvalues are non negative reals the eigenratio r will approach 1 in the large limit of alpha

multi objective optimization for prestress design of cable strut structures abstract stiffness of a cable strut structure is dependent on the level and distribution of prestress although a higher prestress level enhances overall stiffness of the structure this condition may demand larger member sectional areas and material cost the effect of fabrication and installation error should also be incorporated in the prestress design this paper presents a new optimization method for prestress design of cable strut structures a multi objective optimization problem is formulated and solved to obtain preferred coefficient vectors of prestress modes with the following four objective functions 1 minimize average area of members 2 maximize minimum eigenvalue of stiffness matrix 3 minimize prestress variance of cables and 4 minimize maximum eigenvalue of error sensitivity matrix pareto optimal solutions are obtained by nsga ii among the pareto optimal solutions the most preferred solution is selected using promethee ii two examples are presented to illustrate the proposed process the results are compared with those by existing methods of optimization with a single objective function significance of each objective function is also evaluated by the number of remaining pareto optimal solutions after removal of the objective function

the set of forces that ideal trusses or wire webs under tension can support abstract the problem of determining those multiplets of forces or sets of force multiplets acting at a set of points such that there exists a truss structure or wire web that can support these force multiplets with all the elements of the truss or wire web being under tension is considered the two dimensional problem where the points are at the vertices of a convex polygon is essentially solved each multiplet of forces must be such that the net anticlockwise torque around any vertex of the forces summed over any number of consecutive points clockwise past the vertex must be non negative and one can find a truss structure that supports under tension and only supports those force multiplets in a convex polyhedron of force multiplets that is generated by a finite number of force multiplets each satisfying the torque condition progress is also made on the problem where only a subset of the points are at the vertices of a convex polygon and the other points are inside in particular in the case where only one point is inside an explicit procedure is described for constructing a suitable truss if one exists an alternative recipe to that provided by guevara vasquez et al 2011 based on earlier work of camar eddine and seppecher 2003 is given for constructing a truss structure with elements under either compression or tension that supports an arbitrary collection of balanced forces at the vertices of a convex polygon finally some constraints are given on the forces that a three dimension truss or wire web under tension must satisfy

how to recognize the order of infinitesimal mechanisms a numerical approach structures presenting kinematical inderterminacy are usually called mechanisms this paper is entirely concerned with assemblies which reveal themselves to be mechanisms at a null value of the load among them a first distinction is made between infinitesimal and finite ones the former being characterized by one or several directions of lower but not zero stiffness whereas the latter show at least one finite admissible displacement for which none of the bars undergoes any elongation moreover there exists the possibility to make a further distinction among the infinitesimal mechanisms according to which is the order of the stiffness along the direction considered above the way of evaluating this order is to perform a local analysis of the strain energy of the assembly once the displacement field is parametrized in terms of a suitable parameter by means of a finite element technique this analysis can be easily performed through the numerical approach presented in this report

generic combinatorial rigidity of periodic frameworks abstract we give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks the characterization is a true analogue of the maxwell laman theorem from rigidity theory it is stated in terms of a finite combinatorial object and the conditions are checkable by polynomial time combinatorial algorithms to prove our rigidity theorem we introduce and develop periodic direction networks and z 2 graded sparse colored graphs

algorithms for three dimensional rigidity analysis and a first order percolation transition a fast computer algorithm the pebble game has been used successfully to analyze the rigidity of two dimensional 2d elastic networks as well as of a special class of 3d networks the bond bending networks and enabled significant progress in studies of rigidity percolation on such networks application of the pebble game approach to general 3d networks has been hindered by the fact that the underlying mathematical theory is strictly speaking invalid in this case we construct an approximate pebble game algorithm for general 3d networks as well as a slower but exact algorithm the relaxation algorithm that we use for testing the new pebble game based on the results of these tests and additional considerations we argue that in the particular case of randomly diluted central force networks on bcc and fcc lattices the pebble game is essentially exact using the pebble game we observe an extremely sharp jump in the largest rigid cluster size in bond diluted central force networks in 3d with the percolating cluster appearing and taking up most of the network after a single bond addition this strongly suggests a first order rigidity percolation transition which is in contrast to the second order transitions found previously for the 2d central force and 3d bond bending networks while a first order rigidity transition has been observed previously for bethe lattices and networks with chemical order here it is in a regular randomly diluted network in the case of site dilution the transition is also first order for bcc lattices but results for fcc lattices suggest a second order transition even in bond diluted lattices while the transition appears massively first order in the order parameter the percolating cluster size it is continuous in the elastic moduli this and the apparent nonuniversality make this phase transition highly unusual

enhanced synchronizability by structural perturbations in this brief report we investigate the collective synchronization of a system of coupled oscillators on a barab asi albert scale free network we propose an approach of structural perturbations aiming at those nodes with maximal betweenness this method can markedly enhance the network synchronizability and is easy to realize the simulation results show that the eigenratio will sharply decrease by one half when only 0 6 of those hub nodes occur under three division processes when the network size n 2000 in addition the present study also provides numerical evidence that the maximal betweenness plays a major role in network synchronization