[PDF] Top 20 Hybrid discretization methods for Signorini contact and Bingham flow problems
Has 10000 "Hybrid discretization methods for Signorini contact and Bingham flow problems" found on our website. Below are the top 20 most common "Hybrid discretization methods for Signorini contact and Bingham flow problems".
Hybrid discretization methods for Signorini contact and Bingham flow problems
... to contact in elastodynamics by Chouly et ...[47], and to contact between two elastic bodies by Fabre et ...domain discretization in the small deformations ...the contact between two ... Voir le document complet
109
Hybrid finite element methods for the Signorini problem
... Introduction and functional tools Linear finite elements are currently used for the approximation of contact prob- lems with unilateral Signorini boundary ...tools for the numerical ... Voir le document complet
30
Combined face based and nodal based discretizations on hybrid meshes for non-isothermal two-phase Darcy flow problems
... many discretization schemes have been devel- oped to approximate the Darcy fluxes on polyhedral cells in heteroge- neous anisotropic porous ...the Hybrid Finite Volume (HFV) scheme belonging to the family ... Voir le document complet
48
Reduced models for flow in porous media containing faults with discretization using hybrid finite volume schemes
... strategies for solving problems involv- ing single phase flow in a porous medium con- taining faults or fractures whose location and properties are ...position and permeability of the ... Voir le document complet
31
Construction of very high order residual distribution schemes for steady inviscid flow problems on hybrid unstructured meshes
... that, for the dis ontinuous solution of problem (26), we do not get any spurious os ...shows, for prob- lem (27), the bene e ee t of the extra term in smoothing the ontours that now are perfe tly ir ... Voir le document complet
64
Energy-Consistent CoRotational Schemes for Frictional Contact Problems
... angle for co-rotational, linearized r and standard nonlinear scheme Within the same setting, we compute the solutions for a frictional contact problem with Coulomb friction and friction ... Voir le document complet
24
Iterative Discretization of Optimization Problems Related to Superresolution
... known to converge in a finite, but as of now unbounded. In this paper, we present and analyse a slightly different refinement rule. We will in particular arrive, under a few regularity assumptions, at a guarantee ... Voir le document complet
5
Survey of Computational Methods for Inverse Problems
... form” for each resolving (averaging) ...ple, for 2-D tomographic studies the simplest target form could be circular (isotropic resolving-length); each target kernel would be constant inside such a circle ... Voir le document complet
27
Pair-particle trajectories in a shear flow of a Bingham fluid
... Newtonian and Bing- hamian shear rate field morphologies it is difficult to assess the relative magnitude of the hydrodynamic interaction from ...15 and 16 even it is clearly seen that the flow is strongly ... Voir le document complet
18
Stochastic Formal Methods for Hybrid Systems
... proof for the even values of m after noticing that E X i 2k+1 = 0 for any i and any k since X n are ...Perspectives and concluding remarks To the best of our knowledge this paper presents ... Voir le document complet
11
Mesh r-adaptation for unilateral contact problems
... problem and an itera- tion procedure to solve the discretized contact ...validity and efficiency of the ...method and some possible future ... Voir le document complet
16
Convergence of a Lagrangian discretization for barotropic fluids and porous media flow
... 2 and for the discretization in space ...The discretization strategy we use in this paper is closely related to the one developed by Brenier [ 3 ], who proposed a discretization of ... Voir le document complet
32
Decomposition methods for facility location problems
... Although solving the linear program (5.3.12) generates pareto-optimal cuts for Benders' method applied to general mixed integer programs, the special structure of facility locat[r] ... Voir le document complet
84
Current methods for characterising mixing and flow in microchannels
... forward. For characterising liquid–liquid dispersions and emulsions, most available methods require either optical access to the sample and sample dilution, thus off-line ...techniques ... Voir le document complet
30
Gradient discretization of hybrid-dimensional Darcy flow in fractured porous media with discontinuous pressures at matrix-fracture interfaces
... Ω and {ω ν } ν ∈dof Df \dof Dirf of Γ. Like the VAG-CV discretization, the HFV discretization is particularly adapted for the treat- ment of multiphase flow processes through ... Voir le document complet
34
Reconstruction methods for inverse problems for Helmholtz-type equations
... inverse problems for the gauge-covariant Helmholtz equation, whose particular cases include the Schrödinger equation for a charged elementary particle in a magnetic field and the time-harmonic ... Voir le document complet
179
T-coercivity: application to the discretization of Helmholtz-like problems
... literature, and we supply some sharp convergence ...variational problems, which we re- formulate with the help of the theory of T-coercivity, and we derive results on the approximation of the ... Voir le document complet
22
Combinatorial algorithms for inverse network flow problems
... Inverse optimization problems have been investigated rather extensively in the past few years, and inverse versions of the following problems have been studied: shor[r] ... Voir le document complet
27
Bridging the Multiscale Hybrid-Mixed and Multiscale Hybrid High-Order methods
... MHM and MsHHO methods substantially differ in their ...primal hybrid formulation analyzed in [ 39 ...local problems are defined as coercive Neumann problems, the global upscaled linear ... Voir le document complet
22
The auction algorithm for assignment and other network flow problems
... In the auction algorithm presented so far, only one person can bid at each round; this version of the auction algorithm is known as the one-at-a-time or Gauss-Seid[r] ... Voir le document complet
18
Sujets connexes