CHOLESKI_ ALGORITHM
2016-08-23
0 0 0
4.0
Other
Earn points
TO FACTOR THE POSITIVE DEFINITE N BY N MATRIX A INTO LL**T,
WHERE L IS LOWER TRIANGULAR.
INPUT: THE DIMENSION N; ENTRIES A(I,J), 1<=I, J<=N OF A.
OUTPUT: THE ENTRIES L(I,J), 1<=J<=I, 1<=I<=N OF L.
THE ENTRIES OF U=L**T ARE U(I,J)=L(J,I), I<=J<=N, 1<=I<=N
WHERE L IS LOWER TRIANGULAR.
INPUT: THE DIMENSION N; ENTRIES A(I,J), 1<=I, J<=N OF A.
OUTPUT: THE ENTRIES L(I,J), 1<=J<=I, 1<=I<=N OF L.
THE ENTRIES OF U=L**T ARE U(I,J)=L(J,I), I<=J<=N, 1<=I<=N
fortran
算法
Related Source Codes
Deform secondary development
0
0
no vote
Classic Interview Questions for Digital City Front
0
0
no vote
HDU-2553 N Queen Question
0
0
no vote
unifiber-VUMAT
0
0
no vote
Artificial fish school algorithm
0
0
no vote
No comment