Numerical Analysis, Books A La Carte Edition (3rd Edition)
Numerical Analysis, Books A La Carte Edition (3rd Edition)
3rd Edition
ISBN: 9780134697338
Author: Timothy Sauer
Publisher: PEARSON
bartleby

Concept explainers

bartleby

Videos

Textbook Question
Book Icon
Chapter 12.4, Problem 1CP

Use MATLAb’S svd command to find the best rank-one approximation of the following matrices:

a [ 1 2 2 3 ] b [ 1 4 2 3 ] c [ 1 2 4 1 3 3 0 0 1 ] d [ 1 5 3 2 3 2 3 1 1 ]

a.

Expert Solution
Check Mark
To determine

Use MATLAB’s svd command to find the best rank-one approximation of the given matrx.

Answer to Problem 1CP

The best rank-one approximation of the matrix A=[1223] is [1.17071.89441.89443.0656]

Explanation of Solution

Given Information: [1223]

Calculation:

Use commands ‘A=[1 2;2 3]’ to define the matrix A and ‘[U S V]=svd(A)’ to find the singular value decomposition (SVD) of the matrix A in the MATLAB.

  Numerical Analysis, Books A La Carte Edition (3rd Edition), Chapter 12.4, Problem 1CP , additional homework tip  1

  Numerical Analysis, Books A La Carte Edition (3rd Edition), Chapter 12.4, Problem 1CP , additional homework tip  2

Therefore,

u1=[0.52570.8507]

s1=4.2361

v1=[0.52570.8507]

The first rank-one matrix is s1u1v1T .

  Numerical Analysis, Books A La Carte Edition (3rd Edition), Chapter 12.4, Problem 1CP , additional homework tip  3

  Numerical Analysis, Books A La Carte Edition (3rd Edition), Chapter 12.4, Problem 1CP , additional homework tip  4

Thus, the best rank-one approximation of the matrix A=[1223] is [1.17071.89441.89443.0656] .

b.

Expert Solution
Check Mark
To determine

Use MATLAB’s svd command to find the best rank-one approximation of the given matrx.

Answer to Problem 1CP

The best rank-one approximation of the matrix A=[1423] is [1.17071.89441.89443.0656]

Explanation of Solution

Given Information: [1423]

Calculation:

Use commands ‘A=[1 4;2 3]’ to define the matrix A and ‘[U S V]=svd(A)’ to find the singular value decomposition (SVD) of the matrix A in the MATLAB.

  Numerical Analysis, Books A La Carte Edition (3rd Edition), Chapter 12.4, Problem 1CP , additional homework tip  5

  Numerical Analysis, Books A La Carte Edition (3rd Edition), Chapter 12.4, Problem 1CP , additional homework tip  6

Therefore,

u1=[0.75550.6552]

s1=5.3983

v1=[0.38270.9239]

The first rank-one matrix is s1u1v1T .

  Numerical Analysis, Books A La Carte Edition (3rd Edition), Chapter 12.4, Problem 1CP , additional homework tip  7

  Numerical Analysis, Books A La Carte Edition (3rd Edition), Chapter 12.4, Problem 1CP , additional homework tip  8

Thus, the best rank-one approximation of the matrix A=[1423] is [1.56083.76801.35363.2678] .

c.

Expert Solution
Check Mark
To determine

Use MATLAB’s svd command to find the best rank-one approximation of the given matrx.

Answer to Problem 1CP

The best rank-one approximation of the matrix A=[124133001] is [1.01052.51223.64350.95512.37453.44380.17860.44400.6440]

Explanation of Solution

Given Information: [124133001]

Calculation:

Use commands ‘A=[1 2 4;1 3 3;0 0 1]’ to define the matrix A and ‘[U S V]=svd(A)’ to find the singular value decomposition (SVD) of the matrix A in the MATLAB.

  Numerical Analysis, Books A La Carte Edition (3rd Edition), Chapter 12.4, Problem 1CP , additional homework tip  9

  Numerical Analysis, Books A La Carte Edition (3rd Edition), Chapter 12.4, Problem 1CP , additional homework tip  10

