نتایج جستجو برای: keywords convergence

تعداد نتایج: 2072512  

2007
Andrew Huston Yan Zhang Guifu Zhang Mark Yeary

ODUCTION ar sensors with dual-polarization capability etter understanding and characterization of hazards. Advanced knowledge-based hazard algorithms would require better knowledge of ttering characteristics of hydrometeors such as , hailstones, and snowflakes. Especially, characteristics becomes important for utilize phase-array dual-polarization radar Traditionally, theoretical approaches [1]...

2013
P. Victer Paul P. Dhavachelvan R. Baskaran

In traditional Genetic Algorithm, random population seeding technique is simple and efficient however the population may contain poor quality individuals which take long time to converge optimal solution. This motivates to design a population initialization technique with the features of randomness, individual diversity and good quality. In this paper, an initial work has been carried out to de...

2001
MIIN-SHEN YANG

tizzy k nearest neighbor rule (k-NNR) has been applied in a variety of substantive areas. Yang and Chen [l] described a fuzzy generalized k-NN algorithm which is a unified approach to a variety of fuzzy k-NNR’s. They created the strong consistency of posterior risk of the fuzzy generalized NNR. In this paper, we give their convergence rate. That is, the convergence rate of posterior risk of the...

Journal: :J. Optimization Theory and Applications 2013
Rolando Gárciga Otero Alfredo N. Iusem

We introduce in this paper a new class of nonlinear operators which contains, among others, the class of operators with semimonotone additive inverse and also the class of nonexpansive mappings. We study this class and discuss some of its properties. Then we present iterative procedures for computing fixed points of operators in this class, which allow for inexact solutions of the subproblems a...

2012
Taher Lotfi Parisa Bakhtiari Katayoun Mahdiani Mehdi Salimi

In this paper, verified extension of the Ostrowski method which calculates the enclosure solutions of a given nonlinear equation is introduced. Also, error analysis and convergence will be discussed. Some implemented examples with INTLAB are also included to illustrate the validity and applicability of the scheme. Keywords—Iinterval analysis, nonlinear equations, Ostrowski method.

1999
E. B. Davies

We review the literature concerning the Hardy inequality for regions in Euclidean space and in manifolds, concentrating on the best constants. We also give applications of these inequalities to boundary decay and spectral approximation. AMS subject classifications: 35P99, 35P20, 47A75, 47B25 keywords: Hardy inequality, boundary decay, Laplacian, elliptic operators, spectral theory, eigenfunctio...

2010
Carina Geldhauser Matteo Novaga

We analyze a semidiscrete scheme for the Cahn-Hilliard equation in one space dimension, when the interface length parameter is equal to zero. We prove convergence of the scheme for a suitable class of initial data, and we identify the limit equation. We also characterize the long-time behavior of the limit solutions. keywords: Nonconvex functionals, forward-backward parabolic equations, finite ...

2014
Bryant Aaron Dan E. Tamir Naphtali D. Rishe Abraham Kandel

Researchers have observed that multistage clustering can accelerate convergence and improve clustering quality. Two-stage and two-phase fuzzy C-means (FCM) algorithms have been reported. In this paper, we demonstrate that the FCM clustering algorithm can be improved by the use of static and dynamic single-pass incremental FCM procedures. Keywords-Clustering; Fuzzy C-Means Clustering; Incrementa...

2006
Uwe Helmke Jens Jordan Alexander Lanzon

We present a new iterative approach for solving linear systems of equations. Our method is inspired by feedback stabilization schemes from robust control and yields a control system, whose parameters can be tuned to achieve prescribed convergence properties. In contrast to well–known iterative solution methods for linear equations from linear algebra, such as GMRES(m) or Arnoldi’s method, the p...

2012
Dino Kečo Abdulhamit Subasi

In this paper we present parallel implementation of genetic algorithm using map/reduce programming paradigm. Hadoop implementation of map/reduce library is used for this purpose. We compare our implementation with implementation presented in [1]. These two implementations are compared in solving One Max (Bit counting) problem. The comparison criteria between implementations are fitness converge...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید