aboutsummaryrefslogtreecommitdiff
path: root/math/curfit/cvsolve.gx
blob: 08e0bf9254d0e339bb2a36f0c93171c4343a5aed (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
# Copyright(c) 1986 Association of Universities for Research in Astronomy Inc.

include <math/curfit.h>

$if (datatype == r)
include "curfitdef.h"
$else
include "dcurfitdef.h"
$endif


# CVSOLVE -- Solve the matrix normal equations of the form ca = b for a,
# where c is a symmetric, positive semi-definite, banded matrix with
# CV_NCOEFF(cv) rows and a and b are CV_NCOEFF(cv)-vectors.
# Initially c is stored in the CV_ORDER(cv) by CV_NCOEFF(cv) matrix MATRIX
# and b is stored in VECTOR.
# The Cholesky factorization of MATRIX is calculated and stored in CHOFAC.
# Finally the coefficients are calculated by forward and back substitution
# and stored in COEFF.

$if (datatype == r)
procedure cvsolve (cv, ier)
$else
procedure dcvsolve (cv, ier)
$endif


pointer	cv 		# curve descriptor
int	ier		# ier = OK, everything OK
			# ier = SINGULAR, matrix is singular, 1 or more
			# coefficients are 0.
			# ier = NO_DEG_FREEDOM, too few points to solve matrix
int	nfree

begin
	ier = OK
	nfree = CV_NPTS(cv) - CV_NCOEFF(cv)

	if (nfree < 0) {
	    ier = NO_DEG_FREEDOM
	    return
	}

	# calculate the Cholesky factorization of the data matrix
	call $tcvchofac (MATRIX(CV_MATRIX(cv)), CV_ORDER(cv), CV_NCOEFF(cv),
		    CHOFAC(CV_CHOFAC(cv)), ier)

	# solve for the coefficients by forward and back substitution
	call $tcvchoslv (CHOFAC(CV_CHOFAC(cv)), CV_ORDER(cv), CV_NCOEFF(cv),
		    VECTOR(CV_VECTOR(cv)), COEFF(CV_COEFF(cv)))
end