Search results for " convergence."
showing 10 items of 251 documents
Abstract Estimates of the Rate of Convergence for Optimal Control Problems
1997
A method for solving optimal control problems with general elliptic operators is presented and analyzed. Especially, estimates of the rate of convergence for the control problems with the proposed approach are derived independently of the underlying approximation method. Some numerical experiments with the proposed method are included.
ROTOR FLUX OPTIMAL ESTIMATION FOR INDUCTION MOTOR CONTROL
2005
Abstract The aim of this paper is to analyze and design reduced order observers of the rotor flux of induction motors. The design requirements are: a) the convergence rate of the rotor flux estimation error; b) a low sensitivity to stator and rotor resistance variations; c) a low sensitivity to errors due to the implementation of the observers on microprocessor-based systems. It is shown that, in order to satisfy the requirements a)-c), it is sufficient to solve a constrained optimization problem according to a criterion in which these requirements appear explicitly. The implementation of the observer is discussed. The observer is tested by simulation and experiments.
Baseband predistorter using direct spline computation
2005
A baseband predistorter is presented. Key features of the predistorter reside in the use of cubic spline interpolation to generate predistorted input data to the power amplifier, without time convergence problems of classical approaches, with the goal of a reduction in the computational effort. Simulated behaviour of the proposed scheme is presented, demonstrating the effectiveness of the approach.
An optimization location scheme for electric charging stations
2013
International audience; Due to environmental issues, electric mobility is one of the mobility alternatives that are receiving a huge attention nowadays. In fact, in the last few years electric vehicles have entered the world's car market. This revolutionary technology requires a fast deployment of electric charging stations since the key issue in this system is recharging the batteries. In this work, we propose an optimized algorithm to locate electric-vehicles charging stations. Different factors and limitations are considered and a real case study is given as an application. We first determine the appropriate strict constraints and cost of charging stations' location; and then we propose …
Forward and backward diffusion approximations for haploid exchangeable population models
2001
Abstract The class of haploid population models with non-overlapping generations and fixed population size N is considered such that the family sizes ν1,…,νN within a generation are exchangeable random variables. A criterion for weak convergence in the Skorohod sense is established for a properly time- and space-scaled process counting the number of descendants forward in time. The generator A of the limit process X is constructed using the joint moments of the offspring variables ν1,…,νN. In particular, the Wright–Fisher diffusion with generator Af(x)= 1 2 x(1−x)f″(x) appears in the limit as the population size N tends to infinity if and only if the condition lim N→∞ E((ν 1 −1) 3 )/(N Var …
Thresholding projection estimators in functional linear models
2008
We consider the problem of estimating the regression function in functional linear regression models by proposing a new type of projection estimators which combine dimension reduction and thresholding. The introduction of a threshold rule allows to get consistency under broad assumptions as well as minimax rates of convergence under additional regularity hypotheses. We also consider the particular case of Sobolev spaces generated by the trigonometric basis which permits to get easily mean squared error of prediction as well as estimators of the derivatives of the regression function. We prove these estimators are minimax and rates of convergence are given for some particular cases.
Convergence analysis for hierarchical longitudinal data
2018
Abstract Convergence analysis is typically envisaged either from a macro or a micro perspective. However, empirical tests tend to ignore that the two levels are often “nested” in a hierarchy. Building on hierarchical growth curve modelling, we propose an approach to convergence analysis that allows contemporaneous inference on macro and micro-convergence. Compared to the classic linear convergence analysis, the suggested methodology provides a more flexible alternative to model heterogeneity and validate the results for possible Galton's fallacy. We illustrate the approach in two empirical examples, one considering convergence across European regions and countries and the other across Itali…
Avoiding strange attractors in efficient parametric families of iterative methods for solving nonlinear problems
2019
[EN] Searching zeros of nonlinear functions often employs iterative procedures. In this paper, we construct several families of iterative methods with memory from one without memory, that is, we have increased the order of convergence without adding new functional evaluations. The main aim of this manuscript yields in the advantage that the use of real multidimensional dynamics gives us to decide among the different classes designed and, afterwards, to select its most stable members. Moreover, we have found some elements of the family whose behavior includes strange attractors of different kinds that must be avoided in practice. In this sense, Feigenbaum diagrams have resulted an extremely …
Convergence of Boobnov-Galerkin Method Exemplified
2004
In this Note, Boobnov–Galerkin’s method is proved to converge to an exact solution for an applied mechanics problem. We address in detail the interrelation of Boobnov–Galerkin method and the exact solution in the beam deflection problems. Namely, we show the coincidence of these two methods for clamped–clamped boundary conditions, using an alternative set of functions proposed by Filonenko-Borodich.12 Received 25 February 2003; accepted for publication 13 March 2004. Copyright c 2004 by the American Institute of Aeronautics and Astronautics, Inc. All rights reserved. Copies of this paper may be made for personal or internal use, on condition that the copier pay the $10.00 per-copy fee to th…
Circular law for sparse random regular digraphs
2020
Fix a constant $C\geq 1$ and let $d=d(n)$ satisfy $d\leq \ln^{C} n$ for every large integer $n$. Denote by $A_n$ the adjacency matrix of a uniform random directed $d$-regular graph on $n$ vertices. We show that, as long as $d\to\infty$ with $n$, the empirical spectral distribution of appropriately rescaled matrix $A_n$ converges weakly in probability to the circular law. This result, together with an earlier work of Cook, completely settles the problem of weak convergence of the empirical distribution in directed $d$-regular setting with the degree tending to infinity. As a crucial element of our proof, we develop a technique of bounding intermediate singular values of $A_n$ based on studyi…