Random sampling of inverse linear problems with linear equality and inequality constraints. Uses either a "hit and run" algorithm (random or coordinate directions) or a mirroring technique for sampling.
● Data Source:
CranContrib
● Keywords: algebra, array, optimize
● Alias: xsample
●
0 images
|
Solves the linear system of equations
● Data Source:
CranContrib
● Keywords: array
● Alias: Solve.tridiag
●
0 images
|
Solves an lsei inverse problem (Least Squares with Equality and Inequality Constraints)
● Data Source:
CranContrib
● Keywords: algebra, array, optimize
● Alias: lsei
●
0 images
|
Solves the linear system A*X=B where A is an almost block diagonal matrix of the form:
● Data Source:
CranContrib
● Keywords: array
● Alias: Solve.block
●
0 images
|
Solves the following inverse problem:
● Data Source:
CranContrib
● Keywords: algebra, array, optimize
● Alias: ldp
●
0 images
|
Functions that:
● Data Source:
CranContrib
● Keywords: package
● Alias: limSolve, limSolve-package
●
0 images
|
Given an input matrix or its singular value decomposition,
● Data Source:
CranContrib
● Keywords: array
● Alias: resolution
●
0 images
|
Given the linear constraints
● Data Source:
CranContrib
● Keywords: algebra, array, optimize
● Alias: varranges
●
0 images
|
Solves a linear programming problem,
● Data Source:
CranContrib
● Keywords: algebra, array, optimize
● Alias: linp
●
0 images
|
Uses random samples of an under- or overdetermined linear problem to estimate the distribution of equations
● Data Source:
CranContrib
● Keywords: algebra, array
● Alias: varsample
●
0 images
|