Numerical Analysis, Books A La Carte Edition (3rd Edition)
3rd Edition
ISBN: 9780134697338
Author: Timothy Sauer
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Question
Chapter 2.6, Problem 7CP
a.
To determine
To create MATLAB program for preconditioned conjugate Gradient Method.
b
To determine
To create MATLAB program for preconditioned conjugate Gradient Method.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
An open-top rectangular box is being constructed to hold a volume of 150 in³. The base of the box is made
from a material costing 7 cents/in². The front of the box must be decorated, and will cost 11 cents/in².
The remainder of the sides will cost 3 cents/in².
Find the dimensions that will minimize the cost of constructing this box. Please show your answers to at
least 4 decimal places.
Front width:
Depth:
in.
in.
Height:
in.
Find and classify the critical points of z = (x² – 8x) (y² – 6y).
Local maximums:
Local minimums:
Saddle points:
-
For each classification, enter a list of ordered pairs (x, y) where the max/min/saddle occurs. Enter DNE if
there are no points for a classification.
Calculate the 90% confidence interval for the population mean difference using the data in the attached image. I need to see where I went wrong.
Chapter 2 Solutions
Numerical Analysis, Books A La Carte Edition (3rd Edition)
Ch. 2.1 - Use Gaussian elimination to solve the systems:...Ch. 2.1 - Use Gaussian elimination to solve the systems:...Ch. 2.1 - Solve by back substitution: a.3x4y+5z=23y4z=15z=5...Ch. 2.1 - Solve the tableau form a.[ 34236612382-1 ] b.[...Ch. 2.1 - Use the approximate operation count 2n3/3 for...Ch. 2.1 - Assume that your computer completes a 5000...Ch. 2.1 - Assume that a given computer requires 0.002...Ch. 2.1 - If a system of 3000 equations in 3000 unknowns can...Ch. 2.1 - Put together the code fragments in this section to...Ch. 2.1 - Let H denote the nn Hubert matrix, whose (i,j)...
Ch. 2.2 - Find the LU factorization of the given matrices....Ch. 2.2 - Find the LU factorization of the given matrices....Ch. 2.2 - Solve the system by finding the LU factorization...Ch. 2.2 - Solve the system by finding the LU factorization...Ch. 2.2 - Solve the equation Ax=b, where A=[...Ch. 2.2 - Given the 10001000 matrix A, your computer can...Ch. 2.2 - Assume that your computer can solve 1000 problems...Ch. 2.2 - Assume that your computer can solve a 20002000...Ch. 2.2 - Let A be an nn matrix. Assume that your computer...Ch. 2.2 - Use the code fragments for Gaussian elimination in...Ch. 2.2 - Add two-step back substitution to your script from...Ch. 2.3 - Find the norm A of each of the following...Ch. 2.3 - Find the (infinity norm) condition number of (a)...Ch. 2.3 - Find the forward and backward errors, and the...Ch. 2.3 - Find the forward and backward errors and error...Ch. 2.3 - Find the relative forward and backward errors and...Ch. 2.3 - Find the relative forward and backward errors and...Ch. 2.3 - Find the norm H of the 55 Hilbert matrix.Ch. 2.3 - (a) Find the condition number of the coefficient...Ch. 2.3 - (a) Find the condition number (in the infinity...Ch. 2.3 - (a) Find the (infinity norm) condition number of...Ch. 2.3 - (a) Prove that the infinity norm x is a vector...Ch. 2.3 - (a) Prove that the infinity norm A is a matrix...Ch. 2.3 - Prove that the matrix infinity norm is the...Ch. 2.3 - Prove that the matrix 1-norm is the operator norm...Ch. 2.3 - For the matrices in Exercise 1, find a vector x...Ch. 2.3 - For the matrices in Exercise 1, find a vector...Ch. 2.3 - Prob. 17ECh. 2.3 - Prob. 18ECh. 2.3 - For the nn matrix with entries Aij=5/(i+2j1), set...Ch. 2.3 - Carry out Computer Problem 1 for the matrix with...Ch. 2.3 - Let A be the nn matrix with entries Aij=| ij |+1 ....Ch. 2.3 - Carry out the steps of Computer Problem 3 for the...Ch. 2.3 - For what values of n does the solution in Computer...Ch. 2.3 - Use the MATLAB program from Computer Problem 2.1.1...Ch. 2.4 - Find the PA=LU factorization (using partial...Ch. 2.4 - Find the PA=LU factorization (using partial...Ch. 2.4 - Solve the system by finding the PA=LU...Ch. 2.4 - Solve the system by finding the PA=LU...Ch. 2.4 - Write down a 55 matrix P such that multiplication...Ch. 2.4 - (a) Write down the 44 matrix P such that...Ch. 2.4 - Change four entries of the leftmost matrix to make...Ch. 2.4 - Find the PA=LU factorization of the matrix A in...Ch. 2.4 - (a) Find the PA=LU factorization of A=[...Ch. 2.4 - (a) Assume that A is an nn matrix with entries |...Ch. 2.4 - Write a MATLAB program to define the structure...Ch. 2.4 - Plot the solution from Step 1 against the correct...Ch. 2.4 - Rerun the calculation in Step 1 for n=102k, where...Ch. 2.4 - Add a sinusoidal pile to the beam. This means...Ch. 2.4 - Rerun the calculation as in Step 3 for the...Ch. 2.4 - Now remove the sinusoidal load and add a 70 kg...Ch. 2.4 - If we also fix the free end of the diving board,...Ch. 2.4 - Ideas for further exploration: If the width of the...Ch. 2.5 - Compute the first two steps of the Jacobi and the...Ch. 2.5 - Rearrange the equations to form a strictly...Ch. 2.5 - Apply two steps of SOR to the systems in Exercise...Ch. 2.5 - Apply two steps of SOR to the systems in Exercise...Ch. 2.5 - Let be an eigenvalue of an nn matrix A. (a) Prove...Ch. 2.5 - Use the Jacobi Method to solve the sparse system...Ch. 2.5 - Use the Jacobi Method to solve the sparse system...Ch. 2.5 - Rewrite Program 2.2 to carry out Gauss-Seidel...Ch. 2.5 - Rewrite Program 2.2 to carry out SOR. Use =1.1 to...Ch. 2.5 - Carry out the steps of Computer Problem 1 with...Ch. 2.5 - Prob. 6CPCh. 2.5 - Using your program from Computer Problem 3. decide...Ch. 2.6 - Show that the following matrices are symmetric...Ch. 2.6 - Show that the following symmetric matrices are not...Ch. 2.6 - Prob. 3ECh. 2.6 - Show that the Cholesky factorization procedure...Ch. 2.6 - Prob. 5ECh. 2.6 - Find the Cholesky factorization A=RTR of each...Ch. 2.6 - Prob. 7ECh. 2.6 - Solve the system of equations by finding the...Ch. 2.6 - Prob. 9ECh. 2.6 - Find all numbers d such that A=[ 122d ] is...Ch. 2.6 - Prob. 11ECh. 2.6 - Prove that a principal submatrix of a symmetric...Ch. 2.6 - Solve the problems by carrying out the Conjugate...Ch. 2.6 - Solve the problems by carrying out the Conjugate...Ch. 2.6 - Carry out the conjugate gradient iteration in the...Ch. 2.6 - Prob. 1CPCh. 2.6 - Use a MATLAB version of conjugate gradient to...Ch. 2.6 - Solve the system Hx=b by the Conjugate Gradient...Ch. 2.6 - Solve the sparse problem of (2.45) by the...Ch. 2.6 - Prob. 5CPCh. 2.6 - Let A be the nn matrix with n=1000 and entries...Ch. 2.6 - Prob. 7CPCh. 2.6 - Prob. 8CPCh. 2.6 - Prob. 9CPCh. 2.6 - Prob. 10CPCh. 2.7 - Find the jacobian of the functions a....Ch. 2.7 - Use the Taylor expansion to find the linear...Ch. 2.7 - Sketch the two curves in the uv-plane, and find...Ch. 2.7 - Apply two steps of Newtons Method to the systems...Ch. 2.7 - Apply two steps of Broyden I to the systems in...Ch. 2.7 - Prob. 6ECh. 2.7 - Prove that (2.55) satisfies (2.53) and (2.54).Ch. 2.7 - Prove that (2.58) satisfies (2.56) and (2.57).Ch. 2.7 - Implement Newtons Method with appropriate starting...Ch. 2.7 - Use Newtons Method to find the three solutions of...Ch. 2.7 - Use Newtons Method to find the two solutions of...Ch. 2.7 - Apply Newtons Method to find both solutions of the...Ch. 2.7 - Use Multivariate Newtons Method to find the two...Ch. 2.7 - Prob. 6CPCh. 2.7 - Apply Broyden I with starting guesses x0=(1,1) and...Ch. 2.7 - Apply Broyden II with starting guesses (1, 1) and...Ch. 2.7 - Prob. 9CPCh. 2.7 - Apply Broyden Ito find the intersection point in...Ch. 2.7 - Apply Broyden II to find the sets of two...Ch. 2.7 - Apply Broyden II to find the intersection point in...
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.Similar questions
- Suppose that f(x, y, z) = (x − 2)² + (y – 2)² + (z − 2)² with 0 < x, y, z and x+y+z≤ 10. 1. The critical point of f(x, y, z) is at (a, b, c). Then a = b = C = 2. Absolute minimum of f(x, y, z) is and the absolute maximum isarrow_forwarda) Suppose that we are carrying out the 1-phase simplex algorithm on a linear program in standard inequality form (with 3 variables and 4 constraints) and suppose that we have reached a point where we have obtained the following tableau. Apply one more pivot operation, indicating the highlighted row and column and the row operations you carry out. What can you conclude from your updated tableau? x1 x2 x3 81 82 83 84 81 -2 0 1 1 0 0 0 3 82 3 0 -2 0 1 2 0 6 12 1 1 -3 0 0 1 0 2 84 -3 0 2 0 0 -1 1 4 -2 -2 0 11 0 0-4 0 -8arrow_forwardb) Solve the following linear program using the 2-phase simplex algorithm. You should give the initial tableau, and each further tableau produced during the execution of the algorithm. If the program has an optimal solution, give this solution and state its objective value. If it does not have an optimal solution, say why. maximize ₁ - 2x2+x34x4 subject to 2x1+x22x3x41, 5x1 + x2-x3-×4 ≤ −1, 2x1+x2-x3-34 2, 1, 2, 3, 40.arrow_forward
- 9. An elementary single period market model contains a risk-free asset with interest rate r = 5% and a risky asset S which has price 30 at time t = 0 and will have either price 10 or 60 at time t = 1. Find a replicating strategy for a contingent claim with payoff h(S₁) = max(20 - S₁, 0) + max(S₁ — 50, 0). Total [8 Marks]arrow_forward8. An elementary single period market model has a risky asset with price So = 20 at the beginning and a money market account with interest rate r = 0.04 compounded only once at the end of the investment period. = = In market model A, S₁ 10 with 15% probability and S₁ 21 with 85% probability. In market model B, S₁ = 25 with 10% probability and S₁ = 30 with 90% probability. For each market model A, B, determine if the model is arbitrage-free. If not, construct an arbitrage. Total [9 Marks]arrow_forwardb) Solve the following linear program using the 2-phase simplex algorithm. You should give the initial tableau, and each further tableau produced during the execution of the algorithm. If the program has an optimal solution, give this solution and state its objective value. If it does not have an optimal solution, say why. maximize ₁ - 2x2+x34x4 subject to 2x1+x22x3x41, 5x1 + x2-x3-×4 ≤ −1, 2x1+x2-x3-34 2, 1, 2, 3, 40.arrow_forward
- Suppose we have a linear program in standard equation form maximize cTx subject to Ax = b. x ≥ 0. and suppose u, v, and w are all optimal solutions to this linear program. (a) Prove that zu+v+w is an optimal solution. (b) If you try to adapt your proof from part (a) to prove that that u+v+w is an optimal solution, say exactly which part(s) of the proof go wrong. (c) If you try to adapt your proof from part (a) to prove that u+v-w is an optimal solution, say exactly which part(s) of the proof go wrong.arrow_forwarda) Suppose that we are carrying out the 1-phase simplex algorithm on a linear program in standard inequality form (with 3 variables and 4 constraints) and suppose that we have reached a point where we have obtained the following tableau. Apply one more pivot operation, indicating the highlighted row and column and the row operations you carry out. What can you conclude from your updated tableau? x1 x2 x3 81 82 83 84 81 -2 0 1 1 0 0 0 3 82 3 0 -2 0 1 2 0 6 12 1 1 -3 0 0 1 0 2 84 -3 0 2 0 0 -1 1 4 -2 -2 0 11 0 0-4 0 -8arrow_forwardMicrosoft Excel snapshot for random sampling: Also note the formula used for the last column 02 x✓ fx =INDEX(5852:58551, RANK(C2, $C$2:$C$51)) A B 1 No. States 2 1 ALABAMA Rand No. 0.925957526 3 2 ALASKA 0.372999976 4 3 ARIZONA 0.941323044 5 4 ARKANSAS 0.071266381 Random Sample CALIFORNIA NORTH CAROLINA ARKANSAS WASHINGTON G7 Microsoft Excel snapshot for systematic sampling: xfx INDEX(SD52:50551, F7) A B E F G 1 No. States Rand No. Random Sample population 50 2 1 ALABAMA 0.5296685 NEW HAMPSHIRE sample 10 3 2 ALASKA 0.4493186 OKLAHOMA k 5 4 3 ARIZONA 0.707914 KANSAS 5 4 ARKANSAS 0.4831379 NORTH DAKOTA 6 5 CALIFORNIA 0.7277162 INDIANA Random Sample Sample Name 7 6 COLORADO 0.5865002 MISSISSIPPI 8 7:ONNECTICU 0.7640596 ILLINOIS 9 8 DELAWARE 0.5783029 MISSOURI 525 10 15 INDIANA MARYLAND COLORADOarrow_forward
- The spread of an infectious disease is often modeled using the following autonomous differential equation: dI - - BI(N − I) − MI, dt where I is the number of infected people, N is the total size of the population being modeled, ẞ is a constant determining the rate of transmission, and μ is the rate at which people recover from infection. Close a) (5 points) Suppose ẞ = 0.01, N = 1000, and µ = 2. Find all equilibria. b) (5 points) For the equilbria in part a), determine whether each is stable or unstable. c) (3 points) Suppose ƒ(I) = d. Draw a phase plot of f against I. (You can use Wolfram Alpha or Desmos to plot the function, or draw the dt function by hand.) Identify the equilibria as stable or unstable in the graph. d) (2 points) Explain the biological meaning of these equilibria being stable or unstable.arrow_forwardFind the indefinite integral. Check Answer: 7x 4 + 1x dxarrow_forwardshow sketcharrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
College Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage Learning
Linear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage Learning
Elementary Linear Algebra (MindTap Course List)AlgebraISBN:9781305658004Author:Ron LarsonPublisher:Cengage Learning
Algebra for College StudentsAlgebraISBN:9781285195780Author:Jerome E. Kaufmann, Karen L. SchwittersPublisher:Cengage Learning
College AlgebraAlgebraISBN:9781305115545Author:James Stewart, Lothar Redlin, Saleem WatsonPublisher:Cengage Learning
College Algebra (MindTap Course List)
Algebra
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:Cengage Learning
Linear Algebra: A Modern Introduction
Algebra
ISBN:9781285463247
Author:David Poole
Publisher:Cengage Learning
Elementary Linear Algebra (MindTap Course List)
Algebra
ISBN:9781305658004
Author:Ron Larson
Publisher:Cengage Learning
Algebra for College Students
Algebra
ISBN:9781285195780
Author:Jerome E. Kaufmann, Karen L. Schwitters
Publisher:Cengage Learning
College Algebra
Algebra
ISBN:9781305115545
Author:James Stewart, Lothar Redlin, Saleem Watson
Publisher:Cengage Learning
Algebraic Complexity with Less Relations; Author: The University of Chicago;https://www.youtube.com/watch?v=ZOKM1JPz650;License: Standard Youtube License
Strassen's Matrix Multiplication - Divide and Conquer - Analysis of Algorithm; Author: Ekeeda;https://www.youtube.com/watch?v=UnpySHwAJsQ;License: Standard YouTube License, CC-BY
Trigonometric Equations with Complex Numbers | Complex Analysis #6; Author: TheMathCoach;https://www.youtube.com/watch?v=zdD8Dab1T2Y;License: Standard YouTube License, CC-BY