Active vibration suppression of non-linear beams using optimal dynamic inversion

Euler–Bernoulli beams are distributed parameter systems that are governed by a non-linear partial differential equation (PDE) of motion. This paper presents a vibration control approach for such beams that directly utilizes the non-linear PDE of motion, and hence, it is free from approximation errors (such as model reduction, linearization etc.). Two state feedback controllers are presented based on a newly developed optimal dynamic inversion technique which leads to closed-form solutions for the control variable. In one formulation a continuous controller structure is assumed in the spatial domain, whereas in the other approach it is assumed that the control force is applied through a finite number of discrete actuators located at predefined discrete locations in the spatial domain. An implicit finite difference technique with unconditional stability has been used to solve the PDE with control actions. Numerical simulation studies show that the beam vibration can effectively be decreased using either of the two formulations.

Exact-Solutions Of Linear Partial-Differential Equations With Variable-Coefficients

Backlund transformations relating the solutions of linear PDE with variable coefficients to those of PDE with constant coefficients are found, generalizing the study of Varley and Seymour [2]. Auto-Backlund transformations are also determined. To facilitate the generation of new solutions via Backlund transformation, explicit solutions of both classes of the PDE just mentioned are found using invariance properties of these equations and other methods. Some of these solutions are new.

SOLUTIONS OF A SYSTEM OF FORCED BURGERS EQUATION IN TERMS OF GENERALIZED LAGUERRE POLYNOMIALS

In this article, we obtain explicit solutions of a linear PDE subject to a class of radial square integrable functions with a monotonically increasing weight function |x|(n-1)e(beta vertical bar x vertical bar 2)/2, beta >= 0, x is an element of R-n. This linear PDE is obtained from a system of forced Burgers equation via the Cole-Hopf transformation. For any spatial dimension n > 1, the solution is expressed in terms of a family of weighted generalized Laguerre polynomials. We also discuss the large time behaviour of the solution of the system of forced Burgers equation.

Efficient methods for stochastic optimal control

The Hamilton Jacobi Bellman (HJB) equation is central to stochastic optimal control (SOC) theory, yielding the optimal solution to general problems specified by known dynamics and a specified cost functional. Given the assumption of quadratic cost on the control input, it is well known that the HJB reduces to a particular partial differential equation (PDE). While powerful, this reduction is not commonly used as the PDE is of second order, is nonlinear, and examples exist where the problem may not have a solution in a classical sense. Furthermore, each state of the system appears as another dimension of the PDE, giving rise to the curse of dimensionality. Since the number of degrees of freedom required to solve the optimal control problem grows exponentially with dimension, the problem becomes intractable for systems with all but modest dimension.

In the last decade researchers have found that under certain, fairly non-restrictive structural assumptions, the HJB may be transformed into a linear PDE, with an interesting analogue in the discretized domain of Markov Decision Processes (MDP). The work presented in this thesis uses the linearity of this particular form of the HJB PDE to push the computational boundaries of stochastic optimal control.

This is done by crafting together previously disjoint lines of research in computation. The first of these is the use of Sum of Squares (SOS) techniques for synthesis of control policies. A candidate polynomial with variable coefficients is proposed as the solution to the stochastic optimal control problem. An SOS relaxation is then taken to the partial differential constraints, leading to a hierarchy of semidefinite relaxations with improving sub-optimality gap. The resulting approximate solutions are shown to be guaranteed over- and under-approximations for the optimal value function. It is shown that these results extend to arbitrary parabolic and elliptic PDEs, yielding a novel method for Uncertainty Quantification (UQ) of systems governed by partial differential constraints. Domain decomposition techniques are also made available, allowing for such problems to be solved via parallelization and low-order polynomials.

