According to Example 3.39, the n ×n Hilbert matrix Hn is positive definite, and hence we can app

Step 1: **Compute $u005Cmathbf{f} u003D H_n u005Cmathbf{u}^*$ for $n u003D 5, 10, 30$.**u000A u002D The Hilbert matrix

Question

According to Example 3.39, the $n \times n$ Hilbert matrix $H_n$ is positive definite, and hence we can apply the Conjugate Gradient Method to solve the linear system $H_n \mathbf{u}=\mathbf{f}$. For the values $n=5,10,30$, let $\mathbf{u}^* \in \mathbb{R}^n$ be the vector with all entries equal to 1 . (a) Compute $\mathbf{f}=H_n \mathbf{u}^$. (b) Use Gaussian Elimination to solve $H_n \mathbf{u}=\mathbf{f}$. How close is your solution to $\mathbf{u}^$ ? ${ }^n$ (c) Does pivoting improve the solution in part (b)? (d) Does the conjugate gradient algorithm do any better?

    According to Example 3.39, the $n \times n$ Hilbert matrix $H_n$ is positive definite, and hence we can apply the Conjugate Gradient Method to solve the linear system $H_n \mathbf{u}=\mathbf{f}$. For the values $n=5,10,30$, let $\mathbf{u}^* \in \mathbb{R}^n$ be the vector with all entries equal to 1 .
(a) Compute $\mathbf{f}=H_n \mathbf{u}^*$. (b) Use Gaussian Elimination to solve $H_n \mathbf{u}=\mathbf{f}$. How close is your solution to $\mathbf{u}^*$ ? ${ }^n$ (c) Does pivoting improve the solution in part (b)?
(d) Does the conjugate gradient algorithm do any better?

Applied Linear Algebra (Undergraduate Texts in Mathematics)

Peter J. Olver,… 2nd Edition

Chapter 9, Problem 9

Instant Answer

Step 1

** - The Hilbert matrix $H_n$ is defined by $H_n(i, j) = \frac{1}{i + j - 1}$ for $i, j = 1, 2, \ldots, n$. - The vector $\mathbf{u}^*$ has all entries equal to 1. - Compute $\mathbf{f}$ by matrix-vector multiplication: \[ f_i = \sum_{j=1}^n Show more…

Show all steps

Thanks for your feedback!

According to Example 3.39, the $n \times n$ Hilbert matrix $H_n$ is positive definite, and hence we can apply the Conjugate Gradient Method to solve the linear system $H_n \mathbf{u}=\mathbf{f}$. For the values $n=5,10,30$, let $\mathbf{u}^* \in \mathbb{R}^n$ be the vector with all entries equal to 1 . (a) Compute $\mathbf{f}=H_n \mathbf{u}^*$. (b) Use Gaussian Elimination to solve $H_n \mathbf{u}=\mathbf{f}$. How close is your solution to $\mathbf{u}^*$ ? ${ }^n$ (c) Does pivoting improve the solution in part (b)? (d) Does the conjugate gradient algorithm do any better?

Play audio

Feedback

Ace is your personal tutor. It breaks down any question with clear steps so you can learn.

Start Using Ace

Continue solving this problem

Create a free account to:

View full step-by-step solution
Ask follow-up questions with Ace AI
Save progress and study later

Please give Ace some feedback