Meshless Local Petrov-Galerkin Method for Rotating Euler-Bernoulli Beam

Free vibration problem of a rotating Euler-Bernoulli beam is solved with a truly meshless local Petrov-Galerkin method. Radial basis function and summation of two radial basis functions are used for interpolation. Radial basis function satisfies the Kronecker delta property and makes it simpler to apply the essential boundary conditions. Interpolation with summation of two radial basis functions increases the node carrying capacity within the sub-domain of the trial function and higher natural frequencies can be computed by selecting the complete domain as a sub-domain of the trial function. The mass and stiffness matrices are derived and numerical results for frequencies are obtained for a fixed-free beam and hinged-free beam simulating hingeless and articulated helicopter blades. Stiffness and mass distribution suitable for wind turbine blades are also considered. Results show an accurate match with existing literature.

A Lagrangian lattice Boltzmann method for Euler equations

A Lagrangian lattice Boltzmann method for solving Euler equations is proposed. The key step in formulating this method is the introduction of the displacement distribution function. The equilibrium distribution function consists of macroscopic Lagrangian variables at time steps n and n + 1. It is different from the standard lattice Boltzmann method. In this method the element, instead of each particle, is required to satisfy the basic law. The element is considered as one large particle, which results in simpler version than the corresponding Eulerian one, because the advection term disappears here. Our numerical examples successfully reproduce the classical results.

Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization

Augmented Lagrangian methods for large-scale optimization usually require efficient algorithms for minimization with box constraints. On the other hand, active-set box-constraint methods employ unconstrained optimization algorithms for minimization inside the faces of the box. Several approaches may be employed for computing internal search directions in the large-scale case. In this paper a minimal-memory quasi-Newton approach with secant preconditioners is proposed, taking into account the structure of Augmented Lagrangians that come from the popular Powell-Hestenes-Rockafellar scheme. A combined algorithm, that uses the quasi-Newton formula or a truncated-Newton procedure, depending on the presence of active constraints in the penalty-Lagrangian function, is also suggested. Numerical experiments using the Cute collection are presented.

A contractive method for computing the stationary solution of the euler equation

A contractive method for computing stationary solutions of intertemporal equilibrium models is provide. The method is is implemented using a contraction mapping derived from the first-order conditions. The deterministic dynamic programming problem is used to illustrate the method. Some numerical examples are performed.

On the Newton method for solving fuzzy optimization problems

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

An adaptive Newton-method based on a dynamical systems approach

The traditional Newton method for solving nonlinear operator equations in Banach spaces is discussed within the context of the continuous Newton method. This setting makes it possible to interpret the Newton method as a discrete dynamical system and thereby to cast it in the framework of an adaptive step size control procedure. In so doing, our goal is to reduce the chaotic behavior of the original method without losing its quadratic convergence property close to the roots. The performance of the modified scheme is illustrated with various examples from algebraic and differential equations.

Elements of the differential and integral calculus, by a new method, founded on the true system of Sir Isaac Newton, without the use of infinitesimals or limits.

Mode of access: Internet.

Uniform Convergence of the Newton Method for Aubin Continuous Maps

* This work was supported by National Science Foundation grant DMS 9404431.

The Graves Theorem Revisited II: Robust Convergence of the Newton Method

AMS subject classification: 65J15, 47H04, 90C30.