Skip to main content

MatsubaraSampling

Struct MatsubaraSampling 

Source
pub struct MatsubaraSampling<S>
where S: StatisticsType,
{ /* private fields */ }
Expand description

Matsubara sampling for full frequency range (positive and negative)

General complex problem without symmetry assumptions. Supports both real and complex coefficients.

Implementations§

Source§

impl<S> MatsubaraSampling<S>
where S: StatisticsType,

Source

pub fn new(basis: &impl Basis<S>) -> Result<MatsubaraSampling<S>, Error>
where S: 'static,

Create Matsubara sampling with default sampling points

Uses the default sampling points of the basis (symmetric: positive and negative frequencies).

§Errors

The errors of Basis::default_matsubara_sampling_points (NotSupported for a DLR or for basis functions without a definite parity, #183)

Source

pub fn with_sampling_points( basis: &impl Basis<S>, sampling_points: Vec<MatsubaraFreq<S>>, ) -> Result<MatsubaraSampling<S>, Error>
where S: 'static,

Create Matsubara sampling with custom sampling points

The points may be in any order, and are kept in the given order: Self::sampling_points returns them unchanged, and index i along the sampling-point axis of evaluate and fit refers to sampling_points[i].

Duplicate points are accepted; they only raise the condition number.

§Errors
Source

pub fn from_matrix( sampling_points: Vec<MatsubaraFreq<S>>, matrix: &TypedTensor<Complex<f64>, Rank<2>>, ) -> Result<MatsubaraSampling<S>, Error>

Create Matsubara sampling with custom sampling points and pre-computed matrix

This constructor is useful when the sampling matrix is already computed (e.g., from external sources or for testing).

§Arguments
  • sampling_points - Matsubara frequency sampling points, in any order
  • matrix - Pre-computed sampling matrix (n_points × basis_size); row i belongs to sampling_points[i]

The points are kept in the given order: Self::sampling_points returns them unchanged, and index i along the sampling-point axis of evaluate and fit refers to sampling_points[i].

Duplicate points are accepted; they only raise the condition number.

§Errors
Source

pub fn sampling_points(&self) -> &[MatsubaraFreq<S>]

Get sampling points

Source

pub fn n_sampling_points(&self) -> usize

Number of sampling points

Source

pub fn basis_size(&self) -> usize

Basis size

Source

pub fn matrix(&self) -> &TypedTensor<Complex<f64>, Rank<2>>

Get the sampling matrix

Source

pub fn condition_number(&self) -> Result<f64, Error>

Condition number of the sampling matrix, which fitting solves with

Returns σ_max / σ_min, the ratio of the largest to the smallest of the min(n_sampling_points, basis_size) singular values of the complex n_sampling_points × basis_size matrix Self::matrix. It bounds how much Self::fit can amplify relative errors in the values.

Returns f64::INFINITY if the smallest singular value is below 1e-15 (numerically singular matrix). The singular value decomposition is the one fitting uses: it is computed by the first call to this method or to a fit, then cached.

§Errors

Error::DecompositionFailed if the singular value decomposition fails, which a matrix of finite entries does not cause in practice (the constructors reject non-finite entries)

Source

pub fn evaluate( &self, coeffs: &[Complex<f64>], ) -> Result<Vec<Complex<f64>>, Error>

Evaluate complex basis coefficients at sampling points

§Arguments
  • coeffs - Complex basis coefficients (length = basis_size)
§Returns

Complex values at Matsubara frequencies (length = n_sampling_points)

§Errors
Source

pub fn evaluate_real(&self, coeffs: &[f64]) -> Result<Vec<Complex<f64>>, Error>

Evaluate real basis coefficients at sampling points

Source

pub fn fit(&self, values: &[Complex<f64>]) -> Result<Vec<Complex<f64>>, Error>

Fit complex basis coefficients from values at sampling points

§Arguments
  • values - Complex values at Matsubara frequencies (length = n_sampling_points)
§Returns

Fitted complex basis coefficients (length = basis_size)

§Errors
Source

pub fn fit_real(&self, values: &[Complex<f64>]) -> Result<Vec<f64>, Error>

Fit real basis coefficients (real part of the complex solution)

Source

pub fn evaluate_nd<T>( &self, backend: Option<&GemmBackendHandle>, coeffs: &TypedTensor<T>, dim: usize, ) -> Result<TypedTensor<Complex<f64>>, Error>
where T: MatsubaraCoeffs,

Evaluate N-dimensional coefficients at Matsubara sampling points

Supports both real (f64) and complex (Complex<f64>) coefficients and always returns complex values at the Matsubara frequencies. The implementation is selected at compile time through the MatsubaraCoeffs trait.

§Type Parameter
  • T - Must implement MatsubaraCoeffs (currently f64 or Complex<f64>)
§Arguments
  • backend - Optional GEMM backend handle (None uses the global dispatcher)
  • coeffs - N-dimensional tensor of basis coefficients
  • dim - Dimension along which to evaluate (must have size = basis_size)
§Returns

N-dimensional tensor of complex values at Matsubara frequencies, with dimension dim of size n_sampling_points

§Errors
§Example
use num_complex::Complex;
use sparse_ir::{FermionicBasis, LogisticKernel, MatsubaraSampling, TypedTensor};

let beta = 10.0;
let wmax = 1.0;
let basis = FermionicBasis::new(LogisticKernel::new(beta * wmax).unwrap(), beta, Some(1e-6), None).unwrap();
let sampling = MatsubaraSampling::new(&basis).unwrap();
let (size, n_points) = (sampling.basis_size(), sampling.n_sampling_points());

// Real coefficients: two sets stacked along axis 1 (column-major), evaluated along axis 0
let real_data: Vec<f64> = (0..2 * size)
    .map(|k| 1.0 / (1.0 + (k % size + k / size) as f64))
    .collect();
let coeffs_real = TypedTensor::from_vec_col_major(vec![size, 2], real_data.clone()).unwrap();
let values = sampling.evaluate_nd::<f64>(None, &coeffs_real, 0).unwrap();
assert_eq!(values.shape(), &[n_points, 2]);

// Complex coefficients
let complex_data: Vec<Complex<f64>> =
    real_data.iter().map(|&x| Complex::new(x, -0.5 * x)).collect();
let coeffs_complex = TypedTensor::from_vec_col_major(vec![size, 2], complex_data.clone()).unwrap();
let values_z = sampling.evaluate_nd::<Complex<f64>>(None, &coeffs_complex, 0).unwrap();

// Each column matches the 1-D `evaluate` of the corresponding coefficient set
let (values, values_z) = (values.host_data().unwrap(), values_z.host_data().unwrap());
for j in 0..2 {
    let real: Vec<Complex<f64>> = real_data[j * size..(j + 1) * size].iter().map(|&x| x.into()).collect();
    let complex = &complex_data[j * size..(j + 1) * size];
    let (expected, expected_z) = (sampling.evaluate(&real).unwrap(), sampling.evaluate(complex).unwrap());
    for i in 0..n_points {
        assert!((values[i + n_points * j] - expected[i]).norm() < 1e-12);
        assert!((values_z[i + n_points * j] - expected_z[i]).norm() < 1e-12);
    }
}
Source

pub fn evaluate_nd_real( &self, backend: Option<&GemmBackendHandle>, coeffs: &TypedTensor<f64>, dim: usize, ) -> Result<TypedTensor<Complex<f64>>, Error>

Evaluate real basis coefficients at Matsubara sampling points (N-dimensional)

This method takes real coefficients and produces complex values, useful when working with symmetry-exploiting representations or real-valued IR coefficients.

§Arguments
  • backend - Optional GEMM backend handle (None uses default)
  • coeffs - N-dimensional tensor of real basis coefficients
  • dim - Dimension along which to evaluate (must have size = basis_size)
§Returns

N-dimensional tensor of complex values at Matsubara frequencies

§Errors
Source

pub fn fit_nd( &self, backend: Option<&GemmBackendHandle>, values: &TypedTensor<Complex<f64>>, dim: usize, ) -> Result<TypedTensor<Complex<f64>>, Error>

Fit N-dimensional array of complex values to complex basis coefficients

§Arguments
  • backend - Optional GEMM backend handle (None uses default)
  • values - N-dimensional tensor of complex values at Matsubara frequencies
  • dim - Dimension along which to fit (must have size = n_sampling_points)
§Returns

N-dimensional tensor of complex basis coefficients

§Errors
Source

pub fn fit_nd_real( &self, backend: Option<&GemmBackendHandle>, values: &TypedTensor<Complex<f64>>, dim: usize, ) -> Result<TypedTensor<f64>, Error>

Fit N-dimensional array of complex values to real basis coefficients

This method fits complex Matsubara values to real IR coefficients. Takes the real part of the least-squares solution.

§Arguments
  • backend - Optional GEMM backend handle (None uses default)
  • values - N-dimensional tensor of complex values at Matsubara frequencies
  • dim - Dimension along which to fit (must have size = n_sampling_points)
§Returns

N-dimensional tensor of real basis coefficients

§Errors
Source

pub fn evaluate_nd_to<T>( &self, backend: Option<&GemmBackendHandle>, coeffs: &TypedTensorView<'_, T>, dim: usize, out: &mut TypedTensorViewMut<'_, Complex<f64>>, ) -> Result<(), Error>
where T: MatsubaraCoeffs,

Evaluate basis coefficients at Matsubara sampling points (N-dimensional) with in-place output

§Type Parameters
  • T - Coefficient type (f64 or Complex)
§Arguments
  • coeffs - N-dimensional tensor with coeffs.shape().dim(dim) == basis_size
  • dim - Dimension along which to evaluate (0-indexed)
  • out - Output tensor with out.shape().dim(dim) == n_sampling_points (Complex)
§Errors
  • Error::AxisOutOfRange if dim is not an axis of coeffs
  • Error::ShapeMismatch of the input if coeffs does not have basis_size along dim, and of the output if out does not have the shape of coeffs with n_sampling_points along dim

Nothing is written to out then.

Source

pub fn fit_nd_to( &self, backend: Option<&GemmBackendHandle>, values: &TypedTensorView<'_, Complex<f64>>, dim: usize, out: &mut TypedTensorViewMut<'_, Complex<f64>>, ) -> Result<(), Error>

Fit N-dimensional complex values to complex coefficients with in-place output

§Arguments
  • values - N-dimensional tensor with values.shape().dim(dim) == n_sampling_points
  • dim - Dimension along which to fit (0-indexed)
  • out - Output tensor with out.shape().dim(dim) == basis_size (Complex)
§Errors

Nothing is written to out then.

Trait Implementations§

Source§

impl<S> InplaceFitter for MatsubaraSampling<S>
where S: StatisticsType,

Source§

fn n_points(&self) -> usize

Number of sampling points.
Source§

fn basis_size(&self) -> usize

Number of basis functions.
Source§

fn evaluate_nd_dz_to( &self, backend: Option<&GemmBackendHandle>, coeffs: &TypedTensorView<'_, f64>, dim: usize, out: &mut TypedTensorViewMut<'_, Complex<f64>>, ) -> Result<(), Error>

Evaluate: f64 coefficients to Complex<f64> values.
Source§

fn evaluate_nd_zz_to( &self, backend: Option<&GemmBackendHandle>, coeffs: &TypedTensorView<'_, Complex<f64>>, dim: usize, out: &mut TypedTensorViewMut<'_, Complex<f64>>, ) -> Result<(), Error>

Evaluate: Complex<f64> coefficients to Complex<f64> values.
Source§

fn fit_nd_zd_to( &self, backend: Option<&GemmBackendHandle>, values: &TypedTensorView<'_, Complex<f64>>, dim: usize, out: &mut TypedTensorViewMut<'_, f64>, ) -> Result<(), Error>

Fit: Complex<f64> values to f64 coefficients.
Source§

fn fit_nd_zz_to( &self, backend: Option<&GemmBackendHandle>, values: &TypedTensorView<'_, Complex<f64>>, dim: usize, out: &mut TypedTensorViewMut<'_, Complex<f64>>, ) -> Result<(), Error>

Fit: Complex<f64> values to Complex<f64> coefficients.
Source§

fn evaluate_nd_dd_to( &self, backend: Option<&GemmBackendHandle>, coeffs: &TypedTensorView<'_, f64>, dim: usize, out: &mut TypedTensorViewMut<'_, f64>, ) -> Result<(), Error>

Evaluate: f64 coefficients to f64 values.
Source§

fn evaluate_nd_zd_to( &self, backend: Option<&GemmBackendHandle>, coeffs: &TypedTensorView<'_, Complex<f64>>, dim: usize, out: &mut TypedTensorViewMut<'_, f64>, ) -> Result<(), Error>

Evaluate: Complex<f64> coefficients to f64 values.
Source§

fn fit_nd_dd_to( &self, backend: Option<&GemmBackendHandle>, values: &TypedTensorView<'_, f64>, dim: usize, out: &mut TypedTensorViewMut<'_, f64>, ) -> Result<(), Error>

Fit: f64 values to f64 coefficients.
Source§

fn fit_nd_dz_to( &self, backend: Option<&GemmBackendHandle>, values: &TypedTensorView<'_, f64>, dim: usize, out: &mut TypedTensorViewMut<'_, Complex<f64>>, ) -> Result<(), Error>

Fit: f64 values to Complex<f64> coefficients.

Auto Trait Implementations§

§

impl<S> !Freeze for MatsubaraSampling<S>

§

impl<S> !RefUnwindSafe for MatsubaraSampling<S>

§

impl<S> !UnwindSafe for MatsubaraSampling<S>

§

impl<S> Send for MatsubaraSampling<S>
where S: Send,

§

impl<S> Sync for MatsubaraSampling<S>
where S: Sync,

§

impl<S> Unpin for MatsubaraSampling<S>
where S: Unpin,

§

impl<S> UnsafeUnpin for MatsubaraSampling<S>

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
§

impl<T> ByRef<T> for T

§

fn by_ref(&self) -> &T

§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

§

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

§

fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> T
where Self: Distribution<T>,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<T, U> Imply<T> for U
where T: ?Sized, U: ?Sized,

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
§

impl<T> MaybeSend for T
where T: Send,

§

impl<T> MaybeSendSync for T
where T: Send + Sync,

§

impl<T> MaybeSync for T
where T: Sync,

§

impl<T> Pointable for T

§

const ALIGN: usize

The alignment of pointer.
§

type Init = T

The type for initializers.
§

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

Initializes a with the given initializer. Read more
§

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

Dereferences the given pointer. Read more
§

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

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

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

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
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.
§

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

§

fn vzip(self) -> V