The optimization-based SOS technique is then contrasted with the Separated Representation (SR) approach from the applied mathematics community. The technique allows for systems of equations to be solved through a low-rank decomposition that results in algorithms that scale linearly with dimensionality. Its application in stochastic optimal control allows for previously uncomputable problems to be solved quickly, scaling to such complex systems as the Quadcopter and VTOL aircraft. This technique may be combined with the SOS approach, yielding not only a numerical technique, but also an analytical one that allows for entirely new classes of systems to be studied and for stability properties to be guaranteed.

The analysis of the linear HJB is completed by the study of its implications in application. It is shown that the HJB and a popular technique in robotics, the use of navigation functions, sit on opposite ends of a spectrum of optimization problems, upon which tradeoffs may be made in problem complexity. Analytical solutions to the HJB in these settings are available in simplified domains, yielding guidance towards optimality for approximation schemes. Finally, the use of HJB equations in temporal multi-task planning problems is investigated. It is demonstrated that such problems are reducible to a sequence of SOC problems linked via boundary conditions. The linearity of the PDE allows us to pre-compute control policy primitives and then compose them, at essentially zero cost, to satisfy a complex temporal logic specification.

A finite element method for nonlinear elliptic problems

We present a Galerkin method with piecewise polynomial continuous elements for fully nonlinear elliptic equations. A key tool is the discretization proposed in Lakkis and Pryer, 2011, allowing us to work directly on the strong form of a linear PDE. An added benefit to making use of this discretization method is that a recovered (finite element) Hessian is a byproduct of the solution process. We build on the linear method and ultimately construct two different methodologies for the solution of second order fully nonlinear PDEs. Benchmark numerical results illustrate the convergence properties of the scheme for some test problems as well as the Monge–Amp`ere equation and the Pucci equation.

A finite element method for second order nonvariational elliptic problems

We propose a numerical method to approximate the solution of second order elliptic problems in nonvariational form. The method is of Galerkin type using conforming finite elements and applied directly to the nonvariational (nondivergence) form of a second order linear elliptic problem. The key tools are an appropriate concept of “finite element Hessian” and a Schur complement approach to solving the resulting linear algebra problem. The method is illustrated with computational experiments on three linear and one quasi-linear PDE, all in nonvariational form.

Local solvability for a class of evolution equations

Motivated by the celebrated example of Y. Kannai of a linear partial differential operator which is hypoelliptic but not locally solvable, we consider it class of evolution operators with real-analytic coefficients and study their local solvability both in L(2) and in the weak sense. In order to do so we are led to propose a generalization of the Nirenberg-Treves condition (psi) which is suitable to our study. (C) 2009 Published by Elsevier Inc.

Transformações estruturais em xerogéis de sílica tratados termicamente

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

Numerical solution of a PDE system with non-linear steady state conditions that translates the air stripping pollutants removal

This work deals with the numerical simulation of air stripping process for the pre-treatment of groundwater used in human consumption. The model established in steady state presents an exponential solution that is used, together with the Tau Method, to get a spectral approach of the solution of the system of partial differential equations associated to the model in transient state.

Linear Fractional PDE, Uniqueness of Global Solutions

Mathematics Subject Classification: 26A33, 47A60, 30C15.

Exact solutions of linear reaction-diffusion on a uniformly growing domain: criteria for successful colonization

Many processes during embryonic development involve transport and reaction of molecules, or transport and proliferation of cells, within growing tissues. Mathematical models of such processes usually take the form of a reaction-diffusion partial differential equation (PDE) on a growing domain. Previous analyses of such models have mainly involved solving the PDEs numerically. Here, we present a framework for calculating the exact solution of a linear reaction-diffusion PDE on a growing domain. We derive an exact solution for a general class of one-dimensional linear reaction—diffusion process on 0

Certified Rapid Solution of Parametrized Linear Elliptic Equations: Application to Parameter Estimation

We present a technique for the rapid and reliable evaluation of linear-functional output of elliptic partial differential equations with affine parameter dependence. The essential components are (i) rapidly uniformly convergent reduced-basis approximations — Galerkin projection onto a space WN spanned by solutions of the governing partial differential equation at N (optimally) selected points in parameter space; (ii) a posteriori error estimation — relaxations of the residual equation that provide inexpensive yet sharp and rigorous bounds for the error in the outputs; and (iii) offline/online computational procedures — stratagems that exploit affine parameter dependence to de-couple the generation and projection stages of the approximation process. The operation count for the online stage — in which, given a new parameter value, we calculate the output and associated error bound — depends only on N (typically small) and the parametric complexity of the problem. The method is thus ideally suited to the many-query and real-time contexts. In this paper, based on the technique we develop a robust inverse computational method for very fast solution of inverse problems characterized by parametrized partial differential equations. The essential ideas are in three-fold: first, we apply the technique to the forward problem for the rapid certified evaluation of PDE input-output relations and associated rigorous error bounds; second, we incorporate the reduced-basis approximation and error bounds into the inverse problem formulation; and third, rather than regularize the goodness-of-fit objective, we may instead identify all (or almost all, in the probabilistic sense) system configurations consistent with the available experimental data — well-posedness is reflected in a bounded "possibility region" that furthermore shrinks as the experimental error is decreased.

Boundary value problems for third-order linear PDEs in time-dependent domains

We present the extension of a methodology to solve moving boundary value problems from the second-order case to the case of the third-order linear evolution PDE qt + qxxx = 0. This extension is the crucial step needed to generalize this methodology to PDEs of arbitrary order. The methodology is based on the derivation of inversion formulae for a class of integral transforms that generalize the Fourier transform and on the analysis of the global relation associated with the PDE. The study of this relation and its inversion using the appropriate generalized transform are the main elements of the proof of our results.

Detecção de bordas em imagens digitais através de um processo de difusão anisotrópica não linear

The edges detection model by a non-linear anisotropic diffusion, consists in a mathematical model of smoothing based in Partial Differential Equation (PDE), alternative to the conventional low-pass filters. The smoothing model consists in a selective process, where homogeneous areas of the image are smoothed intensely in agreement with the temporal evolution applied to the model. The level of smoothing is related with the amount of undesired information contained in the image, i.e., the model is directly related with the optimal level of smoothing, eliminating the undesired information and keeping selectively the interest features for Cartography area. The model is primordial for cartographic applications, its function is to realize the image preprocessing without losing edges and other important details on the image, mainly airports tracks and paved roads. Experiments carried out with digital images showed that the methodology allows to obtain the features, e.g. airports tracks, with efficiency.

Análise fractal de fraturas em regime linear elástico: modo I de carregamento

For the development of this graduate work of fractal fracture behavior, it is necessary to establish references for fractal analysis on fracture surfaces, evaluating, from tests of fracture tenacity on modes I, II and combined I / II, the behavior of fractures in fragile materials, on linear elastic regime. Fractures in the linear elastic regime are described by your fractal behavior by several researchers, especially Mecholsky JJ. The motivation of that present proposal stems from work done by the group and accepted for publication in the journal Materials Science and Engineering A (Horovistiz et al, 2010), where the model of Mecholsky could not be proven for fractures into grooved specimens for tests of diametric compression of titania on mode I. The general objective of this proposal is to quantify the distinguish surface regions formed by different mechanisms of fracture propagation in linear elastic regime in polymeric specimens (phenolic resin), relating tenacity, thickness of the specimens and fractal dimension. The analyzed fractures were obtained from SCB tests in mode I loading, and the acquisition of images taken using an optical reflection microscope and the surface topographies obtained by the extension focus method of reconstruction, calculating the values of fractal dimension with the use of maps of elevations. The fractal dimension was classified as monofractal dimension (Df), when the fracture is described by a single value, or texture size (Dt), which is a macroscopic analysis of the fracture, combined with the structural dimension (Ds), which is a microscopic analysis. The results showed that there is no clear relationship between tenacity, thickness and fractal values for the material investigated. On the other hand it is clear that the fractal values change with the evolution of cracks during the fracture process ... (Complete abstract click electronic access below)