glssoln: Generalized least-squares solver

In kingaa/ouch: Ornstein-Uhlenbeck Models for Phylogenetic Comparative Hypotheses

Generalized least-squares solver

Description

Solves the generalized least squares problem.

Usage

glssoln(a, x, v, tol = sqrt(.Machine$double.eps))

Details

Given matrices a, x, v, glssoln computes y such that

(x-ay)^T v^{-1} (x-ay)

is minimized. This is accomplished by first computing the Choleski decomposition of v:

v=LL^T.

One then solves for y in the equation

L^{-1}ay=L^{-1}x.

This is accomplished by means of a singular-value decomposition of L^{-1} a.

The resulting y then satisfies

x=ay+e,

where the entries of e are the residuals.

Value

glssoln returns a list of two named components:

• coeff is y as above.

• residuals is e as above.

kingaa/ouch documentation built on June 14, 2025, 9:11 a.m.