Matrix/vector representation
HYPRE.jl defines the structs HYPREMatrix and HYPREVector representing HYPREs datastructures. Specifically it uses the IJ System Interface which can be used for general sparse matrices.
HYPRE.jl defines conversion methods from standard Julia datastructures to HYPREMatrix and HYPREVector, respectively.
PartitionedArrays.jl (multi-process)
HYPRE.jl integrates seemlessly with PSparseMatrix and PVector from the PartitionedArrays.jl package. These can be passed directly to solve and solve!. Internally this will construct a HYPREMatrix and HYPREVectors and then convert the solution back to a PVector.
The HYPREMatrix constructor supports both SparseMatrixCSC and SparseMatrixCSR as storage backends for the PSparseMatrix. However, since HYPREs internal storage is also CSR based it can be slightly more resource efficient to use SparseMatrixCSR.
The constructors also supports both PartitionedArrays.jl backends: When using the MPI backend the communicator of the PSparseMatrix/PVector is used also for the HYPREMatrix/HYPREVector, and when using the Sequential backend it is assumed to be a single-process setup, and the global communicator MPI.COMM_WORLD is used.
Example pseudocode
# Assemble linear system (see documentation for PartitionedArrays)
+Matrix/vector representation · HYPRE.jl Matrix/vector representation
HYPRE.jl defines the structs HYPREMatrix and HYPREVector representing HYPREs datastructures. Specifically it uses the IJ System Interface which can be used for general sparse matrices.
HYPRE.jl defines conversion methods from standard Julia datastructures to HYPREMatrix and HYPREVector, respectively. See the following sections for details:
- PartitionedArrays.jl (multi-process)
SparseMatrixCSC / SparseMatrixCSR (single-process)SparseMatrixCSC / SparseMatrixCSR (multi-process)
PartitionedArrays.jl (multi-process)
HYPRE.jl integrates seemlessly with PSparseMatrix and PVector from the PartitionedArrays.jl package. These can be passed directly to solve and solve!. Internally this will construct a HYPREMatrix and HYPREVectors and then convert the solution back to a PVector.
The HYPREMatrix constructor support both SparseMatrixCSC and SparseMatrixCSR as storage backends for the PSparseMatrix. However, since HYPREs internal storage is also CSR based it can be slightly more resource efficient to use SparseMatrixCSR.
The constructors also support both PartitionedArrays.jl backends: When using the MPI backend the communicator of the PSparseMatrix/PVector is used also for the HYPREMatrix/HYPREVector, and when using the Sequential backend it is assumed to be a single-process setup, and the global communicator MPI.COMM_WORLD is used.
Example pseudocode
# Assemble linear system (see documentation for PartitionedArrays)
A = PSparseMatrix(...)
b = PVector(...)
@@ -21,4 +21,13 @@ b_h = HYPREVector(b)
solve!(solver, x_h, A_h, b_h)
# Copy solution back to x
-copy!(x, x_h)
SparseMatrixCSC / SparseMatrixCSR (single-process)
SparseMatrixCSC / SparseMatrixCSR (multi-process)
Warning This interface isn't finalized yet and is subject to change.
Settings
This document was generated with Documenter.jl version 0.28.0-DEV on Tuesday 26 July 2022. Using Julia version 1.7.3.
+copy!(x, x_h)SparseMatrixCSC / SparseMatrixCSR (single-process)
HYPRE.jl also support working directly with SparseMatrixCSC (from the SparseArrays.jl standard library) and SparseMatrixCSR (from the SparseMatricesCSR.jl package). This makes it possible to use solvers and preconditioners even for single-process problems. When using these type of spars matrices it is assumed that the right hand side and solution vectors are regular Julia Vectors.
Just like when using the PartitionedArrays.jl package, it is possible to pass sparse matrices directly to solve and solve!, but it is also possible to create HYPREMatrix and HYPREVector explicitly, possibly saving some resources when doing multiple consecutive linear solves (see previous section).
Example pseudocode
A = SparseMatrixCSC(...)
+x = Vector(...)
+b = Vector(...)
+
+# Solve with zero initial guess
+x = solve(solver, A, b)
+
+# Inplace solve with x as initial guess
+x = zeros(length(b))
+solve!(solver, x, A, b)SparseMatrixCSC / SparseMatrixCSR (multi-process)
This interface isn't finalized yet and is therefore not documented since it is subject to change.