Yasunori Aoki
Uppsala University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Yasunori Aoki.
SIAM Journal on Scientific Computing | 2014
Yasunori Aoki; Ken Hayami; Hans De Sterck; Akihiko Konagaya
A new algorithm is proposed for simultaneously finding multiple solutions of an underdetermined inverse problem. The algorithm was developed for an ODE parameter identification problem in pharmacokinetics for which multiple solutions are of interest. The algorithm proceeds by computing a cluster of solutions simultaneously, and is more efficient than algorithms that compute multiple solutions one-by-one because it fits the Jacobian in a collective way using a least squares approach. It is demonstrated numerically that the algorithm finds accurate solutions that are suitably distributed, guided by a priori information on which part of the solution set is of interest, and that it does so much more efficiently than a baseline Levenberg--Marquardt method that computes solutions one-by-one. It is also demonstrated that the algorithm benefits from improved robustness due to an inherent smoothing provided by the least-squares fitting.
Aaps Journal | 2016
Yasunori Aoki; Rikard Nordgren; Andrew C. Hooker
As the importance of pharmacometric analysis increases, more and more complex mathematical models are introduced and computational error resulting from computational instability starts to become a bottleneck in the analysis. We propose a preconditioning method for non-linear mixed effects models used in pharmacometric analyses to stabilise the computation of the variance-covariance matrix. Roughly speaking, the method reparameterises the model with a linear combination of the original model parameters so that the Hessian matrix of the likelihood of the reparameterised model becomes close to an identity matrix. This approach will reduce the influence of computational error, for example rounding error, to the final computational result. We present numerical experiments demonstrating that the stabilisation of the computation using the proposed method can recover failed variance-covariance matrix computations, and reveal non-identifiability of the model parameters.
Journal of Computational and Applied Mathematics | 2011
Yasunori Aoki; Hans De Sterck
Abstract The accuracy of a finite element numerical approximation of the solution of a partial differential equation can be spoiled significantly by singularities. This phenomenon is especially critical for high order methods. In this paper, we show that, if the PDE is linear and the singular basis functions are homogeneous solutions of the PDE, the augmentation of the trial function space for the Finite Volume Element Method (FVEM) can be done significantly simpler than for the Finite Element Method. When the trial function space is augmented for the FVEM, all the entries in the matrix originating from the singular basis functions in the discrete form of the PDE are zero, and the singular basis functions only appear in the boundary conditions. That is to say, there is no need to integrate the singular basis functions over the elements and the sparsity of the matrix is preserved without special care. FVEM numerical convergence studies on two-dimensional triangular grids are presented using basis functions of arbitrary high order, confirming the same order of convergence for singular solutions as for smooth solutions.
Computer Methods and Programs in Biomedicine | 2016
Yasunori Aoki; Monika Sundqvist; Andrew C. Hooker; Peter Gennemark
BACKGROUND AND OBJECTIVE Optimal experimental design approaches are seldom used in preclinical drug discovery. The objective is to develop an optimal design software tool specifically designed for preclinical applications in order to increase the efficiency of drug discovery in vivo studies. METHODS Several realistic experimental design case studies were collected and many preclinical experimental teams were consulted to determine the design goal of the software tool. The tool obtains an optimized experimental design by solving a constrained optimization problem, where each experimental design is evaluated using some function of the Fisher Information Matrix. The software was implemented in C++ using the Qt framework to assure a responsive user-software interaction through a rich graphical user interface, and at the same time, achieving the desired computational speed. In addition, a discrete global optimization algorithm was developed and implemented. RESULTS The software design goals were simplicity, speed and intuition. Based on these design goals, we have developed the publicly available software PopED lite (http://www.bluetree.me/PopED_lite). Optimization computation was on average, over 14 test problems, 30 times faster in PopED lite compared to an already existing optimal design software tool. PopED lite is now used in real drug discovery projects and a few of these case studies are presented in this paper. CONCLUSIONS PopED lite is designed to be simple, fast and intuitive. Simple, to give many users access to basic optimal design calculations. Fast, to fit a short design-execution cycle and allow interactive experimental design (test one design, discuss proposed design, test another design, etc). Intuitive, so that the input to and output from the software tool can easily be understood by users without knowledge of the theory of optimal design. In this way, PopED lite is highly useful in practice and complements existing tools.
Journal of Computational and Applied Mathematics | 2015
Philippe Gaudreau; Ken Hayami; Yasunori Aoki; Hassan Safouhi; Akihiko Konagaya
The Cluster Newton method (CN method) has proved to be very efficient at finding multiple solutions to underdetermined inverse problems. In the case of pharmacokinetics, underdetermined inverse problems are often given extra constraints to restrain the variety of solutions. In this paper, we propose a new algorithm based on the two parameters of the Beta distribution for finding a family of solutions which best fit the extra constraints. This allows for a much greater control on the variety of solutions that can be obtained with the CN method. In addition, this algorithm facilitates the task of obtaining pharmacologically feasible parameters. Moreover, we also make some improvements to the original CN method including an adaptive margin of error for the perturbation of the target values and the use of an analytical Jacobian in the resolution of the forward problem.
Journal of Pharmacokinetics and Pharmacodynamics | 2017
Yasunori Aoki; Daniel Röshammar; Bengt Hamrén; Andrew C. Hooker
Population model-based (pharmacometric) approaches are widely used for the analyses of phase IIb clinical trial data to increase the accuracy of the dose selection for phase III clinical trials. On the other hand, if the analysis is based on one selected model, model selection bias can potentially spoil the accuracy of the dose selection process. In this paper, four methods that assume a number of pre-defined model structure candidates, for example a set of dose–response shape functions, and then combine or select those candidate models are introduced. The key hypothesis is that by combining both model structure uncertainty and model parameter uncertainty using these methodologies, we can make a more robust model based dose selection decision at the end of a phase IIb clinical trial. These methods are investigated using realistic simulation studies based on the study protocol of an actual phase IIb trial for an oral asthma drug candidate (AZD1981). Based on the simulation study, it is demonstrated that a bootstrap model selection method properly avoids model selection bias and in most cases increases the accuracy of the end of phase IIb decision. Thus, we recommend using this bootstrap model selection method when conducting population model-based decision-making at the end of phase IIb clinical trials.
NII Technical Reports | 2011
Yasunori Aoki; Ken Hayami; Hans De Sterck; Akihiko Konagaya
Pacific Journal of Mathematics | 2012
Yasunori Aoki; David Siegel
Pacific Journal of Mathematics | 2014
Yasunori Aoki; Hans De Sterck
arXiv: Numerical Analysis | 2018
Yasunori Aoki; Ken Hayami; Kota Toshimoto; Yuichi Sugiyama