940 resultados para Generalized Inverse
Resumo:
An implementation of the inverse vector Jiles-Atherton model for the solution of non-linear hysteretic finite element problems is presented. The implementation applies the fixed point method with differential reluctivity values obtained from the Jiles-Atherton model. Differential reluctivities are usually computed using numerical differentiation, which is ill-posed and amplifies small perturbations causing large sudden increases or decreases of differential reluctivity values, which may cause numerical problems. A rule based algorithm for conditioning differential reluctivity values is presented. Unwanted perturbations on the computed differential reluctivity values are eliminated or reduced with the aim to guarantee convergence. Details of the algorithm are presented together with an evaluation of the algorithm by a numerical example. The algorithm is shown to guarantee convergence, although the rate of convergence depends on the choice of algorithm parameters. © 2011 IEEE.
Resumo:
This study compared adaptation in novel force fields where trajectories were initially either stable or unstable to elucidate the processes of learning novel skills and adapting to new environments. Subjects learned to move in a null force field (NF), which was unexpectedly changed either to a velocity-dependent force field (VF), which resulted in perturbed but stable hand trajectories, or a position-dependent divergent force field (DF), which resulted in unstable trajectories. With practice, subjects learned to compensate for the perturbations produced by both force fields. Adaptation was characterized by an initial increase in the activation of all muscles followed by a gradual reduction. The time course of the increase in activation was correlated with a reduction in hand-path error for the DF but not for the VF. Adaptation to the VF could have been achieved solely by formation of an inverse dynamics model and adaptation to the DF solely by impedance control. However, indices of learning, such as hand-path error, joint torque, and electromyographic activation and deactivation suggest that the CNS combined these processes during adaptation to both force fields. Our results suggest that during the early phase of learning there is an increase in endpoint stiffness that serves to reduce hand-path error and provides additional stability, regardless of whether the dynamics are stable or unstable. We suggest that the motor control system utilizes an inverse dynamics model to learn the mean dynamics and an impedance controller to assist in the formation of the inverse dynamics model and to generate needed stability.
Resumo:
This paper presents a generalized vector control system for a generic brushless doubly fed (induction) machine (BDFM) with nested-loop type rotor. The generic BDFM consists of p1/p2 pole-pair stator windings and a nested-loop rotor with N number of loops per nest. The vector control system is derived based on the basic BDFM equation in the synchronous mode accompanied with an appropriate synchronization approach to the grid. An analysis is performed for the vector control system using the generic BDFM vector model. The analysis proves the efficacy of the proposed approach in BDFM electromagnetic torque and rotor flux control. In fact, in the proposed vector control system, the BDFM torque can be controlled very effectively promising a high-performance BDFM shaft speed control system. A closed-loop shaft speed control system is composed based on the presented vector control system whose performance is examined both in simulations and experiments. The results confirm the high performance of the proposed approach in BDFM shaft speed control as well as a very close agreement between the simulations and experiments. Tests are performed on a 180-frame prototype BDFM. © 2012 IEEE.
Resumo:
An inherent trade-off exists in simulation model development and employment: a trade-off between the level of detail simulated and the simulation models computational cost. It is often desirable to simulate a high level of detail to a high degree of accuracy. However, due to the nature of design optimisation, which requires a large number of design evaluations, the application of such simulation models can be prohibitively expensive. A induction motor modelling approache to reduce the computational cost while maintaining a high level of detail and accuracy in the final design is presented. © 2012 IEEE.
Resumo:
Unbiased location- and scale-invariant `elemental' estimators for the GPD tail parameter are constructed. Each involves three log-spacings. The estimators are unbiased for finite sample sizes, even as small as N=3. It is shown that the elementals form a complete basis for unbiased location- and scale-invariant estimators constructed from linear combinations of log-spacings. Preliminary numerical evidence is presented which suggests that elemental combinations can be constructed which are consistent estimators of the tail parameter for samples drawn from the pure GPD family.
Resumo:
In a companion paper (McRobie(2013) arxiv:1304.3918), a simple set of `elemental' estimators was presented for the Generalized Pareto tail parameter. Each elemental estimator: involves only three log-spacings; is absolutely unbiased for all values of the tail parameter; is location- and scale-invariant; and is valid for all sample sizes $N$, even as small as $N= 3$. It was suggested that linear combinations of such elementals could then be used to construct efficient unbiased estimators. In this paper, the analogous mathematical approach is taken to the Generalised Extreme Value (GEV) distribution. The resulting elemental estimators, although not absolutely unbiased, are found to have very small bias, and may thus provide a useful basis for the construction of efficient estimators.
Resumo:
In this paper we develop a new approach to sparse principal component analysis (sparse PCA). We propose two single-unit and two block optimization formulations of the sparse PCA problem, aimed at extracting a single sparse dominant principal component of a data matrix, or more components at once, respectively. While the initial formulations involve nonconvex functions, and are therefore computationally intractable, we rewrite them into the form of an optimization program involving maximization of a convex function on a compact set. The dimension of the search space is decreased enormously if the data matrix has many more columns (variables) than rows. We then propose and analyze a simple gradient method suited for the task. It appears that our algorithm has best convergence properties in the case when either the objective function or the feasible set are strongly convex, which is the case with our single-unit formulations and can be enforced in the block case. Finally, we demonstrate numerically on a set of random and gene expression test problems that our approach outperforms existing algorithms both in quality of the obtained solution and in computational speed. © 2010 Michel Journée, Yurii Nesterov, Peter Richtárik and Rodolphe Sepulchre.
Resumo:
Using the nonlinear analog of the Fake Riccati equation developed for linear systems, we derive an inverse optimality result for several receding-horizon control schemes. This inverse optimality result unifies stability proofs and shows that receding-horizon control possesses the stability margins of optimal control laws. © 1997 Elsevier Science B.V.