quadGaussLaguerre.m

Via the Golub-Welsch algorithm, this subroutine constructs and returns an \(n\)-point Gauss-Laguerre rule.

[x,w] = quadGaussLaguerre(n)

Inputs

n is the number of weights and nodes required.

Outputs

• x : Gauss-Laguerre nodes.

• w : Gauss-Laguerre weights.