MHB Hint for a problem on condition number

  • Thread starter Thread starter kalish1
  • Start date Start date
  • Tags Tags
    Condition
Click For Summary
The discussion revolves around computing the condition number of a linear system defined by the equations 19x_1 + 20x_2 = b_1 and 20x_1 + 21x_2 = b_2. The condition number is calculated as 1601, derived from the norms of the coefficient matrix and its inverse, both yielding a norm of 41. The participants debate whether introducing a perturbation variable for the right-hand side constants is necessary to assess the system's sensitivity to changes in b_1 and b_2. They also discuss the method used for computing the matrix norm, with one participant confirming the use of a specific norm definition. The conversation concludes with a focus on whether the computed condition number sufficiently addresses the problem's requirements.
kalish1
Messages
79
Reaction score
0
I would like to know if the second part of this question is asking something different.

**Problem:** Consider the linear system $19x_1+20x_2=b_1, 20x_1+21x_2=b_2$. Compute the condition number of the coefficient matrix. Is the system well-conditioned with respect to perturbations of the right-handside constants ${b_1,b_2}$?

Do I need to introduce a $\delta$ into the right-handside, or is computing the coefficient number enough to conjecture about the condition of the right-handside constants?

Thanks.
 
Mathematics news on Phys.org
The second part of the problem as asking if the condition number you just computed is highly dependent on $b_{1}$ and $b_{2}$. What happens if you change the RHS's just a little? Does the condition number change a lot when you do that? I don't think you need to introduce another variable, at least not yet. What do you get for the condition number? And how are you computing it?
 
I get 1601 = 41*41 for the condition number, and I got it by computing the norm of the matrix A and the norm of the matrix A^(-1), an then multiplying them together. The norms of the matrices are both 41.

Isn't this enough for the purposes of this problem?
 
Did you use the formula
$$\|A\|= \max \{ \|Ax \|:x \in \mathbb{R}^{2}, \|x \|=1 \}?$$
If so, what vector norm did you use? Euclidean?
 
I used the following norm:

$$\|A_{n\mathbb x n}|=\max_{1\leq i \leq n}\sum_{j=1}^{n}\|a_{ij}\|$$
 
Thread 'Erroneously  finding discrepancy in transpose rule'
Obviously, there is something elementary I am missing here. To form the transpose of a matrix, one exchanges rows and columns, so the transpose of a scalar, considered as (or isomorphic to) a one-entry matrix, should stay the same, including if the scalar is a complex number. On the other hand, in the isomorphism between the complex plane and the real plane, a complex number a+bi corresponds to a matrix in the real plane; taking the transpose we get which then corresponds to a-bi...

Similar threads

  • · Replies 7 ·
Replies
7
Views
1K
  • · Replies 9 ·
Replies
9
Views
3K
Replies
2
Views
847
Replies
12
Views
3K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 41 ·
2
Replies
41
Views
5K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 16 ·
Replies
16
Views
4K
  • · Replies 20 ·
Replies
20
Views
3K