Therefore,

u1=[0.72080.68130.1274]

s1=6.2980

v1=[0.22260.55340.8026]

The first rank-one matrix is s1u1v1T .

  Numerical Analysis, Books A La Carte Edition (3rd Edition), Chapter 12.4, Problem 1CP , additional homework tip  11

  Numerical Analysis, Books A La Carte Edition (3rd Edition), Chapter 12.4, Problem 1CP , additional homework tip  12

Thus, the best rank-one approximation of the matrix A=[124133001] is [1.01052.51223.64350.95512.37453.44380.17860.44400.6440] .

d.

Expert Solution
Check Mark
To determine

Use MATLAB’s svd command to find the best rank-one approximation of the given matrx.

Answer to Problem 1CP

The best rank-one approximation of the matrix A=[153232311] is [0.51415.23431.99530.20702.10730.80330.14251.45070.5530]

Explanation of Solution

Given Information: [153232311]

Calculation:

Use commands ‘A=[1 5 3;2 -3 2;-3 1 1]’ to define the matrix A and ‘[U S V]=svd(A)’ to find the singular value decomposition (SVD) of the matrix A in the MATLAB.

  Numerical Analysis, Books A La Carte Edition (3rd Edition), Chapter 12.4, Problem 1CP , additional homework tip  13

  Numerical Analysis, Books A La Carte Edition (3rd Edition), Chapter 12.4, Problem 1CP , additional homework tip  14

Therefore,

u1=[0.89840.36170.2490]

s1=6.2614

v1=[0.09140.93050.3547]

The first rank-one matrix is s1u1v1T .

  Numerical Analysis, Books A La Carte Edition (3rd Edition), Chapter 12.4, Problem 1CP , additional homework tip  15

  Numerical Analysis, Books A La Carte Edition (3rd Edition), Chapter 12.4, Problem 1CP , additional homework tip  16

Thus, the best rank-one approximation of the matrix A=[153232311] is [0.51415.23431.99530.20702.10730.80330.14251.45070.5530] .

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
these are solutions to a tutorial that was done and im a little lost. can someone please explain to me how these iterations function, for example i Do not know how each set of matrices produces a number if someine could explain how its done and provide steps it would be greatly appreciated thanks.
Q1) Classify the following statements as a true or false statements a. Any ring with identity is a finitely generated right R module.- b. An ideal 22 is small ideal in Z c. A nontrivial direct summand of a module cannot be large or small submodule d. The sum of a finite family of small submodules of a module M is small in M A module M 0 is called directly indecomposable if and only if 0 and M are the only direct summands of M f. A monomorphism a: M-N is said to split if and only if Ker(a) is a direct- summand in M & Z₂ contains no minimal submodules h. Qz is a finitely generated module i. Every divisible Z-module is injective j. Every free module is a projective module Q4) Give an example and explain your claim in each case a) A module M which has two composition senes 7 b) A free subset of a modale c) A free module 24 d) A module contains a direct summand submodule 7, e) A short exact sequence of modules 74.
************* ********************************* Q.1) Classify the following statements as a true or false statements: a. If M is a module, then every proper submodule of M is contained in a maximal submodule of M. b. The sum of a finite family of small submodules of a module M is small in M. c. Zz is directly indecomposable. d. An epimorphism a: M→ N is called solit iff Ker(a) is a direct summand in M. e. The Z-module has two composition series. Z 6Z f. Zz does not have a composition series. g. Any finitely generated module is a free module. h. If O→A MW→ 0 is short exact sequence then f is epimorphism. i. If f is a homomorphism then f-1 is also a homomorphism. Maximal C≤A if and only if is simple. Sup Q.4) Give an example and explain your claim in each case: Monomorphism not split. b) A finite free module. c) Semisimple module. d) A small submodule A of a module N and a homomorphism op: MN, but (A) is not small in M.

