Displaying similar documents to “Inverse modelling of image-based patient-specific blood vessels: zero-pressure geometry and in vivo stress incorporation”

FETI-DP domain decomposition methods for elasticity with structural changes: P-elasticity

Axel Klawonn, Patrizio Neff, Oliver Rheinbach, Stefanie Vanis (2011)

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

Similarity:

We consider linear elliptic systems which arise in coupled elastic continuum mechanical models. In these systems, the strain tensor := sym ( ∇) is redefined to include a matrix valued inhomogeneity () which cannot be described by a space dependent fourth order elasticity tensor. Such systems arise naturally in geometrically exact plasticity or in problems with eigenstresses. The tensor field induces a structural change of the elasticity equations. For...

FETI-DP domain decomposition methods for elasticity with structural changes: -elasticity

Axel Klawonn, Patrizio Neff, Oliver Rheinbach, Stefanie Vanis (2011)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

We consider linear elliptic systems which arise in coupled elastic continuum mechanical models. In these systems, the strain tensor := sym ( ∇) is redefined to include a matrix valued inhomogeneity () which cannot be described by a space dependent fourth order elasticity tensor. Such systems arise naturally in geometrically exact plasticity or in problems with eigenstresses. The tensor field induces a structural change of the elasticity equations. For such...

Convolutive decomposition and fast summation methods for discrete-velocity approximations of the Boltzmann equation

Clément Mouhot, Lorenzo Pareschi, Thomas Rey (2013)

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

Similarity:

Discrete-velocity approximations represent a popular way for computing the Boltzmann collision operator. The direct numerical evaluation of such methods involve a prohibitive cost, typically ( ) where is the dimension of the velocity space. In this paper, following the ideas introduced in [C. Mouhot and L. Pareschi, 339 (2004) 71–76, C. Mouhot and L. Pareschi, 75 (2006) 1833–1852], we derive fast summation techniques for the evaluation of discrete-velocity schemes which...

Computing and proving with pivots

Frédéric Meunier (2013)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

A simple idea used in many combinatorial algorithms is the idea of . Originally, it comes from the method proposed by Gauss in the 19th century for solving systems of linear equations. This method had been extended in 1947 by Dantzig for the famous simplex algorithm used for solving linear programs. From since, a pivoting algorithm is a method exploring subsets of a ground set and going from one subset to a new one ′ by deleting an element inside and adding an element outside : ′ =  ...

Nash equilibria for a model of traffic flow with several groups of drivers

Alberto Bressan, Ke Han (2012)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

Traffic flow is modeled by a conservation law describing the density of cars. It is assumed that each driver chooses his own departure time in order to minimize the sum of a departure and an arrival cost. There are groups of drivers, The -th group consists of drivers, sharing the same departure and arrival costs (), (). For any given population sizes ,, , we prove the existence of a Nash equilibrium solution,...

Upper large deviations for maximal flows through a tilted cylinder

Marie Theret (2014)

ESAIM: Probability and Statistics

Similarity:

We consider the standard first passage percolation model in ℤ for  ≥ 2 and we study the maximal flow from the upper half part to the lower half part (respectively from the top to the bottom) of a cylinder whose basis is a hyperrectangle of sidelength proportional to and whose height is () for a certain height function . We denote this maximal flow by (respectively ). We emphasize the fact that the cylinder may be tilted. We look at the probability that...

Pointwise constrained radially increasing minimizers in the quasi-scalar calculus of variations

Luís Balsa Bicho, António Ornelas (2014)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

We prove of vector minimizers () =  (||) to multiple integrals ∫ ((), |()|)  on a  ⊂ ℝ, among the Sobolev functions (·) in + (, ℝ), using a  : ℝ×ℝ → [0,∞] with (·) and . Besides such basic hypotheses, (·,·) is assumed to satisfy also...

Model selection and estimation of a component in additive regression

Xavier Gendre (2014)

ESAIM: Probability and Statistics

Similarity:

Let  ∈ ℝ be a random vector with mean and covariance matrix where is some known  × -matrix. We construct a statistical procedure to estimate as well as under moment condition on or Gaussian hypothesis. Both cases are developed for known or unknown . Our approach is free from any prior assumption on and is based on non-asymptotic model selection methods....

An analysis of electrical impedance tomography with applications to Tikhonov regularization

Bangti Jin, Peter Maass (2012)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

This paper analyzes the continuum model/complete electrode model in the electrical impedance tomography inverse problem of determining the conductivity parameter from boundary measurements. The continuity and differentiability of the forward operator with respect to the conductivity parameter in -norms are proved. These analytical results are applied to several popular regularization formulations, which incorporate information of smoothness/sparsity on the inhomogeneity...

Hereditary properties of words

József Balogh, Béla Bollobás (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

Let be a hereditary property of words, , an infinite class of finite words such that every subword (block) of a word belonging to is also in . Extending the classical Morse-Hedlund theorem, we show that either contains at least words of length for every  or, for some , it contains at most words of length for every . More importantly, we prove the following quantitative extension of this result: if has words of length then, for every , it contains at most ⌈( + 1)/2⌉⌈( + 1)/2⌈...