Two-level time-domain decomposition based distributed method for numerical solutions of pharmacokinetic models

The dispersion routes of cyclodextrin complexes with nicardipine (NC), such as hydrophilic hydroxypropyl-β-cyclodextrin (NC/HPβCD) and hydrophobic triacetyl-β-cyclodextrin (NC/TAβCD), through the body for controlled drug delivery and sustained release have been examined. The two-compartment pharmacokinetic model described the mechanisms of how the human body handles with ingestion of NC-cyclodextrin complexes in gastrointestinal tract (GI), distribution in plasma, and their metabolism in the liver. The model showed that drug bioavailability was significantly improved after oral administration of cyclodextrin complexes. The mathematical significance of this study to predict nicardipine delivery using pharmacokinetic two-compartment mathematical model with linear ordinary differential equations (ODE) approach represents a valuable tool to emphasize its effectiveness and metabolizing rate and diminish the side effects.

show abstract

“…This method was already proven for a variety of pharmacokinetic simulations as a very robust technique [18–20]. …”

Section: Methodsmentioning

confidence: 99%

Pharmacokinetic Delivery and Metabolizing Rate of Nicardipine Incorporated in Hydrophilic and Hydrophobic Cyclodextrins Using Two‐Compartment Mathematical Model

Shityakov

Förster

2013

The Scientific World Journal

View full text Add to dashboard Cite

show abstract

“…Decomposition method is the main strategy for divide and conquer methods, 10,11 which are used in the transformation between complex task and simple task. In view of the limitation of traditional distance formula (1) and the advantage of decomposition method, we form the granular classification algorithms by the novel distance between two hyperbox granules and the meet operation between two hyperbox granules, which utilize the decomposition methods to divide the data set into some subsets, these subsets are regarded as granules.…”

Section: Motivation and Related Workmentioning

confidence: 99%

Isolation-based hyperbox granular classification computing

Liu

Zhang

et al. 2016

Journal of Algorithms & Computational Technology

View full text Add to dashboard Cite

Bottom-up and top-down are two main computing models in granular computing by which the granule set including granules with different granularities. The top-down hyperbox granular computing classification algorithm based on isolation, or IHBGrC for short, is proposed in the framework of top-down computing model. Algorithm IHBGrC defines a novel function to measure the distance between two hyperbox hgranules, which is used to judge the inclusion relation between two hyperbox granules, the meet operation is used to isolate the ith class data from the other class data, and the hyperbox granule is partitioned into some hyperbox granules which include the ith class data. We compare the performance of IHBGrC with support vector machines and HBGrC, for a number of two-class problems and multiclass problems. Our computational experiments showed that IHBGrC can both speed up training and achieve comparable generalization performance.

show abstract

“…There are several transform methods that have been investigated such as the Laplace transform, similarity transform, Henkel transform and the Boltzmann transform [1][2][3][4][5]. The Laplace transform solution methods for time dependent problems, which transform parabolic problems into elliptic problems in the Laplace transformed space, have been considered by many authors [7][8]. A two-level time-domain decomposition method was applied to obtain numerical solutions to time-dependent nonlinear problems for European options [7].…”

Section: Introductionmentioning

confidence: 99%

“…A two-level time-domain decomposition method was applied to obtain numerical solutions to time-dependent nonlinear problems for European options [7]. The pharmacokinetic system contains linear and non-liner models which were solved by using time-domain decomposition method using Laplace transform [8].…”

Section: Introductionmentioning

confidence: 99%

A Laplace Transform Method for the Image In-Painting

Kokulan

Chen

2015

Journal of Algorithms & Computational Technology

View full text Add to dashboard Cite

There are many image processing techniques based on partial differential equations that perform well, but they consume much computational time. It's vital that rapid and efficient ways of solving these equations are developed. Use of the Laplace transforms permits solution to the time dependent problems in a parallel environment. The solution procedure requires numerical computation of an inverse Laplace transform of which the Stehfest method was examined in the tests. We investigated the performance and efficiency of using the Laplace transform technique for the solution of a mathematical model related to image in-painting and compared the results with temporal integration.

show abstract

Two-level time-domain decomposition based distributed method for numerical solutions of pharmacokinetic models

Cited by 5 publications

References 14 publications

Pharmacokinetic Delivery and Metabolizing Rate of Nicardipine Incorporated in Hydrophilic and Hydrophobic Cyclodextrins Using Two‐Compartment Mathematical Model

Pharmacokinetic Delivery and Metabolizing Rate of Nicardipine Incorporated in Hydrophilic and Hydrophobic Cyclodextrins Using Two‐Compartment Mathematical Model

Isolation-based hyperbox granular classification computing

A Laplace Transform Method for the Image In-Painting

Contact Info

Product

Resources

About