Scribd
Upload
6 views2 pages

Linear Systems Direct Methods II Problem Sheet

The document is a problem sheet for MATH2033, focusing on direct methods for solving linear systems. It includes multiple problems that require performing forward elimination and Gaussian elimination with various pivoting techniques. The problems involve finding solutions to given linear systems using specified arithmetic methods.

Uploaded by

王健
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views2 pages

Linear Systems Direct Methods II Problem Sheet

The document is a problem sheet for MATH2033, focusing on direct methods for solving linear systems. It includes multiple problems that require performing forward elimination and Gaussian elimination with various pivoting techniques. The problems involve finding solutions to given linear systems using specified arithmetic methods.

Uploaded by

王健
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

MATH2033 (2023–2024)

Introduction to Scientific Computation

Linear Systems: Direct Methods II

PROBLEM SHEET

Problem 1
Consider the linear system

 x1 − 5x2 + x3 = 7,
10x1 + 20x3 = 6,
5x1 − x3 = 4.

On the augmented matrix corresponding to this linear system, perform forward


elimination:
a without pivoting.

b with partial pivoting.

c with scaled partial pivoting.

d with complete pivoting.

Problem 2
Consider the linear system

 x1 + x2 − x3 = 1,
x + x2 + 4x3 = 2,
 1
2x1 − x2 + 2x3 = 3.

On the augmented matrix corresponding to this linear system, perform forward


elimination:
a with no pivoting other than interchanging rows to avoid division by 0.

b with partial pivoting.

c with scaled partial pivoting.

d with complete pivoting.

Page 1 of 2
Problem 3
Find the solution to the linear system

0.03x1 + 58.9x2 = 59.2,
5.31x1 − 6.10x2 = 47.0,

obtained by performing Gaussian elimination:


a followed by backward substitution, using 3-digit arithmetic with rounding
throughout.

b with partial pivoting followed by backward substitution, using 3-digit arith-


metic with rounding throughout.

c followed by backward substitution, using 3-digit arithmetic with chopping


throughout.

d with partial pivoting followed by backward substitution, using 3-digit arith-


metic with chopping throughout.

References

• Burden, Faires & Burden, Numerical Analysis, 10E

– Section 6.2

Page 2 of 2

You might also like