Decomposition algorithm
A dual domain decomposition algorithm for the analysis of non-conforming isogeometric Kirchhoff–Love shells
... Domain Decomposition Methods ...Domain Decomposition [41] are often seen as originators of the two main branches of those non- overlapping ...Domain Decomposition (each sub-domain being a ...
24
A quasi-optimal domain decomposition algorithm for the time-harmonic Maxwell's equations
... We first analyze in detail the case of a circular cylinder of radius R = 1 under TE (E inc = e z e −ikx ; Figure 6) and TM (E inc = e y e −ikx ; Figure 7) plane wave incidence. The outer circular boundary delimitating ...
27
Perturbed Decomposition Algorithm applied to the multi-objective Traveling Salesman Problem
... Keywords: Multi-objective combinatorial optimization, Multi-objective Traveling Salesman Problem, Meta-heuristics, Pareto Local search, Decomposition algorithm, Data perturbation 1. Introduction In ...
32
Decomposition algorithm for large-scale two-stage unit-commitment
... existing decomposition methods. We propose a tractable primal-dual decomposition approach for these large-scale unit-commitment problems, attacking both stages by ...Our algorithm uses the same ...
22
A Decomposition Algorithm for Nested Resource Allocation Problems
... our decomposition algorithm, as a function of n, is in most cases in accordance with the theoretical complexity, cubic for PS09, quadratic for W14, and log-linear for H94 and the proposed method (Figure ...
20
A Neumann-Neumann Domain Decomposition Algorithm for Solving Plate and Shell Problems
... Unite´ de recherche INRIA Lorraine, Technopoˆle de Nancy-Brabois, Campus scientifique, 615 rue du Jardin Botanique, BP 101, 54600 VILLERS LE`S NANCY Unite´ de recherche INRIA Rennes, Iri[r] ...
48
A decomposition algorithm for local access telecommunications network expansion planning
... Given a tree network without existing cable capacities, and fixed and variable costs for installing concentrators and cables, the uncapacitated local access network plann[r] ...
43
A decomposition algorithm for local access telecommunications network expansion planning
... Given the projected demand at each customer node, the existing cable capacity in each section, and the costs for rerouting, for adding cables, and for installing conce[r] ...
61
Multilevel array decomposition algorithm for fast statistical characterization of conformal arrays in the presence of excitation errors
... In this paper, a multilevel array decomposition (MAD) algorithm (A. Letrou, IEEE Trans. Antennas Propagat., vol. Boag, IEEE Trans. Antennas Propagat., vol 55, no. 2007) is introduced as [r] ...
2
A decomposition algorithm for convex differentiable minimization
... This Jacobi method, at each iteration, uses as the descent direction the solution to a variational inequality problem obtained by replacing the gradient of the cost function by a [r] ...
28
A bottom-up algorithm for query decomposition
... bottom-up algorithm for query decomposition without predefined ...The algorithm can be applied to distributed XML-based data sources, which may contain conflicts between their respective ...
10
Asymptotic expansions and domain decomposition
... domain decomposition are two alter- natives to efficiently solve multi scale elasticity ...domain decomposition type ...domain decomposition algorithm on an elasticity problem, in Section 3 we ...
9
Semi-algebraic canonical decomposition of multi-way arrays and joint eigenvalue decomposition
... CP decomposition along with an original JEVD ...CP decomposition algorithm called ...JEVD algorithm and ii) that SALT can overcome standard CP de- composition algorithms in several situations, ...
5
Uniformity and games decomposition
... sum decomposition of an arbitrary game into the potential, har- monic and non-strategic components, each with distinct equilibrium ...provide decomposition results of an arbitrary finite game by identifying ...
20
Skew-Symmetric Tensor Decomposition
... a decomposition of an element v in the orbit of (X), one can proceed as follows: a generic line through v meets σ3 G(3, C 7 ) in 7 points since σ3 G(3, C 7 ) is a hypersurface of degree 7; pick a generic line ...
25
Decomposition of s ― Concentration Curves
... 3 Notations and Definitions The Lorenz curve constitutes the basis of the preceding reasoning of de- composition. As a consequence, for any given consumption good (say j), we gauge the proportion of total consumption of ...
18
Local proper generalized decomposition
... Consider, to begin with, an equation depending solely on space and time, without any parametric dependence. The most naive approach to the problem is to work by partitioning the time dom[r] ...
22
Generalized Filtering Decomposition
... References [1] Y. Achdou and F. Nataf. Low frequency tangential filtering decomposition. Numer. Linear Algebra Appl. , 14(2):129–147, 2007. [2] Michele Benzi and Miroslav Tuma. A comparative study of sparse ...
4
Clique-decomposition revisited
... ˜ O(n 2.3729 )-time complexity. Note that it is less than O(n 2.69 ), that has been the best-known complexity for computing the clique-decomposition of a graph — until this note. Furthermore, new ...
9
Symmetric tensor decomposition
... the decomposition of all the types of ternary cubics. The decomposition allows us to classify, up to projective transformations of the variables, homogeneous polynomials of degree three in three variables, ...
21