Search Results

You're missing a & in your question, which might be simply a typo. iterationsteps[function_, seed_, steps_] := Length[Select[FixedPointList[function, seed, steps] - FixedPoint[function, seed], # >= …

Anon's answer is the way I would do it, but it's fun to figure out a solution that works for single vectors as well as a list of vectors: f[a_, b_, u_] := Map[Composition[#^b &, Total], u, {-2}].a …

I'm afraid my comment was too obscure to be noticed. Further, I disagree with one premise somewhere in the commentary, and I wish to make a fuller explanation to see if I understand correctly or inco …

If you have a large amount of calibData, then preserving packed arrays can greatly improve speed. Convert it all to Reals and then apply logarithm. calibData = 10 RandomInteger[{1, 20}, {10^6, 2}]; …

I sometimes want to apply a linear combination of functions to an argument. This can be more difficult if the linear combinations are generated by code, so that rewriting them some form to make Throu …

There are some features of this specific problem one can take advantage of. The boundary of the x,y,z,n domain represented by val <= max is linear in x,y,z and only quadratic in n; furthermore val in …

Here is a simple fix of the OP's definitions: norm[x_] := Sqrt[x.x] tangent[γ_] := Function[s, Evaluate[γ'[s]/norm[γ'[s]]]] normal[γ_] := Function[s, Evaluate[tangent[γ]'[s]/norm[tangent[γ]'[s]]]] …

If the purpose is as in the following, The reason I want to do that is to filter the list to find the matrix closest to the target one, then an alternative would be to use Nearest: SeedRandom[2 …

Here's another way that's quite a bit faster on David Stork's example: #.Y.# &[A.X] SeedRandom[0]; A = Table[RandomReal[], {3000}]; X = Table[RandomReal[], {3000}, {8000}]; Y = Table[RandomReal[], {8 …

Maybe the following. Simplifying a left-over constant term along with the other coefficients seems hard to comprise in a single, simple function. forms = {_f, _e, _g, _h}; funcs = {simpF, simpE, sim …

This gets the desired result: (MyFunction @@ #1) @@ #2 & @@ {{1, 2, 3}, {4, 5, 6}} (* MyFunction[1, 2, 3][4, 5, 6] *)

A long comment...I'm using V13.1, Mac M1 Pro, which might matter... First, I would point out the "About" section of the profile of user @WReach. Toward the end, the question "Why don't you like to ans …

Compiled, parallelized ordering plus a more functional approach. The switch between DistanceMatrix and Outer (for dm) may be system dependent. ordC = Compile[{{x, _Real, 1}}, First@Ordering[x, 1], …

Best on packed arrays... PadLeft[Transpose@{#2}, {Automatic, 2}, {#1}] &[ n0, {n1, n2, n3, n4, n5}] (* {{n0, n1}, {n0, n2}, {n0, n3}, {n0, n4}, {n0, n5}} *) PadLeft[ArrayReshape[#2, {Length@#2, …

Here's a way using NestWhile: f[lst_?(VectorQ[#, NumericQ] &), n_Integer?Positive, p_?Positive] := If[Length @ # > n, #[[n + 1]], None] &@ NestWhile[Rest, lst, Length @ # > n && Abs[Mea …