875 research outputs found

    Computational Methods and Results for Structured Multiscale Models of Tumor Invasion

    Full text link
    We present multiscale models of cancer tumor invasion with components at the molecular, cellular, and tissue levels. We provide biological justifications for the model components, present computational results from the model, and discuss the scientific-computing methodology used to solve the model equations. The models and methodology presented in this paper form the basis for developing and treating increasingly complex, mechanistic models of tumor invasion that will be more predictive and less phenomenological. Because many of the features of the cancer models, such as taxis, aging and growth, are seen in other biological systems, the models and methods discussed here also provide a template for handling a broader range of biological problems

    Time-parallel iterative solvers for parabolic evolution equations

    Get PDF
    We present original time-parallel algorithms for the solution of the implicit Euler discretization of general linear parabolic evolution equations with time-dependent self-adjoint spatial operators. Motivated by the inf-sup theory of parabolic problems, we show that the standard nonsymmetric time-global system can be equivalently reformulated as an original symmetric saddle-point system that remains inf-sup stable with respect to the same natural parabolic norms. We then propose and analyse an efficient and readily implementable parallel-in-time preconditioner to be used with an inexact Uzawa method. The proposed preconditioner is non-intrusive and easy to implement in practice, and also features the key theoretical advantages of robust spectral bounds, leading to convergence rates that are independent of the number of time-steps, final time, or spatial mesh sizes, and also a theoretical parallel complexity that grows only logarithmically with respect to the number of time-steps. Numerical experiments with large-scale parallel computations show the effectiveness of the method, along with its good weak and strong scaling properties

    Modeling the Role of the Cell Cycle in Regulating Proteus mirabilis Swarm-Colony Development

    Full text link
    We present models and computational results which indicate that the spatial and temporal regularity seen in Proteus mirabilis swarm-colony development is largely an expression of a sharp age of dedifferentiation in the cell cycle from motile swarmer cells to immotile dividing cells (also called swimmer or vegetative cells.) This contrasts strongly with reaction-diffusion models of Proteus behavior that ignore or average out the age structure of the cell population and instead use only density-dependent mechanisms. We argue the necessity of retaining the explicit age structure, and suggest experiments that may help determine the underlying mechanisms empirically. Consequently, we advocate Proteus as a model organism for a multiscale understanding of how and to what extent the life cycle of individual cells affects the macroscopic behavior of a biological system

    A mixed â„“1\ell_1 regularization approach for sparse simultaneous approximation of parameterized PDEs

    Full text link
    We present and analyze a novel sparse polynomial technique for the simultaneous approximation of parameterized partial differential equations (PDEs) with deterministic and stochastic inputs. Our approach treats the numerical solution as a jointly sparse reconstruction problem through the reformulation of the standard basis pursuit denoising, where the set of jointly sparse vectors is infinite. To achieve global reconstruction of sparse solutions to parameterized elliptic PDEs over both physical and parametric domains, we combine the standard measurement scheme developed for compressed sensing in the context of bounded orthonormal systems with a novel mixed-norm based â„“1\ell_1 regularization method that exploits both energy and sparsity. In addition, we are able to prove that, with minimal sample complexity, error estimates comparable to the best ss-term and quasi-optimal approximations are achievable, while requiring only a priori bounds on polynomial truncation error with respect to the energy norm. Finally, we perform extensive numerical experiments on several high-dimensional parameterized elliptic PDE models to demonstrate the superior recovery properties of the proposed approach.Comment: 23 pages, 4 figure

    From low-rank approximation to an efficient rational Krylov subspace method for the Lyapunov equation

    Full text link
    We propose a new method for the approximate solution of the Lyapunov equation with rank-11 right-hand side, which is based on extended rational Krylov subspace approximation with adaptively computed shifts. The shift selection is obtained from the connection between the Lyapunov equation, solution of systems of linear ODEs and alternating least squares method for low-rank approximation. The numerical experiments confirm the effectiveness of our approach.Comment: 17 pages, 1 figure
    • …
    corecore