6 resultados para Adaptive methods
em Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho"
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
The scheme is based on Ami Harten's ideas (Harten, 1994), the main tools coming from wavelet theory, in the framework of multiresolution analysis for cell averages. But instead of evolving cell averages on the finest uniform level, we propose to evolve just the cell averages on the grid determined by the significant wavelet coefficients. Typically, there are few cells in each time step, big cells on smooth regions, and smaller ones close to irregularities of the solution. For the numerical flux, we use a simple uniform central finite difference scheme, adapted to the size of each cell. If any of the required neighboring cell averages is not present, it is interpolated from coarser scales. But we switch to ENO scheme in the finest part of the grids. To show the feasibility and efficiency of the method, it is applied to a system arising in polymer-flooding of an oil reservoir. In terms of CPU time and memory requirements, it outperforms Harten's multiresolution algorithm.The proposed method applies to systems of conservation laws in 1Dpartial derivative(t)u(x, t) + partial derivative(x)f(u(x, t)) = 0, u(x, t) is an element of R-m. (1)In the spirit of finite volume methods, we shall consider the explicit schemeupsilon(mu)(n+1) = upsilon(mu)(n) - Deltat/hmu ((f) over bar (mu) - (f) over bar (mu)-) = [Dupsilon(n)](mu), (2)where mu is a point of an irregular grid Gamma, mu(-) is the left neighbor of A in Gamma, upsilon(mu)(n) approximate to 1/mu-mu(-) integral(mu-)(mu) u(x, t(n))dx are approximated cell averages of the solution, (f) over bar (mu) = (f) over bar (mu)(upsilon(n)) are the numerical fluxes, and D is the numerical evolution operator of the scheme.According to the definition of (f) over bar (mu), several schemes of this type have been proposed and successfully applied (LeVeque, 1990). Godunov, Lax-Wendroff, and ENO are some of the popular names. Godunov scheme resolves well the shocks, but accuracy (of first order) is poor in smooth regions. Lax-Wendroff is of second order, but produces dangerous oscillations close to shocks. ENO schemes are good alternatives, with high order and without serious oscillations. But the price is high computational cost.Ami Harten proposed in (Harten, 1994) a simple strategy to save expensive ENO flux calculations. The basic tools come from multiresolution analysis for cell averages on uniform grids, and the principle is that wavelet coefficients can be used for the characterization of local smoothness.. Typically, only few wavelet coefficients are significant. At the finest level, they indicate discontinuity points, where ENO numerical fluxes are computed exactly. Elsewhere, cheaper fluxes can be safely used, or just interpolated from coarser scales. Different applications of this principle have been explored by several authors, see for example (G-Muller and Muller, 1998).Our scheme also uses Ami Harten's ideas. But instead of evolving the cell averages on the finest uniform level, we propose to evolve the cell averages on sparse grids associated with the significant wavelet coefficients. This means that the total number of cells is small, with big cells in smooth regions and smaller ones close to irregularities. This task requires improved new tools, which are described next.
Resumo:
We suggest a pseudospectral method for solving the three-dimensional time-dependent Gross-Pitaevskii (GP) equation, and use it to study the resonance dynamics of a trapped Bose-Einstein condensate induced by a periodic variation in the atomic scattering length. When the frequency of oscillation of the scattering length is an even multiple of one of the trapping frequencies along the x, y or z direction, the corresponding size of the condensate executes resonant oscillation. Using the concept of the differentiation matrix, the partial-differential GP equation is reduced to a set of coupled ordinary differential equations, which is solved by a fourth-order adaptive step-size control Runge-Kutta method. The pseudospectral method is contrasted with the finite-difference method for the same problem, where the time evolution is performed by the Crank-Nicholson algorithm. The latter method is illustrated to be more suitable for a three-dimensional standing-wave optical-lattice trapping potential.
Resumo:
An algorithm for adaptive IIR filtering that uses prefiltering structure in direct form is presented. This structure has an estimation error that is a linear function of the coefficients. This property greatly simplifies the derivation of gradient-based algorithms. Computer simulations show that the proposed structure improves convergence speed.
Resumo:
Recently, a generalized passivity concept for linear multivariable systems was obtained which allows circumventing the restrictiveness of the usual passivity concept. The latter is associated with the classical SPR (Strictly Positive Real) condition whereas the new concept of passivity is associated with the so called WSPR condition and its advantage in multivariable systems is that it does not require a restrictive symmetry condition of SPR systems. As a result, it allows the design of multivariable adaptive control that, unlike some existing factorization approaches, does not imply in additional overparameterization of the adaptive controller. In this paper, we complete a previously established WSPR sufficient condition and prove that it is also necessary. We also propose some methods of passification by either premultiplying the system output tracking error vector or the system input vector by an adequate passifying matrix multiplier, so that the resulting input/output transfer function becomes WSPR. The efficiency of our proposals are illustrated by simulation utilizing a well known robotics adaptive visual servoing problem. © 2011 IFAC.
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)