pub struct FGLS;Implementations§
Source§impl FGLS
impl FGLS
Sourcepub fn wls_from_formula(
formula: &Formula,
data: &DataFrame,
weights: &Array1<f64>,
) -> Result<FglsResult, GreenersError>
pub fn wls_from_formula( formula: &Formula, data: &DataFrame, weights: &Array1<f64>, ) -> Result<FglsResult, GreenersError>
Weighted Least Squares (WLS) from a formula and DataFrame.
§Examples
use greeners::{FGLS, DataFrame, Formula};
use ndarray::Array1;
use std::collections::HashMap;
let mut data = HashMap::new();
data.insert("y".to_string(), Array1::from(vec![1.0, 2.0, 3.0]));
data.insert("x1".to_string(), Array1::from(vec![1.0, 2.0, 3.0]));
data.insert("weight".to_string(), Array1::from(vec![1.0, 1.0, 1.0]));
let df = DataFrame::new(data).unwrap();
let formula = Formula::parse("y ~ x1").unwrap();
let weights = df.get("weight").unwrap();
let result = FGLS::wls_from_formula(&formula, &df, weights).unwrap();Sourcepub fn wls(
y: &Array1<f64>,
x: &Array2<f64>,
weights: &Array1<f64>,
) -> Result<FglsResult, GreenersError>
pub fn wls( y: &Array1<f64>, x: &Array2<f64>, weights: &Array1<f64>, ) -> Result<FglsResult, GreenersError>
Weighted Least Squares (WLS) Used when there is known or estimated heteroscedasticity. Weights (w) should be inversely proportional to variance: w_i = 1 / sigma_i^2
pub fn wls_with_names( y: &Array1<f64>, x: &Array2<f64>, weights: &Array1<f64>, variable_names: Option<Vec<String>>, ) -> Result<FglsResult, GreenersError>
Sourcepub fn cochrane_orcutt_from_formula(
formula: &Formula,
data: &DataFrame,
) -> Result<FglsResult, GreenersError>
pub fn cochrane_orcutt_from_formula( formula: &Formula, data: &DataFrame, ) -> Result<FglsResult, GreenersError>
Cochrane-Orcutt Iterative Procedure (AR(1)) from a formula and DataFrame.
Sourcepub fn cochrane_orcutt(
y: &Array1<f64>,
x: &Array2<f64>,
) -> Result<FglsResult, GreenersError>
pub fn cochrane_orcutt( y: &Array1<f64>, x: &Array2<f64>, ) -> Result<FglsResult, GreenersError>
Cochrane-Orcutt Iterative Procedure (AR(1)) Solves serial correlation: u_t = rho * u_{t-1} + e_t Recovers the efficiency (BLUE) that OLS loses.
pub fn cochrane_orcutt_with_names( y: &Array1<f64>, x: &Array2<f64>, variable_names: Option<Vec<String>>, ) -> Result<FglsResult, GreenersError>
Auto Trait Implementations§
impl Freeze for FGLS
impl RefUnwindSafe for FGLS
impl Send for FGLS
impl Sync for FGLS
impl Unpin for FGLS
impl UnwindSafe for FGLS
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.