Chebyshev polynomial approximation to approximate partial differential equations

This paper suggests a simple method based on Chebyshev approximation at Chebyshev nodes to approximate partial differential equations. The methodology simply consists in determining the value function by using a set of nodes and basis functions. We provide two examples. Pricing an European option and determining the best policy for chatting down a machinery. The suggested method is flexible, easy to program and efficient. It is also applicable in other fields, providing efficient solutions to complex systems of partial differential equations.

On a moment problem associated with Chebyshev polynomials

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Nonlinear Dynamics and Control of an Ideal/Nonideal Load Transportation System With Periodic Coefficients

In this paper, a loads transportation system in platforms or suspended by cables is considered. It is a monorail device and is modeled as an inverted pendulum built on a car driven by a dc motor the governing equations of motion were derived via Lagrange's equations. In the mathematical model we consider the interaction between the dc motor and the dynamical system, that is, we have a so called nonideal periodic problem. The problem is analyzed, qualitatively, through the comparison of the stability diagrams, numerically obtained, for several motor torque constants. Furthermore, we also analyze the problem quantitatively using the Floquet multipliers technique. Finally, we devise a control for the studied nonideal problem. The method that was used for analysis and control of this nonideal periodic system is based on the Chebyshev polynomial exponsion, the Picard iterative method, and the Lyapunov-Floquet transformation (L-F transformation). We call it Sinha's theory.

On a control of a non-ideal mono-rail system with periodics coefficients

In this work, the problem in the loads transport (in platforms or suspended by cables) it is considered. The system in subject is composed for mono-rail system and was modeled through the system: inverted pendulum, car and motor and the movement equations were obtained through the Lagrange equations. In the model, was considered the interaction among of the motor and system dynamics for several potencies motor, that is, the case studied is denominated a non-ideal periodic problem. The non-ideal periodic problem dynamics was analyzed, qualitatively, through the comparison of the stability diagrams, numerically obtained, for several motor torque constants. Furthermore, one was made it analyzes quantitative of the problem through the analysis of the Floquet multipliers. Finally, the non-ideal problem was controlled. The method that was used for analysis and control of non-ideal periodic systems is based on the Chebyshev polynomial expansion, in the Picard iterative method and in the Lyapunov-Floquet transformation (L-F trans formation). This method was presented recently in [3-9].

On non-linear dynamics and a periodic control design applied to the potential of membrane action

The Fitzhugh-Nagumo (fn) mathematical model characterizes the action potential of the membrane. The dynamics of the Fitzhugh-Nagumo model have been extensively studied both with a view to their biological implications and as a test bed for numerical methods, which can be applied to more complex models. This paper deals with the dynamics in the (FH) model. Here, the dynamics are analyzed, qualitatively, through the stability diagrams to the action potential of the membrane. Furthermore, we also analyze quantitatively the problem through the evaluation of Floquet multipliers. Finally, the nonlinear periodic problem is controlled, based on the Chebyshev polynomial expansion, the Picard iterative method and on Lyapunov-Floquet transformation (L-F transformation).

Análise da estabilidade de sistemas dinâmicos periódicos usando Teoria de Sinha

Pós-graduação em Matemática - IBILCE

The dynamic behavior of a parametrically excited time-periodic MEMS taking into account parametric errors

Micro-electromechanical systems (MEMS) are micro scale devices that are able to convert electrical energy into mechanical energy or vice versa. In this paper, the mathematical model of an electronic circuit of a resonant MEMS mass sensor, with time-periodic parametric excitation, was analyzed and controlled by Chebyshev polynomial expansion of the Picard interaction and Lyapunov-Floquet transformation, and by Optimal Linear Feedback Control (OLFC). Both controls consider the union of feedback and feedforward controls. The feedback control obtained by Picard interaction and Lyapunov-Floquet transformation is the first strategy and the optimal control theory the second strategy. Numerical simulations show the efficiency of the two control methods, as well as the sensitivity of each control strategy to parametric errors. Without parametric errors, both control strategies were effective in maintaining the system in the desired orbit. On the other hand, in the presence of parametric errors, the OLFC technique was more robust.

Chebyshev real wave packet propagation: H+O-2 (J=0) state-to-state reactive scattering calculations

In this paper we explore the relative performance of two recently developed wave packet methodologies for reactive scattering, namely the real wave packet Chebyshev domain propagation of Gray and Balint-Kurti [J. Chem. Phys. 108, 950 (1998)] and the Lanczos subspace wave packet approach of Smith [J. Chem. Phys. 116, 2354 (2002); Chem. Phys. Lett. 336, 149 (2001)]. In the former method, a modified Schrodinger equation is employed to propagate the real part of the wave packet via the well-known Chebyshev iteration. While the time-dependent wave packet from the modified Schrodinger equation is different from that obtained using the standard Schrodinger equation, time-to-energy Fourier transformation yields wave functions which differ only trivially by normalization. In the Lanczos subspace approach the linear system of equations defining the action of the Green operator may be solved via either time-dependent or time-independent methods, both of which are extremely efficient due to the simple tridiagonal structure of the Hamiltonian in the Lanczos representation. The two different wave packet methods are applied to three dimensional reactive scattering of H+O-2 (total J=0). State-to-state reaction probabilities, product state distributions, as well as initial-state-resolved cumulative reaction probabilities are examined. (C) 2002 American Institute of Physics.

Direct Computation of Operational Matrices for Polynomial Bases

Several numerical methods for boundary value problems use integral and differential operational matrices, expressed in polynomial bases in a Hilbert space of functions. This work presents a sequence of matrix operations allowing a direct computation of operational matrices for polynomial bases, orthogonal or not, starting with any previously known reference matrix. Furthermore, it shows how to obtain the reference matrix for a chosen polynomial base. The results presented here can be applied not only for integration and differentiation, but also for any linear operation.

A comparative study of iterative Chebyshev and Lanczos implementations of the boundary inhomogeneity method for quantum scattering

We have recently developed a scaleable Artificial Boundary Inhomogeneity (ABI) method [Chem. Phys. Lett.366, 390–397 (2002)] based on the utilization of the Lanczos algorithm, and in this work explore an alternative iterative implementation based on the Chebyshev algorithm. Detailed comparisons between the two iterative methods have been made in terms of efficiency as well as convergence behavior. The Lanczos subspace ABI method was also further improved by the use of a simpler three-term backward recursion algorithm to solve the subspace linear system. The two different iterative methods are tested on the model collinear H+H2 reactive state-to-state scattering.

Spectral and weak polynomial completeness for the porduct of nonsingular matrices

Let F be a field with at least four elements. In this paper, we identify all the pairs (A, B) of n x n nonsingular matrices over F , satisfying the following property: for every monic polynomial f(x) = xn + an-1xn-1 + … +a1x + aο over F, with a root in F and aο = (-1)n det(AB), there are nonsingular matrices X, Y ϵ Fnxn such that X A X-1 Y BY-1 has characteristic polynomial f (x). © 2014 © 2014 Taylor & Francis.

Spectral and weak polynomial completeness for the product of nonsingular matrices

Let F be a field with at least four elements. In this paper, we identify all the pairs (A, B) of n x n nonsingular matrices over F, satisfying the following property: for every monic polynomial f (x) = x(n) + a(n-1)x(n-1) +... + a(1)x + a(0) over F, with a root in F and a(0) = (-1)(n) det(AB), there are nonsingular matrices X, Y is an element of F-nxn such that XAX(-1)Y BY-1 has characteristic polynomial f (x).

Verification of system properties of polynomial systems using discrete-time approximations and set-based analysis

Magdeburg, Univ., Fak. für Elektrotechnik und Informationstechnik, Diss., 2015

Polynomial-time complexity for instances of the endomorphism problem in free groups

We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F, there is an endomorphism Φ of F sending W to U. This work analyzes an approach due to C. Edmunds and improved by C. Sims. Here we prove that the approach provides an efficient algorithm for solving the endomorphism problem when W is a two- generator word. We show that when W is a two-generator word this algorithm solves the problem in time polynomial in the length of U. This result gives a polynomial-time algorithm for solving, in free groups, two-variable equations in which all the variables occur on one side of the equality and all the constants on the other side.