Search results for "routing"
showing 10 items of 587 documents
On the convergence of fixed point iterations for the moving geometry in a fluid-structure interaction problem
2019
In this paper a fluid-structure interaction problem for the incompressible Newtonian fluid is studied. We prove the convergence of an iterative process with respect to the computational domain geometry. In our previous works on numerical approximation of similar problems we refer this approach as the global iterative method. This iterative approach can be understood as a linearization of the so-called geometric nonlinearity of the underlying model. The proof of the convergence is based on the Banach fixed point argument, where the contractivity of the corresponding mapping is shown due to the continuous dependence of the weak solution on the given domain deformation. This estimate is obtain…
�ber ein Verfahren der Ordnung $$1 + \sqrt 2 $$ zur Nullstellenbestimmung
1979
A new iterative method for solving nonlinear equations is presented which is shown to converge locally withR-order of convergence $$1 + \sqrt 2 $$ at least under suitable differentiability assumptions. The method needs as many function evaluations per step as the classical Newton method.
Some supplementary results on the 1+ $$\sqrt 2 $$ order method for the solution of nonlinear equations
1982
Recently an iterative method for the solution of systems of nonlinear equations having at leastR-order 1+ $$\sqrt 2 $$ for simple roots has been investigated by the author [7]; this method uses as many function evaluations per step as the classical Newton method. In the present note we deal with several properties of the method such as monotone convergence, asymptotic inclusion of the solution and convergence in the case of multiple roots.
A Note on the Local Minimum Problem in Wireless Sensor Networks
2013
The Local Minimum Problem occurs in geographic routing scenarios. In this paper two solutions to this problem for certain network topologies are proposed. By using the notion of virtual coordinates a theoretical and a practical constructions are presented. A distributed algorithm for the practical approach is proposed.
Size-intensive decomposition of orbital energy denominators
2000
We introduce an alternative to Almlöf and Häser’s Laplace transform decomposition of orbital energy denominators used in obtaining reduced scaling algorithms in perturbation theory based methods. The new decomposition is based on the Cholesky decomposition of positive semidefinite matrices. We show that orbital denominators have a particular short and size-intensive Cholesky decomposition. The main advantage in using the Cholesky decomposition, besides the shorter expansion, is the systematic improvement of the results without the penalties encountered in the Laplace transform decomposition when changing the number of integration points in order to control the convergence. Applications will…
The Method of Fundamental Solutions in Solving Coupled Boundary Value Problems for M/EEG
2015
The estimation of neuronal activity in the human brain from electroencephalography (EEG) and magnetoencephalography (MEG) signals is a typical inverse problem whose solution pro- cess requires an accurate and fast forward solver. In this paper the method of fundamental solutions is, for the first time, proposed as a meshfree, boundary-type, and easy-to-implement alternative to the boundary element method (BEM) for solving the M/EEG forward problem. The solution of the forward problem is obtained by numerically solving a set of coupled boundary value problems for the three-dimensional Laplace equation. Numerical accuracy, convergence, and computational load are investigated. The proposed met…
Fuzzifying topology induced by a strong fuzzy metric
2016
A construction of a fuzzifying topology induced by a strong fuzzy metric is presented. Properties of this fuzzifying topology, in particular, its convergence structure are studied. Our special interest is in the study of the relations between products of fuzzy metrics and the products of the induced fuzzifying topologies.
The shortest-path problem with resource constraints with -loop elimination and its application to the capacitated arc-routing problem
2014
Abstract In many branch-and-price algorithms, the column generation subproblem consists of computing feasible constrained paths. In the capacitated arc-routing problem (CARP), elementarity constraints concerning the edges to be serviced and additional constraints resulting from the branch-and-bound process together impose two types of loop-elimination constraints. To fulfill the former constraints, it is common practice to rely on a relaxation where loops are allowed. In a k-loop elimination approach all loops of length k and smaller are forbidden. Following Bode and Irnich (2012) for solving the CARP, branching on followers and non-followers is the only known approach to guarantee integer …
A Nonlinear Observer for Rotor Flux Estimation of Induction Motor Considering the Estimated Magnetization Characteristic
2017
This paper proposes a nonlinear observer for induction machine drives based on space-vector dynamic model of induction machine, expressed in state form, which presents the peculiarity of taking into consideration the magnetic saturation of the iron core. This observer is particularly suitable in order to obtain high accuracy in rotor flux estimation, in both amplitude and phase position, during working conditions characterized by varying flux, among which the most important are those during electrical losses minimization. A Lyapunov-based convergence analysis is proposed in order to suitably compute the numerical observer gain guaranteeing the convergence of the estimation error. The propos…
Exponential Transients in Continuous-Time Symmetric Hopfield Nets
2001
We establish a fundamental result in the theory of continuous-time neural computation, by showing that so called continuous-time symmetric Hopfield nets, whose asymptotic convergence is always guaranteed by the existence of a Liapunov function may, in the worst case, possess a transient period that is exponential in the network size. The result stands in contrast to e.g. the use of such network models in combinatorial optimization applications. peerReviewed