If we have an array îį, i = 0, 1, · · · n − 1, then the elements of the array can be thought of as elements of a multi-dimensional vector. There are a number of ways to measure the "norm" or "length" of such a vector. Two measures which are in common use are the 1-norm (the taxi-cab norm) and the 2-norm (the euclidean norm) with formulas as follows: norm1 = |x₂| norm2 H n-1 The array has 5 entries. The norms 1-norm - 9.000000 2-norm = 4.358899 are: i=0 n-1 i=0 Write a program which reads a sequence of no more than 100 floats from the input file lengthin.txt into an array, computes both norms, and then writes the values of the norms to the output file lengthout.txt in the form: ² 2

If we have an array îį, i = 0, 1, · · · n − 1, then the elements of the array can be thought of as elements of a multi-dimensional vector. There are a number of ways to measure the "norm" or "length" of such a vector. Two measures which are in common use are the 1-norm (the taxi-cab norm) and the 2-norm (the euclidean norm) with formulas as follows: norm1 = |x₂| norm2 H n-1 The array has 5 entries. The norms 1-norm - 9.000000 2-norm = 4.358899 are: i=0 n-1 i=0 Write a program which reads a sequence of no more than 100 floats from the input file lengthin.txt into an array, computes both norms, and then writes the values of the norms to the output file lengthout.txt in the form: ² 2

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter2: Basic Linear Algebra

Section2.4: Linear Independence And Linear Dependence

Problem 8P

See similar textbooks

Similar questions

Give a clear description of an efficient algorithm for finding the k smallest elements of a very large n-element vector. Compare its running time with that of other plausible ways of achieving the same result, including that of applying k times your solution for part (a). [Note that in part (a) the result of the function consists of one element, whereas here it consists of k elements. As above, you may assume for simplicity that all the elements of the vector are different.]
/*** We will assume that `matrixA` and `matrixB` are valid 2D arrays of* `int`s. Each matrix is rectangular, with each row having the same number* of columns.** First, we need to make sure the matrices are compatible. Given `numRows X* numColumns` for each matrix `A` and `B`, if `A` is `m x n`, then `B` must* be `n x p`. That is the ``inner`` dimensions (lengths) must match.** If number of columns in `matrixA` does NOT equal the number of rows in* `matrixB`, then return `null`. That is, not output is created.** Assuming the dimensions are consistent, then we create a 2D output array* that is `m x p`, that is `numRowsA X numColumnsB`.** To calculate each element of the output matrix, we multiply the rows of* `A` by the columns of `B` and sum them up.** For example, let for integer values be given by lower case letters, let* `A` be a 2 x 3 matrix, and `B` a 3 x 3 matrix. The inner dimensions are* consistent, so we can multiply.** <pre>[a, b ,c]A = [d, e, f][p, q, r]B = |s, t, u|[v,…
Consider a vector ('L', 'M', 'M', 'L', 'H', 'M', 'H', 'H'), where H stands for ‘high’, L stands for ‘low’, and M for ‘medium’ in rstudio. a. Convert this vector into an unordered factor. b. Convert this vector into an ordered factor with Low < Medium < High.
Let y be a column vector: y = [1, 2, 3, 4, 5, 6] so that y.shape = (6,1). Reshape the vector into a matrix z using the numpy.array.reshape and (numpy.array.transpose if necessary) to form a new matrix z whose first column is [1, 2, 3], and whose second column is [4, 5, 6]. Print out the resulting array z.
Construct a square matrix with NN rows and NN columns consisting of nonnegative integers from 00 to 10^{18}1018, such that its determinant is equal to 11, and there are exactly A_iAi odd numbers in the ii-th row for each ii from 11 to NN, or report there isn't such a matrix. Standard input The first line contains a single integer NN. Each of the next NN lines contains a single integer A_iAi. Standard output If there is no solution, output \text{-}1-1. Otherwise, print NN lines, each consisting of NN integers, representing the values of the constructed matrix. If there are multiple solutions, print any. Constraints and notes 2 \le N \le 502≤N≤50 1 \leq A_i \leq N1≤Ai≤N For 40\%40% of the test files, N \le 17N≤17.
Write a program that can inverse a matrix by using an approach to find its minor, cofactor and adjugate matrix. Test your program with the given matrix ?
Give a MPI program segment to convert a n-by-n matrix distributed on a n-by-n 2D mesh such that allits rows and columns get sorted in ascending order. Show only the iterative loop. Only communicationsallowed are to the four direct neighbors. (Hint: You may employ a variant of odd-even transpositionsort, but the whole matrix does not need to be sorted.)
(20pts) Consider the matrixA =−2 11−10 5(a) Determine, by hand, an SVD of A, A = UΣVT. The SVD is not unique,so find the one with the minimum number of minus signs in U and V . List thesingular values σ1 and σ2, and the left and right singular vectors.(b) Find A−1 not directly, but via the SVD. Check your result by typing inv(A)in MATLAB or calculating A−1 by other methods.(c) Find the eigenvalues λ1 and λ2 of A. Verify that detA = λ1λ2 and |detA| =σ1σ2
An array of size n and two integers D and S are given, the special sum of a subarray is defined as follows:(Sum of all elements of the subarray) (D - p S)Where p = number of distinct prime factors of “product of all elements of the subarray”.Find the maximum special sum by considering all non-empty subarrays of the given array.Input:-First 3 integers will be n, D and S and the following will be the elements of the arrayOutput:- Output maximum special sum considering all non-empty subarrays of the array(single output integer)
The algorithm for computing the Hamming distance between two sequences of the same length implemented in R, for instance, by first splitting the sequences into vectors with the strsplit function and then using the sum function to count the number of positions at which the two vectors differ.
Consider the matrix multiplication C = AB. A matrix W is called a witness matrix with the following conditions: • If ci j = 0, then wi j = 0.• If ci j = 1, then wi j = k where aik = bkj = 1. make code to displays two Booelan matrices A and B and their productC. Note that we define these matrices with 0 and 1 entries and declare their typesas boolean with dtype = bool statement after specifying the entries. Alternatively,we could have specified theses matrices with True and False entries. The booleanproduct C is then converted to integer by the astype method and both forms of Care printed
Search a sorted matrix: The input consistsof a real number x and a matrix A[1..n, 1..m] of nm real numbers such that each rowA[i, 1..m] is sorted and each column A[1..n, j] is sorted. The goal is to find the maximum array entry A[i, j] that is less than or equal to x, or report that all elements of Aare larger than x. Design and analyze an iterative algorithm for this problem that examines as few matrix entries as possible. Becareful if you believe that a simple binarysearch solves the problem. make a lower bound, and recursive algorithm.