Numerical Solution of the Upper-Convected Maxwell Model for Three-Dimensional Free Surface Flows

This work presents a finite difference technique for simulating three-dimensional free surface flows governed by the Upper-Convected Maxwell (UCM) constitutive equation. A Marker-and-Cell approach is employed to represent the fluid free surface and formulations for calculating the non-Newtonian stress tensor on solid boundaries are developed. The complete free surface stress conditions are employed. The momentum equation is solved by an implicit technique while the UCM constitutive equation is integrated by the explicit Euler method. The resulting equations are solved by the finite difference method on a 3D-staggered grid. By using an exact solution for fully developed flow inside a pipe, validation and convergence results are provided. Numerical results include the simulation of the transient extrudate swell and the comparison between jet buckling of UCM and Newtonian fluids.

Approximating a class of combinatorial problems with rational objective function

In the late seventies, Megiddo proposed a way to use an algorithm for the problem of minimizing a linear function a(0) + a(1)x(1) + ... + a(n)x(n) subject to certain constraints to solve the problem of minimizing a rational function of the form (a(0) + a(1)x(1) + ... + a(n)x(n))/(b(0) + b(1)x(1) + ... + b(n)x(n)) subject to the same set of constraints, assuming that the denominator is always positive. Using a rather strong assumption, Hashizume et al. extended Megiddo`s result to include approximation algorithms. Their assumption essentially asks for the existence of good approximation algorithms for optimization problems with possibly negative coefficients in the (linear) objective function, which is rather unusual for most combinatorial problems. In this paper, we present an alternative extension of Megiddo`s result for approximations that avoids this issue and applies to a large class of optimization problems. Specifically, we show that, if there is an alpha-approximation for the problem of minimizing a nonnegative linear function subject to constraints satisfying a certain increasing property then there is an alpha-approximation (1 1/alpha-approximation) for the problem of minimizing (maximizing) a nonnegative rational function subject to the same constraints. Our framework applies to covering problems and network design problems, among others.

A stopping rule while searching for optimal solution of facility-location

Solutions to combinatorial optimization, such as p-median problems of locating facilities, frequently rely on heuristics to minimize the objective function. The minimum is sought iteratively and a criterion is needed to decide when the procedure (almost) attains it. However, pre-setting the number of iterations dominates in OR applications, which implies that the quality of the solution cannot be ascertained. A small branch of the literature suggests using statistical principles to estimate the minimum and use the estimate for either stopping or evaluating the quality of the solution. In this paper we use test-problems taken from Baesley's OR-library and apply Simulated Annealing on these p-median problems. We do this for the purpose of comparing suggested methods of minimum estimation and, eventually, provide a recommendation for practioners. An illustration ends the paper being a problem of locating some 70 distribution centers of the Swedish Post in a region.

Predictor-Corrector Primal-Dual Interior Point Method for Solving Economic Dispatch Problems: A Postoptimization Analysis

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

A common Tabu search algorithm for the global optimization of engineering problems

A novel common Tabu algorithm for global optimizations of engineering problems is presented. The robustness and efficiency of the presented method are evaluated by using standard mathematical functions and hy solving a practical engineering problem. The numerical results show that the proposed method is (i) superior to the conventional Tabu search algorithm in robustness, and (ii) superior to the simulated annealing algorithm in efficiency. (C) 2001 Elsevier B.V. B.V. All rights reserved.

Bose-Einstein condensation dynamics from the numerical solution of the Gross-Pitaevskii equation

We study certain stationary and time-evolution problems of trapped Bose-Einstein condensates using the numerical solution of the Gross-Pitaevskii (GP) equation with both spherical and axial symmetries. We consider time-evolution problems initiated by suddenly changing the interatomic scattering length or harmonic trapping potential in a stationary condensate. These changes introduce oscillations in the condensate which are studied in detail. We use a time iterative split-step method for the solution of the time-dependent GP equation, where all nonlinear and linear non-derivative terms are treated separately from the time propagation with the kinetic energy terms. Even for an arbitrarily strong nonlinear term this leads to extremely accurate and stable results after millions of time iterations of the original equation.

Solution of the Poisson-Boltzmann equation for a system with four ionic species

The analytical solution of the Poisson-Boltzmann equation in an electrolyte with four ionic species (2:2:1:1), in the presence of a charged planar membrane or surface is presented. The function describing the mean electrical potential provides a convenient description that helps the understanding of electrical processes of biological interest.

