964 resultados para Matrix fractional order differential equation
Resumo:
Ce mémoire est une partie d’un programme de recherche qui étudie la superintégrabilité des systèmes avec spin. Plus particulièrement, nous nous intéressons à un hamiltonien avec interaction spin-orbite en trois dimensions admettant une intégrale du mouvement qui est un polynôme matriciel d’ordre deux dans l’impulsion. Puisque nous considérons un hamiltonien invariant sous rotation et sous parité, nous classifions les intégrales du mouvement selon des multiplets irréductibles de O(3). Nous calculons le commutateur entre l’hamiltonien et un opérateur général d’ordre deux dans l’impulsion scalaire, pseudoscalaire, vecteur et pseudovecteur. Nous donnons la classification complète des systèmes admettant des intégrales du mouvement scalaire et vectorielle. Nous trouvons une condition nécessaire à remplir pour le potentiel sous forme d’une équation différentielle pour les cas pseudo-scalaire et pseudo-vectoriel. Nous utilisons la réduction par symétrie pour obtenir des solutions particulières de ces équations.
Resumo:
The present thesis is about the inverse problem in differential Galois Theory. Given a differential field, the inverse problem asks which linear algebraic groups can be realized as differential Galois groups of Picard-Vessiot extensions of this field. In this thesis we will concentrate on the realization of the classical groups as differential Galois groups. We introduce a method for a very general realization of these groups. This means that we present for the classical groups of Lie rank $l$ explicit linear differential equations where the coefficients are differential polynomials in $l$ differential indeterminates over an algebraically closed field of constants $C$, i.e. our differential ground field is purely differential transcendental over the constants. For the groups of type $A_l$, $B_l$, $C_l$, $D_l$ and $G_2$ we managed to do these realizations at the same time in terms of Abhyankar's program 'Nice Equations for Nice Groups'. Here the choice of the defining matrix is important. We found out that an educated choice of $l$ negative roots for the parametrization together with the positive simple roots leads to a nice differential equation and at the same time defines a sufficiently general element of the Lie algebra. Unfortunately for the groups of type $F_4$ and $E_6$ the linear differential equations for such elements are of enormous length. Therefore we keep in the case of $F_4$ and $E_6$ the defining matrix differential equation which has also an easy and nice shape. The basic idea for the realization is the application of an upper and lower bound criterion for the differential Galois group to our parameter equations and to show that both bounds coincide. An upper and lower bound criterion can be found in literature. Here we will only use the upper bound, since for the application of the lower bound criterion an important condition has to be satisfied. If the differential ground field is $C_1$, e.g., $C(z)$ with standard derivation, this condition is automatically satisfied. Since our differential ground field is purely differential transcendental over $C$, we have no information whether this condition holds or not. The main part of this thesis is the development of an alternative lower bound criterion and its application. We introduce the specialization bound. It states that the differential Galois group of a specialization of the parameter equation is contained in the differential Galois group of the parameter equation. Thus for its application we need a differential equation over $C(z)$ with given differential Galois group. A modification of a result from Mitschi and Singer yields such an equation over $C(z)$ up to differential conjugation, i.e. up to transformation to the required shape. The transformation of their equation to a specialization of our parameter equation is done for each of the above groups in the respective transformation lemma.
Resumo:
Exam questions and solutions in LaTex. Diagrams for the questions are all together in the support.zip file, as .eps files
Resumo:
Exam questions and solutions in LaTex
Resumo:
Exam questions and solutions in PDF
Resumo:
In the present paper we study the approximation of functions with bounded mixed derivatives by sparse tensor product polynomials in positive order tensor product Sobolev spaces. We introduce a new sparse polynomial approximation operator which exhibits optimal convergence properties in L2 and tensorized View the MathML source simultaneously on a standard k-dimensional cube. In the special case k=2 the suggested approximation operator is also optimal in L2 and tensorized H1 (without essential boundary conditions). This allows to construct an optimal sparse p-version FEM with sparse piecewise continuous polynomial splines, reducing the number of unknowns from O(p2), needed for the full tensor product computation, to View the MathML source, required for the suggested sparse technique, preserving the same optimal convergence rate in terms of p. We apply this result to an elliptic differential equation and an elliptic integral equation with random loading and compute the covariances of the solutions with View the MathML source unknowns. Several numerical examples support the theoretical estimates.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
In this work we have elaborated a spline-based method of solution of inicial value problems involving ordinary differential equations, with emphasis on linear equations. The method can be seen as an alternative for the traditional solvers such as Runge-Kutta, and avoids root calculations in the linear time invariant case. The method is then applied on a central problem of control theory, namely, the step response problem for linear EDOs with possibly varying coefficients, where root calculations do not apply. We have implemented an efficient algorithm which uses exclusively matrix-vector operations. The working interval (till the settling time) was determined through a calculation of the least stable mode using a modified power method. Several variants of the method have been compared by simulation. For general linear problems with fine grid, the proposed method compares favorably with the Euler method. In the time invariant case, where the alternative is root calculation, we have indications that the proposed method is competitive for equations of sifficiently high order.
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:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Improved numerical approach for the time-independent Gross-Pitaevskii nonlinear Schrödinger equation
Resumo:
In the present work, we improve a numerical method, developed to solve the Gross-Pitaevkii nonlinear Schrödinger equation. A particular scaling is used in the equation, which permits us to evaluate the wave-function normalization after the numerical solution. We have a two-point boundary value problem, where the second point is taken at infinity. The differential equation is solved using the shooting method and Runge-Kutta integration method, requiring that the asymptotic constants, for the function and its derivative, be equal for large distances. In order to obtain fast convergence, the secant method is used. © 1999 The American Physical Society.
Resumo:
The dynamics of the AFM-atomic force microscope follows a model based in a Timoshenko cantilever beam with a tip attached at the free end and acting with the surface of a sample. General boundary conditions arise when the tip is either in contact or non-contact with the surface. The governing equations are given in matrix conservative form subject to localized loads. The eigenanalysis is done with a fundamental matrix response of a damped second-order matrix differential equation. Forced responses are found by using a Galerkin approximation of the matrix impulse response. Simulations results with harmonic and pulse forcing show the filtering character and the effects of the tip-sample interaction at the end of the beam. © 2012 American Institute of Physics.
Resumo:
In this work we study the periodic solutions, their stability and bifurcation for the class of Duffing differential equation mathematical equation represented where C > 0, ε > 0 and Λ are real parameter, A(t), b(t) and h(t) are continuous T periodic functions and ε is sufficiently small. Our results are proved using the averaging method of first order.
Resumo:
In order to refine the solution given by the classical logistic equation and extend its range of applications in the study of tumor dynamics, we propose and solve a generalization of this equation, using the so-called Fractional Calculus, i.e., we replace the ordinary derivative of order 1, in one version of the usual equation, by a non-integer derivative of order 0 < α < 1, and recover the classical solution as a particular case. Finally, we analyze the applicability of this model to describe the growth of cancer tumors.
Resumo:
[EN] We establish the existence and uniqueness of a positive and nondecreasing solution to a singular boundary value problem of a class of nonlinear fractional differential equation. Our analysis relies on a fixed point theorem in partially ordered sets.