2003
DOI: 10.1016/s0003-2670(03)01263-7
|View full text |Cite
|
Sign up to set email alerts
|

Automated off-line optimisation of programmed elutions in reversed-phase high-performance liquid chromatography using ternary solvent mixtures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2011
2011
2011
2011

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…In the case of binary elutions, linear or quadratic mathematical models allow in most cases an accurate enough representation of the retention for peaks. For ternary solvent systems, it is possible to model the whole search space using the Shepard algorithm (24) on transformed retention data (1/square root of retention data), although the number of priming experiments (between 12 and 18) is too high in most practical circumstances (1). Other approaches select an isoeluotropic plane, allowing all the peaks eluting in a reasonable time (e.g., retention factors -k-bellow 10).…”
Section: General Statement Of the Problem And Retention Modelsmentioning
confidence: 99%
See 1 more Smart Citation
“…In the case of binary elutions, linear or quadratic mathematical models allow in most cases an accurate enough representation of the retention for peaks. For ternary solvent systems, it is possible to model the whole search space using the Shepard algorithm (24) on transformed retention data (1/square root of retention data), although the number of priming experiments (between 12 and 18) is too high in most practical circumstances (1). Other approaches select an isoeluotropic plane, allowing all the peaks eluting in a reasonable time (e.g., retention factors -k-bellow 10).…”
Section: General Statement Of the Problem And Retention Modelsmentioning
confidence: 99%
“…A few years ago Martinez-Pontevedra et al (1) developed a general approach for ternary gradient separations. In this approach, the search space is not restricted, so the entire solvent triangle is optimized (or at least the maximum area feasible in experimental terms) by a computerized approach based on a powerful evolutionary algorithm (2) working on an islands model (3,4).…”
Section: Introductionmentioning
confidence: 99%