biosimulationII hw2

2000 016000 0 1 24000 0 0 4240 10 the algorithm in

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: matrix [L] in the [L][U] decomposition of matrix given below 0 0Ⱥ Ⱥu11 u12 u13 Ⱥ Ⱥ25 5 4 Ⱥ Ⱥ 1 Ⱥ10 8 16 Ⱥ = Ⱥ Ⱥ Ⱥ Ⱥ Ⱥ Ⱥ Ⱥ 21 1 0Ⱥ Ⱥ 0 u22 u23 Ⱥ Ⱥ 8 12 22Ⱥ Ⱥ 31 32 1Ⱥ Ⱥ 0 0 u33 Ⱥ Ⱥ Ⱥ Ⱥ Ⱥ Ⱥ Ⱥ is (A) 0 0Ⱥ Ⱥ 1 Ⱥ0.40000 1 0Ⱥ Ⱥ Ⱥ Ⱥ0.32000 1.7333 1Ⱥ Ⱥ Ⱥ (B) 4 Ⱥ Ⱥ25 5 Ⱥ 0 6 14.400 Ⱥ Ⱥ Ⱥ Ⱥ 0 0 − 4.2400Ⱥ Ⱥ Ⱥ (C) Ⱥ 1 0 0Ⱥ Ⱥ10 1 0Ⱥ Ⱥ Ⱥ Ⱥ 8 12 0Ⱥ Ⱥ Ⱥ 0 0Ⱥ Ⱥ 1 Ⱥ0.40000 (D) 1 0Ⱥ Ⱥ Ⱥ Ⱥ0.32000 1.5000 1Ⱥ Ⱥ Ⱥ 9. The upper triangular matrix [U] in the [L][U] decomposition of matrix given below 0 0Ⱥ Ⱥu11 u12 u13 Ⱥ Ⱥ25 5 4 Ⱥ Ⱥ 1 Ⱥ 0 8 16 Ⱥ = Ⱥ Ⱥ Ⱥ Ⱥ Ⱥ Ⱥ Ⱥ 21 1 0Ⱥ Ⱥ 0 u22 u23 Ⱥ Ⱥ 0 12 22 Ⱥ Ⱥ 31 32 1Ⱥ Ⱥ 0 0 u33 Ⱥ Ⱥ Ⱥ Ⱥ Ⱥ Ⱥ Ⱥ is (A) 0 0Ⱥ Ⱥ 1 Ⱥ0.40000 1 0Ⱥ Ⱥ Ⱥ Ⱥ0.32000 1.7333 1Ⱥ Ⱥ Ⱥ (B) 4 Ⱥ Ⱥ25 5 Ⱥ 0 6 14.400 Ⱥ Ⱥ Ⱥ Ⱥ 0 0 − 4.2400Ⱥ Ⱥ Ⱥ (C) Ⱥ25 5 4 Ⱥ Ⱥ 0 8 16 Ⱥ Ⱥ Ⱥ Ⱥ 0 0 − 2Ⱥ Ⱥ Ⱥ (D) Ⱥ1 0.2000 0.16000Ⱥ Ⱥ0 1 2.4000 Ⱥ Ⱥ Ⱥ Ⱥ0 0 − 4.240 Ⱥ Ⱥ Ⱥ 10. The algorithm in solving the set of equations [A][X] = [C], where [A] = [L][U] involves solving [L][Z] = [C] by forward substitution....
View Full Document

Ask a homework question - tutors are online