MTH603 Quiz 1 Solution and Discussion

zareen

Please share your Quiz

cyberian

@cyberian said in MTH603 Quiz 1 Solution and Discussion:

while using relaxation method, which of th folowing is the

2x+3y = 1, 3x +2y =4 ?
(1,4)

cyberian

@cyberian said in MTH603 Quiz 1 Solution and Discussion:

the linear equation 2x-0y-2=0 has

cyberian

@cyberian said in MTH603 Quiz 1 Solution and Discussion:

A system is inconsistent if it has no solution. In a system of two equations in two variables, the equations are dependent if one equation is a multiple of the other. Dependent systems have an infinite number of solutions – every point is a solution.

Two Variables
In a system of two equations in two variables, the equations are dependent if one equation is a multiple of the other. Dependent systems have an infinite number of solutions – every point is a solution.

cyberian

@cyberian said in MTH603 Quiz 1 Solution and Discussion:

The primary use of iterative methods is for computing the solution to large, sparse systems and for finding a few eigenvalues of a large sparse matrix. Along with other problems, such systems occur in the numerical solution of partial differential equations.

This chapter discusses the use of iterative methods in the solution of partial differential equations. Most of the large sparse systems, which are solved by iterative methods, arise from discretizations of partial differential equations. The value of a particular generality is a function of the problem or class of problems to be solved. Three basic parts of a computer program to solve a boundary-value problem are the mesh generation, the discretization, and the solution of the matrix problem. The mesh generation and the discretization parts determine the accuracy or value of the numerical solution, while the matrix solution part determines most of the computer solution cost. These three parts are not independent of each other. Increased generality in the mesh generation and discretization parts can significantly increase the matrix solution cost. Thus, solution cost can only be given as a function of the mesh decomposition and discretization methods under consideration. The factors that mostly affect matrix solution costs are total arithmetic operations required, storage requirements, and overhead because of data transmission and logical operations associated with the implementation of the solution method. The most efficient solution procedures usually are those that minimize storage and arithmetic requirements.

cyberian

A system is inconsistent if it has no solution. In a system of two equations in two variables, the equations are dependent if one equation is a multiple of the other. Dependent systems have an infinite number of solutions – every point is a solution.

cyberian

The primary use of iterative methods is for computing the solution to large, sparse systems and for finding a few eigenvalues of a large sparse matrix. Along with other problems, such systems occur in the numerical solution of partial differential equations.

cyberian

the linear equation 2x-0y-2=0 has

cyberian

Solution to the linear equation 2x + 0y = 0

cyberian

while using relaxation method, which of th folowing is the

cyberian

In numerical linear algebra, the Jacobi method (a.k.a. the Jacobi iteration method) is an iterative algorithm for determining the solutions of a strictly diagonally dominant system of linear equations. Each diagonal element is solved for, and an approximate value is plugged in.

cyberian

Simplifying
0x + 0y = 2

Anything times zero is zero.
0x + 0y = 2

Anything times zero is zero.
0 + 0y = 2

Combine like terms: 0 + 0 = 0
0 = 2

Solving
0 = 2

Couldn’t find a variable to solve for.

This equation is invalid, the left and right sides are not equal, therefore there is no solution.

cyberian

A square matrix is said to be diagonally dominant if the magnitude of the diagonal element in a row is greater than or equal to the sum of the magnitudes of all the other non-diagonal elements in that row for each row of the matrix.