algorithm - What is the time complexity of finding the cube of a matrix? -

-

i know complexity of multiplying 2 matrices directly axb o(n^3). holds when trying find square of matrix, because means axa.

what complexity when trying find cube of matrix?

it o(n3)

why?

  • you can calculate cube 2 matrix multiplications.
  • doing matrix multiplication of square matrices not change n.
  • doing 2 o(n3) operations in series o(n3).

see wikipedia formal definition.


Comments

Post a Comment

Popular posts from this blog

Using 'OR' and 'AND' in SQL Server -

-
is using ( condition or condition b , condition c ) the same as ( condition , condition c) or (condition b , condition c) no. first condition is: (condition a) or (condition b , condition c) and second is: (condition , condition c) or (condition b , condition c) you can see difference between them.
Read more

python - Finding intersection between ellipse and a line -

-
i trying find intersection points between elipse , line, seem unable so. have tried 2 approaches, 1 shapely trying find intersection between linestring , linearring in code bellow, did not usable values out of it. 1 of problems, elipse off center , @ small or high angle # -*- coding: utf-8 -*- """ created on mon aug 19 17:38:55 2013 @author: adudchenko """ pylab import * import numpy np shapely.geometry.polygon import linearring shapely.geometry import linestring def ellipse_polyline(ellipses, n=100): t = np.linspace(0, 2*np.pi, n, endpoint=false) st = np.sin(t) ct = np.cos(t) result = [] x0, y0, a, b, angle in ellipses: angle = np.deg2rad(angle) sa = np.sin(angle) ca = np.cos(angle) p = np.empty((n, 2)) p[:, 0] = x0 + * ca * ct - b * sa * st p[:, 1] = y0 + * sa * ct + b * ca * st result.append(p) return result def intersections(a, line): ea = linearring(a) eb...
Read more

c++ - NetBeans Remote Development with additional configuration -

-
i'm trying use netbeans (7.3.1) work on remote project. my configuration following: my local machine windows 7 laptop. doesn't have tools. in particular neither compiler nor debugger. have netbeans ide , putty example. source code, make scripts , (eventually) build results located on remote storage shared across servers , "locals". (i might switch single server storage faster don't think matters @ all.) i'm accessing using sshfs manager . sshfs manager takes server name, path on server, user name , ssh private key. in result mounts directory on server disk on windows. works fine. (although directories, possibly links, represented files in windows explorer, don't know if matters...) netbeans project located on local machine don't think matters , place remotely well. prefer keep "off source" don't have add ignores version control. in netbeans did procedure described in remote developement tutorial . seems successful. netbeans c...
Read more