Chapter 12 Solutions

Numerical Analysis, Books A La Carte Edition (3rd Edition)

Ch. 12.1 - If A is a 66 matrix with eigenvalues -6, -3, 1, 2,...Ch. 12.1 - Prob. 1CPCh. 12.1 - Prob. 2CPCh. 12.1 - Prob. 3CPCh. 12.1 - Prob. 4CPCh. 12.2 - Prob. 1ECh. 12.2 - Prob. 2ECh. 12.2 - Prob. 3ECh. 12.2 - Call a square matrix stochastic if the entries of...Ch. 12.2 - Prob. 5ECh. 12.2 - (a) Show that the determinant of a matrix in real...Ch. 12.2 - Decide whether the preliminary version of the QR...Ch. 12.2 - Prob. 8ECh. 12.2 - Prob. 1CPCh. 12.2 - Prob. 2CPCh. 12.2 - Prob. 3CPCh. 12.2 - Prob. 4CPCh. 12.2 - Prob. 5CPCh. 12.2 - Prob. 6CPCh. 12.2 - Prob. 7CPCh. 12.2 - Verify the page rank eigenvector p for Figure...Ch. 12.2 - Prob. 2SACh. 12.2 - Prob. 3SACh. 12.2 - Prob. 4SACh. 12.2 - Set q=0.15 . Suppose that Page 2 in the Figure...Ch. 12.2 - Prob. 6SACh. 12.2 - Design your own network, compute page ranks, and...Ch. 12.3 - Find the SVD of the following symmetric matrices...Ch. 12.3 - Prob. 2ECh. 12.3 - Prob. 3ECh. 12.3 - (a) Prove that the ui , as defined in Theorem...Ch. 12.3 - Prove that for any constants a and b, the nonzero...Ch. 12.3 - Prob. 6ECh. 12.3 - Prob. 7ECh. 12.3 - Prove that for any constants a and b, the nonzero...Ch. 12.4 - Use MATLAbS svd command to find the best rank-one...Ch. 12.4 - Prob. 2CPCh. 12.4 - Find the best least squares approximating line for...Ch. 12.4 - Find the best least squares approximating plane...Ch. 12.4 - Prob. 5CPCh. 12.4 - Continuing Computer Problem 5, add code to find...Ch. 12.4 - Use the code developed in Computer Problem 6 to...Ch. 12.4 - Import a photo, using MATLABs imread command. Use...
Knowledge Booster
Background pattern image
Math
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
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Discrete Mathematics and Its Applications ( 8th I...
Math
ISBN:9781259676512
Author:Kenneth H Rosen
Publisher:McGraw-Hill Education
Text book image
Mathematics for Elementary Teachers with Activiti...
Math
ISBN:9780134392790
Author:Beckmann, Sybilla
Publisher:PEARSON
Text book image
Calculus Volume 1
Math
ISBN:9781938168024
Author:Strang, Gilbert
Publisher:OpenStax College
Text book image
Thinking Mathematically (7th Edition)
Math
ISBN:9780134683713
Author:Robert F. Blitzer
Publisher:PEARSON
Text book image
Discrete Mathematics With Applications
Math
ISBN:9781337694193
Author:EPP, Susanna S.
Publisher:Cengage Learning,
Text book image
Pathways To Math Literacy (looseleaf)
Math
ISBN:9781259985607
Author:David Sobecki Professor, Brian A. Mercer
Publisher:McGraw-Hill Education
Vector Spaces | Definition & Examples; Author: Dr. Trefor Bazett;https://www.youtube.com/watch?v=72GtkP6nP_A;License: Standard YouTube License, CC-BY
Understanding Vector Spaces; Author: Professor Dave Explains;https://www.youtube.com/watch?v=EP2ghkO0lSk;License: Standard YouTube License, CC-BY