PDF version (NAG web site
, 64-bit version, 64-bit version)
NAG Toolbox: nag_lapack_dggglm (f08zb)
Purpose
nag_lapack_dggglm (f08zb) solves a real general Gauss–Markov linear (least squares) model problem.
Syntax
[
a,
b,
d,
x,
y,
info] = f08zb(
a,
b,
d, 'm',
m, 'n',
n, 'p',
p)
[
a,
b,
d,
x,
y,
info] = nag_lapack_dggglm(
a,
b,
d, 'm',
m, 'n',
n, 'p',
p)
Description
nag_lapack_dggglm (f08zb) solves the real general Gauss–Markov linear model (GLM) problem
where
is an
by
matrix,
is an
by
matrix and
is an
element vector. It is assumed that
,
and
, where
. Under these assumptions, the problem has a unique solution
and a minimal
-norm solution
, which is obtained using a generalized
factorization of the matrices
and
.
In particular, if the matrix
is square and nonsingular, then the GLM problem is equivalent to the weighted linear least squares problem
References
Anderson E, Bai Z, Bischof C, Blackford S, Demmel J, Dongarra J J, Du Croz J J, Greenbaum A, Hammarling S, McKenney A and Sorensen D (1999) LAPACK Users' Guide (3rd Edition) SIAM, Philadelphia
Anderson E, Bai Z and Dongarra J (1992) Generalized QR factorization and its applications Linear Algebra Appl. (Volume 162–164) 243–271
Parameters
Compulsory Input Parameters
- 1:
– double array
-
The first dimension of the array
a must be at least
.
The second dimension of the array
a must be at least
.
The by matrix .
- 2:
– double array
-
The first dimension of the array
b must be at least
.
The second dimension of the array
b must be at least
.
The by matrix .
- 3:
– double array
-
The left-hand side vector of the GLM equation.
Optional Input Parameters
- 1:
– int64int32nag_int scalar
-
Default:
the dimension of the array
d and the first dimension of the array
b. (An error is raised if these dimensions are not equal.)
, the number of rows of the matrices and .
Constraint:
.
- 2:
– int64int32nag_int scalar
-
Default:
the second dimension of the array
a.
, the number of columns of the matrix .
Constraint:
.
- 3:
– int64int32nag_int scalar
-
Default:
the second dimension of the array
b.
, the number of columns of the matrix .
Constraint:
.
Output Parameters
- 1:
– double array
-
The first dimension of the array
a will be
.
The second dimension of the array
a will be
.
- 2:
– double array
-
The first dimension of the array
b will be
.
The second dimension of the array
b will be
.
- 3:
– double array
-
- 4:
– double array
-
The solution vector of the GLM problem.
- 5:
– double array
-
The solution vector of the GLM problem.
- 6:
– int64int32nag_int scalar
unless the function detects an error (see
Error Indicators and Warnings).
Error Indicators and Warnings
-
If , parameter had an illegal value on entry. The parameters are numbered as follows:
1:
m, 2:
n, 3:
p, 4:
a, 5:
lda, 6:
b, 7:
ldb, 8:
d, 9:
x, 10:
y, 11:
work, 12:
lwork, 13:
info.
It is possible that
info refers to a parameter that is omitted from the MATLAB interface. This usually indicates that an error in one of the other input parameters has caused an incorrect value to be inferred.
-
-
The upper triangular factor associated with in the generalized factorization of the pair is singular, so that ; the least squares solution could not be computed.
-
-
The bottom by part of the upper trapezoidal factor associated with in the generalized factorization of the pair is singular, so that ; the least squares solutions could not be computed.
Accuracy
For an error analysis, see
Anderson et al. (1992). See also Section 4.6 of
Anderson et al. (1999).
Further Comments
When , the total number of floating-point operations is approximately ; when , the total number of floating-point operations is approximately .
Example
This example solves the weighted least squares problem
where
Open in the MATLAB editor:
f08zb_example
function f08zb_example
fprintf('f08zb example results\n\n');
a = [-0.57, -1.28, -0.39;
-1.93, 1.08, -0.31;
2.30, 0.24, -0.40;
-0.02, 1.03, -1.43];
b = [ 0.5, 0, 0, 0;
0, 1, 0, 0;
0, 0, 2, 0;
0, 0, 0, 5];
d = [ 1.32;
-4.00;
5.52;
3.24];
[~, ~, ~, x, y, info] = f08zb( ...
a, b, d);
disp('Weighted least-squares solution');
fprintf('%12.4f',x);
fprintf('\n');
fprintf('Residual vector\n ');
fprintf('%12.2e',y);
sqres = norm(y,2);
fprintf('\n\nSquare root of the residual sum of squares\n %12.2e\n', ...
sqres);
f08zb example results
Weighted least-squares solution
1.9889 -1.0058 -2.9911
Residual vector
-6.37e-04 -2.45e-03 -4.72e-03 7.70e-03
Square root of the residual sum of squares
9.38e-03
PDF version (NAG web site
, 64-bit version, 64-bit version)
© The Numerical Algorithms Group Ltd, Oxford, UK. 2009–2015