Struct DenseMatrix 

pub struct DenseMatrix<S: Scalar + Entity> { /* private fields */ }

Dense matrix backed by faer.

Implementations

impl<S: Scalar + SimpleEntity + Conjugate<Canonical = S> + ComplexField> DenseMatrix<S>

pub fn eigh(&self) -> Result<SymEigenDecomposition<S>, LinalgError>

Symmetric eigendecomposition.

pub fn eigvalsh(&self) -> Result<Vec<S>, LinalgError>

Symmetric eigenvalues only (ascending order).

impl DenseMatrix<f64>

pub fn eigvals(&self) -> Result<(Vec<f64>, Vec<f64>), LinalgError>

General eigenvalues as (real_parts, imag_parts).

impl DenseMatrix<f32>

pub fn eigvals(&self) -> Result<(Vec<f32>, Vec<f32>), LinalgError>

General eigenvalues as (real_parts, imag_parts).

impl<S: Scalar + Entity> DenseMatrix<S>

pub fn from_faer(mat: Mat<S>) -> Self

Create from a faer Mat.

pub fn as_faer(&self) -> MatRef<'_, S>

Get reference to underlying faer matrix.

pub fn as_faer_mut(&mut self) -> MatMut<'_, S>

Get mutable reference to underlying faer matrix.

pub fn from_row_major(rows: usize, cols: usize, data: &[S]) -> Self

Create from row-major data.

pub fn from_col_major(rows: usize, cols: usize, data: &[S]) -> Self

Create from column-major data.

pub fn to_row_major(&self) -> Vec<S>

Convert to row-major vector.

pub fn norm_frobenius(&self) -> S

Frobenius norm.

pub fn norm_inf(&self) -> S

Infinity norm (max row sum).

pub fn rows(&self) -> usize

Number of rows (direct access without trait).

pub fn cols(&self) -> usize

Number of columns (direct access without trait).

pub fn is_square(&self) -> bool

Check if square (direct access without trait).

impl<S: Scalar + SimpleEntity + Conjugate<Canonical = S> + ComplexField> DenseMatrix<S>

where S::Real: RealField,

pub fn svd(&self) -> Result<SvdDecomposition<S>, LinalgError>

Compute full SVD.

pub fn thin_svd(&self) -> Result<ThinSvdDecomposition<S>, LinalgError>

Compute thin SVD.

pub fn singular_values(&self) -> Vec<S>

Compute singular values only (decreasing order).

pub fn pinv(&self) -> Result<DenseMatrix<S>, LinalgError>

Moore-Penrose pseudoinverse via thin SVD.

pub fn cond(&self) -> S

Condition number via SVD (sigma_max / sigma_min).

pub fn rank(&self, tol: S) -> usize

Numerical rank: count of singular values > tol.

pub fn lstsq(&self, b: &[S]) -> Result<Vec<S>, LinalgError>

Least-squares solve via thin SVD pseudoinverse: min ||Ax - b||_2.

Trait Implementations

impl<S: Clone + Scalar + Entity> Clone for DenseMatrix<S>

fn clone(&self) -> DenseMatrix<S>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<S: Debug + Scalar + Entity> Debug for DenseMatrix<S>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<S: Scalar + SimpleEntity + Conjugate<Canonical = S> + ComplexField> LUSolver<S> for DenseMatrix<S>

fn lu_solve(&self, b: &[S]) -> Result<Vec<S>, LinalgError>

Solve Ax = b.

fn lu_factor(&self) -> Result<LUFactorization<S>, LinalgError>

Compute and store LU factorization.

impl<S: Scalar + SimpleEntity + Conjugate<Canonical = S> + ComplexField> Matrix<S> for DenseMatrix<S>

fn zeros(rows: usize, cols: usize) -> Self

Create a zero matrix with given dimensions.

fn identity(n: usize) -> Self

Create an identity matrix.

fn nrows(&self) -> usize

Number of rows.

fn ncols(&self) -> usize

Number of columns.

fn get(&self, i: usize, j: usize) -> S

Get element at (i, j).

fn set(&mut self, i: usize, j: usize, value: S)

Set element at (i, j).

fn fill_zero(&mut self)

Fill matrix with zeros.

fn scale(&mut self, alpha: S)

Scale all elements by a constant.

fn mul_vec(&self, x: &[S], y: &mut [S])

Compute y = self * x (matrix-vector product).

fn add_scaled(&mut self, alpha: S, other: &Self)

Add another matrix: self += alpha * other.

fn solve(&self, b: &[S]) -> Result<Vec<S>, LinalgError>

Solve the linear system Ax = b, returning x.

fn is_square(&self) -> bool

Check if matrix is square.