Tpofofn

1,527 reputation

514

bio	website
	location
	age
visits	member for	2 years, 5 months
	seen	21 hours ago
stats	profile views	139

	1,527 reputation	bio	website		visits	member for	2 years, 5 months
514 badges		location			seen	21 hours ago

summary answers questions tags badges favorites bounties reputation activity

241 Actions

suggestions reviews revisions comments badges posts accepts all

Mar 23	comment	An eigenvector is a non-zero vector such that… @ScottH. I think that you are confusing the notions of a space and a basis. A basis is a non-zero vector which is linearly independent (i.e. cannot contain the zero vector) and spans the space. An eigenvector cannot be zero because it is a basis. The space spanned by the eigenvector must contain the zero vector.
Mar 22	comment	An eigenvector is a non-zero vector such that… An eigenspace is spanned by a non-zero eigenvector associated with a particular eigenvalue. The eigenspace must be at least one dimensional and therefore excludes using the zero vector as an eigenvector.
Mar 6	comment	New vector position Is the axis aligned with one of your coordinate axes. If so, then you can omit that axis in your calculations. Don't include it in your distance calculations and don't include it in your scaling calculations. If it is not aligned with a coordinate axis, then you need something more sophisticated.
Mar 6	comment	New vector position It is essentially the same equation just written a different way. The steps you need to go through are as follows: (1) compute the average distance, (2) compute the relative vector to the center $v_i - c$, (3) normalize it to unit length by dividing it by its own length, (4) scaling it to the average length and then finally (5) adding the center back onto the result. The referenced post does essentially the same thing, except that it distributes the scaling to each component.
Mar 5	comment	New vector position Almost. You should use: npX = (vts[0] - cs[0]) / (distanceFromCenter[for this point]) * averageDistance + cs[0]
Mar 5	comment	New vector position Just the magnitude of the vector. I believe that you compute it in your first loop and call it distanceFromCenter.
Mar 5	revised	How to get Euler angles with respect to initial Euler angle added 435 characters in body
Mar 5	answered	New vector position
Mar 5	answered	How to get Euler angles with respect to initial Euler angle
Mar 5	comment	New vector position So you have 8 points (for example) and a center point. You want to update the 8 points based on their distance to the center point. It is not clear what you want the new points to be based on their distance to the center point. Please clarify
Mar 5	comment	New vector position observing your code, it appears that you are summing the coordinates in oldCoordArray. If you divide by the number of points, you should have the center of the points.
Mar 5	comment	New vector position I guess I meant, compute the average coordinate in each axis separately (i.e. x, y, z).
Mar 5	comment	New vector position Is it safe to assume that you want to compute the new center so that it has a minimum average distance to each point? If so, compute average distances in each of the coordinates separately. These three average coordinates will give you the new center point.
Mar 5	comment	Identifying a pattern in an array Do you know what type of process generated the array or is it completely unknown?
Mar 5	revised	identify unknown variables in a graph plot edited tags
Mar 5	comment	identify unknown variables in a graph plot Please explain what you mean by "how many variables are responsible for the plot". If you have a plot of distance vs. time then you have two variables (1) time (the independent variable) and (2) distance (the dependent variable).
Mar 3	revised	I cannot solve this problem about surface area of a cone Inserted LaTeX to make more readable.
Mar 3	suggested	suggested edit on I cannot solve this problem about surface area of a cone
Mar 2	answered	What is the intuitive meaning of the basis of a vector space and the span?
Feb 27	comment	Subspace of a Vector Space must be non-empty. To have a subspace the span must form a group under vector addition. A group must contain an identity element, the zero vector $\mathbf 0$. A subspace spanned by ${\mathbf 0}$ is zero-dimensional (i.e. consists of one point). This is the smallest subspace that one can have.