arXiv subjects

Jorge P. Zubelli

Publications and source records attributed to Jorge P. Zubelli.

27 records · Page 2Linked to original sources

arXiv2009

On the Calibration of a Size-Structured Population Model from Experimental Data

The aim of this work is twofold. First, we survey the techniques developed in (Perthame, Zubelli, 2007) and (Doumic, Perthame, Zubelli, 2008) to reconstruct the division (birth) rate from the cell volume distribution data in certain structured population models. Secondly, we implement such techniques on experimental cell volume distributions available in the literature so as to validate the theoretical and numerical results. As a proof of concept, we use the data reported in the classical work of Kubitschek [3] concerning Escherichia coli in vitro experiments measured by means of a Coulter transducer-multichannel analyzer system (Coulter Electronics, Inc., Hialeah, Fla, USA.) Despite the rather old measurement technology, the reconstructed division rates still display potentially useful biological features.

math.NA↗

arXiv2009

Global stability for a class of virus models with CTL immune response and antigenic variation

We study the global stability of a class of models for in-vivo virus dynamics, that take into account the CTL immune response and display antigenic variation. This class includes a number of models that have been extensively used to model HIV dynamics. We show that models in this class are globally asymptotically stable, under mild hypothesis, by using appropriate Lyapunov functions. We also characterise the stable equilibrium points for the entire biologically relevant parameter range. As a byproduct, we are able to determine what is the diversity of the persistent strains.

q-bio.PE↗

arXiv2008

Numerical Solution of an Inverse Problem in Size-Structured Population Dynamics

We consider a size-structured model for cell division and address the question of determining the division (birth) rate from the measured stable size distribution of the population. We propose a new regularization technique based on a filtering approach. We prove convergence of the algorithm and validate the theoretical results by implementing numerical simulations, based on classical techniques. We compare the results for direct and inverse problems, for the filtering method and for the quasi-reversibility method proposed in [Perthame-Zubelli].

math.NA↗

arXiv2008

Bi-Hamiltonian Aspects of a Matrix Harry Dym Hierarchy

We study the Harry Dym hierarchy of nonlinear evolution equations from the bi-Hamiltonian view point. This is done by using the concept of an S-hierarchy. It allows us to define a matrix Harry Dym hierarchy of commuting Hamiltonian flows in two fields that projects onto the scalar Harry Dym hierarchy. We also show that the conserved densities of the matrix Harry Dym equation can be found by means of a Riccati-type equation.

nlin.SI↗

arXiv2006

On the Inverse Problem for a Size-Structured Population Model

We consider a size-structured model for cell division and address the question of determining the division (birth) rate from the measured stable size distribution of the population. We formulate such question as an inverse problem for an integro-differential equation posed on the half line. We develop firstly a regular dependency theory for the solution in terms of the coefficients and, secondly, a novel regularization technique for tackling this inverse problem which takes into account the specific nature of the equation. Our results rely also on generalized relative entropy estimates and related Poincaré inequalities.

math.AP↗

arXiv2001

On the Bi-Hamiltonian Theory for the Harry Dym Equation

We describe how the Harry Dym equation fits into the the bi-Hamiltonian formalism for the Korteweg-de Vries equation and other soliton equations. This is achieved by means of a certain Poisson pencil constructed from two compatible Poisson structures. We obtain an analogue of the Kadomtsev-Petviashivili hierarchy whose reduction leads to the Harry Dym hierarchy. We call such system the HD-KP hierarchy. Then, we construct an infinite system of ordinary differential equations (in infinitely many variables) that is equivalent to the HD-KP hierarchy. Its role is analogous to the one played by the Central System for the Kadomtsev-Petviashivili hierarchy.

math-ph↗

arXiv2000

A Bi-Hamiltonian Theory for Stationary KdV Flows and their Separability

We present a fairly new and comprehensive approach to the study of stationary flows of the Korteweg-de Vries hierarchy. They are obtained by means of a double restriction process from a dynamical system in an infinite number of variables. This process naturally provides us with a Lax representation of the flows, which is used to find their bi-Hamiltonian formulation. Then we prove the separability of these flows making use of their bi-Hamiltonian structure, and we show that the variables of separation are supplied by the Poisson pair.

nlin.SI↗

arXiv1999

On the Geometry of Graeffe Iteration

A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is called Renormalized Graeffe Iteration. It is globally convergent, with probability 1. All quantities involved in the computation are bounded, once the initial polynomial is given (with probability 1). This implies remarkable stability properties for the new algorithm, thus overcoming known limitations of the classical Graeffe algorithm. If we start with a degree-$d$ polynomial, each renormalized Graeffe iteration costs $O(d^2)$ arithmetic operations, with memory $O(d)$. A probabilistic global complexity bound is given. The case of univariate real polynomials is briefly discussed. A numerical implementation of the algorithm presented herein allowed us to solve random polynomials of degree up to 1000.

math.NA↗

arXiv1999

Tangent Graeffe Iteration

Graeffe iteration was the choice algorithm for solving univariate polynomials in the XIX-th and early XX-th century. In this paper, a new variation of Graeffe iteration is given, suitable to IEEE floating-point arithmetics of modern digital computers. We prove that under a certain generic assumption the proposed algorithm converges. We also estimate the error after N iterations and the running cost. The main ideas from which this algorithm is built are: classical Graeffe iteration and Newton Diagrams, changes of scale (renormalization), and replacement of a difference technique by a differentiation one. The algorithm was implemented successfully and a number of numerical experiments are displayed.

math.NA↗