Skip to main content

SimdSpectral

Struct SimdSpectral 

Source
pub struct SimdSpectral;
Expand description

SIMD-accelerated operations for spectral graph methods.

Provides optimized kernels for Laplacian construction, eigenvalue iteration helpers, and spectral embedding computations.

Implementations§

Source§

impl SimdSpectral

Source

pub fn standard_laplacian( adjacency: &Array2<f64>, degrees: &Array1<f64>, ) -> Result<Array2<f64>>

Construct the standard graph Laplacian L = D - A using SIMD.

The Laplacian is computed row-by-row: L[i,j] = degree[i] * delta(i,j) - A[i,j]. SIMD acceleration is applied to the row-level subtraction.

§Arguments
  • adjacency - The adjacency matrix (n x n)
  • degrees - The degree vector (length n)
§Returns

The standard Laplacian matrix.

Source

pub fn normalized_laplacian( adjacency: &Array2<f64>, degrees: &Array1<f64>, ) -> Result<Array2<f64>>

Construct the normalized Laplacian L_norm = I - D^{-1/2} A D^{-1/2} using SIMD.

§Arguments
  • adjacency - The adjacency matrix (n x n)
  • degrees - The degree vector (length n)
§Returns

The normalized Laplacian matrix.

Source

pub fn random_walk_laplacian( adjacency: &Array2<f64>, degrees: &Array1<f64>, ) -> Result<Array2<f64>>

Construct the random-walk Laplacian L_rw = I - D^{-1} A using SIMD.

§Arguments
  • adjacency - The adjacency matrix (n x n)
  • degrees - The degree vector (length n)
§Returns

The random-walk Laplacian matrix.

Source

pub fn compute_degree_inv_sqrt(degrees: &Array1<f64>) -> Array1<f64>

Compute D^{-1/2} vector using SIMD acceleration.

For each degree d, computes 1/sqrt(d) if d > 0, else 0.

§Arguments
  • degrees - The degree vector
§Returns

The D^{-1/2} diagonal vector.

Source

pub fn power_iteration( matrix: &Array2<f64>, initial: &Array1<f64>, max_iterations: usize, tolerance: f64, ) -> Result<(f64, Array1<f64>, usize)>

SIMD-accelerated power iteration for finding the dominant eigenvector.

Used in spectral methods to find eigenvectors of the Laplacian.

§Arguments
  • matrix - Symmetric matrix (n x n)
  • initial - Initial guess vector (length n)
  • max_iterations - Maximum iterations
  • tolerance - Convergence tolerance
§Returns

A tuple of (eigenvalue, eigenvector, iterations used).

Source

pub fn gram_schmidt_orthogonalize(vectors: &mut Array2<f64>)

SIMD-accelerated Gram-Schmidt orthogonalization.

Orthogonalizes a set of column vectors in-place.

§Arguments
  • vectors - Matrix whose columns are vectors to orthogonalize (n x k)
Source

pub fn rayleigh_quotient( matrix: &Array2<f64>, vector: &ArrayView1<'_, f64>, ) -> Result<f64>

SIMD-accelerated Rayleigh quotient: v^T M v / (v^T v).

§Arguments
  • matrix - Symmetric matrix (n x n)
  • vector - Input vector (length n)
§Returns

The Rayleigh quotient value.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V