Distributed Processing
This mode assumes that the data set is split into
nblocks
blocks across computation nodes.Algorithm Parameters
QR decomposition in the distributed processing mode has the following parameters:
Parameter | Default Valude | Description |
---|---|---|
computeStep | Not applicable | The parameter required to initialize the algorithm. Can be:
|
algorithmFPType | float | The floating-point type that the algorithm uses for intermediate computations. Can be float or double . |
method | defaultDense | Performance-oriented computation method, the only method supported by the algorithm. |
Use the three-step computation schema to compute QR decomposition:
Step 1 - on Local Nodes
QR Decomposition without Pivoting: Distributed Processing, Step 1 - on Local Nodes

In this step, QR decomposition accepts the input described below.
Pass the
Input ID
as a parameter to the methods that provide input for your algorithm.
For more details, see Algorithms.Input ID | Input |
---|---|
data | Pointer to the The input can be an object of any class derived from NumericTable . |
In this step, QR decomposition calculates the results described below.
Pass the
Partial Result ID
as a parameter to the methods that access the results of your algorithm.
For more details, see Algorithms.Partial Result ID | Result |
---|---|
outputOfStep1ForStep2 | A collection that contains numeric tables each with the partial result to transmit to the master node for Step 2. By default, these tables are objects of the HomogenNumericTable class,
but you can define them as objects of any class derived from NumericTable
except the PackedSymmetricMatrix class, CSRNumericTable class, and PackedTriangularMatrix class with the lowerPackedTriangularMatrix layout. |
outputOfStep1ForStep3 | A collection that contains numeric tables each with the partial result to keep on the local node for Step 3. By default, these tables are objects of the HomogenNumericTable class,
but you can define them as objects of any class derived from NumericTable
except the PackedSymmetricMatrix , PackedTriangularMatrix , and CSRNumericTable . |
Step 2 - on Master Node
QR Decomposition without Pivoting: Distributed Processing, Step 2 - on Master Node

In this step, QR decomposition accepts the input from each local node described below.
Pass the
Input ID
as a parameter to the methods that provide input for your algorithm.
For more details, see Algorithms.Input ID | Input |
---|---|
inputOfStep2FromStep1 | A collection that contains results computed in Step 1 on local nodes ( outputOfStep1ForStep2 ).This collection can contain objects of any class derived from NumericTable
except the PackedSymmetricMatrix class and PackedTriangularMatrix class with the lowerPackedTriangularMatrix layout. |
In this step, QR decomposition calculates the results described below.
Pass the
Result ID
or Partial Result ID
as a parameter to the methods that access the results of your algorithm.
For more details, see Algorithms.Partial Result ID | Result |
---|---|
outputOfStep2ForStep3 | A collection that contains numeric tables to be split across local nodes to compute By default, these tables are objects of the HomogenNumericTable class,
but you can define them as objects of any class derived from NumericTable
except the PackedSymmetricMatrix class, CSRNumericTable class, and PackedTriangularMatrix class with the lowerPackedTriangularMatrix layout. |
Result ID | Result |
---|---|
matrixR | Pointer to the numeric table with the By default, this result is an object of the HomogenNumericTable class,
but you can define the result as an object of any class derived from NumericTable
except the PackedSymmetricMatrix class, CSRNumericTable class, and PackedTriangularMatrix class with the lowerPackedTriangularMatrix layout. |
Step 3 - on Local Nodes
QR Decomposition without Pivoting: Distributed Processing, Step 3 - on Local Nodes

In this step, QR decomposition accepts the input described below.
Pass the
Input ID
as a parameter to the methods that provide input for your algorithm.
For more details, see Algorithms.Input ID | Input |
---|---|
inputOfStep3FromStep1 | A collection that contains results computed in Step 1 on local nodes ( outputOfStep1ForStep3 ).The collection can contain objects of any class derived from NumericTable
except the PackedSymmetricMatrix and PackedTriangularMatrix . |
inputOfStep3FromStep2 | A collection that contains results computed in Step 2 on local nodes ( outputOfStep2ForStep3 ).The collection can contain objects of any class derived from NumericTable
except the PackedSymmetricMatrix class and PackedTriangularMatrix class with the lowerPackedTriangularMatrix layout. |
In this step, QR decomposition calculates the results described below.
Pass the
Result ID
as a parameter to the methods that access the results of your algorithm.
For more details, see Algorithms.Result ID | Result |
---|---|
matrixQ | Pointer to the numeric table with the By default, the result is an object of the HomogenNumericTable class,
but you can define the result as an object of any class derived from NumericTable
except PackedSymmetricMatrix , PackedTriangularMatrix , and CSRNumericTable . |