cudd/cuddMatMult.c File Reference

Matrix multiplication functions. More...

#include "util.h"
#include "cuddInt.h"
Include dependency graph for cuddMatMult.c:

Functions

DdNodeCudd_addMatrixMultiply (DdManager *dd, DdNode *A, DdNode *B, DdNode **z, int nz)
 Calculates the product of two matrices represented as ADDs.
DdNodeCudd_addTimesPlus (DdManager *dd, DdNode *A, DdNode *B, DdNode **z, int nz)
 Calculates the product of two matrices represented as ADDs.
DdNodeCudd_addTriangle (DdManager *dd, DdNode *f, DdNode *g, DdNode **z, int nz)
 Performs the triangulation step for the shortest path computation.
DdNodeCudd_addOuterSum (DdManager *dd, DdNode *M, DdNode *r, DdNode *c)
 Takes the minimum of a matrix and the outer sum of two vectors.
static DdNodeaddMMRecur (DdManager *dd, DdNode *A, DdNode *B, int topP, int *vars)
 Performs the recursive step of Cudd_addMatrixMultiply.
static DdNodeaddTriangleRecur (DdManager *dd, DdNode *f, DdNode *g, int *vars, DdNode *cube)
 Performs the recursive step of Cudd_addTriangle.
static DdNodecuddAddOuterSumRecur (DdManager *dd, DdNode *M, DdNode *r, DdNode *c)
 Performs the recursive step of Cudd_addOuterSum.

Detailed Description

Matrix multiplication functions.

Author:
Fabio Somenzi

Copyright (c) 1995-2015, Regents of the University of Colorado

All rights reserved.

Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:

Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.

Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.

Neither the name of the University of Colorado nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.


Function Documentation

static DdNode* addMMRecur ( DdManager dd,
DdNode A,
DdNode B,
int  topP,
int *  vars 
) [static]

Performs the recursive step of Cudd_addMatrixMultiply.

Returns:
a pointer to the result if successful; NULL otherwise.
Side effects
None
static DdNode* addTriangleRecur ( DdManager dd,
DdNode f,
DdNode g,
int *  vars,
DdNode cube 
) [static]

Performs the recursive step of Cudd_addTriangle.

Returns:
a pointer to the result if successful; NULL otherwise.
Side effects
None
DdNode* Cudd_addMatrixMultiply ( DdManager dd,
DdNode A,
DdNode B,
DdNode **  z,
int  nz 
)

Calculates the product of two matrices represented as ADDs.

This procedure implements the quasiring multiplication algorithm. A is assumed to depend on variables x (rows) and z (columns). B is assumed to depend on variables z (rows) and y (columns). The product of A and B then depends on x (rows) and y (columns). Only the z variables have to be explicitly identified; they are the "summation" variables.

Returns:
a pointer to the result if successful; NULL otherwise.
Side effects
None
See also:
Cudd_addTimesPlus Cudd_addTriangle Cudd_bddAndAbstract
DdNode* Cudd_addOuterSum ( DdManager dd,
DdNode M,
DdNode r,
DdNode c 
)

Takes the minimum of a matrix and the outer sum of two vectors.

Takes the pointwise minimum of a matrix and the outer sum of two vectors. This procedure is used in the Floyd-Warshall all-pair shortest path algorithm.

Returns:
a pointer to the result if successful; NULL otherwise.
Side effects
None
DdNode* Cudd_addTimesPlus ( DdManager dd,
DdNode A,
DdNode B,
DdNode **  z,
int  nz 
)

Calculates the product of two matrices represented as ADDs.

Calculates the product of two matrices, A and B, represented as ADDs, using the CMU matrix by matrix multiplication procedure by Clarke et al.. Matrix A has x's as row variables and z's as column variables, while matrix B has z's as row variables and y's as column variables. The resulting matrix has x's as row variables and y's as column variables.

Returns:
the pointer to the result if successful; NULL otherwise.
Side effects
None
See also:
Cudd_addMatrixMultiply
DdNode* Cudd_addTriangle ( DdManager dd,
DdNode f,
DdNode g,
DdNode **  z,
int  nz 
)

Performs the triangulation step for the shortest path computation.

Implements the semiring multiplication algorithm used in the triangulation step for the shortest path computation. f is assumed to depend on variables x (rows) and z (columns). g is assumed to depend on variables z (rows) and y (columns). The product of f and g then depends on x (rows) and y (columns). Only the z variables have to be explicitly identified; they are the "abstraction" variables.

Returns:
a pointer to the result if successful; NULL otherwise.
Side effects
None
See also:
Cudd_addMatrixMultiply Cudd_bddAndAbstract
static DdNode* cuddAddOuterSumRecur ( DdManager dd,
DdNode M,
DdNode r,
DdNode c 
) [static]

Performs the recursive step of Cudd_addOuterSum.

Returns:
a pointer to the result if successful; NULL otherwise.
Side effects
None
 All Data Structures Files Functions Variables Typedefs Enumerations Defines

Generated on 31 Dec 2015 for cudd by  doxygen 1.6.1