The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying 1641 – 1660 of 9172

Showing per page

Analysis of an Asymptotic Preserving Scheme for Relaxation Systems

Francis Filbet, Amélie Rambaud (2013)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

We consider an asymptotic preserving numerical scheme initially proposed by F. Filbet and S. Jin [J. Comput. Phys. 229 (2010)] and G. Dimarco and L. Pareschi [SIAM J. Numer. Anal. 49 (2011) 2057–2077] in the context of nonlinear and stiff kinetic equations. Here, we propose a convergence analysis of such a scheme for the approximation of a system of transport equations with a nonlinear source term, for which the asymptotic limit is given by a conservation law. We investigate the convergence of the...

Analysis of approximate solutions of coupled dynamical thermoelasticity and related problems

Jozef Kačur, Alexander Ženíšek (1986)

Aplikace matematiky

The authors study problems of existence and uniqueness of solutions of various variational formulations of the coupled problem of dynamical thermoelasticity and of the convergence of approximate solutions of these problems. First, the semidiscrete approximate solutions is defined, which is obtained by time discretization of the original variational problem by Euler’s backward formula. Under certain smoothness assumptions on the date authors prove existence and uniqueness of the solution and establish...

Analysis of Compatible Discrete Operator schemes for elliptic problems on polyhedral meshes

Jérôme Bonelle, Alexandre Ern (2014)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Compatible schemes localize degrees of freedom according to the physical nature of the underlying fields and operate a clear distinction between topological laws and closure relations. For elliptic problems, the cornerstone in the scheme design is the discrete Hodge operator linking gradients to fluxes by means of a dual mesh, while a structure-preserving discretization is employed for the gradient and divergence operators. The discrete Hodge operator is sparse, symmetric positive definite and is...

Analysis of fast boundary-integral approximations for modeling electrostatic contributions of molecular binding

Amelia B. Kreienkamp, Lucy Y. Liu, Mona S. Minkara, Matthew G. Knepley, Jaydeep P. Bardhan, Mala L. Radhakrishnan (2013)

Molecular Based Mathematical Biology

We analyze and suggest improvements to a recently developed approximate continuum-electrostatic model for proteins. The model, called BIBEE/I (boundary-integral based electrostatics estimation with interpolation), was able to estimate electrostatic solvation free energies to within a mean unsigned error of 4% on a test set of more than 600 proteins¶a significant improvement over previous BIBEE models. In this work, we tested the BIBEE/I model for its capability to predict residue-by-residue interactions...

Analysis of gradient flow of a regularized Mumford-Shah functional for image segmentation and image inpainting

Xiaobing Feng, Andreas Prohl (2004)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

This paper studies the gradient flow of a regularized Mumford-Shah functional proposed by Ambrosio and Tortorelli (1990, 1992) for image segmentation, and adopted by Esedoglu and Shen (2002) for image inpainting. It is shown that the gradient flow with L 2 × L initial data possesses a global weak solution, and it has a unique global in time strong solution, which has at most finite number of point singularities in the space-time, when the initial data are in H 1 × H 1 L . A family of fully discrete approximation...

Analysis of gradient flow of a regularized Mumford-Shah functional for image segmentation and image inpainting

Xiaobing Feng, Andreas Prohl (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

This paper studies the gradient flow of a regularized Mumford-Shah functional proposed by Ambrosio and Tortorelli (1990, 1992) for image segmentation, and adopted by Esedoglu and Shen (2002) for image inpainting. It is shown that the gradient flow with L2 x L∞ initial data possesses a global weak solution, and it has a unique global in time strong solution, which has at most finite number of point singularities in the space-time, when the initial data are in H1 x H1 ∩ L∞. A family of fully...

Analysis of lumped parameter models for blood flow simulations and their relation with 1D models

Vuk Milišić, Alfio Quarteroni (2004)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

This paper provides new results of consistence and convergence of the lumped parameters (ODE models) toward one-dimensional (hyperbolic or parabolic) models for blood flow. Indeed, lumped parameter models (exploiting the electric circuit analogy for the circulatory system) are shown to discretize continuous 1D models at first order in space. We derive the complete set of equations useful for the blood flow networks, new schemes for electric circuit analogy, the stability criteria that guarantee...

Analysis of lumped parameter models for blood flow simulations and their relation with 1D models

Vuk Milišić, Alfio Quarteroni (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

This paper provides new results of consistence and convergence of the lumped parameters (ODE models) toward one-dimensional (hyperbolic or parabolic) models for blood flow. Indeed, lumped parameter models (exploiting the electric circuit analogy for the circulatory system) are shown to discretize continuous 1D models at first order in space. We derive the complete set of equations useful for the blood flow networks, new schemes for electric circuit analogy, the stability criteria that...

Analysis of patch substructuring methods

Martin Gander, Laurence Halpern, Frédéric Magoulès, Francois Roux (2007)

International Journal of Applied Mathematics and Computer Science

Patch substructuring methods are non-overlapping domain decomposition methods like classical substructuring methods, but they use information from geometric patches reaching into neighboring subdomains condensated, on the interfaces to enhance the performance of the method, while keeping it non-overlapping. These methods are very convenient to use in practice, but their convergence properties have not been studied yet. We analyze geometric patch substructuring methods for the special case of one...

Currently displaying 1641 – 1660 of 9172