Invariant discretizations of partial differential equations

Un algorithme permettant de discrétiser les équations aux dérivées partielles (EDP) tout en préservant leurs symétries de Lie est élaboré. Ceci est rendu possible grâce à l'utilisation de dérivées partielles discrètes se transformant comme les dérivées partielles continues sous l'action de groupes de Lie locaux. Dans les applications, beaucoup d'EDP sont invariantes sous l'action de transformations ponctuelles de Lie de dimension infinie qui font partie de ce que l'on désigne comme des pseudo-groupes de Lie. Afin d'étendre la méthode de discrétisation préservant les symétries à ces équations, une discrétisation des pseudo-groupes est proposée. Cette discrétisation a pour effet de transformer les symétries ponctuelles en symétries généralisées dans l'espace discret. Des schémas invariants sont ensuite créés pour un certain nombre d'EDP. Dans tous les cas, des tests numériques montrent que les schémas invariants approximent mieux leur équivalent continu que les différences finies standard.

Global solutions for impulsive abstract partial differential equations

In this paper, we study the existence of global solutions for a class of impulsive abstract functional differential equation. An application involving a parabolic system With impulses is considered. (c) 2008 Elsevier Ltd. All rights reserved.

Generalized Differential Quadrature Finite Element Method applied to Advanced Structural Mechanics

Over the years the Differential Quadrature (DQ) method has distinguished because of its high accuracy, straightforward implementation and general ap- plication to a variety of problems. There has been an increase in this topic by several researchers who experienced significant development in the last years. DQ is essentially a generalization of the popular Gaussian Quadrature (GQ) used for numerical integration functions. GQ approximates a finite in- tegral as a weighted sum of integrand values at selected points in a problem domain whereas DQ approximate the derivatives of a smooth function at a point as a weighted sum of function values at selected nodes. A direct appli- cation of this elegant methodology is to solve ordinary and partial differential equations. Furthermore in recent years the DQ formulation has been gener- alized in the weighting coefficients computations to let the approach to be more flexible and accurate. As a result it has been indicated as Generalized Differential Quadrature (GDQ) method. However the applicability of GDQ in its original form is still limited. It has been proven to fail for problems with strong material discontinuities as well as problems involving singularities and irregularities. On the other hand the very well-known Finite Element (FE) method could overcome these issues because it subdivides the computational domain into a certain number of elements in which the solution is calculated. Recently, some researchers have been studying a numerical technique which could use the advantages of the GDQ method and the advantages of FE method. This methodology has got different names among each research group, it will be indicated here as Generalized Differential Quadrature Finite Element Method (GDQFEM).

Preconditioning strategies for the numerical solution of convection-diffusion partial differential equations

Il trattamento numerico dell'equazione di convezione-diffusione con le relative condizioni al bordo, comporta la risoluzione di sistemi lineari algebrici di grandi dimensioni in cui la matrice dei coefficienti è non simmetrica. Risolutori iterativi basati sul sottospazio di Krylov sono ampiamente utilizzati per questi sistemi lineari la cui risoluzione risulta particolarmente impegnativa nel caso di convezione dominante. In questa tesi vengono analizzate alcune strategie di precondizionamento, atte ad accelerare la convergenza di questi metodi iterativi. Vengono confrontati sperimentalmente precondizionatori molto noti come ILU e iterazioni di tipo inner-outer flessibile. Nel caso in cui i coefficienti del termine di convezione siano a variabili separabili, proponiamo una nuova strategia di precondizionamento basata sull'approssimazione, mediante equazione matriciale, dell'operatore differenziale di convezione-diffusione. L'azione di questo nuovo precondizionatore sfrutta in modo opportuno recenti risolutori efficienti per equazioni matriciali lineari. Vengono riportati numerosi esperimenti numerici per studiare la dipendenza della performance dei diversi risolutori dalla scelta del termine di convezione, e dai parametri di discretizzazione.

Optimization of chemical plant simulation using double collocation

