Abstract
How to determine adsorption isotherms is an issue of significant importance in chromatography. A modern technique of obtaining adsorption isotherms is to solve an inverse problem so that the simulated batch separation coincides with actual experimental results. In this work, as well as the natural least-square approach, we consider a Kohn–Vogelius type formulation for the reconstruction of adsorption isotherms in chromatography, which converts the original boundary fitting problem into a domain fitting problem. Moreover, using the first momentum regularizing strategy, a new regularization algorithm for both the Equilibrium-Dispersive model and the Transport-Dispersive model is developed. The mass transfer resistance coefficients in the Transport-Dispersive model are also estimated by the proposed inverse method. The computation of the gradients of objective functions for both of the two models is derived by the adjoint method. Finally, numerical simulations for both a synthetic problem and a real-world problem are given to show the robustness of the proposed algorithm.
1. Introduction
Preparative chromatography is a powerful separation method to get pure compounds from more or less complex gas/liquid mixtures. Computer simulations can be used to optimize preparative chromatography, while the competitive adsorption isotherms are usually required. Roughly speaking, adsorption isotherms describe the dependence of the amount of adsorbed substance on the partial pressure of the solution concentration at a constant temperature. They are used to calculate the specific surface area of materials, mean size of deposited particles, as well as pore size or particle size distribution.
Experimental adsorption isotherms are the most common way to describe the adsorption phenomena.[Citation1,Citation2] Methods for getting the adsorption data for the adsorption isotherms are based on measuring the amount of gas/liquid removed from the gas/liquid phase during adsorption, and on various ways of determining the amount of adsorbed substance/adsorbate on the surface of the adsorbing substance/adsorbent: for instance, the volumetric method, the gravimetric method, etc.
Adsorption isotherms are often classified according to their shape.[Citation3] There are six main types of adsorption isotherms. The most common ones are Type-I (Langmuir or similar) that are microporous solids with a relatively small proportion of the outer surface. Type-II refers to polymolecular adsorption in non-porous or macroporous adsorbents. Type-III is characteristic of non-porous sorbents with low energy adsorbent-adsorbate interaction. Types-IV and V are similar to types-II and III, but refer to porous adsorbents, while Type-VI isotherm is characteristic of non-porous adsorbents with a homogeneous surface.
However, the above classification only provides a qualitative representation of the adsorption isotherm. There are several methods of mathematically representing adsorption isotherms , with different models used to describe the adsorption process.[Citation4,Citation5] At low surface coverage by the adsorbate, the adsorption isotherm equation for a uniform surface is given by Henry’s equation: , where a is a constant and C denotes the concentration. At medium coverage, Freundlich’s empirical equation can be applied: , where a and n are constants. A rigorous adsorption isotherm theory was proposed by Langmuir for the model of monolayer adsorption on a uniform surface, in which the attraction between adsorbate molecules and their mobility along the surface can be ignored. Langmuir’s isotherm equation has the form: , where a and b are constants.
In the multicomponent preparative case, we will have a non-linear adsorption isotherm, for each component, that is a function of all component concentrations because of competition for access to the adsorption sites. The simplest competitive non-linear adsorption isotherm is the competitive Langmuir one, where for component i in a n-component system we have that,(1) (1)
Here denotes as a collection of all parameters, and is the concentration of ith component.
Recently, so-called model free methods have been developed for the estimation of complicated adsorption isotherms in liquid chromatography. These types of methods estimate the adsorption isotherm [Citation6] or its derivative [Citation7] using monotone piecewise interpolation. In these methods, one divides the range of C into a finite number of segments and interpolates between the segments boundary points using basis function such that continuity, up to a certain order, is preserved across the boundaries, where denotes as a collection of all parameters. To be more precise, consider the case with a single component. Denote by a collection of m values of concentration C. Set , where are basis functions and is a vector of coefficients.
Inverse methods are a more practical alternative that have been developed in recent years.[Citation8,Citation9] These methods only require a few injections of different sample concentrations, so solute consumption and time requirements are very modest. The adsorption isotherm parameters cannot be obtained directly from the experimental elution data, in contrast to the traditional methods such as the frontal analysis method, which is usually carried out in a series of programmed concentration steps, each step resulting in a so-called breakthrough front giving one point on the adsorption isotherm curve.[Citation10] Instead, the parameters are estimated numerically by solving an inverse problem in partial differential equations (PDEs). In this study, as well as the natural least-square approach, we propose a Kohn–Vogelius type formulation for reconstructing adsorption isotherms in chromatography. By the Kohn–Vogelius formulation, data to be fitted is transferred from boundary into the whole domain.[Citation11] Therefore, this method is more efficient than the least-squares approach for the numerical reconstruction.[Citation12] Furthermore, applying the first momentum regularization, we have developed a new regularizing algorithm to reconstruct the adsorption isotherm.
The remainder of the paper is structured as follows. Section 2 states the model we are dealing with, and introduces the original least-square problem and the corresponding Kohn–Vogelius type formulation of the problem. Applying the gradient descent method, in Section 3, we obtain a novel algorithm of reconstructing adsorption isotherms in chromatography. Methods of computing exact gradients of objective functions for both the Equilibrium-Dispersive model and the Transport-Dispersive model are also developed in the same section. Moreover, a method of estimating the mass transfer resistance in the Transport-Dispersive model is proposed in Section 3. In Section 4, some implementation issues with the proposed numerical algorithms are discussed. Various numerical examples with both the synthetic data and real data are presented in Section 5 to demonstrate the robustness of the proposed method. Finally, concluding remarks are given in Section 6.
2. Mathematical models
2.1. Models
There are various mathematical models for chromatographic processes.[Citation5,Citation13–Citation15] The most commonly used model to describe the travel of multicomponents is the following time-dependent convection–diffusion system with the Danckwert’s boundary condition(2) (2)
where C and q are concentrations in mobile and stationary phase, respectively; u is mobile phase velocity and F is stationary/mobile phase ratio, and is the diffusion parameter. Note that all of u, F and are given constants in this work. L is the length of chromatographic column, and T is an appropriate time point slightly larger than the dead time of chromatographic time . In this work, we set . x is distance and t is time. Further, g is the initial condition and h is the boundary condition, which describes the injection profile of the problem. For the problem with n components, C, q, g and h are vector functions of size .
Define ( or ) as the space of square Lebesgue integrable functions, equipped with the standard norm, i.e. .[Citation16] Denote and , where . Suppose that , and C, (a Sobolev space with norm [Citation17,Citation18]).
If there is no diffusion, i.e. , we have the hyperbolic model, which is mostly of theoretical interest.[Citation8] In this study, we focus on the case when .
If we have the Equilibrium-Dispersive model. In this model, the mass transfer resistance for adsorption/desorption is assumed to be small, though not negligible (fast kinetics).
If(3) (3) we obtain the Transport-Dispersive model, which is commonly used when the mass transfer resistance for adsorption/desorption cannot be assumed to be small (slow kinetics). Here, vector represents the mass transfer resistance for species. The superscript T represents the transpose of a matrix.
Remark 2.1:
reads as . Nevertheless, for simplicity, we will ignore the operator ‘’ after from now on.
Before discussing the inverse problem based on Equation (Equation2(2) (2) ), let us make the following assumption on the forward problem.
(A) | The non-linear PDE (Equation2(2) (2) ) for both the Equilibrium-Dispersive model and the Transport-Dispersive model has an unique stable solution in . |
2.2. The identification problem
The purpose of this work is to find parameter such that the solution of (Equation2(2) (2) ) satisfies
where denotes the observation data measured at the outlet. The output least-squares approach for this identifying process is used most commonly as the optimization problem in :(4) (4)
where solves PDE (Equation2(2) (2) ). It is not difficult to show that the functional does not take into account the position of the profiles, which implies the ill posedness of the formulation of problem. Indeed, remains constant if one moves along the t-axis when .[Citation8] It is well known that to obtain a stable approximate solution for an ill-posed problem, regularization procedure should be employed. Within the framework of the Tikhonov regularization algorithm, the problem (Equation4(4) (4) ) is substituted by(5) (5)
where is the regularization parameter and the second term in the cost represents a regularization term, which guarantees the continuity of the mappings from the observation to a solution for appropriate choice of and . In this work, we apply the first momentum regularizing strategy, introduced in [Citation8]. Define the first moment of a function C(t) by(6) (6)
Then, if C happens to be a concentration profile, the two moments and are related to the retention times of the two components.[Citation4] Hence, the regularization term for our problem is defined as(7) (7)
where is the standard norm in .
In [Citation19,Citation20], a Kohn–Vogelius type functional is used for the data fitting in solving the inverse source problem. For our problem, the Kohn–Vogelius type formulation becomes(8) (8)
where is a convex closed set in , which contains the a priori information of the parameter (m is the dimensionality of the parameter space) and is the solution of (Equation1(1) (1) )–(Equation2(2) (2) ) (or (Equation1(1) (1) )–(Equation3(3) (3) ) for the Transport-Dispersive model) with replaced by and is the solution to(9) (9)
with additional information (Equation1(1) (1) ) ((Equation1(1) (1) ) and (Equation3(3) (3) ) for the Transport-Dispersive model).
Remark 2.2:
For simplicity, the smooth function is constructed by the linear interpolation of discrete observation data . This is necessary since, in general, the time grids of numerical solution of PDE (Equation2(2) (2) ) do not fit the time grids of the observation data. Obviously, one can apply spline technique to obtain a better smooth function .
Remark 2.3:
The objective function has been used widely [Citation9,Citation21] for identification problems in chromatography. To the best of our knowledge, the Kohn–Vogelius type formulation of the problem has not been tried for the inverse chromatography problem. In general, compared to least-squares boundary fitting function, the Kohn–Vogelius type function is expected to lead to more robust optimization procedures.[Citation12]
3. The solution method
3.1. The algorithm
To solve the inverse problem requires advanced optimization algorithms. It should be noted that in most cases a global optimization algorithm is needed, otherwise the algorithm might get stuck in local minima. However, local optimization algorithms can be used to refine the solution found by the global optimization algorithm. One branch of local optimization algorithms that have been tried previously is non-gradient algorithms,[Citation22] but the drawback is slow convergence. Another approach is to use a gradient-based algorithm such as the steepest descent method and the conjugate gradient method. In this work, we use a gradient descent method combined with a Barzilai–Borwein step [Citation23]: see Algorithm 1 for details.
3.2. Methods of calculating the Jacobian of objective functions
The estimation of the Jacobian by numeric or complex step differentiation is not accurate and the gradient-based algorithm converges slowly or not at all. For the hyperbolic model, i.e. , in [Citation24], the authors converted adsorption isotherms into a part of the flux of the system by variable change and obtained the exact computation of the Jacobian of objective function . However, the variable change is complicated and the neglected diffusion will cause a significant error. Hence, in this work, without variable change and neglecting diffusion, we try to derive the exact Jacobian of the objective functions mentioned in Section 2.
3.2.1. Equilibrium-dispersive model
We first study the Jacobian of the objective function in the Equilibrium-Dispersive model.
Proposition 3.1:
The Jacobian of the objective function for the Equilibrium-Dispersive model is
where C is the solution of (Equation2(2) (2) ) and p is the solution to the following adjoint problem(10) (10)
where .
Proof:
Let us consider the weak form of (Equation2(2) (2) )(11) (11)
where the test function space is a subspace of , whose elements (functions) have a compact support.[Citation16] .
Using integration by parts, the last term of (Equation11(11) (11) ) can be expressed as
Assume that the derivative of C with respect to in the direction is M, i.e. . Then from (Equation11(11) (11) ), we obtain that M will satisfy
i.e.(12) (12)
Note that the derivative of with respect to in the direction is
If we replace by p in Equation (Equation12(12) (12) ) (it is allowed since ), i.e. when is a solution to Equation (Equation10(10) (10) ), by relation (Equation12(12) (12) ) and boundary condition we deduce
which implies
This yields the required result.
At the end of the proof, let us discuss the computation of . Actually, using the inner products and in and , respectively, we have
By definition of the first moment functional in (Equation6(6) (6) ), the derivative of with respect to C in the direction can be calculated as
This implies that .
Remark 3.2:
The existence of the derivative of C with respect to can be derived from assumption (A) immediately. Furthermore, the existence of can be obtained if the adjoint Equation (Equation10(10) (10) ) has a solution.
Similarly, it is not difficult to obtain the Jacobian of the Kohn–Vogelius type objective function for the Equilibrium-Dispersive model, i.e. the following proposition holds.
Proposition 3.3:
The Jacobian of for the Equilibrium-Dispersive model is
where is the solution to Equation (Equation2(2) (2) ) with C replaced with , is the solution to (Equation9(9) (9) ), and satisfies
while satisfies
where
3.2.2. Transport-Dispersive model
Now, consider the Transport-Dispersive model. Using the technique shown in Section 3.2.1, it is possible to obtain Jacobians of objective functions for the Transport-Dispersive model. For simplicity, we only discuss the Jacobian of the Kohn–Vogelius function.
Proposition 3.4:
The Jacobian of for the Transport-Dispersive model is
where is the solution of (Equation2(2) (2) ), (Equation3(3) (3) ) with C replaced with , is the solution of (Equation9(9) (9) ) and Equation (Equation3(3) (3) ) with C replaced with , satisfies(13) (13)
and satisfies(14) (14)
where satisfies
and satisfies
However, if the unknown parameter contains too many elements, i.e. , it is difficult to calculate and for the Transport-Dispersive model, which implies a large computation cost. Therefore, we will use the following strategy to find the Jacobian.
Proposition 3.5:
The Jacobian of objective function for the Transport-Dispersive model is
where , are the solution of adjoint equations(15) (15)
and(16) (16)
respectively. Here and are defined in Proposition 3.4.
Proof:
By Proposition 3.4, we obtain(17) (17)
where , satisfy(18) (18)
and(19) (19)
respectively. Rewrite (Equation18(18) (18) ) and (Equation19(19) (19) ) into
and substitute the test function by and , respectively. Since is the solution to (Equation15(15) (15) ) ( is the solution to (Equation16(16) (16) )), we deduce that(20) (20)
and(21) (21)
Combine (Equation17(17) (17) ), (Equation20(20) (20) ) and (Equation21(21) (21) ), we obtain which yields the desired result.
For the Transport-Dispersive model, the mass transfer resistance coefficients should be estimated. In chemistry, different techniques can be used to experimentally determine mass transfer coefficients, such as frontal analysis, pulse on a plateau method, nuclear magnetic resonance, uptake curve measurement and the Wicke–Kallenbach method – see review articles [Citation25,Citation26] for details. In this work, instead of the experimental approaches, we will estimate the mass transfer coefficient by the inverse method. To be more precise, denote . Suppose that , where is a convex closed set in . Obviously, is also a convex closed set in . Then, the reconstructing process for parameter can be described in the following algorithm
Note that in step 3 of Algorithm 2 means the derivative of function with respect to vector with the fixed mass transfer resistance . The derivative of functional with respect to vector with the fixed can be calculated analogously. Here, we only show the result for the Kohn–Vogelius type objective functional.
Proposition 3.6:
The Jacobian of objective function with respect to with the fixed adsorption isotherm parameter is
where , are the solution of adjoint equations(22) (22)
and(23) (23)
respectively. Here , , and are defined in Proposition 3.4.
Proof:
By Proposition 3.4, we have(24) (24)
Here and satisfy(25) (25)
and(26) (26)
respectively. Rewrite (Equation25(25) (25) ) and (Equation26(26) (26) ) into
and let and , where and are solutions to (Equation22(22) (22) ) and (Equation23(23) (23) ), respectively, we deduce that(27) (27)
and(28) (28)
Combine (Equation24(24) (24) ), (Equation27(27) (27) ) and (Equation28(28) (28) ), we obtain
which is the required result in the proposition.
4. Implementation issues
In this section, we briefly discuss some numerical issues that arise in the implementation of the developed approaches – see Algorithms Equation1(1) (1) and Equation2(2) (2) .
4.1. Regularization parameter selection methods
There exist various regularization parameter selection methods such as a priori methods [Citation27] or a posteriori methods.[Citation28] However, all of them need the error information since a regularizing algorithm without using error level exists only for the well-posed problems. Therefore, there is no systematic rule for since the error level is not available for the real problem. Note that introducing a small amount of the momentum criterion improves the convergence towards the minimum, because there is a better control on the position of the peaks. On the other hand, if is too large, the position of the shocks becomes predominant, and the shape of the peaks cannot be improved. By performing a number of computer simulations, we recommend the following two regularization parameter selection strategies:
(S1) | Chose such that(29) (29) | ||||
(S2) | At the step k of iteration, chose such that(30) (30) |
Remark 4.1:
By demonstrating several artificial noised data, we found that the results of strategy (S2) are similar as the results of strategy (S1). Hence, in the simulation, we only display the results from strategy (S1).
4.2. Solution of the forward problem
The chromatography model (Equation2(2) (2) ) is a non-linear convection–diffusion PDE with dominated convection terms. A complication is that discontinuities in the solutions can develop even for smooth initial data, which is known as self-sharpening, and can easily cause numerical instability. We use a high resolution koren flux-limiting finite volume scheme,[Citation15] which can suppress numerical oscillation and capture sharp discontinuity of chromatographic fronts on coarse grids.
For the numerical simulation of the Equilibrium-Dispersive model, we will have one first-order ODE for each discretization point in space for each component, i.e. if the number of discretization points (cells) is and the number of components is , we will have a system with ODE’s of the form, . In the simulation, we use the Runge–Kutta method and to evaluate one needs to solve a full linear system where the coefficient matrix is the Jacobian with size . I.e. we must solve number of full linear system systems in each time step. This can be done by assembling all number of full linear system in a block-diagonal matrix.
Similarly, for the Transport-Dispersive model we have to solve a system with ODEs of the form, , , which is a sparse linear system (but not a block-diagonal matrix). MATLAB uses an Unsymmetric MultiFrontal method [Citation29] to LU-factorize the sparse linear system that arises in the Transport-Dispersive model [Citation5] of chromatography. In this work, we apply column approximate minimum degree permutation technique [Citation30] to permute the columns of the coefficient matrix. The LU-factorization of the column permuted coefficient matrix is almost 4.5 times faster than LU-factorization of the original coefficient matrix. It should be noted that the column/row permutation needs to be calculated only once in the Finite-Volume code and can then be applied to all sparse coefficient matrices that arise. For a test case, the portion of the time spent in the code doing LU-factorization was reduced from to with column permutation, and the total runtime was reduced by .
4.3. Solution of the adjoint problem
Consider the adjoint problem (Equation10(10) (10) ) with boundary fitting method (Equation5(5) (5) ). In order to distinguish the original problem (Equation2(2) (2) ) and its adjoint problem (Equation10(10) (10) ) more clearly, we perform a change of variables , and , where . Then, satisfies(31) (31)
As one can see in (Equation31(31) (31) ), the main difference between Equations (Equation2(2) (2) ) and (Equation31(31) (31) ) is the change of sign in the flux term. Hence, we have to use a different upwind scheme to solve them. A simple method is the forward difference method when approximating , which just provides first order accurate. In order to improve the accurate, we apply similar koren flux-limiting finite-volume scheme as in [Citation31].
4.4. Constrains and starting guess
Now, we consider some constraints and initial starting point (vector) on the adsorption isotherm parameters to improve the speed and quality of the proposed optimization algorithm.
4.4.1. The competitive Langmuir adsorption isotherm
Bound constraints will be used in all tests, i.e. . Furthermore, in analytical chromatography, the adsorption isotherm is assumed as a linear function, i.e. . Therefore, a reasonable initial guess is . Further from [Citation9], can be approximated by(32) (32)
where is elution time of the ith component.
4.4.2. Approximate adsorption isotherm using piecewise polynomial
For simplicity, for this model, we only consider the case with a single component. For the adsorption isotherm, we have the following monotone constraints
where is the value of C at a point.
A simple initial guess is , where can be calculated by (Equation32(32) (32) ). For different types of adsorption isotherms, we can specify different bound constraints to reduce the computational time.[Citation6] For example, if the adsorption isotherm is concave downward, the bound for each recovered parameters can be expressed as
where and is the upper bound of .
4.5. The choice of interpolation points and interpolation functions
For a large number of interpolation points, the optimization will take a long time. According to the properties of the adsorption isotherm, we could use an uneven distribution of the interpolation points; that is, more interpolation points should be placed at the important part of adsorption isotherm.
It is important to choose suitable interpolation functions to approximate the adsorption isotherm. In [Citation6], the authors applied linear interpolation, which needs numerous interpolation points to approximate non-linear adsorption isotherm. In this work, we apply Stineman interpolation combined with linear basis functions, developed in [Citation7], which greatly reduces the interpolation points, and has continuous derivatives, whereas linear interpolation has discontinuous ones.
5. Simulations
In this section, we do some numerical experiments to validate the accuracy and effectiveness of the proposed approach. Note that, before performing our algorithm (Algorithms Equation1(1) (1) and Equation2(2) (2) ) one can apply any global optimization algorithm based on gradient or combine global optimization of free gradient and a local optimization algorithm based on gradient. In the following simulations, assume that we have already got a ‘good’ initial guess by a global optimization algorithm such as genetic algorithm,[Citation32] and we improve this initial guess by the constrained non-linear local optimization algorithm fmincon, which is implemented in the MATLAB Optimization Toolbox, Version 7.9.0. Note that in the initial guess for fmincon, it is not necessary to be very close to the exact parameter.
5.1. Computer simulation
Our first group of examples deals with synthetic data in order to demonstrate the robustness of the developed approach. The simulations consist of three steps. First, a simulated concentration in mobile phase at the outlet is generated by computer according to PDE (Equation2(2) (2) ) for a given parameter . The collected exact data at time grid at the outlet are denoted by . Denote as the data matrix. We then define the artificial measured data by adding independent and identically distributed (i.i.d.) Gaussian random variables , i.e. , where is the error level. At the last step of the simulation, the observation data are processed through our algorithm, and the retrieved parameter is compared with the input one.
The parameters of the concentration elution profiles for simulation are: , , , number of theoretical plates is , , , , where denotes the Heaviside step function.
5.1.1. Estimating the adsorption isotherm using piecewise interpolation for the case with a single component.
In this example, a simulated concentration in mobile phase at the outlet is generated by computer according to PDE (Equation2(2) (2) ) for a given model . Similarly, denote vector as the exact data and then generate a noised data by adding i.i.d. Gaussian random variables. The reconstructed adsorption isotherms by noisy data with different error levels and their corresponding relative errors are displayed in Figure . Note that only the Equilibrium-Dispersive model is used in this simulation.
5.1.2. The competitive Langmuir adsorption isotherm for the binary case,
In the second group of simulations, the Langmuir adsorption isotherm model with parameters is used. Boundary constraints are , . In our simulations, the least-squares boundary fitting method, i.e. problem , needs stronger boundary constraints: .
The numerical results with different error levels for both the Equilibrium-Dispersive model and the Transport-Dispersive model with the given mass transfer resistance are displayed in Table . The results for the Transport-Dispersive model with unknown mass transfer resistance are given in Table . The constraints for the mass transfer are .
Moreover, in Figures and , we depict the objective function and relative error of the recovered parameters in the Equilibrium-Dispersive model at every iteration for both the boundary fitting method and the Kohn–Vogelius type method, respectively. As seen from the numerical results, although the computation cost of optimization processes Kohn–Vogelius type functional is larger than least-square boundary fitting functional, the relative error of recovered parameters by the Kohn–Vogelius type method is convergence, and smaller than the result from the boundary fitting method. The results with the Transport-Dispersive model are shown in Figures and .
5.2. Real data application
In the above subsection, the algorithm was used on test data to verify that the solution converged correctly. In practice, one never knows which model and model parameters are ‘correct’. The practitioner is satisfied when the observed model agreement is ‘good enough’, and the estimated parameters are consistent in the sense that they can be used to make accurate predictions even when the initial and boundary conditions are varied. To exemplify this, the algorithm was tested on actual experimental data.
Unfortunately, having separate response data for the individual components in a binary competitive experiment is extremely rare. It either requires special detectors or so-called fractioning, i.e. collecting a large number of samples at the outlet of the column and analyzing each one of these samples to get the concentration/response of the individual components at the collection time, an extremely time-consuming procedure. In this real data simulation, we have done the single component measurements for two components, i.e. we have just one component present in the injected sample. From these single components experiments, we can estimate the competitive adsorption isotherm surface. Then we can check how well the simulations using this competitive adsorption isotherm surface match experimental binary elution profiles.
Propranolol and alprenolol, two pharmaceutical substances were found to separate well on a Kromasil C18 column (Eka Chemicals, Bohus, Sweden) at 25 C using a mobile phase composed of 28:72 (v/v) acetonitrile: aqueous phosphate buffer (pH 2.54, ion strength 0.1). Other experimental details can be found in our previous work in [Citation9]. Ten binary (propranolol and alprenolol) elution profiles with and h(t) equal to [0.75, 0]mM, [0, 0.75]mM, [5, 0]mM, [0, 5]mM, [10, 0]mM, [0, 10]mM, [15, 0]mM, [0, 15]mM, [30, 0]mM, [0, 30]mM were recorded, respectively. Other parameters were as follows: cm (inner diameter, 0.46 cm), , cm/s, and injection volume . The elution profiles were recorded using an Agilent 1100 Chemstation LC instrument (Agilent, Palo Alto, CA, USA) with a UV detector. The calibration curves were linear ( up to 0.2 M) for both substances at all mobile-phase compositions. Therefore, in this work, we assume that the response curve is just the concentration at the outlet.
In this real-world problem, only a poor fit could be obtained using the Langmuir adsorption isotherms, relation (Equation1(1) (1) ), with only four parameters, whereas excellent results were obtained using the following bi-Langmuir adsorption isotherms with four more parameters
Moreover, in this real data application, before performing our adjoint method, we apply the genetic algorithm to obtain an appropriate starting point . The termination conditions of our genetic algorithm in this work is the following (a) the number of generations reached equals 200 and (b) the computation time is less than 6 h.
The reconstructed adsorption isotherms by our regularized Kohn–Vogelius approach for both the Equilibrium-Dispersive model and the Transport-Dispersive model are displayed in Figures and , respectively. As we can see, the reconstructed adsorption isotherms for the Equilibrium-Dispersive model and the Transport-Dispersive model with the estimated mass transfer resistance are almost the same . Hence, in the later analysis, we only take the results of the Equilibrium-Dispersive model, for example.
The estimated adsorption isotherm parameters by a fixed model (ED, TD or TDE) with different injection profiles h(t) are similar up to , i.e. , where (or ) is the estimated adsorption isotherm parameter with the injection profile (or ). In practice, as in the Figure , we use the average of estimated adsorption isotherm parameters with different injection profiles as the final estimated parameter.
To verify our result, the comparison between how the experimental elution profile (solid line) and the simulated elution profile (dashed line) correspond to the estimated parameter in the Equilibrium-Dispersive model is displayed in the in Figure (we only display the results with the injection elution profiles and ).
Though we do not know the exact adsorption isotherm model for the real problem, we can verify our result by checking the following physical property of adsorption isotherms(33) (33)
For our result (Figure ) one can check that , and , , which also verified the reliability of reconstructed adsorption isotherms.
Finally, we apply the estimated adsorption isotherms to the ‘real’ binary data with injections , , , , , , and , respectively. The simulated total elution profile with injection and the evolution of objective function , which can be considered as the residual error of the model, are displayed in Figure .
6. Conclusions
The numerical experiments performed above on both synthetic and experimental data indicate that the developed regularized Kohn–Vogelius method is an efficient approach for reconstructing adsorption isotherms in chromatography. The advantages of the proposed methods are several. Firstly, we use the original convection–diffusion equation while traditional methods only deal with the hyperbolic model. The second improvement concern from exist methods in the literature: we introduce two PDEs, so that the original boundary fitting is transferred to domain fitting. From a practical point of view, this is meaningful since the effects of noise in the forward boundary condition and noise in the measurement on solution accuracy are different. The final improvement is how the Jacobian of the regularizing cost function was calculated: using a variational technique, we obtained an exact formula of the Jacobian, achieving a substantial improvement in accuracy and reduction in execution time. Though the above improvements were applied to a specific parameter identification problem, they are sufficiently general to be applicable to many other problems.
Acknowledgements
We express our gratitude to the anonymous reviewers whose valuable comments and suggestions lead to an improvement of the manuscript.
Additional information
Funding
Notes
No potential conflict of interest was reported by the authors.
References
- Seidel-Morgenstern A. Experimental determination of single solute and competitive adsorption isotherms. J. Chromatogr. A. 2004;1037:255–272.
- Lindholm J, Forssen P, Fornstedt T. Validation of the accuracy of the perturbation peak method for determination of single and binary adsorption isothermparameters in LC. Anal. Chem. 2004;76:4856–4865.
- Sing K, Everett D, Haul R, et al. Reporting physisorption data for gas/solid systems with special reference to the determination of surface area and porosity. Pure Appl. Chem. 1985;57:603–619.
- Guiochon G, Shirazi G, Katti M. Fundamentals of preparative and nonlinear chromatography. 2nd ed. Netherlands: Elsevier; 2006.
- Guiochon G, Lin B. Modeling for preparative chromatography. New York (NY): Academic Press; 2003.
- Haghpanah R, Rajendran A, Farooq S, et al. Discrete equilibrium data from dynamic column breakthrough experiments. Ind. Eng. Chem. Res. 2012;51:14834–14844.
- Forssén P, Fornstedt T. A model free method for estimation of complicated adsorption isotherms in liquid chromatography. J. Chromatogr. A. 2015;1409:108–115.
- James F, Sepulveda M. Parameter identification for a model of chromatographic column. Inverse Probl. 1994;10:1299. doi:10.1088/0266-5611/10/6/008.
- Forssén P, Arnell R, Fornstedt T. An improved algorithm for solving inverse problems in liquid chromatography. Comput. Chem. Eng. 2006;30:1381–1391.
- Lisec O, Hugo P, Seidel-Morgenstern A. Frontal analysis method to determine competitive adsorption isotherms. J. Chromatogr. A. 2001;908:19–34.
- Kohn R, Vogelius M. Determining conductivity by boundary measurements. Commun. Pure Appl. Math. 1984;37:289–298.
- Afraites L, Dambrine M, Kateb D. Conformal mappings and shape derivatives for the transmission problem with a single measurement. Numer. Funct. Anal. Optim. 2007;28:519–551.
- Ruthven DM. Principles of adsorption and adsorption processes. New York (NY): Wiley; 1984.
- Horvath C. In high-performance liquid chromatography: advances and perspectives (volume 5). New York (NY): Academic Press; 1988.
- Javeed S, Qamar S, Seidel-Morgenstern A, et al. Efficient and accurate numerical simulation of nonlinear chromatographic processes. Comput. Chem. Eng. 2011;35:2294–2305.
- Rudin W. Functional analysis. 2nd ed. New York (NY): McGraw-Hill Science; 1991.
- Ladyzhenskaya O, Solonnikov V, Uraltseva N. Linear and quasi-linear equations of parabolic type. London: American Mathematical Society; 1991.
- Lieberman G. Second order parabolic differential equations. London: World Scientific Publishing; 2005.
- Song SJ, Huang JG. Solving an inverse problem from bioluminescence tomography by minimizing an energy-like functional. J. Comput. Anal. Appl. 2012;14:544–558.
- Cheng X, Gong R, Han W. A new kohn-vogelius type formulation for inverse source problems. Inverse probl. Imaging. 2015;9:1051–1067.
- Felinger A, Zhou D, Guiochon G. Determination of the single component and competitive adsorption isotherms of the 1-indanol enantiomers by the inverse method. J. Chromatogr. A. 2003;1005:35–49.
- Dose EV, Jacobson S, Guiochon G. Determination of isotherms from chromatographic peak shapes. Anal. Chem. 1991;63:833–839.
- Barzilai J, Borwein J. Two-point step size gradient methods. IMA J. Numer. Anal. 1988;8:141–148.
- James F, Sepulveda M, Charton F, et al. Determination of binary competitive equilibrium isotherms from the individual chromatographic band profiles. Chem. Eng. Sci. 1999;54:1677–1696.
- Gritti F, Guiochon G. Mass transfer kinetics, band broadening and column efficiency. J. Chromatogr. A. 2012;1221:2–40.
- Miyabe K, Guiochon G. Measurement of the parameters of the mass transfer kinetics in high performance liquid chromatography. J. Sep. Sci. 2003;26:155–173.
- Tikhonov A, Goncharsky A, Stepanov V, et al. Numerical methods for the solution of ill-posed problems. Dordrecht: Kluwer; 1995.
- Tikhonov A, Leonov A, Yagola A. Nonlinear ill-posed problems. Vol. i and ii. London: Chapman and Hall; 1998.
- Davis T. Algorithm 832: Umfpack v4.3-an unsymmetric-pattern multifrontal method. ACM Trans. Math. Softw. 2004;30:196–199.
- Davis T, Gilbert J, Larimore SI, et al. A column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 2004;30:353–376.
- Zijlema M, Wesseling P. Higher-order flux-limiting schemes for the finite volume computation of incompressible flow. Int. J. Comput. Fluid Dyn. 1998;9:89–109.
- Goldberg DE. Genetic algorithms in search, optimization, and machine learning. Boston (MA): Addison-Wesley; 1989.