Skip to main content
Studentmath's user avatar
Studentmath's user avatar
Studentmath's user avatar
Studentmath
Unregistered
  • Member for 12 years, 1 month
comment
Pure greedy algorithm
$G_m(f,D)$ is approximant we obtained after $m$ th step of PGA. For more information see mosaic.math.tamu.edu/~rdevore/publications/91.pdf
revised
Pure greedy algorithm
added 11 characters in body
Loading…
revised
Pure greedy algorithm
added 310 characters in body
Loading…
awarded
revised
Pure greedy algorithm
deleted 1 characters in body; deleted 232 characters in body
Loading…
asked
Loading…