A method has been constructed for the solution of a wide range of chemical plant simulation models including differential equations and optimization. Double orthogonal collocation on finite elements is applied to convert the model into an NLP problem that is solved either by the VF 13AD package based on successive quadratic programming, or by the GRG2 package, based on the generalized reduced gradient method. This approach is termed simultaneous optimization and solution strategy. The objective functional can contain integral terms. The state and control variables can have time delays. Equalities and inequalities containing state and control variables can be included into the model as well as algebraic equations and inequalities. The maximum number of independent variables is 2. Problems containing 3 independent variables can be transformed into problems having 2 independent variables using finite differencing. The maximum number of NLP variables and constraints is 1500. The method is also suitable for solving ordinary and partial differential equations. The state functions are approximated by a linear combination of Lagrange interpolation polynomials. The control function can either be approximated by a linear combination of Lagrange interpolation polynomials or by a piecewise constant function over finite elements. The number of internal collocation points can vary by finite elements. The residual error is evaluated at arbitrarily chosen equidistant grid-points, thus enabling the user to check the accuracy of the solution between collocation points, where the solution is exact. The solution functions can be tabulated. There is an option to use control vector parameterization to solve optimization problems containing initial value ordinary differential equations. When there are many differential equations or the upper integration limit should be selected optimally then this approach should be used. The portability of the package has been addressed converting the package from V AX FORTRAN 77 into IBM PC FORTRAN 77 and into SUN SPARC 2000 FORTRAN 77. Computer runs have shown that the method can reproduce optimization problems published in the literature. The GRG2 and the VF I 3AD packages, integrated into the optimization package, proved to be robust and reliable. The package contains an executive module, a module performing control vector parameterization and 2 nonlinear problem solver modules, GRG2 and VF I 3AD. There is a stand-alone module that converts the differential-algebraic optimization problem into a nonlinear programming problem.

EXISTENCE RESULTS FOR NEUTRAL INTEGRO-DIFFERENTIAL EQUATIONS WITH UNBOUNDED DELAY

In this paper we discuss the existence of mild, strict and classical solutions for a class of abstract integro-differential equations in Banach spaces. Some applications to ordinary and partial integro-differential equations are considered.

Existence of solutions for second order partial neutral functional differential equations

We establish existence of mild solutions for a class of abstract second-order partial neutral functional differential equations with unbounded delay in a Banach space.

Global solutions for abstract impulsive neutral differential equations

We study the existence of mild solutions for a class of impulsive neutral functional differential equation defined on the whole real axis. Some concrete applications to ordinary and partial neutral differential equations with impulses are considered. (C) 2010 Elsevier Ltd. All rights reserved.

Generalized backward doubly stochastic differential equations and SPDEs with nonlinear Neumann boundary conditions

In this paper, a new class of generalized backward doubly stochastic differential equations is investigated. This class involves an integral with respect to an adapted continuous increasing process. A probabilistic representation for viscosity solutions of semi-linear stochastic partial differential equations with a Neumann boundary condition is given.

Explicit and Implicit Methods In Solving Differential Equations

Differential equations are equations that involve an unknown function and derivatives. Euler's method are efficient methods to yield fairly accurate approximations of the actual solutions. By manipulating such methods, one can find ways to provide good approximations compared to the exact solution of parabolic partial differential equations and nonlinear parabolic differential equations.

Theory of differential equations.

pt. I. (Vol. I) Exact equations and Pfaff's problem. 1890.--pt. II. (Vol. II-III) Ordinary equations, not linear. 1900.--pt. III. (Vol. IV) Ordinary equations. 1902.--pt. IV (vol. V-VI) Partial differential equations. 1906.

Fractional Fokker-Planck-Kolmogorov type Equations and their Associated Stochastic Differential Equations

MSC 2010: 26A33, 35R11, 35R60, 35Q84, 60H10 Dedicated to 80-th anniversary of Professor Rudolf Gorenflo

Symbolic Solving of Partial Differential Equation Systems and Compatibility Conditions

An algorithm is produced for the symbolic solving of systems of partial differential equations by means of multivariate Laplace–Carson transform. A system of K equations with M as the greatest order of partial derivatives and right-hand parts of a special type is considered. Initial conditions are input. As a result of a Laplace–Carson transform of the system according to initial condition we obtain an algebraic system of equations. A method to obtain compatibility conditions is discussed.