3.1 (12/25) LU decomposition Perform LU decomposition on matrix A by implementing your own function (lu) based on following pseudocode. Please validate your final solution by using e = ||LU – PA||F, which should be a small value (for this problem, e < 10-6). Algorithm 1 LU Decomposition with Partial Pivoting DI is the identity matrix Dn is the number of rows of A Input: U + A, L + I, P + I 1: for k = 1:n – 1 do Find i > k to maximize |U(i, k)| U(k, k : n) + U(i, k : n) L(k, 1 : k) → L(i, 1 : k) P(k,:) + P(i, :) for j = k +1: n do L(j, k) = U (j, k)/U(k, k) U(j, k : n) = U(j, k : n) – L(j, k)U(k, k : n) end for %3D 2: D switching specified elements 3: 4: 5: 6: 7: 8: 9: 10: end for 11: return P, L,U

3.1 (12/25) LU decomposition Perform LU decomposition on matrix A by implementing your own function (lu) based on following pseudocode. Please validate your final solution by using e = ||LU – PA||F, which should be a small value (for this problem, e < 10-6). Algorithm 1 LU Decomposition with Partial Pivoting DI is the identity matrix Dn is the number of rows of A Input: U + A, L + I, P + I 1: for k = 1:n – 1 do Find i > k to maximize |U(i, k)| U(k, k : n) + U(i, k : n) L(k, 1 : k) → L(i, 1 : k) P(k,:) + P(i, :) for j = k +1: n do L(j, k) = U (j, k)/U(k, k) U(j, k : n) = U(j, k : n) – L(j, k)U(k, k : n) end for %3D 2: D switching specified elements 3: 4: 5: 6: 7: 8: 9: 10: end for 11: return P, L,U

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

LANGUAGUE: C I - Write an algorithm that takes two nxn matrices stored in vectors v1 and v2 and, computes a new matrix to be stored in vector v3 that corresponds to multiplication of the matrix stored in vector v1 by the matrix stored in vector v2. Assume that vector v3 is already properly allocated. int MultiplicaMatrizes (int *v1, int *v2, int *v3, int n) II - Write an algorithm for the Pune operation that punishes an element in a stack putting it n positions down. Assume that the stack is implemented as a vector. int Pune(Stack *s, int n) III - Write a k-remove(L,k) algorithm to remove the kth node from the linear list simply chained L void * sllRemovek (SLList *l, int k)
Q.5 Assume that an upper triangular matrix A [0... 99, 0 ..99] is stored in a linear array C of size 5050 with row major order. If A[0, 0] is stored in C[0], find the index of C where A[70, 90] is stored in it.
2. Show that matrix multiplication distributes over matrix addition: show A(B + C) = AB+ AC assuming that A, B, and C are matrices of compatible size. 3. Write a function my_is_orthogonal (v1,v2,tol) where v1 and v2 are column vectors of the same size, and tol is a scalar value strictly larger than zero. The output should be 1 if the angle between vl and v2 is within tol of 1/2, that is, |7/2 – 0| < tol, and zero otherwise. You may assume that vl and v2 are column vectors of the same size, and that tol is a positive scalar.
Exercise 4.18 Determine the DFT of the following vectors! Give the solutions in matrix form! f¹ = [20,5]; f = [3,2,5,1].
Computer Science Parallelization of matrix vector multiplication 3.1 Create a program that computes a simple matrix vector multiplication b=Ax, Use OpenMP directives to make it run in parallel.
Q2) Simplify the following function for F using a K-map. F(A,B,C,D) = E m(0, 2, 8, 10, 12, 14)
4 a) Dijkstra's algorithm solves the SSSP problem. Describe how your choice of data structure to implement the Dijkstra's algorithm affects the time complexity of the algorithm b) Apply the Dijkstra's algorithm to compute the shortest path from the source vertex S and comment whether it solves the SSSP problem. You should use the table below to update d[v] and n[v] for each vertex 2 3 4 -3 5 y You should show all your updates using the following table as you apply the algorithm Vertex, v d[v] n[v] y 2.
A: Create the following matrix M and Create a 4 x 3 matrix F from all rows and the third through fifth columnsof matrix M. 0 0 2 2 2 0.7 0.6 0.5 0.4 0.3 0.2 0.1 M= 4 6 8 8 10 12 14 22 19 16 13 10 7 B: find the minimum value of the matrix H. 1.7 1.6 1.5 1.4 1.3 1.2 22 24 26 28 30 32 = H 9 8 7 6 . 4
x²+3x+3 Q14) Plot the function f(x) = 0.8(x+1) for -4 ≤ x ≤ 3. Notice that the function has a vertical asymptote at x=-1. Plot the function by creating two vectors for the domain of x. The first vector (name it x1) includes elements from -4 to -1.1, and the second vector (name it x2) includes elements from -0.9 to 3. For each x vector create a y vector (mane them y1 and y2) with the corresponding values of y according to the function. To plot the function, make two curves in the same plot (yl vs. x1, and y2 vs. x2).
1. Write the code using vpasolve and find the x and y values. (1) ((log(x)/log(3))+3y=13, x^2-2y=1 2. Quadratic square matrix A=[2 3; 1 a], the sum of all elements of A^5 is 2474856. Find the value of the constant a. (a<=100, natural number)
MPI Programming: Write a MPI program in C/C++ to multiply two n-by-n matrices using p processors organized ina ring network with 1 ≤ p ≤ 12. Use the algorithm laid out here: P0 will generate and send ith row-band of Aand ith row-band of BT (the transpose of matrix B) to Pi, 1 ≤ i ≤ p − 1 (thus, space allocated should only be toaccommodate row-bands of A, BT and C). To compute their row-bands of product matrix C, the processors willuse p steps of computation (multiplying row-bands of A and BT producing a block of row-band of C) and (p-1)steps of communication (sending the row-band of BT to the right neighbor and receiving from the left neighbor).You must only use send/receive primitives. P0 finally receives the ith row-bands of product matrix C from Pi,1 ≤ i ≤ p − 1, and prints it out.
Q1: if y = [1,2,3,4,6,5,4,3,8,9,7,6,5,4,3,2], then a) replace the first three elements of vector y with its minimum value. b) reshape this vectorinto a 4 x 4 matrix.