J2597 ... the test data - 12/21/21 04:02 PM

I'm reading through J2597 for the first time, as I'll need to conform as I venture back into the peening world. Here's a question:

Table 1 shows ten saturation curve data sets, with the note that candidate programs must reach the target answer within +/- 0.001 for all ten sets. Seven of these sets have four data points each; three sets have six data points each. So far so good ... except that J2597 goes on to recommend different algorithms , depending on how many data points are available. As such, I don't see how a single solver is going to accommodate all ten data sets. It's also my understanding that Dr. Kirk provides different solutions for 4-point data sets and those with more than four points (although I haven't been able to get my hands on those yet).

Am I missing something here?

Table 1 shows ten saturation curve data sets, with the note that candidate programs must reach the target answer within +/- 0.001 for all ten sets. Seven of these sets have four data points each; three sets have six data points each. So far so good ... except that J2597 goes on to recommend different algorithms , depending on how many data points are available. As such, I don't see how a single solver is going to accommodate all ten data sets. It's also my understanding that Dr. Kirk provides different solutions for 4-point data sets and those with more than four points (although I haven't been able to get my hands on those yet).

Am I missing something here?