# User Portlet Richard Frost
Discussions
At least numerically the solutions are if not equal, but almost equal. The negative values of alpha1 are missing, here for alpha1 = .237: w1a = W1 /. {Cos[\[Alpha]1] -> c1, Cos[\[Alpha]3] -> c3, Sin[\[Alpha]3] -> Sqrt[1 - c3^2]}; w2a =...
Thanks to your help, I made the code I wanted. Thank you very much.
Thank you. That works, and {Right, Top} is better than my absolute placement.
Rohit, Thank you for the tips. I have been misunderstanding ':=' as 'define', and also was unaware of RandomSample[] - which I'm reading has the desired properties.
Hello Henrik, thank you for the clarification. This is actually a very elegant way of computing the solution in a simple way, without having to calculate any coefficients! Funnily (and understandibly), it is converging faster when n gets larger. ...
Radicals are tricky. Equations with radicals, doubly so. I have learnt from your nice example. I hope you have too.
Thanks, it worked.
It is not that there are drawbacks to k-means, but rather there are drawbacks to implementations that ignore multiplicity. Part of this is due to the influence of of older k-neighbor algorithms, designed for compiler construction in a single threaded...
Is there a list of logical rectangular (over-determined) matrices where the pseudoinverse can be solved by a simple algorithm rather than the Mathematica Function PseudoInverse (Moore-Penrose method)? I seem to recall a page on Wikipedia that...
Thank you Kuba for your quick reply plus examples. So "& @" now makes sense, a prefixed pure function. NumberForm is a good idea too -- it gets to the heart of what I wanted. Quantity[] is also desirable, but upon export in tabular form does not...