(a) Let A € Rxn be nonsingular, and assume that we know the LU decomposition ALU. Let BE Rnxk, CERnxk, and DE Rkxk. We want to compute the solution of A B D - B as efficiently as possible using the fact that we know the LU decomposition of A. (i) Give explicit expressions for a and y in terms of the matrices A, B, C, and D (and their inverses where appropriate), and the right-hand side vectors by and b₂. (ii) Show that the complexity of computing e and y is O(kn²+k²n+k³) if the LU decomposition of A is known. (b) Now let A € Rmxn, m≥n. Let trace(A) := the sum of its diagonal values). Note that || A|| -1 ajj be the trace of A (that is := [trace(ATA)]¹/2 (i) Show that trace(AB) = trace(BA) for square matrices with the same di- mensions. (ii) Conclude that ||PAQ||||A|| for orthogonal matrices PE Rmxm and QE Rnxn,

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question

please answer the whole 2 question thank you l'll give you a thumb

2.
(a) Let A € Rnxn be nonsingular, and assume that we know the LU decomposition
A = LU. Let B E Rnxk, CE Rnxk, and D € Rkxk
We want to compute the solution of
A
[BD-R]
as efficiently as possible using the fact that we know the LU decomposition of
A.
(i) Give explicit expressions for r and y in terms of the matrices A, B, C, and
D (and their inverses where appropriate), and the right-hand side vectors
by and b₂.
(ii) Show that the complexity of computing a and y is O(kn²+k²n+k³) if the
LU decomposition of A is known.
(b) Now let A € Rmxn, m≥n. Let trace(A) :=
-1 aj be the trace of A (that is
=1
the sum of its diagonal values). Note that || A|| F = [trace(ATA)]¹/2
:=
(i) Show that trace(AB) = trace (BA) for square matrices with the same di-
mensions.
(ii) Conclude that ||PAQ||F = ||A||F for orthogonal matrices P € Rmxm and
QERnxn
Transcribed Image Text:2. (a) Let A € Rnxn be nonsingular, and assume that we know the LU decomposition A = LU. Let B E Rnxk, CE Rnxk, and D € Rkxk We want to compute the solution of A [BD-R] as efficiently as possible using the fact that we know the LU decomposition of A. (i) Give explicit expressions for r and y in terms of the matrices A, B, C, and D (and their inverses where appropriate), and the right-hand side vectors by and b₂. (ii) Show that the complexity of computing a and y is O(kn²+k²n+k³) if the LU decomposition of A is known. (b) Now let A € Rmxn, m≥n. Let trace(A) := -1 aj be the trace of A (that is =1 the sum of its diagonal values). Note that || A|| F = [trace(ATA)]¹/2 := (i) Show that trace(AB) = trace (BA) for square matrices with the same di- mensions. (ii) Conclude that ||PAQ||F = ||A||F for orthogonal matrices P € Rmxm and QERnxn
Expert Solution
steps

Step by step

Solved in 4 steps

Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,