Last data update: 2014.03.03

Data Source

R Release (3.2.3)
CranContrib
BioConductor
All

Data Type

Packages
Functions
Images
Data set

Classification

Results 1 - 10 of 18 found.
[1] < 1 2 > [2]  Sort:

allTotallyUnimodular (Package: lintools) : Test if a list of matrices are all unimodular

Helper function for raghavachari
● Data Source: CranContrib
● Keywords: internal
● Alias: allTotallyUnimodular
● 0 images

lintools (Package: lintools) : Tools for manipulating linear systems of (in)equations

Tools for manipulating linear systems of (in)equations
● Data Source: CranContrib
● Keywords:
● Alias: lintools, lintools-package
● 0 images

sparse_constraints (Package: lintools) : Generate sparse set of constraints.

Generate a constraint set to be used by sparse_project
● Data Source: CranContrib
● Keywords:
● Alias: print.sparse_constraints, sparseConstraints, sparse_constraints, sparse_constraints.data.frame
● 0 images

ranges (Package: lintools) : Derive variable ranges from linear restrictions

Gaussian and/or Fourier-Motzkin elimination is used to derive upper and lower limits implied by a system of (in)equations.
● Data Source: CranContrib
● Keywords:
● Alias: ranges
● 0 images

block_index (Package: lintools) : Find independent blocks of equations.

Find independent blocks of equations.
● Data Source: CranContrib
● Keywords:
● Alias: block_index
● 0 images

compact (Package: lintools) : Remove spurious variables and restrictions

A system of linear (in)equations can be compactified by removing zero-rows and zero-columns (=variables). Such rows and columns may arise after substitution (see subst_value) or eliminaton of a variable (see eliminate).
● Data Source: CranContrib
● Keywords:
● Alias: compact
● 0 images

reduceMatrix (Package: lintools) : Apply reduction method from Scholtus (2008)

Apply the reduction method in the appendix of Scholtus (2008) to a matrix. Let A with coefficients in {-1,0,1}. If, after a possible permutation of columns it can be written in the form A=[B,C] where each column in B has at most 1 nonzero element, then A is totally unimodular if and only if C is totally unimodular. By transposition, a similar theorem holds for the rows of A. This function iteratively removes rows and columns with only 1 nonzero element from A and returns the reduced result.
● Data Source: CranContrib
● Keywords: internal
● Alias: reduceMatrix
● 0 images

pinv (Package: lintools) : Moore-Penrose pseudoinverse

Compute the pseudoinverse of a matrix using the SVD-construction
● Data Source: CranContrib
● Keywords:
● Alias: pinv
● 0 images

hellerTompkins (Package: lintools) : Determine if a matrix is totally unimodular using Heller and Tompkins criterium.

This function is deducorrect internal
● Data Source: CranContrib
● Keywords: internal
● Alias: hellerTompkins
● 0 images

is_feasible (Package: lintools) : Check feasibility of a system of linear (in)equations

Check feasibility of a system of linear (in)equations
● Data Source: CranContrib
● Keywords:
● Alias: is_feasible
● 0 images