On the solution of the extended linear complementarity problem

The extended linear complementarity problem (XLCP) has been introduced in a recent paper by Mangasarian and Pang. In the present research, minimization problems with simple bounds associated to this problem are defined. When the XLCP is solvable, their solutions are global minimizers of the associated problems. Sufficient conditions that guarantee that stationary points of the associated problems are solutions of the XLCP will be proved. These theoretical results support the conjecture that local methods for box constrained optimization applied to the associated problems could be efficient tools for solving the XLCP. (C) 1998 Elsevier B.V. All rights reserved.

Neural approach for solving several types of optimization problems

Neural networks consist of highly interconnected and parallel nonlinear processing elements that are shown to be extremely effective in computation. This paper presents an architecture of recurrent neural net-works that can be used to solve several classes of optimization problems. More specifically, a modified Hopfield network is developed and its inter-nal parameters are computed explicitly using the valid-subspace technique. These parameters guarantee the convergence of the network to the equilibrium points, which represent a solution of the problem considered. The problems that can be treated by the proposed approach include combinatorial optimiza-tion problems, dynamic programming problems, and nonlinear optimization problems.

Boussinesq solitary-wave as a multiple-time solution of the Korteweg-de Vries hierarchy

We study the Boussinesq equation from the point of view of a multiple-time reductive perturbation method. As a consequence of the elimination of the secular producing terms through the use of the Korteweg-de Vries hierarchy, we show that the solitary-wave of the Boussinesq equation is a solitary-wave satisfying simultaneously all equations of the Korteweg-de Vries hierarchy, each one in an appropriate slow time variable. © 1995 American Institute of Physics.

Optimal trajectory and solution of the inverse kinematics of a robotic manipulator by genetic algorithms

This paper presents the generation of optimal trajectories by genetic algorithms (GA) for a planar robotic manipulator. The implemented GA considers a multi-objective function that minimizes the end-effector positioning error together with the joints angular displacement and it solves the inverse kinematics problem for the trajectory. Computer simulations results are presented to illustrate this implementation and show the efficiency of the used methodology producing soft trajectories with low computing cost. © 2011 Springer-Verlag Berlin Heidelberg.

Numerical solution of the FENE-CR model in complex flows

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Numerical solution of the time dependent Ginzburg-Landau equations for mixed (d plus s)-wave superconductors

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Rubric Assessment of Mathematical Processes in Homework

In this action research study of my classroom of 11th grade geometry, I investigated the use of rubrics to help me assess my students during homework presentations. I wanted to know more about the processes students went through as they did their homework problems, so homework presentations were implemented with the rubrics being the main form of assessment. I discovered that students are willing to speak about mathematics and can gain more understanding of mathematical processes as a result of homework presentations. The scores of the class improved after they talked about the homework assignments with each other. As a result of this research, I plan to keep on using homework presentations in my classroom to talk about homework, but discontinue the use of rubrics in assessment of students in mathematics. I also found students going to the board to solve problems in small groups are another helpful way to use presentations prior to assessment to help me understand where the students are with a new concept prior to assigning homework or giving an assessment.

Analysis and numerical solution of the Peterlin viscoelastic model

Liquids and gasses form a vital part of nature. Many of these are complex fluids with non-Newtonian behaviour. We introduce a mathematical model describing the unsteady motion of an incompressible polymeric fluid. Each polymer molecule is treated as two beads connected by a spring. For the nonlinear spring force it is not possible to obtain a closed system of equations, unless we approximate the force law. The Peterlin approximation replaces the length of the spring by the length of the average spring. Consequently, the macroscopic dumbbell-based model for dilute polymer solutions is obtained. The model consists of the conservation of mass and momentum and time evolution of the symmetric positive definite conformation tensor, where the diffusive effects are taken into account. In two space dimensions we prove global in time existence of weak solutions. Assuming more regular data we show higher regularity and consequently uniqueness of the weak solution. For the Oseen-type Peterlin model we propose a linear pressure-stabilized characteristics finite element scheme. We derive the corresponding error estimates and we prove, for linear finite elements, the optimal first order accuracy. Theoretical error of the pressure-stabilized characteristic finite element scheme is confirmed by a series of numerical experiments.