Volume 112, Advances in the Astronautical Sciences Spaceflight Mechanics 2002

Size: px
Start display at page:

Download "Volume 112, Advances in the Astronautical Sciences Spaceflight Mechanics 2002"

Transcription

1 Volume 112, Advances in the Astronautical Sciences Spaceflight Mechanics 2002 AAS EQUILIBRIUM CONDITIONS OF A CLASS I TENSEGRITY STRUCTURE Robert E. Skelton 1, Darrell Williamson 2, JeongHeon Han 3 ABSTRACT Static models of tensegrity structures are reduced to linear algebra problems, after first characterizing the problem in a vector space where direction cosines are not needed. That is, we describe the components of all member vectors as opposed to the usual practice of characterizing the statics problem in terms of the magnitude of tension vectors. While our approach enlarges (by a factor of 3) the vector space required to describe the problem, the computational space is not increased. The advantage of enlarging the vector space makes the mathematical structure of the problem amenable to linear algebra treatment. Using the linear algebraic techniques, many variables are eliminated from the final existence equations. This paper characterizes the existence conditions for all tensegrity equilibria. Key Words: tensegrity, structure, statics, equilibrium conditions, linear algebra. INTRODUCTION The Tensegrity structures introduced by Kenneth Snelson pose a wonderful blend of geometry and mechanics. In addition, they have engineering appeal in problems requiring large changes is structural shape. We define class I tensegrity as a stable connection of bars and strings with only one bar connected to any given node. Nodes connecting more than one bar or other constraints form class II tensegrity. Thus, class I structures are unconstrained, whereas, class II may have boundary constraints or bar to bar connections. Most existing smart structure methods are limited to small displacements. Since class I tensegrity structures [8 have no bar-to-bar connections, the control of tendons allows very large shape changes. Therefore, an efficient set of analytical tools could be the enabler to a hoist of new engineering concepts for deployable and shape controllable structures. This paper characterizes the static equilibria of class I tensegrity structures. Furthermore, we use vectors to describe each element( bars and tendons), eliminating the need to use direction cosines and the subsequent transcendental functions that follow their use. It is well known in a variety of mathematical problems that enlarging the domain in which the problem is posed can often simplify the mathematical treatment. For example, nonlinear Riccati equations are known to be solvable by linear algebra in a space that is twice the size of the original problem statement. Many nonlinear problems admit solutions by linear techniques by enlarging the domain of the problem. The purpose of this paper is to show that by enlarging the vector space in 1 University of California, San Diego, Dept. of Mechanical and Aerospace Engineering, La Jolla, CA, USA. bobskelton@ucsd.edu 2 University of Wollongong, Faculty of Informatics, Wollongong, NSW 2522 Australia darrell williamson@uow.edu.au 3 University of California, San Diego, Dept. of Mechanical and Aerospace Engineering, La Jolla, CA, USA. jehan@mae.ucsd.edu 1

2 which we characterize the tensegrity statics problem, the mathematical structure of the equations admit treatment by linear algebra methods, for the most part. Our results characterize the equilibria conditions of both Class I tensegrity structures in terms of a very small number of variables, since the necessary and sufficient conditions of the linear algebra treatment allows the elimination of several of the original variables. In the future, these results will be programmed into object-oriented software to design and simulate a large class of tensegrity structures. This paper provides the enabling technology for efficient algorithms to design tensegrity structures, which have been around for fifty years without efficient design procedures. The paper is laid out as follows. Section 2 introduces the network representations of tensegrity structures as an oriented graph in real three dimensional space. Geometric connectivity, equilibrium, and a coordinate transformation will be introduced. Section 3 introduces the algebraic equilibrium conditions for a class I tensegrity structure. After we derive necessary and sufficient conditions for the existence of an unloaded tensegrity structure in equilibrium, we write the necessary and sufficient conditions for the externally loaded structure in equilibrium. A couple of examples will show how to construct a tensegrity structure that concludes the paper. Notation We let I n define the n n identity matrix, and 0 define an n m matrix of zeros. (The dimensions of 0 will be clear from the context.) We also let ρ(a) define the rank of the matrix A. Let A R m n and B R p q, then the Kronecker product of A and B is defined as A B a 11 B a 12 B a 1n B a 21 B a 22 B a 2n B.. a m1 B a m2 B NETWORK REPRESENTATION OF STRUCTURES. a mn B Rmp nq In this paper, we choose to represent a tensegrity structure as an oriented graph in real three dimensional space R 3 defined in terms of n p nodes and n s + n b directed branches which are all represented as vectors in R 3. A loop is any closed path in the graph. As we shall see, the advantage of this approach is that both the magnitude and the direction of the forces are contained in vectors which can be solved using linear algebra. Thus linear algebra plays a larger role in this approach compared to the usual approach in mechanics and finite element methods using direction cosines. In the oriented graph of a class I tensegrity structure, the nodes consist of the ends of the bars as represented by the n p nodes (or vectors) {p k }. Hence if there are n b bars, then there are n p 2n b nodes. We choose to identify two different types of directed branches; the n s string branches (or vectors) {s n } and the n b bar branches (or vectors) {b m }. Geometric Connectivity Each directed branch can undergo a displacement in reaching its equilibrium state. String vectors can change both their length and orientation while rigid bar vectors can only change their orientation. Node vectors can change both their length and orientation but subject to a Law of Geometric Connectivity which we state as follows: The vector sum of all branch vectors in any loop is zero. (1) These equations are in the form of a set of linear algebraic equations in the branch vectors. Force Equilibrium In our study of tensegrity structures, we are concerned with structures in which bars sustain compressive forces. We therefore choose to distinguish between the string (or tensile) forces {t n } 2

3 and the bar (or compressive) forces {f m } which are defined in terms of the string and bar vectors respectively as follows. Definition 1 Given the tensile force t n in the string characterized by the string vector s n and the compressive force f n in the bar characterized by the bar vector b n, the tensile force coefficient γ m 0 and the compressive force coefficient λ n 0 are defined by t n γ n s n ; f m λ m b m (2) The forces of the tensegrity structure are defined by the external force vector w R 3np, the compression vector f R 3n b, and the tension vector t R 3ns where w T [w T 1,w T 2,...,w T n p ; f T [f T 1,f T 2,...,f T n b ; t T [t T 1,t T 2,...,t T n s (3) Force Convention: Suppose each node p k is subjected to compressive vector forces {f mk }, tensile vector forces {t nk } and external force w k. Then the Law for Static Equilibrium may be stated as follows: t nk f mk w k 0 (4) n m where a positive sign is assigned to a (tensile, compressive, external) force leaving a node, and a negative sign is assigned to a (tensile, compressive, external) force entering a node. The negative sign in (4) is a consequence of the fact that we choose to define nonnegative compressive force coefficients λ n. Consider a class I tensegrity structure consisting of n p nodes, n b bars and n s strings. Suppose the positions of the nodes are described by the n p vectors {p 1,p 2,...,p np }, the positions of the bars are described by the n b vectors {b 1,b 2,...,b nb }, and the positions of the strings are described by the n s vectors {s 1,s 2,...,s ns }. Definition 2 The geometry of the tensegrity structure is defined by the tensegrity node vector p R 3np, the tensegrity bar vector b R 3n b, and the tensegrity string vector s R 3ns where p T [p T 1,p T 2,...,p T n p ; b T [b T 1,b T 2,...,b T n b ; s T [s T 1,s T 2,...,s T n s (5) From the network, it follows that components of the string vector s and the bar vector b can be written as a linear combination of components of the node vector p. Also if branch k is a bar which leaves node i and enters node j, then b k p j p i, whereas if branch k is a string which leaves node i and enters node j, then s k p j p i. Hence we have A T p [s T,b T T where the matrix A consists only of block matrices of the form {0, ±I 3 }. In particular, if we consecutively number the n s + n b branches {s 1,s 2,...,s ns, b 1,b 2,...,b nb } as {1, 2,..., n s, n s + 1,..., n s + n b }, then the 3n p (3n s + 3n b ) matrix A [A ij is defined by I 3 if tension (compression) j leaves (enters) node i A ij I 3 if tension (compression) j enters (leaves) node i (6) 0 if tension (compression) j is not incident with node i Also: (i) each column of A has exactly one block I 3 and one block I 3 with all other column blocks 0, and (ii) for any row i there exists a column j such that A ij ±I 3. Specifically, the bar connectivity matrix B and the string connectivity matrix S form the matrix A as follows. [ s b [ S T B T 3 p A T p (7)

4 FIG Bar 4-String Class I Tensegrity In network analysis, the matrix A is known as the incidence matrix. This matrix is not the reduced incidence matrix since we have included the datum node which means that one block row of equations in (8) are dependent on the other rows. This fact does not cause any difficulties in subsequent developments. On the contrary, some symmetry is preserved in the algebraic equations. From Network analysis and the law for static equilibrium, we have the following result. Lemma 1 Consider a tensegrity structure as described by the geometric conditions given by (7). Then the equilibrium conditions for a class I tensegrity structure under the external load w are [ t A f w ; A [S,B (8) or equivalently St Bf + w. (9) Example 1 Consider the 2-bar 4-string class I tensegrity structure illustrated in Figure 1 with tensile force vectors {t 1,t 2,t 3,t 4 } and compressive force vectors {f 1,f 2 }. The Geometric Connectivity conditions are: p 1 + p 3 s 1 ; p 2 p 3 s 2 p 2 + p 4 s 3 ; p 1 p 4 s 4 (10) Also, in terms of the stated force convention (4), the conditions for Static Equilibrium at nodes 1-4 are: t 1 t 4 f 1 w 1 0 ; t 2 + t 3 + f 1 w 2 0 t 1 + t 2 f 2 w 3 0 ; t 3 + t 4 + f 2 w 4 0 (11) 4

5 The static equilibrium conditions and the geometric conditions can be written in the form (6), (7), (8), where I I 3 I 3 0 S 0 I 3 I 3 0 I 3 I ; B I I 3 (12) 0 0 I 3 I 3 0 I 3 We now derive a canonical network representation in which the bar vectors are a subset of the transformed network nodes. Lemma 2 Given the tensegrity node vector p, define the coordinate transformation for some nonsingular matrix P R 3np 3np where p Pq (13) Then: P [P T 1,PT 2 ; P 1,P 2 R 3n b 3n p (14) (i) In terms of the transformed tensegrity node q, the tensegrity geometry is given by where with S T q q s ; BT q q b (15) S T q [S T 1,S T 2 ; B T q [B T 1,B T 2 (16) S 1 P 1 S ; S 2 P 2 S ; B 1 P 1 B ; B 2 P 2 B (17) (ii) The tensegrity force equilibrium is given by S 1 t B 1 f + P 1 w ; S 2 t B 2 f + P 2 w (18) Proof : Part (i) follows directly from the definition of P. Part (ii) follows from the expansion of the equilibrium condition S q t B q f + P T w. Since each bar has two end points, n p 2n b. Without any loss of generality, we label the nodes of the bar b m to be p 2m and p 2m 1 for class I tensegrity structures, hence b m p 2m 1 + p 2m, m 1, 2,..., n b. B T blockdiag{ [ I 3 I 3,, [ I3 I 3 } (19) In particular, the following Lemma gives three special choices for coordinate transformations based on the special bar connectivity matrix given by (19). Lemma 3 The transformed equilibrium conditions (18) for all three coordinate transformations are given by S q t B q f P T w ; S T q [ST 1,ST 2 ; BT q [I n b,0 nb (20) where S 1 R 3n b 3n s ; S 2 R 3n b 3n s are given by (17). S 1 t f + P 1 w ; S 2 t P 2 w (21) 5

6 The transformed coordinate q is given by where b is the bar vector and q e is given in (26), (29), and (32). q T [b T,q T e (22) (i) Let the coordinate transformation matrix P R 3np 3np in (14) be given by P [ P T 1 P T 2 1 [ B (Ie I o )B (23) 2 where B is given by (19) and odd and even node selection matrix I o,i e R 3np 3np are defined by I o blockdiag{i 3,0 3,,I 3,0 3 } ; I e blockdiag{0 3,I 3,,0 3,I 3 }. (24) Then the inverse transformation is P 1 [P T 1,PT [ P1 [ P 2 B T B T (I e I o ) (25) q e R 3n b is the vector of the mass center of each of the bars given by where p cj 1 2 (p 2j + p 2j 1 ). (ii) Let the coordinate matrix P R 3np 3np in (14) be given by q T e [pt c 1,p T c 2,...,p T c nb (26) P [ I o B (I e I o )B (27) where B is given by (19) and odd and even node selection matrix I o,i e R 3np 3np are given by (24). Then the inverse transformation is [ B P 1 [P T 1,P T 2 1 T B T (28) I e q e R 3n b is a vector of the even nodes given by (iii) Let the coordinate matrix P R 3np 3np in (14) be given by q T e [pt 2,pT 4,...,pT 2n b (29) P [ I e B (I o I e )B (30) where B is given by (19) and odd and even node selection matrix I o,i e R 3np 3np are given by (24). Then the inverse transformation is [ P 1 [P T B T 1,PT 2 1 B T (31) I o q e R 3n b is a vector of the odd nodes given by q T e [pt 1,pT 3,...,pT 2n b 1 (32) Proof : Proof of PP 1 P 1 P I follows directly from identities B T I e B B T I o B I ; I e I o 0 ; I 2 e I e ; I 2 o I o. 6

7 Example 2 The equations (10), (11) of the 2-bar 4-string tensegrity introduced in Example 1 can be written in the form (8) and (7) where B T [ I3 I I 3 I 3 Then from part (i) in Lemma 3, we have ; S T I 3 0 I I 3 I I 3 0 I 3 I I 3 P 1 S 1 [ [ I I3 I ; P 0 0 I I 3 I 3 [ [ I3 0 0 I 3 I3 I ; S I 3 I I 3 I 3 I 3 I 3 I 3 I 3 (33) Or from part (ii) in Lemma 3, we have P 1 1 [ I3 I ; P I 3 I 2 1 [ I3 I I 3 I 3 S 1 1 [ I3 I 3 I 3 I 3 ; S 2 I 3 I 3 I 3 I 2 1 [ I3 I 3 I 3 I I 3 I 3 I 3 I 3 ANALYSIS OF THE TRANSFORMED EQUILIBRIUM CONDITIONS FOR A CLASS I TENSEGRITY STRUCTURE Definition 3 A tensegrity structure with tensile force coefficients {γ n 0}, compressive force coefficients {λ n 0}, node vector p, string vector s and bar vector b is said to be in equilibrium if the element relationships (2), the force equations (9) and the geometric equations (7) are all satisfied. For the remainder of this paper, we choose to use the coordinate transformation derived in part (i) Lemma 3. Requirements for Equilibrium: Given an external force vector w, the problem of determining the geometric and force configuration of a tensegrity structure consisting of n s strings and n b bars in equilibrium is therefore equivalent to finding a solution b,q e R 3n b of the equations: s S T 1 b + S T 2 q e (34) t Γs ; Γ diag{γ 1 I 3, γ 2 I 3,..., γ ns I 3 } (35) S 2 t P 2 w (36) f S 1 t P 1 w (37) f Λb ; Λ diag{λ 1 I 3, λ 2 I 3,..., λ nb I 3 } (38) for given matrices S 1,S 2 R 3n b 3n s ; P 1,P 2 R 3n b 3n p (39) where n p 2n b ; n s > n b (40) 7

8 Beyond equilibrium requirements, one might require shape constraints by requiring p to take on a specific set of values p p, where p Pq P T 1 b+p T 2 q e. Our focus in this paper is characterizing equilibria, hence the freedom in choosing the nodal vector p will appear as free variables in the vector q e, as the sequel shows. The diagonal matrices {Γ,Λ} shall be referred to as the tensile force matrix and compressive force matrix respectively. Prestressed Equilibrium( Unloaded Structure ) We now proceed to derive necessary and sufficient conditions for the existence of a structure in equilibrium that is prestressed in the absence of any external load (i.e. w 0) in (34) - (38). Our strategy for the examination of the conditions (34) - (38) is as follows. The solution of the linear algebra problem (36) yields nonunique t which lies in the right null space of S 2. The existence condition of q e for linear algebra problem (34) yields a condition on the left null space of S 2. Hence (34) and (36) can be combined to obtain a unique expression for t in terms of b. This is key to the main results of this paper. We now establish necessary and sufficient conditions for a solution of equations (34)-(40) in the absence of external forces (i.e. w 0) by examining each of these equations in turn beginning with the solution of (34), (36). Lemma 4 Suppose r ρ(s 2 ) min{3n p, 3n s } (41) and let S 2 have the singular value decomposition {U,Σ,V} given by S 2 UΣV T R 3n b 3n s (42) where U [U 1,U 2 ; Σ [ Σ ; V [V 1,V 2 U 1 R 3n b r ; U 2 R 3n b (3n b r) ; V 1 R 3ns r ; V 2 R 3ns (3ns r) Then a necessary and sufficient condition for (34) to have a solution q e R 3n b is given by Furthermore, when (43) is satisfied, all solutions q e are of the form V2 T (s ST 1 b) 0 (43) where z e R 3n b r is arbitrary. q e U 1 Σ 1 11 VT 1 (s ST 1 b) + U 2z e (44) We now consider the solution of (36) when w 0. Lemma 5 When w 0, all solutions t of (36) which guarantee (43) are of the form t V 2 M 1 V2 T ST 1 b ; M V2 T Γ 1 V 2 (45) Proof : From (42), (43), we have t V 2 z t where z t is the free solution of (36). Then from (35) V2 T (s ST 1 b) VT 2 (Γ 1 V 2 z t S T 1 b) 8

9 Since V 2 has full column rank, the matrix M V T 2 Γ 1 V 2 is invertible if it exists (that is, if γ n 0, n 1,, n s ). Hence (43) is satisfied when z t M 1 V T 2 S T 1 b, and this gives (45). We now consider the solution of (37), (38) when w 0. Lemma 6 When w 0, a necessary and sufficient condition for (37), (38) to have a solution b R 3n b is given by where In particular, define (X Λ)b 0 (46) X (S 1 V 2 )M 1 (S 1 V 2 ) T ; M V T 2 Γ 1 V 2 (47) Then: (i) When r b 3n b, then b 0 is the only solution of (46), (ii) When r b 0, any b R 3n b is a solution of (46), and (iii) When 0 < r b < 3n b, all solutions b satisfy the equation r b ρ(x Λ) (48) [I V X1 Σ 1 X11 UT X1Λb V X2 z b (49) where z b R 3n b r b is free, and where {U X,Σ X,V X } is the singular value decomposition of the matrix X R 3n b 3n b ; that is [ ΣX11 0 U X [U X1,U X2 ; Σ X ; V 0 0 X [V X1,V X2 ; r X rank(x) with U X1 R 3n b r X, V X2 R 3n b (3n b r X). Proof : From (45), (38) and (37) S 1 t f S 1 V 2 M 1 V T 2 S T 1 b Λb (X Λ)b The result then follows from the singular value decomposition of X after writing (46) in the form Xb f, f Λb. For the establishment of a non-trivial tensegrity structure, it is necessary that the node component vectors p k are not required to lie on any line for a planar tensegrity structure and it is necessary that the node component vectors p k are not required to lie on any plane for a spatial tensegrity structure. Hence we establish the following Corollary. Corollary 1 When w 0, a necessary and sufficient condition for (37), (38) to have a nontrivial solution b R 3n b is given by (X Λ)b 0 r b ρ(x Λ) (nb 2)d where dimension d is 2 for planar tensegrity structure, and 3 for spatial tensegrity structure. Proof : When r b n b d, b 0 is the only solution. When r b (n b 1) d, all bar vectors are parallel. Corollary 2 If Γ γi, and Λ λi, then all unforced tensegrity equilibria are characterized by the modal data of the matrix X S 1 V 2 V2 TST 1. That is, all admissible values of λ γ are eigenvalues of X, and all bar vectors are eigenvectors of X. 9

10 Proof : From (46) and Γ γi,λ λi, X γs 1 V 2 V2 TST 1 γ X. Then ( γ X λi ) b 0 or ( ) X ρi b 0, where ρ λ γ. Hence ρ and b are the eigenvalues and eigenvectors of X. Lemma 7 Consider the partitioned matrix A [ A B C D. Then [ A B (i) deta det C D [ A B (ii) deta det C D det[adet[d CA 1 B if det[a 0. det[ddet[a BD 1 C if det[d 0. Now Γ positive definite implies M in (47) is positive definite. Then M positive definite implies X in (47) is positive semi-definite with at least one non-zero eigenvalue. Since (46) has a nonzero solution b if and only if det(x Λ) 0, the following Lemma is important. Lemma 8 Given a nonzero symmetric positive semi-definite matrix X and a positive definite diagonal matrix Λ, the following statements are equivalent. ( ) (i) det(x Λ) 0, where X S 1 V 2 V T 2 Γ 1 1 V 2 V T {[ } 2 S T 1. Λ S (ii) det 1 V 2 V2 TST 1 V2 T 0. Γ 1 V {[ [ 2 [ } I 0 Λ S1 I 0 (iii) det 0 V2 T S T 1 Γ V 2 (iv) det { ( ) } V2 T Γ 1 S T 1 Λ 1 S 1 V2 0. Proof : Since V2 T Γ 1 V 2 is a positive definite matrix, the solutions of det {X Λ} 0 are not affected by multiplying by det {Λ}. This yields det { V T 2 Γ 1 V 2 } det {X Λ} 0. Now we can apply (ii) in Lemma 7 by setting A Λ, B S 1 V 2, C V T 2 S T 1, and D V T 2 Γ 1 V 2, which proves part (ii). Part (iii) can be easily proved by the equality given by [ A [ Λ S 1 V 2 I 0 V2 TST 1 V2 T Γ 1 V 2 0 V2 T [ [ Λ S1 I 0 S T 1 Γ 1. 0 V 2 Since Λ is a positive definite matrix, applying (i) in Lemma 7 to A yields (iv). Remark 1 For 0 < r b < 3n b, (X Λ)b 0 always has at least one solution b 0 of the form (49) where the freedom in the choice of b is available in the choice of a free vector z b. Theorem 1 Consider a class I tensegrity structure as defined by the geometry and force equations in the absence of external load as described by the geometric conditions B T p b ; S T p s ; p R 3np, b R 3n b, s R 3ns with n p 2n b, and the equilibrium conditions St Bf ; t Γs, f Λb 10

11 where for {γ m 0, λ n 0}, Γ diag{γ 1 I 3, γ 2 I 3,..., γ ns I 3 } ; Λ diag{λ 1 I 3, λ 2 I 3,..., λ nb I 3 }. Then given any tensile force coefficients {γ m 0, 1 m n s }, there exits compressive force coefficients {λ n 0, 1 m n b } and b, which define an equilibrium structure, satisfy the condition: (X Λ)b 0 ; X (S 1 V 2 )M 1 (S 1 V 2 ) T, M V T 2 Γ 1 V 2, (50) where S 1 is given by (17), and V 2 is given by (43). Moreover, for any b and Γ satisfying (50), the nodal vector p is of the form where z e may be arbitrarily chosen and Q [ I3nb 0 L U 2 p PQ[b T,z T e T (51) ; L U 1 Σ 1 11 VT 1 [Γ 1 V 2 M 1 V T 2 I 3ns S T 1. (52) The corresponding tensegrity tension vector t, string vector s, and compression vector f are given in terms of the bar vector b by t V 2 M 1 V T 2 S T 1 b ; s Γ 1 t ; f Λb (53) Externally Loaded Structures Under the action of an external force vector w with component vectors {w j } given by w T [w T 1,wT 2,...,wT n p (54) suppose that the new equilibrium structure is assumed to be given by node vector p, bar vector b, string vector s, compressive force vector f, tensile vector t, compressive force coefficient matrix Λ and tensile force matrix Γ as described by (34)-(38). Note that all force coefficients together with all node geometry will normally change. We now seek necessary and sufficient conditions for the externally loaded structure to be in equilibrium. An extension of Lemma 5 and Lemma 6 gives us the following result. Theorem 2 (i) All solutions t of (36) which guarantee (43) are of the form t V 2 M 1 V T 2 ST 1 b + D 1w ; M V T 2 Γ 1 V 2 D 1 (I 3ns V 2 M 1 V T 2 Γ 1 )V 1 Σ 1 11 UT 1 P 2 (55) (ii) A necessary and sufficient condition for (37), (38) to have a solution b R 3n b is given by where X is given by (47), and (X Λ)b Dw U T 2 P 2w 0 (56) D P 1 S 1 D 1 (57) 11

12 Proof : Since (34) is not directly dependent on w, Lemma 4 applies for w 0. Now consider the solution of (36) for w 0. A necessary condition for the existence of a solution t is U T 2 P 2 w 0, and in this case, all solutions t are of the form t V 2 z t + V 1 Σ 1 11 UT 1 P 2w for any z t R 3n b r where as in (41), r is the rank of S 2. Now in order that condition (43) is satisfied, z t must be selected such that That is V T 2 Γ 1 (V 2 z t + V 1 Σ 1 11 UT 1 P 2 w) V T 2 S T 1 b 0 which gives (55). From (55), (38) and (36) which gives (56). z t M 1 V T 2 ST 1 b M 1 V T 2 Γ 1 V 1 Σ 1 11 UT 1 P 2w 0 S 1 t P 1 w f S 1 V 2 M 1 V T 2 S T 1 b + S 1 D 1 w P 1 w Λb The first condition in (56) is a nonhomogeneous equivalent of condition (46). However it is unlikely (although not impossible) that Λ X for w 0. Instead, is more likely that r b ρ(x Λ) satisfies 0 < r b 3n b. If r b 3n b, then b (X Λ) 1 Dw is unique. When 0 < r b < 3n b, suppose {U b,σ b,v b } is the singular value decomposition of the matrix X Λ R 3n b 3n b ; that is U b [U b1,u b2 ; Σ b [ Σb ; V b [V b1,v b2 with U b1 R 3n b r b, V b2 R 3n b (3n b r b ). Then when U T 2 Dw 0, the solution b is of the form b V b2 z b + V b1 Σ 1 b11 UT b1dw ; U T 2 Dw 0 where z b R 3n b r b is arbitrary. The particular equilibrium obtained will depend on the way in which the external load w is introduced. The structural implications of the null space condition U T 2 Dw 0 on the external load w would then also require a physical interpretation. The existence of an equilibrium solution however requires the second condition in (56) on the external force w to be satisfied. In this regard, we have the following result. Lemma 9 For all structures {S,B}, the (3n b r) 3n s matrix product U T 2 P 2 is of the form for some nonsingular matrix E. Hence U T 2 P 2w 0 if and only if U T 2 E[I 3,I 3,...,I 3 (58) n p w k 0 (59) k1 Proof : It follows from svd(s 2 ) in Lemma 4 that U T 2 S 2 0 which from (17) implies U T 2 P 2S 0. Now from Lemma 1, each column of S has exactly one block I 3 and exactly one block I 3 with all other column elements 0. Furthermore, for every ith row of S, there exists a column j such that the ijth component of S is ±I 3. These properties of S then imply that U T 2 P 2 is of the form (58) for some (but not necessarily nonsingular) matrix E, and so 12

13 n U T 2 P p 2w E Now if the full row rank matrix U 2 is partitioned into the block form U T 2 [Z 1,Z 2,...,Z nb it follows from (23) that k1 w k U T 2 P 2 [Z 1,Z 1,Z 2,Z 2...,Z nb,z nb which then guarantees that U T 2 P 2 also has full row rank, and consequently that the matrix E is invertible. Condition (59) expresses the requirement that for an externally loaded tensegrity structure to be in equilibrium, it is necessary (but not sufficient) that the sum of the external forces is zero. COMPUTATIONAL ALGORITHM FOR EQUILIBRIA One suggested procedure for construction of a class I tensegrity structure in equilibrium is provided as follows. Design Algorithm A : step 1. Given the connectivity matrices S and B from the network topology, find a nonsingular matrix P [P T 1,PT 2 such that BT q BT P [I nb,0 nb, and calculate {S 1 P 1 S, S 2 P 2 S}. (Note that if B is defined as in (19), then {P 1,P 2 } are given by (23),(27), or (30). step 2. Choose {γ m > 0} and {λ n > 0} such that det(x Λ) 0. step 3. Select suitable b z and compute b (X Λ) b z based on a desired bar vector. step 4. Choose the free vector z e in (51), (52) to give a suitable node vector p based on a desired shape. step 5. calculate {t, s, f} from (53). Design Algorithm for Given Bar Vector b In the design of tensegrity structures, an alternative approach for the selection of the node vector p and bar vector b may be useful. From (50), it is easy to eliminate the variable Λ if b is known, since Λb bλ where b blockdiag [b 1,,b nb ; Lemma. λ [λ 1,,λ nb T. Hence, we can establish the following Lemma 10 For any tensegrity equilibrium, λ is given uniquely by λ b + Xb, (60) where b 1 + ( bt b) bt and b and Γ for all tensegrity structures must satisfy b L Xb 0. (61) where b L is the left null space basis of b and satisfies b L b 0 ; b L b T L > 0. 13

14 Proof : From (50), note that Xb Λb bλ has a solution λ if and only if (61) holds. In this case, the unique solution is given by (60) assuming b has full column rank. This assumption is guaranteed for b i 0, i 1,,n b. Note that (61) is equivalent to since (I b b ) + forms the left null space of b. ( I b b +) Xb 0 (62) Design Algorithm B : step 1. Same as in Design Algorithm A. step 2. Choose b and then compute Γ to satisfy (61). step 3. Compute λ from (60). step 4. Choose the free vector z e in (51), (52) to give a suitable node vector p based on a desired shape. step 5. calculate {t, s, f} from (53). Design Algorithm for Given Nodal Vector p One can first select the node vector p as in (51), (52) subject (if necessary) to other design constraints. The corresponding bar vector b is then determined from the first 3n b components of the vector P 1 p. When the node position vector p is given, we can establish following lemma. Lemma 11 A given node position vector p corresponds to a class I tensegrity equilibrium if and only if there exists a nonzero vector z such that [ γ [ S s B b z > 0, (63) λ where b blockdiag[b 1,,b nb ; s blockdiag [s 1,,s ns. Proof : Using f Λb bλ and t Γs sγ leads to the equilibrium condition St Bf [ S s B b [ γ 0. (64) λ The solutions of (64) for positive γ and λ yields (63). When we premultiply (64) by the coordinate transformation matrix P T given by (13), we can further simplify (64). Hence we establish the following Corollary. Corollary 3 A given node position vector p corresponds to a class I tensegrity equilibrium if and only if there exists a nonzero vector z such that [ γ λ [ I b + S 1 s (S 2 s) [ bl S 1 s(s 2 s) z > 0. (65) Proof : 14

15 Premultiplying by the coordinate transformation matrix P T given by (23) to (64) and using (20) yields P T (St Bf) S q t B q f [ [ [ [ γ S1 s b γ S q s B q b 0. λ S 2 s 0 λ Hence the existence condition for γ and λ require Then, all admissible force coefficients are (S 2 s) 0 ; b L S 1 sγ 0. (66) γ (S 2 s) z r (67) λ b + S 1 sγ b + S 1 s(s 2 s) z r. Substituting γ in (67) into the existence condition (66) yields b L S 1 s (S 2 s) z r 0. Hence z r is z r [ bl S 1 s (S 2 s) z, which completes the proof. Design Algorithm P : step 1. Same as in Design Algorithm A. step 2. Choose nodal vector p. step 3. Choose the free vector z in (63) and Compute λ and γ. step 4. calculate {t, s, f} from (53). ILLUSTRATED EXAMPLES We now illustrate the construction procedure for a simple tensegrity structure. 2-bar 4-string planar tensegrity structure A general force configuration for the class I tensegrity structure in Example 1 and 2 will be investigated in this section. Suppose the force coefficient matrices are given by Λ diag {λ 1, λ 2 } and Γ diag {γ 1, γ 2, γ 3, γ 4 }. We will demonstrate two procedures using Design Algorithms A and B. Design Algorithm A : step 1. The connectivity matrices S, B and the coordinate transformation P [P T 1,PT 2 are given in Example 1 and 2. Since V 2 spans the null space of S 2, we compute V I step 2. Choose {γ m > 0} and {λ n > 0} such that det(x Λ) 0, where ( X S 1 V 2 V T 2 Γ 1 ) 1 V 2 V T 2 S T 1 [ 1 (γ2 + γ 3 )(γ 4 + γ 1 ) ( γ 3 γ 1 + γ 2 γ 4 ) I2. γ 1 + γ 2 + γ 3 + γ 4 ( γ 3 γ 1 + γ 2 γ 4 ) (γ 3 + γ 4 ) (γ 2 + γ 1 ) 15

16 In all choices for {λ n } that led to the rank of (X Λ) having rank 1, the 4 2 matrix V X2 is of the form V T X2 [AT 1, ±A T 1 ; that is, in (49), the two bar vectors {b 1,b 2 } are always parallel, so the equilibrium structure is one dimensional with {p 1 p 3,p 2 p 4 }. Hence for a two-dimensional structure, X Λ must have rank zero. This requires γ 4 γ 3γ 1 γ 2 λ 1 (γ 2 + γ 3 )(γ 4 + γ 1 ) γ 2 + γ 3 + γ 4 + γ 1 λ 2 (γ 3 + γ 4 )(γ 2 + γ 1 ) γ 2 + γ 3 + γ 4 + γ 1, (68) where γ 1, γ 2, and γ 3 are free positive constants. If we choose {γ k 1; k 1, 2, 3}, then Γ I 4. It follows that X I 4 and Λ I 2 satisfy condition (50) in Theorem 1. step 3. Select suitable b z and compute b (X Λ) b z based on a desired bar vector. Since we choose γ and λ such that X Λ 0, the bar vector is arbitrary. Let s choose b 1 [2, 0 T,b 2 [0, 2 T. step 4. Choose the free vector z e in (51), (52) to give a suitable node vector p based on a desired shape. The nodes {p 1 [ 1, 0 T,p 2 [1, 0 T,p 3 [0, 1 T,p 4 [0, 1 T } define an equilibrium solution from (51) setting z e is zero. When z e [1, 1 T, we get p [ T. This choices of z e only translate the geometric center of the structure from [0, 0 T [1, 1 T, since the force coefficients and b have been specified. to Design Algorithm B : step 1. Connectivity matrices and the coordinate transformation matrix is the same as the step 1 in design algorithm A. step 2. Let s choose b 1 [2, 0,b 2 [0, 2. From (61), b L [ ; bl Xb Hence the equilibrium condition is reduced to 2 4 i1 γ i [ γ1 γ 3 + γ 2 γ 4 0. γ 1 γ 3 + γ 2 γ 4 γ 4 γ 3γ 1 γ 2. (69) Let s choose γ 1 γ 2 γ 3 1, and then γ 4 1 given by (69). step 3. Compute λ from (60). [ [ λ b + 1 (γ2 + γ Xb 3 )(γ 4 + γ 1 ) 1 γ 2 + γ 3 + γ 4 + γ 1 (γ 3 + γ 4 )(γ 2 + γ 1 ) 1 (70) step 4. When we choose the free vector z e [1, 1 T in (51), we get the node vector p [ T. Note that the existence conditions (70),(69) for λ and γ give the same results as (68). Design Algorithm P : 16

17 (A) Class I Design (B) Class II Design (z 1) (C) Class II Design (z 1) FIG Bar 4-String Tensegrity Structure step 1. Same as in design algorithm A. step 2. We choose p 1 [1, 0 T,p 2 [3, 0 T,p 3 [0, 1 T,p 4 [0, 1 T.(See Figure 2.(A) ) step 3. There is no choice of z e which satisfies (63). The choice of z 1 yields γ [ T ; λ [ 3 1 T. The choice of z e 1 obviously reverses all signs of this γ and λ. This proves that the configuration in Figure 2A can only be stabilized with class II tensegrity with negative γ 2, γ 3 and λ 1. Negative γ 2, γ 3 means that compression is required in these members, hence bars must replace these strings and negative λ 1 means that tension is required in this member. This yields the structure in Figure 2B, where thick lines are bars and thin lines are strings. In conclusion, the only class I tensegrity that exists for the topology of Figure 1 requires overlap of the bars. For the nodal configurations in Figure 2A, the bars do not overlap and no class I tensegrity exists. Two configurations of class II tensegrities are possible as shown in Figure 2B and 2C. Symmetrical Force Configuration for 3-bars 9-strings Tensegrity Structure A (3; 9; 3) class I tensegrity [9 consisting of one stage of n b 3 bars (so n p 6 nodes) with n s 9 strings has topology as illustrated in Figure 3 17

18 FIG Bar 9-String (3; 9; 3) Class I Tensegrity The corresponding geometric matrices {S,B} are given by I I 0 I I I 0 I 0 S I 0 I I 0 0 I 0 I I ; B 0 0 I 0 I I I 0 I I 0 0 I 0 0 I I 0 0 I I 0 0 I A symmetrical force configuration will be investigated with equal bar force coefficients {λ 1 λ 2 λ 3 λ}, equal base string force coefficients {γ 1 γ 2 γ 3 γb }, equal top string coefficients {γ 4 γ 5 γ 6 γt }, and equal vertical string coefficients {γ 7 γ 8 γ 9 γv }. Then where ( X S 1 V 2 V T 2 Γ 1 ) 1 V 2 V T 2 S T 1 1 [ (2 γ b2 + 8 γ b γ t + 6 γ b γ v + 6 γ v γ t + 2 γ t2 + 3 γ v2 )γt 3 X1 X 2 X 3 I3, γ3 b γ3 v X 1 X 2 X 3 (γ t + γ v + γ b ) ( γ v γ v γ t + 3 γ b γ v + 4 γ b γ t + γ b 2 + γ t 2 ) γ b γ v γ t γ b γ t 2 4 γ b 2 γ t 3 γ b 2 γ v γ b 3 + γ v γ t γ t γ v 2 + γ v 3 4 γ b γ t 2 γ b γ v γ t γ b 2 γ t + 2 γ b γ v 2 + γ b 2 γ v 3 γ v γ t 2 γ t 3 + γ v 3 γ b γ v γ t γ b γ t 2 4 γ b 2 γ t 3 γ b 2 γ v γ b 3 + γ v γ t γ t γ v 2 + γ v 3 10 γ b γ v γ t + 4 γ b γ t γ b 2 γ t + 5 γ b γ v γ b 2 γ v + γ b γ v γ t γ t γ v 2 + γ v 3 3 γ b γ t 2 γ b γ v γ t γ v γ t 2 + γ t γ v 2 3 γ b 2 γ t + γ b γ v 2 γ b 2 γ v + γ v 3 4 γ b γ t 2 γ b γ v γ t γ b 2 γ t + 2 γ b γ v 2 + γ b 2 γ v 3 γ v γ t 2 γ t 3 + γ v 3 3 γ b γ t 2 γ b γ v γ t γ v γ t 2 + γ t γ v 2 3 γ b 2 γ t + γ b γ v 2 γ b 2 γ v + γ v 3 6 γ v γ t γ t γ v γ b γ v γ t + 7 γ b γ t γ b 2 γ t + γ t 3 + γ v γ b γ v γ b 2 γ v 18

19 Now we have to solve the force coefficients based on the equilibrium conditions given by Lemma 8. If we apply (i) condition in Lemma 8, det(x Λ) (λ γ v ) 2 γ b2 + 8 γ b γ t + 6 γ b γ v + 6 γ v γ t + 2 γ t2 + 3 γ 2 λ second 0, v where λ second ( 2 γt 3 λ + 2 γ v 2 γ t γ v γ t γ b 3 γ t + 15 γ b 2 γ t γ b 2 γ v γ b γ t γ b 3 γ v 6 γ v 2 γ t λ 10 γ v γ t 2 λ 16 γ b 2 γ t λ + 2 γ b 2 λ 2 2 γ b 3 λ 10 γ b 2 γ v λ + 6 γ b λ 2 γ v 6 γ b λγ v γ b λ 2 γ t 16 γ b λγ t 2 22 γ b λγ v γ t + 2 λ 2 γ t λ 2 γ v λ 2 γ v γ t + 16 γ b γ t 2 γ v + 8 γ b γ t γ v γ b 2 γ v γ t ). Since smaller rank of (X Λ) yields more freedom for the choice of b, we choose γ v λ. Next evaluating second term when γ v λ, we get λ second γvλ 6 λ 2 γ t 2 6 γ b 2 λ γ b γ t γ b 3 γ t + 15 γ b 2 γ t 2 6 γ b λ 2 γ t + 3 λ 4 ( λ 2 γ t γ b 2γ 2 b) ( λ 2 γ t γ b 2γ 2 t ). We conclude λ γ t γ b + 2γb 2 or λ γ t γ b + 2γt 2, since λ > 0. When we apply λ γ t γ b + 2γt 2, we get X Λ (γ b γ t )(γ b + γ t ) 2 γ b2 + 6 γ b γ bt + 11 γ b γ t + 8 γ t2 + 6 γ t γ bt X where γ bt γt (γ b + 2 γ t ) and γ b + 2 γ bt + 3 γ t γ b 4 γ t 3 γ bt γ t + γ bt X γ b 4 γ t 3 γ bt γ b + 4 γ bt + 6 γ t 2 γ t γ bt I3 γ t + γ bt 2 γ t γ bt γ t Note that the rank of the matrix X is 1. An interesting case is when γ t γ b. In this case, an equilibrium solution with Λ X is provided by λ γ v 3γ t for all choices of {γ t }. When γ t γ b 1 and λ γ v 3, the structural shape is the prism given in Figure 3. Symmetrical Force Configuration for 6-bars 24-strings Tensegrity Structure A (6;24;3;3) class I tensegrity structure consisting of two stage of n b 6 bars ( so n p 12 nodes ) with n s 24 strings has topology as illustrated in Figure 4. Since the connectivity matrix for this example is quite big, we introduced another notation Bar and Tendon which is defined by Bar(Bar Id#, { Node Id #1, Node Id #2}) and Tendon (Tendon Id#, { Node Id #1, Node Id #2}). For simplicity, a symmetrical force configuration will be investigated in this example. Bars are defined by Bar(1, {1, 2}); Bar(2, {3, 4}); Bar(3, {5, 6}); Bar(4, {7, 8}); Bar(5, {9, 10}); Bar(6, {11, 12}); with equal bar force coefficients {λ 1 λ 2 λ 3 λ 4 λ 5 λ 6 λ}. Similariliy base and top strings are defined by Tendon(7, {1, 3}); Tendon(9, {3, 5}); Tendon(11, {5, 1}); Tendon(8, {8, 10}); Tendon(10, {10, 12}); Tendon(12, {12, 8}); 19

20 FIG Bar 24-String Class I Tensegrity with equal base and top string force coefficients {γ i γt } for all i Saddle strings are defined by Tendon(13, {2, 7}); Tendon(14, {2, 11}); Tendon(15, {4, 9}); Tendon(16, {4, 7}); Tendon(17, {6, 11}); Tendon(18, {6, 9}); with equal saddle string force coefficients {γ i γs } for all i Diagonal strings are defined by Tendon(19, {1, 11}); Tendon(20, {3, 7}); Tendon(21, {5, 9}); Tendon(22, {2, 8}); Tendon(23, {4, 10}); Tendon(24, {6, 12}); with equal diagonal string force coefficients {γ i γd } for all i Vertical strings are defined by Tendon(25, {1, 6}); Tendon(26, {3, 2}); Tendon(27, {5, 4}); Tendon(28, {7, 10}); Tendon(29, {9, 12}); Tendon(30, {11, 8}); with equal vertical string force coefficients {γ i γd } for all i For simplicity of calculation, we introduce scaled variables as following γ s γ s γ t ; γ v γ v γ t ; γ d γ d γ t ; λ λ γ t. Then the equilibrium condition (ii) in Lemma 8 is given by [ Λ S det 1 V 2 V2 T S T 1 V2 T Γ 1 0. V 2 This expression yields by using our scaled variables 6 ( γd γ v γ6 6 + λ ) ) γ v ( λ γd γ s γ d + γ s λ γv γ d γ s γ v s γ6 d 2 ( λ γd 3 γ d γ s γ d γ v γ d 3 γ v + 3 λ + 3 γ v λ 3 γs γ s γ v + γ s λ) ( λ γd γ d γ s γ d γ v γ d γ v + λ + γ v λ 3 γs γ s γ v + γ s λ) 2 0 (71) 20

21 There are many solutions satisfying this condition. Since we are interested in three dimensional stable equilbria, we seek those combinations that generate stable equilibria. After simulation to verify the stability, the following combinations were found to generate stable equilibria. λ γd γ s γ d + γ s λ γd γ v γ s γ v 0 (72) λ γd γ d γ s γ d γ d γ v γ v + λ + γ v λ 3 γs γ s γ v + γ s λ 0 (73) Now we analyze the equilibria (72) and (73). We solve (72) for λ to obtain λ γ s γ d + γ d γ v + γ s γ v γ s + γ d. (74) Since every variable is positive, this equation yields positive λ as required. Substituting (74) into (73) yields γ d γ s γ v + γ s γ d + γ 2 d γ d γ 2 v γ s γ 2 v + γ 2 s 0. (75) Requiring positiveness of γ v, (75) can be solved by γ v 1 2 γ s γ d + γ 2 d γ2 s + 8 γ2 s γ d + 8 γ s γ 2 d + 4 γ3 s + 4 γ3 d γ s + γ d. (76) With the use of original variables, (74) and (76) can be expressed as following λ γ s γ d + γ d γ v + γ s γ v γ s + γ d (77) γ v 1 γ s γ d + γd 2γ2 s + 4γ t (γ s + γ v )(γs 2 + γ2 v + γ sγ v ). (78) 2 γ s + γ d CONCLUSION This paper characterizes the static equilibria of a class I tensegrity structure. Analytical expressions are derived for the equilibrium condition of a tensegrity structure in terms of member force coefficients and string and bar connectivity information. We use vectors to describe each element (bars and tendons), eliminating the need to use direction cosines and the subsequent transcendental functions that follow their use. By enlarging the vector space in which we characterize the problem, the mathematical structure of the equations admit treatment by linear algebra methods, for the most part. This reduces the study of a significant portion of the tensegrity equilibria to a series of linear algebra problems. Our results characterize the equilibria conditions of tensegrity structures in terms of a very small number of variables since the necessary and sufficient conditions of the linear algebra treatment has eliminated several of the original variables. This formulation offers insight and identifies the free parameters that may be used to achieve desired structural shapes. Since all conditions are necessary and sufficient, these results can be used in the design of any tensegrity structure. Special insightful properties are available in the special case when one designs a tensegrity structure so that all strings have the same force per unit length(γ), and all bars have the same force per unit length(λ). In this case, all admissible values of λ γ are the discrete set of eigenvalues of a matrix given in terms of only the string connectivity matrix. Furthermore the only bar vectors which can be assigned are eigenvectors of the same matrix. Future papers will integrate these algorithms into software to make these designs more efficient. ACKNOWLEDGEMENTS This research were conducted by Dynamic Systems Research Inc. under the sponsorship of the Jet Propulsion Laboratory, technical monitors Dr. Marco Quadrelli and Fred Hadaegh. 21

22 (i) Equilibrium Configuration when γ t 0.1 (ii) Equilibrium Configuration when γ t 1 (iii) Equilibrium Configuration when γ t 10 FIG. 5. Two-stage Shell Class Tensegrity Structure when γ s γ d 1 References [1 R. Connelly, Rigidity and Energy, Inventiones Mathematicae, 66 (1), pp 11-33, [2 R. Connelly, Rigidity in: P.M. Gruber and J.M. Wills, ed., Handbook of Convex Geometry, Elsevier Publishers Ltd, pp , [3 R. Connelly, Tensegrity Structures: Why are they stable?, in: M.F. Thorpe and P.M. Duxbury, ed., Rigity Theory and Applications, Plenum Press, pp47-54, New York, [4 R. Connelly and A. Bach, Mathematics and Tensegrity, American Scientist, March, [5 D. E. Ingber, Tensegrity: The Architectural Basis of Cellular Mechanotransduction, Ann. Rev. of Physiology, 59, pp , [6 D. E. Ingber, Architecture of Life, Scientific American, Jan., pp48-57, [7 R.E. Skelton and C. Sultan, Controllable Tensegrity, Proc. SPIE 4th Ann. Symp. Smart Str. & Mats., San Diego, March [8 R.E. Skelton, W.J. Helton and R. Adhikari, Mechanics of Tensegrity Beams, UCSD, Structural Systems & Contr. Lab., Rep. No ,

23 [9 D. Williamson and R.E. Skelton, A General Class of Tensegrity Systems: Geometric Definition, Engineering Mechanics for the 21st Century, ASCE Conference, La Jolla, California, May, [10 D. Williamson and R.E. Skelton, A General Class of Tensegrity Systems: Equilibrium Analysis, Engineering Mechanics for the 21st Century, ASCE Conference, La Jolla, California, May, [11 R. Motro, Tensegrity Systems: The State of the Art, Int. J. Space Structures, 7(2):75-83, [12 Tibert and S. Pellegrino, Review of Form-Finding Methods for Tensegrity Strucutres, Tensegrity Workshop, Rome, May, 2001 [13 Motro, R., Foldable Tensegrities, in: S. Pellegrino, ed. Deployable Structures, Springer Verlag Wien-New York, [14 Ingber, D.E., Cellular tensegrity: defining new rules of biological design that govern the cytoskeleton, Journal of Cell Science, 104, 1993, [15 Pugh, A., An Introduction to Tensegrity, University of California Press, Berkeley, California, [16 Connelly, R. and Terrell, M., Globally rigid symmetric tensegrities, Structural Topology, 21, 1995, [17 Vassart, N. and Motro, R., Multiparametered form.nding method: application to tensegrity systems, International Journal of Space Structures, 14 (2), 1999, [18 Sultan, C., Corless, M., and Skelton, R.E., Reduced prestressability conditions for tensegrity structures, Proceedings of 40th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics and Materials Conference, April 1999, St Louis, MO, AIAA, [19 Barnes, M.R., Form-finding and analysis of prestressed nets and membranes, Computers & Structures, 30 (3), 1988, [20 Motro, R., Forms and forces in tensegrity systems, in: H. Nooshin, ed., Proceedings of Third International Conference on Space Structures, Elsevier, Amsterdam, 1984, [21 Motro, R., Tensegrity systems and geodesic domes, International Journal of Space Structures, 5 (3-4), 1990, [22 Motro, R., Belkacem, S., and Vassart, N., Form finding numerical methods for tensegrity systems, in: J.F. Abel, J.W. Leonard, and C.U. Penalba, ed., Proceedings of IASS-ASCE International Symposium on Spatial, Lattice and Tension Structures, Atlanta, USA, ASCE, 1994, [23 Kenner, H., Geodesic Math and How to Use It, University of California Press, Berkeley, California, [24 Schek, H.-J., The force density method for form finding and computation of general networks, Computer Methods in Applied Mechanics and Engineering, 3, 1974, [25 Linkwitz, K., Form finding by the direct approach and pertinent strategies for the conceptual design of prestressed and hanging structures, International Journal of Space Structures, 14 (2), 1999,

Equilibrium Conditions of a Tensegrity Structure

Equilibrium Conditions of a Tensegrity Structure Proceedings of the Third World Conference on Structural Control (3WCSC) Como, Italy, April 7-12, 2002 Equilibrium Conditions of a Tensegrity Structure Darrell Williamson, Robert E. Skelton, and JeongHeon

More information

Equilibrium Conditions of Class 1 Tensegrity Structures

Equilibrium Conditions of Class 1 Tensegrity Structures Revue francaise de genie civil, July, 2003 Equilibrium Conditions of Class 1 Tensegrity Structures Darrell Williamson, Robert E. Skelton, JeongHeon Han University of Wollongong, Faculty of Informatics,

More information

Review of Form-Finding Methods for Tensegrity Structures

Review of Form-Finding Methods for Tensegrity Structures Review of Form-Finding Methods for Tensegrity Structures A.G. Tibert and S. Pellegrino Department of Structural Engineering, Royal Institute of Technology SE-100 44 Stockholm, Sweden. Department of Engineering,

More information

(a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? Solution: dim N(A) 1, since rank(a) 3. Ax =

(a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? Solution: dim N(A) 1, since rank(a) 3. Ax = . (5 points) (a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? dim N(A), since rank(a) 3. (b) If we also know that Ax = has no solution, what do we know about the rank of A? C(A)

More information

OPTIMUM PRE-STRESS DESIGN FOR FREQUENCY REQUIREMENT OF TENSEGRITY STRUCTURES

OPTIMUM PRE-STRESS DESIGN FOR FREQUENCY REQUIREMENT OF TENSEGRITY STRUCTURES Blucher Mechanical Engineering Proceedings May 2014, vol. 1, num. 1 www.proceedings.blucher.com.br/evento/10wccm OPTIMUM PRE-STRESS DESIGN FOR FREQUENCY REQUIREMENT OF TENSEGRITY STRUCTURES Seif Dalil

More information

Conceptual Questions for Review

Conceptual Questions for Review Conceptual Questions for Review Chapter 1 1.1 Which vectors are linear combinations of v = (3, 1) and w = (4, 3)? 1.2 Compare the dot product of v = (3, 1) and w = (4, 3) to the product of their lengths.

More information

Properties of Linear Transformations from R n to R m

Properties of Linear Transformations from R n to R m Properties of Linear Transformations from R n to R m MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Topic Overview Relationship between the properties of a matrix transformation

More information

Economic sensor/actuator selection and its application to flexible structure control

Economic sensor/actuator selection and its application to flexible structure control To appear in Proc. SPIE Int. Soc. Opt. Eng. 2004 Economic sensor/actuator selection and its application to flexible structure control Robert E. Skelton a and Faming Li a a Department of Mechanical and

More information

Topology Optimization of Tensegrity Structures Based on Nonsmooth Mechanics. Yoshihiro Kanno. November 14, 2011 ACOMEN 2011

Topology Optimization of Tensegrity Structures Based on Nonsmooth Mechanics. Yoshihiro Kanno. November 14, 2011 ACOMEN 2011 Topology Optimization of Tensegrity Structures Based on Nonsmooth Mechanics Yoshihiro Kanno November 14, 2011 ACOMEN 2011 tensegrity definition tension + integrity [Fuller 75] [Emmerich], [Snelson] pin-jointed

More information

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2 MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

More information

EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 2

EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 2 EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 2 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory April 5, 2012 Andre Tkacenko

More information

Math 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination

Math 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination Math 0, Winter 07 Final Exam Review Chapter. Matrices and Gaussian Elimination { x + x =,. Different forms of a system of linear equations. Example: The x + 4x = 4. [ ] [ ] [ ] vector form (or the column

More information

Math Bootcamp An p-dimensional vector is p numbers put together. Written as. x 1 x =. x p

Math Bootcamp An p-dimensional vector is p numbers put together. Written as. x 1 x =. x p Math Bootcamp 2012 1 Review of matrix algebra 1.1 Vectors and rules of operations An p-dimensional vector is p numbers put together. Written as x 1 x =. x p. When p = 1, this represents a point in the

More information

Intrinsic products and factorizations of matrices

Intrinsic products and factorizations of matrices Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences

More information

Matrices and Vectors. Definition of Matrix. An MxN matrix A is a two-dimensional array of numbers A =

Matrices and Vectors. Definition of Matrix. An MxN matrix A is a two-dimensional array of numbers A = 30 MATHEMATICS REVIEW G A.1.1 Matrices and Vectors Definition of Matrix. An MxN matrix A is a two-dimensional array of numbers A = a 11 a 12... a 1N a 21 a 22... a 2N...... a M1 a M2... a MN A matrix can

More information

Discrete Optimization 23

Discrete Optimization 23 Discrete Optimization 23 2 Total Unimodularity (TU) and Its Applications In this section we will discuss the total unimodularity theory and its applications to flows in networks. 2.1 Total Unimodularity:

More information

Linear Algebra M1 - FIB. Contents: 5. Matrices, systems of linear equations and determinants 6. Vector space 7. Linear maps 8.

Linear Algebra M1 - FIB. Contents: 5. Matrices, systems of linear equations and determinants 6. Vector space 7. Linear maps 8. Linear Algebra M1 - FIB Contents: 5 Matrices, systems of linear equations and determinants 6 Vector space 7 Linear maps 8 Diagonalization Anna de Mier Montserrat Maureso Dept Matemàtica Aplicada II Translation:

More information

MA 527 first midterm review problems Hopefully final version as of October 2nd

MA 527 first midterm review problems Hopefully final version as of October 2nd MA 57 first midterm review problems Hopefully final version as of October nd The first midterm will be on Wednesday, October 4th, from 8 to 9 pm, in MTHW 0. It will cover all the material from the classes

More information

ON THE SINGULAR DECOMPOSITION OF MATRICES

ON THE SINGULAR DECOMPOSITION OF MATRICES An. Şt. Univ. Ovidius Constanţa Vol. 8, 00, 55 6 ON THE SINGULAR DECOMPOSITION OF MATRICES Alina PETRESCU-NIŢǍ Abstract This paper is an original presentation of the algorithm of the singular decomposition

More information

Solving Homogeneous Systems with Sub-matrices

Solving Homogeneous Systems with Sub-matrices Pure Mathematical Sciences, Vol 7, 218, no 1, 11-18 HIKARI Ltd, wwwm-hikaricom https://doiorg/112988/pms218843 Solving Homogeneous Systems with Sub-matrices Massoud Malek Mathematics, California State

More information

General elastic beam with an elastic foundation

General elastic beam with an elastic foundation General elastic beam with an elastic foundation Figure 1 shows a beam-column on an elastic foundation. The beam is connected to a continuous series of foundation springs. The other end of the foundation

More information

Introduction to Matrices and Linear Systems Ch. 3

Introduction to Matrices and Linear Systems Ch. 3 Introduction to Matrices and Linear Systems Ch. 3 Doreen De Leon Department of Mathematics, California State University, Fresno June, 5 Basic Matrix Concepts and Operations Section 3.4. Basic Matrix Concepts

More information

Chapters 5 & 6: Theory Review: Solutions Math 308 F Spring 2015

Chapters 5 & 6: Theory Review: Solutions Math 308 F Spring 2015 Chapters 5 & 6: Theory Review: Solutions Math 308 F Spring 205. If A is a 3 3 triangular matrix, explain why det(a) is equal to the product of entries on the diagonal. If A is a lower triangular or diagonal

More information

Practical Linear Algebra: A Geometry Toolbox

Practical Linear Algebra: A Geometry Toolbox Practical Linear Algebra: A Geometry Toolbox Third edition Chapter 12: Gauss for Linear Systems Gerald Farin & Dianne Hansford CRC Press, Taylor & Francis Group, An A K Peters Book www.farinhansford.com/books/pla

More information

SHAPE CONTROL OF A MULTI-AGENT SYSTEM USING TENSEGRITY STRUCTURES

SHAPE CONTROL OF A MULTI-AGENT SYSTEM USING TENSEGRITY STRUCTURES SHAPE CONTROL OF A MULTI-AGENT SYSTEM USING TENSEGRITY STRUCTURES Benjamin Nabet,1 Naomi Ehrich Leonard,1 Mechanical and Aerospace Engineering, Princeton University, Princeton, NJ 08544 USA, {bnabet, naomi}@princeton.edu

More information

MATH 583A REVIEW SESSION #1

MATH 583A REVIEW SESSION #1 MATH 583A REVIEW SESSION #1 BOJAN DURICKOVIC 1. Vector Spaces Very quick review of the basic linear algebra concepts (see any linear algebra textbook): (finite dimensional) vector space (or linear space),

More information

Jim Lambers MAT 610 Summer Session Lecture 1 Notes

Jim Lambers MAT 610 Summer Session Lecture 1 Notes Jim Lambers MAT 60 Summer Session 2009-0 Lecture Notes Introduction This course is about numerical linear algebra, which is the study of the approximate solution of fundamental problems from linear algebra

More information

arxiv: v1 [cs.sy] 2 Apr 2019

arxiv: v1 [cs.sy] 2 Apr 2019 On the Existence of a Fixed Spectrum for a Multi-channel Linear System: A Matroid Theory Approach F Liu 1 and A S Morse 1 arxiv:190401499v1 [cssy] 2 Apr 2019 Abstract Conditions for the existence of a

More information

Fall 2016 MATH*1160 Final Exam

Fall 2016 MATH*1160 Final Exam Fall 2016 MATH*1160 Final Exam Last name: (PRINT) First name: Student #: Instructor: M. R. Garvie Dec 16, 2016 INSTRUCTIONS: 1. The exam is 2 hours long. Do NOT start until instructed. You may use blank

More information

Least Sparsity of p-norm based Optimization Problems with p > 1

Least Sparsity of p-norm based Optimization Problems with p > 1 Least Sparsity of p-norm based Optimization Problems with p > Jinglai Shen and Seyedahmad Mousavi Original version: July, 07; Revision: February, 08 Abstract Motivated by l p -optimization arising from

More information

A MARCHING PROCEDURE FOR FORM-FINDING FOR TENSEGRITY STRUCTURES

A MARCHING PROCEDURE FOR FORM-FINDING FOR TENSEGRITY STRUCTURES JOURNAL OF MECHANICS OF MATERIALS AND STRUCTURES Vol., No., A MARCHING PROCEDURE FOR FORM-FINDING FOR TENSEGRITY STRUCTURES ANDREA MICHELETTI AND WILLIAM O. WILLIAMS We give an algorithm for solving the

More information

Linear Algebra & Geometry why is linear algebra useful in computer vision?

Linear Algebra & Geometry why is linear algebra useful in computer vision? Linear Algebra & Geometry why is linear algebra useful in computer vision? References: -Any book on linear algebra! -[HZ] chapters 2, 4 Some of the slides in this lecture are courtesy to Prof. Octavia

More information

EIGENVALUES AND EIGENVECTORS 3

EIGENVALUES AND EIGENVECTORS 3 EIGENVALUES AND EIGENVECTORS 3 1. Motivation 1.1. Diagonal matrices. Perhaps the simplest type of linear transformations are those whose matrix is diagonal (in some basis). Consider for example the matrices

More information

Symmetric Prismatic Tensegrity Structures: Part II. Symmetry-adapted Formulations

Symmetric Prismatic Tensegrity Structures: Part II. Symmetry-adapted Formulations Symmetric Prismatic Tensegrity Structures: Part II. Symmetry-adapted Formulations J.Y. Zhang a S.D. Guest b, M. Ohsaki a a Dept. of Architecture & Architectural Engineering, Kyoto University, Japan b Dept.

More information

Glossary of Linear Algebra Terms. Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB

Glossary of Linear Algebra Terms. Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB Glossary of Linear Algebra Terms Basis (for a subspace) A linearly independent set of vectors that spans the space Basic Variable A variable in a linear system that corresponds to a pivot column in the

More information

Foundations of Matrix Analysis

Foundations of Matrix Analysis 1 Foundations of Matrix Analysis In this chapter we recall the basic elements of linear algebra which will be employed in the remainder of the text For most of the proofs as well as for the details, the

More information

Matrix Operations: Determinant

Matrix Operations: Determinant Matrix Operations: Determinant Determinants Determinants are only applicable for square matrices. Determinant of the square matrix A is denoted as: det(a) or A Recall that the absolute value of the determinant

More information

Solvability of Linear Matrix Equations in a Symmetric Matrix Variable

Solvability of Linear Matrix Equations in a Symmetric Matrix Variable Solvability of Linear Matrix Equations in a Symmetric Matrix Variable Maurcio C. de Oliveira J. William Helton Abstract We study the solvability of generalized linear matrix equations of the Lyapunov type

More information

Frame Diagonalization of Matrices

Frame Diagonalization of Matrices Frame Diagonalization of Matrices Fumiko Futamura Mathematics and Computer Science Department Southwestern University 00 E University Ave Georgetown, Texas 78626 U.S.A. Phone: + (52) 863-98 Fax: + (52)

More information

Linear Algebra Primer

Linear Algebra Primer Linear Algebra Primer David Doria daviddoria@gmail.com Wednesday 3 rd December, 2008 Contents Why is it called Linear Algebra? 4 2 What is a Matrix? 4 2. Input and Output.....................................

More information

Equality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same.

Equality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same. Introduction Matrix Operations Matrix: An m n matrix A is an m-by-n array of scalars from a field (for example real numbers) of the form a a a n a a a n A a m a m a mn The order (or size) of A is m n (read

More information

Lecture Summaries for Linear Algebra M51A

Lecture Summaries for Linear Algebra M51A These lecture summaries may also be viewed online by clicking the L icon at the top right of any lecture screen. Lecture Summaries for Linear Algebra M51A refers to the section in the textbook. Lecture

More information

Mathematical Foundations of Applied Statistics: Matrix Algebra

Mathematical Foundations of Applied Statistics: Matrix Algebra Mathematical Foundations of Applied Statistics: Matrix Algebra Steffen Unkel Department of Medical Statistics University Medical Center Göttingen, Germany Winter term 2018/19 1/105 Literature Seber, G.

More information

LEC 2: Principal Component Analysis (PCA) A First Dimensionality Reduction Approach

LEC 2: Principal Component Analysis (PCA) A First Dimensionality Reduction Approach LEC 2: Principal Component Analysis (PCA) A First Dimensionality Reduction Approach Dr. Guangliang Chen February 9, 2016 Outline Introduction Review of linear algebra Matrix SVD PCA Motivation The digits

More information

The spectra of super line multigraphs

The spectra of super line multigraphs The spectra of super line multigraphs Jay Bagga Department of Computer Science Ball State University Muncie, IN jbagga@bsuedu Robert B Ellis Department of Applied Mathematics Illinois Institute of Technology

More information

Boolean Inner-Product Spaces and Boolean Matrices

Boolean Inner-Product Spaces and Boolean Matrices Boolean Inner-Product Spaces and Boolean Matrices Stan Gudder Department of Mathematics, University of Denver, Denver CO 80208 Frédéric Latrémolière Department of Mathematics, University of Denver, Denver

More information

The Singular Value Decomposition (SVD) and Principal Component Analysis (PCA)

The Singular Value Decomposition (SVD) and Principal Component Analysis (PCA) Chapter 5 The Singular Value Decomposition (SVD) and Principal Component Analysis (PCA) 5.1 Basics of SVD 5.1.1 Review of Key Concepts We review some key definitions and results about matrices that will

More information

OHSx XM511 Linear Algebra: Solutions to Online True/False Exercises

OHSx XM511 Linear Algebra: Solutions to Online True/False Exercises This document gives the solutions to all of the online exercises for OHSx XM511. The section ( ) numbers refer to the textbook. TYPE I are True/False. Answers are in square brackets [. Lecture 02 ( 1.1)

More information

3 Matrix Algebra. 3.1 Operations on matrices

3 Matrix Algebra. 3.1 Operations on matrices 3 Matrix Algebra A matrix is a rectangular array of numbers; it is of size m n if it has m rows and n columns. A 1 n matrix is a row vector; an m 1 matrix is a column vector. For example: 1 5 3 5 3 5 8

More information

Math 240 Calculus III

Math 240 Calculus III The Calculus III Summer 2015, Session II Wednesday, July 8, 2015 Agenda 1. of the determinant 2. determinants 3. of determinants What is the determinant? Yesterday: Ax = b has a unique solution when A

More information

Linear Algebra Review. Vectors

Linear Algebra Review. Vectors Linear Algebra Review 9/4/7 Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa (UCSD) Cogsci 8F Linear Algebra review Vectors

More information

Maslov indices and monodromy

Maslov indices and monodromy Loughborough University Institutional Repository Maslov indices and monodromy This item was submitted to Loughborough University's Institutional Repository by the/an author. Additional Information: This

More information

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2017 LECTURE 5

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2017 LECTURE 5 STAT 39: MATHEMATICAL COMPUTATIONS I FALL 17 LECTURE 5 1 existence of svd Theorem 1 (Existence of SVD) Every matrix has a singular value decomposition (condensed version) Proof Let A C m n and for simplicity

More information

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2016 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing

More information

Lecture 12: Diagonalization

Lecture 12: Diagonalization Lecture : Diagonalization A square matrix D is called diagonal if all but diagonal entries are zero: a a D a n 5 n n. () Diagonal matrices are the simplest matrices that are basically equivalent to vectors

More information

Solutions Problem Set 8 Math 240, Fall

Solutions Problem Set 8 Math 240, Fall Solutions Problem Set 8 Math 240, Fall 2012 5.6 T/F.2. True. If A is upper or lower diagonal, to make det(a λi) 0, we need product of the main diagonal elements of A λi to be 0, which means λ is one of

More information

Dynamics and control of tensegrity systems

Dynamics and control of tensegrity systems Dynamics and control of tensegrity systems Robert Skelton Feb 24, 24 Abstract This paper introduces rigid body dynamics in a new form, as a matrix differential equation, rather than the traditional vector

More information

Maths for Signals and Systems Linear Algebra in Engineering

Maths for Signals and Systems Linear Algebra in Engineering Maths for Signals and Systems Linear Algebra in Engineering Lectures 13 15, Tuesday 8 th and Friday 11 th November 016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE

More information

Study Guide for Linear Algebra Exam 2

Study Guide for Linear Algebra Exam 2 Study Guide for Linear Algebra Exam 2 Term Vector Space Definition A Vector Space is a nonempty set V of objects, on which are defined two operations, called addition and multiplication by scalars (real

More information

Introduction to Matrix Algebra

Introduction to Matrix Algebra Introduction to Matrix Algebra August 18, 2010 1 Vectors 1.1 Notations A p-dimensional vector is p numbers put together. Written as x 1 x =. x p. When p = 1, this represents a point in the line. When p

More information

Problem # Max points possible Actual score Total 120

Problem # Max points possible Actual score Total 120 FINAL EXAMINATION - MATH 2121, FALL 2017. Name: ID#: Email: Lecture & Tutorial: Problem # Max points possible Actual score 1 15 2 15 3 10 4 15 5 15 6 15 7 10 8 10 9 15 Total 120 You have 180 minutes to

More information

Prestress stability. Lecture VI. Session on Granular Matter Institut Henri Poincaré. R. Connelly Cornell University Department of Mathematics

Prestress stability. Lecture VI. Session on Granular Matter Institut Henri Poincaré. R. Connelly Cornell University Department of Mathematics Prestress stability Lecture VI Session on Granular Matter Institut Henri Poincaré R. Connelly Cornell University Department of Mathematics 1 Potential functions How is the stability of a structure determined

More information

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each

More information

Matrix Inequalities by Means of Block Matrices 1

Matrix Inequalities by Means of Block Matrices 1 Mathematical Inequalities & Applications, Vol. 4, No. 4, 200, pp. 48-490. Matrix Inequalities by Means of Block Matrices Fuzhen Zhang 2 Department of Math, Science and Technology Nova Southeastern University,

More information

Chapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors

Chapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors Chapter 7 Canonical Forms 7.1 Eigenvalues and Eigenvectors Definition 7.1.1. Let V be a vector space over the field F and let T be a linear operator on V. An eigenvalue of T is a scalar λ F such that there

More information

NOTES FOR LINEAR ALGEBRA 133

NOTES FOR LINEAR ALGEBRA 133 NOTES FOR LINEAR ALGEBRA 33 William J Anderson McGill University These are not official notes for Math 33 identical to the notes projected in class They are intended for Anderson s section 4, and are 2

More information

Semidefinite Programming

Semidefinite Programming Semidefinite Programming Notes by Bernd Sturmfels for the lecture on June 26, 208, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra The transition from linear algebra to nonlinear algebra has

More information

1. Linear systems of equations. Chapters 7-8: Linear Algebra. Solution(s) of a linear system of equations (continued)

1. Linear systems of equations. Chapters 7-8: Linear Algebra. Solution(s) of a linear system of equations (continued) 1 A linear system of equations of the form Sections 75, 78 & 81 a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2 a m1 x 1 + a m2 x 2 + + a mn x n = b m can be written in matrix

More information

Review of linear algebra

Review of linear algebra Review of linear algebra 1 Vectors and matrices We will just touch very briefly on certain aspects of linear algebra, most of which should be familiar. Recall that we deal with vectors, i.e. elements of

More information

Linear Algebra - Part II

Linear Algebra - Part II Linear Algebra - Part II Projection, Eigendecomposition, SVD (Adapted from Sargur Srihari s slides) Brief Review from Part 1 Symmetric Matrix: A = A T Orthogonal Matrix: A T A = AA T = I and A 1 = A T

More information

3 (Maths) Linear Algebra

3 (Maths) Linear Algebra 3 (Maths) Linear Algebra References: Simon and Blume, chapters 6 to 11, 16 and 23; Pemberton and Rau, chapters 11 to 13 and 25; Sundaram, sections 1.3 and 1.5. The methods and concepts of linear algebra

More information

Rigid Geometric Transformations

Rigid Geometric Transformations Rigid Geometric Transformations Carlo Tomasi This note is a quick refresher of the geometry of rigid transformations in three-dimensional space, expressed in Cartesian coordinates. 1 Cartesian Coordinates

More information

Remark By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.

Remark By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero. Sec 6 Eigenvalues and Eigenvectors Definition An eigenvector of an n n matrix A is a nonzero vector x such that A x λ x for some scalar λ A scalar λ is called an eigenvalue of A if there is a nontrivial

More information

2. Linear algebra. matrices and vectors. linear equations. range and nullspace of matrices. function of vectors, gradient and Hessian

2. Linear algebra. matrices and vectors. linear equations. range and nullspace of matrices. function of vectors, gradient and Hessian FE661 - Statistical Methods for Financial Engineering 2. Linear algebra Jitkomut Songsiri matrices and vectors linear equations range and nullspace of matrices function of vectors, gradient and Hessian

More information

Remark 1 By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.

Remark 1 By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero. Sec 5 Eigenvectors and Eigenvalues In this chapter, vector means column vector Definition An eigenvector of an n n matrix A is a nonzero vector x such that A x λ x for some scalar λ A scalar λ is called

More information

Rigidity of Skeletal Structures

Rigidity of Skeletal Structures CHAPTER 3 Rigidity of Skeletal Structures 3. INTRODUCTION The rigidity of structures has been studied by pioneering structural engineers such as Henneberg [79] and Müller-Breslau [76]. The methods they

More information

Review of Linear Algebra

Review of Linear Algebra Review of Linear Algebra Definitions An m n (read "m by n") matrix, is a rectangular array of entries, where m is the number of rows and n the number of columns. 2 Definitions (Con t) A is square if m=

More information

Chapter 7. Linear Algebra: Matrices, Vectors,

Chapter 7. Linear Algebra: Matrices, Vectors, Chapter 7. Linear Algebra: Matrices, Vectors, Determinants. Linear Systems Linear algebra includes the theory and application of linear systems of equations, linear transformations, and eigenvalue problems.

More information

Review of Some Concepts from Linear Algebra: Part 2

Review of Some Concepts from Linear Algebra: Part 2 Review of Some Concepts from Linear Algebra: Part 2 Department of Mathematics Boise State University January 16, 2019 Math 566 Linear Algebra Review: Part 2 January 16, 2019 1 / 22 Vector spaces A set

More information

12. Perturbed Matrices

12. Perturbed Matrices MAT334 : Applied Linear Algebra Mike Newman, winter 208 2. Perturbed Matrices motivation We want to solve a system Ax = b in a context where A and b are not known exactly. There might be experimental errors,

More information

Math Camp II. Basic Linear Algebra. Yiqing Xu. Aug 26, 2014 MIT

Math Camp II. Basic Linear Algebra. Yiqing Xu. Aug 26, 2014 MIT Math Camp II Basic Linear Algebra Yiqing Xu MIT Aug 26, 2014 1 Solving Systems of Linear Equations 2 Vectors and Vector Spaces 3 Matrices 4 Least Squares Systems of Linear Equations Definition A linear

More information

MTH Linear Algebra. Study Guide. Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education

MTH Linear Algebra. Study Guide. Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education MTH 3 Linear Algebra Study Guide Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education June 3, ii Contents Table of Contents iii Matrix Algebra. Real Life

More information

Linear Algebra March 16, 2019

Linear Algebra March 16, 2019 Linear Algebra March 16, 2019 2 Contents 0.1 Notation................................ 4 1 Systems of linear equations, and matrices 5 1.1 Systems of linear equations..................... 5 1.2 Augmented

More information

Linear Algebra Review. Fei-Fei Li

Linear Algebra Review. Fei-Fei Li Linear Algebra Review Fei-Fei Li 1 / 37 Vectors Vectors and matrices are just collections of ordered numbers that represent something: movements in space, scaling factors, pixel brightnesses, etc. A vector

More information

Chapter 4 - MATRIX ALGEBRA. ... a 2j... a 2n. a i1 a i2... a ij... a in

Chapter 4 - MATRIX ALGEBRA. ... a 2j... a 2n. a i1 a i2... a ij... a in Chapter 4 - MATRIX ALGEBRA 4.1. Matrix Operations A a 11 a 12... a 1j... a 1n a 21. a 22.... a 2j... a 2n. a i1 a i2... a ij... a in... a m1 a m2... a mj... a mn The entry in the ith row and the jth column

More information

Almost Sharp Quantum Effects

Almost Sharp Quantum Effects Almost Sharp Quantum Effects Alvaro Arias and Stan Gudder Department of Mathematics The University of Denver Denver, Colorado 80208 April 15, 2004 Abstract Quantum effects are represented by operators

More information

A Brief Outline of Math 355

A Brief Outline of Math 355 A Brief Outline of Math 355 Lecture 1 The geometry of linear equations; elimination with matrices A system of m linear equations with n unknowns can be thought of geometrically as m hyperplanes intersecting

More information

IRREDUCIBLE REPRESENTATIONS OF SEMISIMPLE LIE ALGEBRAS. Contents

IRREDUCIBLE REPRESENTATIONS OF SEMISIMPLE LIE ALGEBRAS. Contents IRREDUCIBLE REPRESENTATIONS OF SEMISIMPLE LIE ALGEBRAS NEEL PATEL Abstract. The goal of this paper is to study the irreducible representations of semisimple Lie algebras. We will begin by considering two

More information

Presentation by: H. Sarper. Chapter 2 - Learning Objectives

Presentation by: H. Sarper. Chapter 2 - Learning Objectives Chapter Basic Linear lgebra to accompany Introduction to Mathematical Programming Operations Research, Volume, th edition, by Wayne L. Winston and Munirpallam Venkataramanan Presentation by: H. Sarper

More information

Math113: Linear Algebra. Beifang Chen

Math113: Linear Algebra. Beifang Chen Math3: Linear Algebra Beifang Chen Spring 26 Contents Systems of Linear Equations 3 Systems of Linear Equations 3 Linear Systems 3 2 Geometric Interpretation 3 3 Matrices of Linear Systems 4 4 Elementary

More information

. = V c = V [x]v (5.1) c 1. c k

. = V c = V [x]v (5.1) c 1. c k Chapter 5 Linear Algebra It can be argued that all of linear algebra can be understood using the four fundamental subspaces associated with a matrix Because they form the foundation on which we later work,

More information

Product distance matrix of a tree with matrix weights

Product distance matrix of a tree with matrix weights Product distance matrix of a tree with matrix weights R B Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India email: rbb@isidacin Sivaramakrishnan Sivasubramanian

More information

18.06 Professor Johnson Quiz 1 October 3, 2007

18.06 Professor Johnson Quiz 1 October 3, 2007 18.6 Professor Johnson Quiz 1 October 3, 7 SOLUTIONS 1 3 pts.) A given circuit network directed graph) which has an m n incidence matrix A rows = edges, columns = nodes) and a conductance matrix C [diagonal

More information

Math 443 Differential Geometry Spring Handout 3: Bilinear and Quadratic Forms This handout should be read just before Chapter 4 of the textbook.

Math 443 Differential Geometry Spring Handout 3: Bilinear and Quadratic Forms This handout should be read just before Chapter 4 of the textbook. Math 443 Differential Geometry Spring 2013 Handout 3: Bilinear and Quadratic Forms This handout should be read just before Chapter 4 of the textbook. Endomorphisms of a Vector Space This handout discusses

More information

Fundamentals of Linear Algebra. Marcel B. Finan Arkansas Tech University c All Rights Reserved

Fundamentals of Linear Algebra. Marcel B. Finan Arkansas Tech University c All Rights Reserved Fundamentals of Linear Algebra Marcel B. Finan Arkansas Tech University c All Rights Reserved 2 PREFACE Linear algebra has evolved as a branch of mathematics with wide range of applications to the natural

More information

Matrices A brief introduction

Matrices A brief introduction Matrices A brief introduction Basilio Bona DAUIN Politecnico di Torino Semester 1, 2014-15 B. Bona (DAUIN) Matrices Semester 1, 2014-15 1 / 41 Definitions Definition A matrix is a set of N real or complex

More information

NETWORK FORMULATION OF STRUCTURAL ANALYSIS

NETWORK FORMULATION OF STRUCTURAL ANALYSIS Chapter 4 NETWORK FORMULATION OF STRUCTURAL ANALYSIS 4.1 INTRODUCTION Graph theoretical concepts have been widely employed for the analysis of networks in the field of electrical engineering. Kirchhoff

More information

4. Determinants.

4. Determinants. 4. Determinants 4.1. Determinants; Cofactor Expansion Determinants of 2 2 and 3 3 Matrices 2 2 determinant 4.1. Determinants; Cofactor Expansion Determinants of 2 2 and 3 3 Matrices 3 3 determinant 4.1.

More information

Operations On Networks Of Discrete And Generalized Conductors

Operations On Networks Of Discrete And Generalized Conductors Operations On Networks Of Discrete And Generalized Conductors Kevin Rosema e-mail: bigyouth@hardy.u.washington.edu 8/18/92 1 Introduction The most basic unit of transaction will be the discrete conductor.

More information

Math Matrix Algebra

Math Matrix Algebra Math 44 - Matrix Algebra Review notes - 4 (Alberto Bressan, Spring 27) Review of complex numbers In this chapter we shall need to work with complex numbers z C These can be written in the form z = a+ib,

More information