Artificial time integration

Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18     

The Exact Solutions of Some (2 + 1)-Dimensional Integrable Systems

The equivalence of three (2 1)-dimensional soliton equations is proved, and the quite generalsolutionswitha some arbitrary functions of x, t and y respectively are obtained. By selecting the arbitrary functions, many specialtypes of the localized excitations like the solitoff solitons, multi-dromion solutions, lump, and multi-ring soliton solutionsare obtained.     

Effect of Weakly Transverse Perturbations on Dust Acoustic Solitary Waves with Adiabatic Variation of Dust Charge

By employing the reductive perturbation technique we derived a Kadomtsev-Petviashvili equation forunmagnetized dusty plasmas. It suggests that the nonlinear dust acoustic solitary waves with adiabatic variation of dustcharge are stable even there are some higher order transverse perturbatoins. There are only rarefactive solitary wavesfor this system which has been verified analytically in this paper.     

~ Transform Demonstration of Dark Soliton Solutions Found by Inverse Scattering

One of the basic problems about the inverse scattering transform for solving a completely integrable nonlinear evolutions equation is to demonstrate that the Jost solutions obtained from the inverse scattering equations of Cauchy integral satisfy the Lax equations. Such a basic problem still exists in the procedure of deriving the dark soliton solutions of the NLS equation in normal dispersion with non-vanishing boundary conditions through the inverse scattering transform. In this paper, a pair of Jost solutions with same analytic properties are composed to be a 2 × 2 matrix and then another pair are introduced to be its right inverse confirmed by the Liouville theorem. As they are both 2 × 2 matrices, the right inverse should be the left inverse too, based upon which it is not difficult to show that these Jost solutions satisfy both the first and second Lax equations. As a result of compatibility condition, the dark soliton solutions definitely satisfy the NLS equation in normal dispersion with non-vanishing boundary conditions.     

Difference discrete connection and curvature on cubic lattice Dedicated to Professor Sheng GONG on the occasion of his 75th birthday

In a way similar to the continuous case formally, we define in different but equivalent manners the difference discrete connection and curvature on discrete vector bundle over the regular lattice as base space. We deal with the difference operators as the discrete counterparts of the derivatives based upon the differential calculus on the lattice. One of the definitions can be extended to the case over the random lattice. We also discuss the relation between our approach and the lattice gauge theory and apply to the discrete integrable systems.     

On Characterizations of Proper Efficiency for Nonconvex Multiobjective Optimization

In this paper, nonconvex multiobjective optimization problems are studied. New characterizations of a properly efficient solution in the sense of Geoffrion's are established in terms of the stability of one scalar optimization problem and the existence of an exact penalty function of a scalar constrained program, respectively. One of the characterizations is applied to derive necessary conditions for a properly efficient control-parameter pair of a nonconvex multiobjective discrete optimal control problem with linear constraints.     

Integral-Type Darboux Transformations for the mKdV Hierarchy with Self-Consistent Sources

We present integral-type Darboux transformation for the mKdV hierarchy and for the mKdV hierarchy withself-consistent sources. In contrast with the normal Darboux transformation, the integral-type Darboux transformationscan offer non-auto-Backlund transformation between two (2n 1)-th mKdV equations with self-consistent sources withdifferent degrees. This kind of Darboux transformation enables us to construct the N-soliton solution for the mKdVhierarchy with self-consistent sources. We also propose the formulas for the m times repeated integral-type Darbouxtransformations for both mKdV hierarchy and mKdV hierarchy with self-consistent sources.     

Numerical analysis of the Toda lattice equations

Numerical solutions to three systems of integrable evolutionary equations from the Toda lattice hierarchy are analyzed. These are the classical Toda lattice, the second local dispersive flow, and the second extended dispersive flow. Special attention is given to the properties of soliton solutions. For the equations of the second local flow, two types of solitons interacting in a special manner are found. Solutions corresponding to various initial data are qualitatively outlined.     

Speedup estimates for some variants of the parallel implementations of the branch-and-bound method

The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered.     

Global Parametric Sufficient Optimality Conditions for Semi-infinite Discrete Minmax Fractional Programming Problems Involving Generalized （η,ρ）-invex Functions

In this paper,we discuss a large number of sets of global parametric sufficient optimality condi-tions under various gcneralized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programmingproblem.