Search results for "Decomposition methods"
showing 10 items of 20 documents
Acute Type Refinements of Tetrahedral Partitions of Polyhedral Domains
2001
We present a new technique to perform refinements on acute type tetrahedral partitions of a polyhedral domain, provided that the center of the circumscribed sphere around each tetrahedron belongs to the tetrahedron. The resulting family of partitions is of acute type; thus, all the tetrahedra satisfy the maximum angle condition. Both these properties are highly desirable in finite element analysis.
Fictitious Domain Methods for the Numerical Solution of Two-Dimensional Scattering Problems
1998
Fictitious domain methods for the numerical solution of two-dimensional scattering problems are considered. The original exterior boundary value problem is approximated by truncating the unbounded domain and by imposing a nonreflecting boundary condition on the artificial boundary. First-order, second-order, and exact nonreflecting boundary conditions are tested on rectangular and circular boundaries. The finite element discretizations of the corresponding approximate boundary value problems are performed using locally fitted meshes, and the discrete equations are solved with fictitious domain methods. A special finite element method using nonmatching meshes is considered. This method uses …
Parallel Schwarz methods for convection-dominated semilinear diffusion problems
2002
AbstractParallel two-level Schwarz methods are proposed for the numerical solution of convection-diffusion problems, with the emphasis on convection-dominated problems. Two variants of the methodology are investigated. They differ from each other by the type of boundary conditions (Dirichlet- or Neumann-type) posed on a part of the second-level subdomain interfaces. Convergence properties of the two-level Schwarz methods are experimentally compared with those of a variant of the standard multi-domain Schwarz alternating method. Numerical experiments performed on a distributed memory multiprocessor computer illustrate parallel efficiency of the methods.
A new discretization for the polarizable continuum model within the domain decomposition paradigm
2016
International audience; We present a new algorithm to solve the polarizable continuum model equation in a framework compatible with the strategy previously developed by us for the conductor-like screening model based on Schwarz’s domain decomposition method (ddCOSMO). The new discretization is systematically improvable and is fully consistent with ddCOSMO so that it reproduces ddCOSMO results for large dielectric constants.
Simulation Software for Flow of Fluid with Suspended Point Particles in Complex Domains: Application to Matrix Diffusion
2013
Matrix diffusion is a phenomenon in which tracer particles convected along a flow channel can diffuse into porous walls of the channel, and it causes a delay and broadening of the breakthrough curve of a tracer pulse. Analytical and numerical methods exist for modeling matrix diffusion, but there are still some features of this phenomenon, which are difficult to address using traditional approaches. To this end we propose to use the lattice-Boltzmann method with point-like tracer particles. These particles move in a continuous space, are advected by the flow, and there is a stochastic force causing them to diffuse. This approach can be extended to include particle-particle and particle-wall…
A Lagrange Multiplier Based Domain Decomposition Method for the Solution of a Wave Problem with Discontinuous Coefficients
2008
In this paper we consider the numerical solution of a linear wave equation with discontinuous coefficients. We divide the computational domain into two subdomains and use explicit time difference scheme along with piecewise linear finite element approximations on semimatching grids. We apply boundary supported Lagrange multiplier method to match the solution on the interface between subdomains. The resulting system of linear equations of the “saddle-point” type is solved efficiently by a conjugate gradient method.
Comparison of parallel implementation of some multi-level Schwarz methods for singularly perturbed parabolic problems
1999
Abstract Parallel multi-level algorithms combining a time discretization and an overlapping domain decomposition technique are applied to the numerical solution of singularly perturbed parabolic problems. Two methods based on the Schwarz alternating procedure are considered: a two-level method with auxiliary “correcting” subproblems as well as a three-level method with auxiliary “predicting” and “correcting” subproblems. Moreover, modifications of the methods using time extrapolation on subdomain interfaces are investigated. The emphasis is given to the description of the algorithms as well as their computer realization on a distributed memory multiprocessor computer. Numerical experiments …
Qualitative analysis of matrix splitting methods
2001
Abstract Qualitative properties of matrix splitting methods for linear systems with tridiagonal and block tridiagonal Stieltjes-Toeplitz matrices are studied. Two particular splittings, the so-called symmetric tridiagonal splittings and the bidiagonal splittings, are considered, and conditions for qualitative properties like nonnegativity and shape preservation are shown for them. Special attention is paid to their close relation to the well-known splitting techniques like regular and weak regular splitting methods. Extensions to block tridiagonal matrices are given, and their relation to algebraic representations of domain decomposition methods is discussed. The paper is concluded with ill…
First Look at Two-Loop Five-Gluon Scattering in QCD.
2018
We compute the leading colour contributions to five-gluon scattering at two loops in massless QCD. The integrands of all independent helicity amplitudes are evaluated using d-dimensional generalised unitarity cuts and finite field reconstruction techniques. Numerical evaluation of the integral basis is performed with sector decomposition methods to obtain the first benchmark results for all helicity configurations of a 2 to 3 scattering process in QCD.
A decomposition approach for multidimensional knapsacks with family-split penalties
2022
The optimization of Multidimensional Knapsacks with Family-Split Penalties has been introduced in the literature as a variant of the more classical Multidimensional Knapsack and Multi-Knapsack problems. This problem deals with a set of items partitioned in families, and when a single item is picked to maximize the utility, then all items in its family must be picked. Items from the same family can be assigned to different knapsacks, and in this situation split penalties are paid. This problem arises in real applications in various fields. This paper proposes a new exact and fast algorithm based on a specific Combinatorial Benders Cuts scheme. An extensive experimental campaign computational…