Abstract:
Systems and methods for combined matrix-vector and matrix-transpose vector multiply for block sparse matrices. Exemplary embodiments include a method of updating a simulation of physical objects in an interactive computer, including generating a set of representations of objects in the interactive computer environment, partitioning the set of representations into a plurality of subsets such that objects in any given set interact only with other objects in that set, generating a vector b describing an expected position of each object at the end of a time interval h, applying a biconjugate gradient algorithm to solve A*Δv=b for the vector Δv of position and velocity changes to be applied to each object wherein the q=Ap and qt=A T (pt) calculations are combined so that A only has to be read once, integrating the updated motion vectors to determine a next state of the simulated objects, and converting the simulated objects to a visual.

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
     This application is a continuation of U.S. patent application Ser. No. 12/057,693, filed Mar. 28, 2008, the disclosure of which is incorporated by reference herein in its entirety. 
    
    
     BACKGROUND 
     This invention relates to matrix-vector calculations on general-purpose computers, and particularly to systems and methods for a combined matrix-vector and matrix-transpose vector multiply for a block sparse matrix on a single instruction, multiple data (SIMD) processor. 
     A physics engine for an online game provides simulation of a simplified model of real-world physics. Typically, integration is required to determine, given position and momentum information about the objects in the world, where each object will be after the next time step. This determination can be done using semi-implicit integration of a penalty force-based system (a dynamic system that enforces constraints by applying a restorative force when a constraint is violated). The properties of the system are represented as a block-sparse matrix A and a vector b. The biconjugate gradient algorithm is used to solve A*Δv=b, and then the vector Δv is used to update the system for the next time step. For the online game application, speed of computation is more important than great accuracy; it is sufficient to perform these calculations in single precision floating point without taking special measures to ensure numerical accuracy. 
     The physics engine for an online game may operate as follows. In a typical online game physics engine, each object in the virtual world is represented as one or more rigid bodies; multiple bodies may be necessary to represent such things as robots with moving parts. The system stores information about the position and motion of each rigid body at a given time t 0 , along with an indication of whether each body is potentially moving (active) or at rest (sleeping). This indication reduces the amount of calculation required because unless something happens to a sleeping body, it remains where it is and there is no need to calculate a new position for it. In order to derive the positions and motions of the active bodies at some future time t 0 +Δt, the following steps are performed: 1) determine which of the rigid bodies are colliding; 2) wake any sleeping bodies with which an active body has collided; 3) partition the active bodies into non-interacting groups; 4) put to sleep the active bodies in any group which has come to rest; and 5) integrate each of the groups of active bodies to determine their position/motion for the next step. 
     For game systems developed to run on the Cell Broadband Engine Architecture (Cell BE), the first four steps run on the power-processing element (PPE), the main processor, which acts as a controller for the several synergistic processing elements (SPEs). The integration step (which is numerically intensive) is farmed out to the SPEs. Ideally, each partition of the set of active bodies is handled by a single SPE. In practice, the size of the group that fits on an SPE is constrained by the amount of local store available on the SPE. Therefore, an additional step of decoupling, which breaks up the groups into smaller groups, is used to obtain groups that fit on an SPE. This step introduces some errors into the simulation, but they can be managed. However, the necessity of decoupling places a premium on a space-efficient implementation of the integration algorithm; the less storage is required to integrate a group of a given size, the larger the group that can be integrated without decoupling. 
     To integrate a group on the SPE, the PPE supplies information on the positions and motions of the rigid bodies in the group, the forces which connect them (these can be used to define hinges and joints), and the points where one rigid body is in contact with another. The SPE then performs the following steps: 1) form the matrix A and the vector b which describe the system; 2) solve A*Δv=b using the biconjugate gradient method; and 3) return Δv to the PPE, which uses it to update the positions and motions of the rigid bodies. 
     In the maximal coordinates representation, each rigid body contributes six coordinates to b, and A is a square matrix containing six elements per dimension for each rigid body. A is typically block-sparse; that is, it can be divided into a grid of 6×6-element submatrices, most of which are all zero but a few of which have nonzero elements. In particular, the diagonal blocks are nonzero, and there is a pair of off-diagonal nonzero blocks for each pair of bodies that interact directly. It is well known that by storing only the nonzero blocks, along with information giving the position of each block within the matrix, the storage required for the array A can be greatly reduced, and the computation required to perform calculations which can only yield zero results can be avoided. 
     The biconjugate gradient algorithm used to solve A*Δv=b is well-known, and can be expressed as follows: 
     
       
         
               
               
             
               
               
             
               
               
             
               
               
             
               
               
             
               
               
             
               
               
             
           
               
                   
                   
               
             
             
               
                   
                 Pseudocode: 
               
               
                   
                 Compute r (0)  = b − Ax (0)  for some initial guess x (0) . 
               
               
                   
                 Choose {tilde over (r)} (0)  (for example, {tilde over (r)} (0)  = r (0) ). 
               
               
                   
                 for i = 1, 2, ... 
               
             
          
           
               
                   
                 solve Mz (i−1)  = r (i−1)   
               
               
                   
                 solve M T {tilde over (z)} (i−1)  = {tilde over (r)} (i−1)   
               
               
                   
                 ρ i−1  = z (i−1)τ {tilde over (r)} (i−1)   
               
               
                   
                 if ρ i−1  = 0, method fails 
               
               
                   
                 if i = 1 
               
             
          
           
               
                   
                 p (i)  = z (i−1)   
               
               
                   
                 {tilde over (p)} (i)  = {tilde over (z)} (i−1)   
               
             
          
           
               
                   
                 else 
               
             
          
           
               
                   
                 β i−1  = ρ i−1 /ρ i−2   
               
               
                   
                 p (i)  = z (i−1)  + β i−1 p (i−1)   
               
               
                   
                 {tilde over (p)} (i)  = {tilde over (z)} (i−1)  + β i−1 {tilde over (p)} (i−1)   
               
             
          
           
               
                   
                 endif 
               
               
                   
                 q (i)  = Ap (i)   
               
               
                   
                 {tilde over (q)} (i)  = A T {tilde over (p)} (i)   
               
               
                   
                 α i  = ρ i−1 /{tilde over (p)} (i)τ  q (i)   
               
               
                   
                 x (i)  = x (i−1)  + α i p (i)   
               
               
                   
                 r (i)  = r (i−1)  − α i q (i)   
               
               
                   
                 {tilde over (r)} (i)  = {tilde over (r)} (i−1)  − α i {tilde over (q)} (i)   
               
               
                   
                 check convergence; continue if necessary 
               
             
          
           
               
                   
                 end 
               
               
                   
                   
               
             
          
         
       
     
     The pseudocode above is from a “Mathworld” (mathworld.com) article by Noel Black and Shirley Moore, adapted from Barret et al (1994). The computation at the top of the loop is sometimes simplified (at a cost of possibly having to do more iterations) by replacing the preconditioner M with the identity matrix. In this case the first two lines in the loop become z (i-1) =r (i-1)  and {tilde over (z)} (i-1) ={tilde over (r)} (i-1) . Inspection of the subsequent calculations shows that it is not necessary to form z and {tilde over (z)} at all; r and {tilde over (r)} can be substituted. The most computationally intensive part of this procedure that remains is the formation of the two matrix-vector products q (i) =Ap (i)  and {tilde over (q)} (i) =A T {tilde over (p)} (i) . The straightforward way to do this computation is to have a procedure which multiplies a matrix and a vector together, to use it to obtain the first product, to form the transpose of A, and to use the routine again to form the second product. The disadvantages of this are the computation and storage required to form the transpose of A and the fact that the elements of A must be read out of storage twice per iteration for the multiplications, once from the original matrix and once from the transpose. In addition, for a processor such as the Cell BE SPE, the number of instructions used to load and store the data required for a matrix-vector multiply is much larger than the number of arithmetic instructions needed to perform the calculations, so that the full capability of the processor cannot be utilized. 
     There persists a need for modifications to the above-discussed pseudo-code for a combined matrix-vector and matrix-transpose vector multiply for a block sparse matrix on a single instruction, multiple data (SIMD) processor having the characteristics of the Cell BE SPE, namely, the ability to execute many instructions at once but with latencies of several cycles before results are available, and the desirability of having the number of arithmetic and logical computations at least as large as the number of loads and stores. 
     BRIEF SUMMARY 
     Embodiments of the invention include a method of updating a simulation of physical objects in an interactive computer environment having a processor, a memory and a display, the method including generating a set of representations of objects in the interactive computer environment; partitioning the set of representations into a plurality of subsets such that objects in any given set interact only with other objects in that set; generating a system of linear equations A*Δv=b which describe the changes in velocities Δv in terms of known characteristics of the objects such as mass and forces acting on the objects, said characteristics being used to generate the block-sparse matrix A and the vector b; applying a biconjugate gradient algorithm to solve A*Δv=b for the vector Δv of velocity changes to be applied to each object, wherein a single matrix-vector multiplication routine is called once per iteration to perform two matrix-vector multiplications, one involving A and the other involving the transpose of A, to determine the values of two vectors used to update the residuals used in the biconjugate gradient algorithm; applying the velocity changes to determine a next state of the simulated objects; and converting the simulated objects to a visual representation comprising pixel data for display. 
     Additional embodiments include a method for a combined matrix-vector and matrix transpose-vector multiplication calculation for a block-sparse matrix A which computes q=Ap and qt=A T pt for iteratively solving a system of equations AΔv=b for updating a simulation of physical objects in an interactive computer environment, the computer environment having a processor, a memory in which the matrix A and vectors p, pt, q, and qt are stored, and a plurality of registers capable of representing and operating on multiple matrix or vector elements in a single operation, the method including storing the matrix A as a collection of nonzero subblocks chained in a first dimension, with one chain for each position in a second dimension, such that each block includes an index giving its position in said first dimension and the subblock elements are stored in groups corresponding to the register size and ordered reading along said first dimension within the group; initializing each element of the vector q to zero; for each subblock chain along said second dimension, performing the steps of a) for each position along said first dimension of the subblock, initializing a register to all zeros as an accumulator; b) for each position along said second dimension of the subblock, filling a register with copies of the element of the p vector corresponding to that position; c) for each subblock in said chain, performing the steps of reading all groups of elements of said subblock into registers; reading the elements of q corresponding to the subblock elements along said second dimension into one or more registers, adding to said registers the sum of the products of the appropriate registers of matrix elements and copies of the p vector elements corresponding to said horizontal positions in the subblocks, and using the resulting register values to update said elements of q corresponding to said subblock elements along said second dimension; forming the products of the matrix elements with the elements of pt corresponding to the positions along said first axis and adding them to the corresponding accumulators; d) for each accumulator, summing the individual elements of the accumulator and storing the result as the element of qt corresponding to the chain offset by the accumulator&#39;s position within the subblock. 
     Further embodiments include a computer readable medium having computer executable instructions for performing a method of updating a simulation of physical objects in an interactive computer environment having a processor, a memory and a display, the method including generating a set of representations of objects in the interactive computer environment, partitioning the set of representations into a plurality of subsets such that objects in any given set interact only with other objects in that set, generating a block-sparse matrix A and a vector b for each subset, the block-sparse matrix representing the interactions between the objects in the subset, wherein nonzero sub-matrices representing the direct interaction of the objects are stored along with coordinate information corresponding to a position of each one of the plurality of sub-matrices within the first matrix, the sub-matrices being derived from the characteristics of the objects, applying a biconjugate gradient algorithm to solve A*Δv=b for the vector Δv of velocity changes to be applied to each object, wherein a single matrix-vector multiplication routine is called once per iteration to determine the values of two vectors used to update the residuals used in the biconjugate gradient algorithm, applying the vector of velocity changes Δv to determine a next state of the simulated objects, and converting the simulated objects to a visual representation comprising pixel data for presentation on the display. 
     Further embodiments include a computer readable medium having computer executable instructions for performing a method of updating a simulation of physical objects in an interactive computer environment having a processor, a memory and a display, the method including generating a set of representations of objects in the interactive computer environment, partitioning the set of representations into a plurality of subsets such that objects in any given set interact only with other objects in that set, applying a biconjugate gradient algorithm to solve A*Δv=b for the vector Δv of velocity changes to be applied to each object, wherein solving A*Δv=b comprises the following steps: 
     a. determining b-Ax, wherein A is a block-sparse matrix representing interactions between the objects and b is a vector representing an expected position of the objects; 
     b. assigning results of the b-Ax calculation to vectors r, rt, p, and pt; 
     c. defining a vector procedure computing the dot product of r and rt; 
     d. using the vector procedure to determine if the dot product result is 0, in which case, recording a calculation failure; 
     e. calculating the vectors q=Ap and qt=A T (pt) using a single procedure which reads each subblock of A only once; 
     f. calculating scalar quantities α and β; 
     g. updating the x, r and rt vectors as defined by x=x+αp, r=r−αq, and rt=rt−αqt; 
     h. computing the dot product of r and rt; 
     i. defining a test procedure for determining convergence of the dot product of r and rt; 
     j. using the test procedure to determine if convergence has occurred, in which case, recording a complete calculation; 
     k. using the vector procedure to determine if the dot product result is 0, in which case, recording a calculation failure; 
     l. updating the scalar β and the vectors p and pt; 
     m. iteratively repeating steps e-l until convergence of r and rt is achieved; 
     applying the vector of velocity changes Δv to determine a next state of the simulated objects; and converting the simulated objects to a visual representation comprising pixel data for presentation on the display. 
     Further embodiments include a method for a combined matrix-vector and matrix transpose-vector calculation for a block-sparse matrix A which computes q=Ap and qt=A T (pt), for iteratively solving a system of equations A*Δv=b for updating a simulation of physical objects in an interactive computer environment, said computer environment having a processor, a memory in which said matrix A and vectors p, pt, q, and qt are stored, and a plurality of registers capable of representing and operating on multiple matrix or vector elements in a single operation, the method including storing the matrix A as a collection of nonzero subblocks chained in a first dimension, with one chain for each position in a second dimension, such that each block includes an index giving its position in said first dimension and the subblock elements are stored in groups corresponding to the register size and ordered reading along said first dimension within the group, initializing each element of the vector q to zero, for each subblock chain along said second dimension, performing, for each position along said first dimension of the subblock, initializing a register to all zeroes as an accumulator, for each position along said second dimension of the subblock, filling a register with copies of the element of the p vector corresponding to that position, for each subblock in said chain, performing, reading all groups of elements of said subblock into registers, reading the elements of q corresponding to the subblock elements along said second dimension into one or more registers, adding to said registers the sum of the products of the appropriate registers of matrix elements and copies of the p vector elements corresponding to said horizontal positions in the subblocks, and using the resulting register values to update said elements of q corresponding to said subblock elements along said second dimension, forming the products of the matrix elements with the elements of pt corresponding to the positions along said first axis and adding them to the corresponding accumulators, for each accumulator, summing the individual elements of the accumulator and storing the result as the element of qt corresponding to the chain offset by the accumulator&#39;s position within the subblock. 
     Other systems, methods, and/or computer program products according to embodiments will be or become apparent to one with skill in the art upon review of the following drawings and detailed description. It is intended that all such additional systems, methods, and/or computer program products be included within this description, be within the scope of the present invention, and be protected by the accompanying claims. 
     TECHNICAL EFFECTS 
     As a result of the summarized invention, technically a novel implementation of the matrix-vector calculations q=A*p and qt=A T *pt for a block-sparse matrix A and vectors p, pt, q, and qt which does not require explicit formation of A T  has been achieved. The methods described herein can be implemented on a SIMD processor architecture such as that of the Cell BE SPEs. This method avoids forming the transposes of the individual blocks as well as of the full matrix; the transpose of the blocks is implicit in the way the multiplications are performed and accumulated. As such, rearrangement of the elements of each block to create a transposed block can be bypassed. This method reduces the amount of storage required and is more efficient on a SIMD architecture than forming the transpose of A and doing two separate matrix-vector multiplications. 
    
    
     
       BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS 
       The subject matter which is regarded as the invention is particularly pointed out and distinctly claimed in the claims at the conclusion of the specification. The foregoing and other objects, features, and advantages of the invention are apparent from the following detailed description taken in conjunction with the accompanying drawings in which: 
         FIG. 1  illustrates a system level diagram of a computer system in accordance with exemplary embodiments; 
         FIG. 2  illustrates a flow chart of pseudocode implementing the solution of A*Δv=b; 
         FIG. 3  shows an example of how the square matrix A may be represented in computer storage; 
         FIG. 4  shows the calculations implemented to update the q and qt vectors for each 6×6 subblock in the matrix A; and 
         FIG. 5  illustrates an exemplary method of the computation of  FIG. 4 . 
     
    
    
     The detailed description explains the preferred embodiments of the invention, together with advantages and features, by way of example with reference to the drawings. 
     DETAILED DESCRIPTION 
     Exemplary embodiments include systems and methods for a combined matrix-vector and matrix-transpose vector multiply for a block sparse matrix on a single instruction, multiple data (SIMD) processor. 
     In another exemplary embodiment, a similar calculation can be performed with chaining across block rows, the groups in row-major order, and the index indicating the subblock column, in which case p/q and pt/qt would change places. 
       FIG. 1  illustrates a system level diagram of a computer system  10  in accordance with exemplary embodiments. System  10  includes a general-purpose processor  20  which can include the ability to carry out the scalar, vector, matrix etc. operations described herein. Processor is further coupled to a display  22 , a storage device  24 , such as a hard drive, and various peripherals  26  for aiding in the implementation of the methods described herein. System  10  further includes a memory  30  for storing instructions, data, calculations, etc. described herein. As discussed above, system  10  can include a single instruction, multiple data (SIMD) processor as processor  20 . 
       FIG. 2  illustrates a flow chart of pseudocode implementing the solution of A*Δv=b. The preconditioner M can be defined to be the identity matrix, so that the “solve” operations reduce to vector copies and the “z” vectors can be replaced by references to the “r” vectors. The loop is rearranged to remove the test for the first iteration. The vectors {tilde over (p)}, {tilde over (q)}, and {tilde over (r)} are referred to as pt, qt, and rt, respectively; the t&#39;s can be thought of as standing for either “tilde” (from the description of the algorithm above) or “transpose” (because they participate in the transpose multiply). Given a sparse matrix A, a vector b, and an initial approximation to the solution x (which in our application is a vector consisting entirely of zeroes), several expressions can be computed. First, b-Ax is computed and the result assigned to each of the vectors r, rt, p, and pt at step  110 . The dot product of r with rt is also computed at step  110 . If this result is zero at step  120 , the method fails. The two matrix-vector products q and qt are computed at step  130 . As discussed further below, it is appreciated that the computation of the vectors q and qt are calculated by a single matrix vector multiplication routine that is called once per iteration to determine the value of updated vectors. The scalars alpha and beta are then computed, alpha is used to update the x, r, and rt vectors, and the dot product of r and rt is computed at step  140 . Check for convergence at step  150  (in which case the computations are complete) and for a zero dot product at step  160  (in which case the method fails). If there is no 0 dot product at step  160 , beta is calculated and used to update the p and pt vectors at step  170 , and the loop repeats. With these modifications, there remain two lines in the biconjugate gradient loop that are particularly computation-intensive: the lines involving multiplication of A and A T  by vectors. 
     A feature of the SPE of the Cell BE is its SIMD architecture; it has a large number of 128-bit (“quadword”) registers. Each register is capable of holding four floating-point values, and instructions that operate on these registers can operate on all elements of a register (or registers) simultaneously. Thus, if two registers containing (a,b,c,d) and (e,f,g,h) are added, a result of (a+e, b+f, c+g, d+h) is obtained. A single instruction can also load or store four floating-point values residing in properly aligned contiguous storage locations. 
       FIG. 3  shows an example of how the square matrix A may be represented in computer storage. Each 6×6 block contains 36 single-precision floats of element data, a row index, and a pointer to the next block in the column. In an exemplary implementation, the 36 elements are stored three to a quadword, with the fourth word containing 0, and the vectors are similarly stored three elements to a quadword. Although it is contemplated to pack them as four to a quadword, calculations outside the biconjugate gradient routine become more complicated. In an exemplary embodiment, the diagonal elements are stored as a one-dimensional array so that the array index of an element indicates its row and column, and the other elements in the column are chained from the diagonal element. It is appreciated that the order in which the elements are chained can vary; a different ordering may produce a slightly different result because of operations being done in a different order. The Λ values indicate null pointers and mark the ends of the chains. If there are additional blocks in the portions of  FIG. 3  marked “ . . . ”, the null chain pointers above them are replaced by pointers to the first such additional block in each column. 
     The computation of q=Ap and qt=A T pt is now discussed. In general, p and pt are inputs and q and qt are outputs.  FIG. 4  shows the calculations implemented to update the q and qt vectors for each 6×6 subblock in the matrix A, and  FIG. 5  illustrates an exemplary method of the computation. The matrix elements m ij  are shown in the center of  FIG. 4 , where i is the row index and j is the column index within the subblock. The subblocks of A are stored as four 3×3 blocks; the 3×3 blocks are stored in row-major order but within each block the elements are stored in column-major order, for ease of computation. Each rectangle in the figure represents a quadword (four single-precision floats), but the fourth word is not used and is not illustrated in  FIG. 4 . The groups of rectangles show the 3×3 blocks. The 6×6 subblocks are processed reading down the block columns of A. 
     Referring to  FIG. 5 , the q vector is initialized to all zeroes at step  210 . The column number j is set to 0. At step  220 , test to see if the last block column has been processed; if so, processing is complete. Otherwise, the first 6×6 subblock in the chain for the current column is addressed at step  230 , which in an exemplary embodiment is the diagonal element. Six elements of the p vector are read, indexed by 6j, 6j+1, 6j+2, . . . , 6j+5 and denoted v 0 , v 1 , . . . , v 5 , and shuffled into six “v registers”, each of which has three copies of one of the elements. These elements are used to update six elements of the q vector for each subblock in the column. Six 4-float accumulators tacc 0 , tacc 1 , . . . , tacc 5  are initialized so that each contains four zero entries; these accumulators store partial results used to calculate six elements of the qt vector corresponding to the current column, since by reading down the block columns of A, the block rows of A T  are read across. The loop which processes one 6×6 subblock is then entered at step  240 . 
     The row index i is read from the current subblock, and the matrix elements m ij  are loaded into quadword registers as shown in  FIG. 4 . Each 6×6 subblock causes six elements of q to be updated based on the matrix elements and six elements of p. The six elements of q are loaded into two accumulators acc 0  and acc 1 . The v registers are then multiplied with the associated matrix elements as indicated by the dots in  FIG. 4 , and the products are summed as shown by the lines. It is appreciated that in a SIMD architecture such as that of the Cell BE, vectors are multiplied or summed element by element. Thus, acc 0  accumulates the first three elements of the revised q vector, which are q0+Σm 0i v i , q1+Σm 1i v i , and q2+Σm 2i v i , and acc 1  accumulates the second three elements, which are q3+Σm 3i v i , q4+Σm 4i v i , and q5+Σm 5i v i . These results are stored back into the q vector as the updated values. 
     To compute the current subblock&#39;s contribution to the six qt values corresponding to the current block column, the appropriate six entries of pt (denoted w 0 , w 1 , . . . , w 5 ) are read into two quadword registers, and then multiplied with the appropriate subblock elements as shown by the dots in  FIG. 4 . It is appreciated that although 12 “w” registers are shown in  FIG. 4 , there are two distinct sets of values, representing two “w” registers which are each used six times. Two of the resulting products are accumulated into each of the taccN registers. Each taccN register thus has the entries (m 0N w 0 +m 3N w 3 , m 1N w 1 +m 4N w 4 , m 2N w 2 +m 5N w 5 ) added to it element-wise. These values sum to the required Σm iN w N . In an exemplary implementation, these sums are completed when all of the subblocks in the block column of A have been processed. The sums of the elements of the taccN registers can then be calculated and stored as the next six elements of qt. In an exemplary implementation, summing the elements of a quadword register is performed outside of the inner loop, at step  260 . 
     After a subblock is processed, the block pointer to address the next subblock in the chain is updated. If there is another block in the chain, the loop to process it is repeated. When the end of the chain is reached, the elements of each of the taccN accumulators are summed and the results qt[6j], qt[6j+1], . . . , qt[6j+5] are stored at step  260 . If a next block column exists, it is then processed. 
     It is therefore appreciated that the handling of the A matrix can be minimized by utilizing the features that each 6×6 block affects only six elements of each result vector, and by observing that it is possible to avoid forming the transposes of the individual blocks. By reading down the block columns of A, the shuffling of the elements of p and the summing of the partial results of the transpose multiply are moved out of the inner loop. In a register-rich architecture such as the Cell BE SPE, all of the 36 block elements can be loaded into registers (three to a register) with remaining registers for accumulators and other operands. The transpose of the block is implicit in the way the multiplications are performed and accumulated. In general, the block elements do not have to be rearranged to create a transposed block. The aforementioned loops described above can allow inputs to be loaded farther ahead of the places where they are needed (to cover load latencies), and supplemental accumulators can be implemented to allow more operations to proceed in parallel. 
     This algorithm is useful because on the Cell BE SPE space is at a premium and a relatively high ratio of computation to storage access and branch instructions is desirable. Other solvers can be substituted for the biconjugate gradient. For example, the conjugate gradient squared algorithm replaces multiplies by A and A T  with two multiplies by A, but the data dependencies are such that they cannot be combined. The overhead of going through A twice remains, and since there is less computation per loop it is harder to utilize the power of the SPE effectively. 
     Therefore, it is appreciated that a method for a combined matrix-vector and matrix-transpose vector multiply for a block sparse matrix on a single instruction, multiple data (SIMD) processor is described herein. In an exemplary implementation, the following instructions can be implemented for the above-described methods. 
     Store the block-sparse matrix A as a collection of nonzero subblocks. The blocks are chained in a first dimension (e.g., vertical), with one chain for each position in a second dimension (e.g., horizontal). Each block includes an index giving its position in the matrix in the first dimension. The elements of the subblock are stored in groups corresponding to the processor register size; within each group, elements are ordered reading along the first dimension. 
     Store the vectors p and pt with elements grouped corresponding to the subblock and processor register sizes (e.g., three to a quadword). 
     Store the vector q with elements grouped corresponding to the subblock and processor register sizes, with all elements initialized to 0. In an exemplary implementation, no initialization is performed for the vector qt. 
     For each subblock chain along the second dimension (i.e. each block column),
         For each position along the first dimension of the subblock, initialize a register taccN to all zeroes as an accumulator.   For each position along the second dimension of the subblock, fill a register vN with copies of the element of the p vector corresponding to that position.   For each subblock in the chain,
           Read all groups of elements of the subblock into registers.   Read the elements of q corresponding to the subblock elements along the second dimension into one or more registers. In another exemplary implementation, the sum of the products of the appropriate registers of matrix elements and the SIMD registers vN containing copies of the elements of p corresponding to the horizontal positions in the subblocks are added to the register(s). The resulting register values are used to update the elements of q corresponding to the subblock elements along the second dimension.   Form the products of the appropriate registers of matrix elements with the elements of pt corresponding to the positions along the first axis and they are added to the taccN accumulators.   
           For each the taccN accumulator, the individual elements of the accumulator are summed and the result is stored as the element of qt corresponding to current block column, offset by the accumulator&#39;s position within the block.       

     The capabilities of the present invention can be implemented in software, firmware, hardware or some combination thereof. 
     As one example, one or more aspects of the present invention can be included in an article of manufacture (e.g., one or more computer program products) having, for instance, computer usable media. The media has embodied therein, for instance, computer readable program code means for providing and facilitating the capabilities of the present invention. The article of manufacture can be included as a part of a computer system or sold separately. 
     Additionally, at least one program storage device readable by a machine, tangibly embodying at least one program of instructions executable by the machine to perform the capabilities of the present invention can be provided. 
     The flow diagrams depicted herein are just examples. There may be many variations to these diagrams or the steps (or operations) described therein without departing from the spirit of the invention. For instance, the steps may be performed in a differing order, or steps may be added, deleted or modified. All of these variations are considered a part of the claimed invention. 
     As described above, embodiments can be embodied in the form of computer-implemented processes and apparatuses for practicing those processes. In exemplary embodiments, the invention is embodied in computer program code executed by one or more network elements. Embodiments include computer program code containing instructions embodied in tangible media, such as floppy diskettes, CD-ROMs, hard drives, or any other computer-readable storage medium, wherein, when the computer program code is loaded into and executed by a computer, the computer becomes an apparatus for practicing the invention. Embodiments include computer program code, for example, whether stored in a storage medium, loaded into and/or executed by a computer, or transmitted over some transmission medium, such as over electrical wiring or cabling, through fiber optics, or via electromagnetic radiation, wherein, when the computer program code is loaded into and executed by a computer, the computer becomes an apparatus for practicing the invention. When implemented on a general-purpose microprocessor, the computer program code segments configure the microprocessor to create specific logic circuits. 
     While the invention has been described with reference to exemplary embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted for elements thereof without departing from the scope of the invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the invention without departing from the essential scope thereof. Therefore, it is intended that the invention not be limited to the particular embodiment disclosed as the best mode contemplated for carrying out this invention, but that the invention will include all embodiments falling within the scope of the appended claims. Moreover, the use of the terms first, second, etc. do not denote any order or importance, but rather the terms first, second, etc. are used to distinguish one element from another. Furthermore, the use of the terms a, an, etc. do not denote a limitation of quantity, but rather denote the presence of at least one of the referenced item.