Struct SolveConfig 

pub struct SolveConfig {
    pub values: Vec<f64>,
    pub col_indices: Vec<u32>,
    pub row_ptrs: Vec<u32>,
    pub rows: u32,
    pub cols: u32,
    pub rhs: Vec<f64>,
    pub tolerance: Option<f64>,
    pub max_iterations: Option<u32>,
    pub algorithm: Option<String>,
}

Configuration for solving a sparse linear system Ax = b.

Fields

values: Vec<f64>

Non-zero values in CSR format.

col_indices: Vec<u32>

Column indices for each non-zero entry.

row_ptrs: Vec<u32>

Row pointers (length = rows + 1).

rows: u32

Number of rows in the matrix.

cols: u32

Number of columns in the matrix.

rhs: Vec<f64>

Right-hand side vector b.

tolerance: Option<f64>

Convergence tolerance (default: 1e-6).

max_iterations: Option<u32>

Maximum number of iterations (default: 1000).

algorithm: Option<String>

Algorithm to use: “neumann”, “jacobi”, “gauss-seidel”, “conjugate-gradient”. Defaults to “jacobi”.

Trait Implementations

impl FromNapiValue for SolveConfig

unsafe fn from_napi_value(env: napi_env, napi_val: napi_value) -> Result<Self>

Safety

fn from_unknown(value: JsUnknown) -> Result<Self, Error>

impl ToNapiValue for SolveConfig

unsafe fn to_napi_value(env: napi_env, val: SolveConfig) -> Result<napi_value>

Safety

impl TypeName for SolveConfig

fn type_name() -> &'static str

fn value_type() -> ValueType

impl ValidateNapiValue for SolveConfig

unsafe fn validate( env: *mut napi_env__, napi_val: *mut napi_value__, ) -> Result<*mut napi_value__, Error>

Safety