sub chodec.for

来自「非线性回归问题SQP解法」· FOR 代码 · 共 23 行

	SUBROUTINE CHODEC(N,NAMAX,G,L,QPINDX,ZERO)
	DOUBLE PRECISION G(NAMAX,N),L(NAMAX,N),ZERO
	INTEGER QPINDX
	DO 4 J=1,N
		L(J,J)=G(J,J)
		DO 1 K=1,J-1
			L(J,J)=L(J,J)-L(J,K)**2
1		CONTINUE
		IF (L(J,J).LT.ZERO)THEN
			QPINDX=1
			RETURN
		ENDIF
		L(J,J)=DSQRT(L(J,J))
		DO 3 I=J+1,N
			L(I,J)=G(I,J)
			DO 2 K=1,J-1
				L(I,J)=L(I,J)-L(I,K)*L(J,K)
2			CONTINUE
			L(I,J)=L(I,J)/L(J,J)
3		CONTINUE
4	CONTINUE
	RETURN
	END