Coherence imaging by use of a Newton rings sampling function

We show that, with suitable optics in the arm of a Michelson interferometer, orthogonal galvo-scanning mirrors build a sampling function in the form of Newton rings when the two interferometer arms are matched. Using a low-coherence source, one can obtain transversal depth-resolved images. A fast display procedure using a storage oscilloscope was devised based on this method.

Coherence imaging by use of a Newton rings sampling function

We show that, with suitable optics in the arm of a Michelson interferometer, orthogonal galvo-scanning mirrors build a sampling function in the form of Newton rings when the two interferometer arms are matched. Using a low-coherence source, one can obtain transversal depth-resolved images. A fast display procedure using a storage oscilloscope was devised based on this method.

Introduction to the Maple Power Tool Intpakx

The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006

Solving Ratio-Dependent Predator-Prey System with Constant Effort Harvesting using Variational Iteration Method

Due to wide range of interest in use of bio-economic models to gain insight into the scientific management of renewable resources like fisheries and forestry,variational iteration method (VIM) is employed to approximate the solution of the ratio-dependent predator-prey system with constant effort prey harvesting.The results are compared with the results obtained by Adomian decomposition method and reveal that VIM is very effective and convenient for solving nonlinear differential equations.

Stability of the Iteration Method for non Expansive Mappings

The general iteration method for nonexpansive mappings on a Banach space is considered. Under some assumption of fast enough convergence on the sequence of (“almost” nonexpansive) perturbed iteration mappings, if the basic method is τ−convergent for a suitable topology τ weaker than the norm topology, then the perturbed method is also τ−convergent. Application is presented to the gradient-prox method for monotone inclusions in Hilbert spaces.

Uniform Convergence of the Newton Method for Aubin Continuous Maps

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

Semi-Smooth Newton Methods for the Time Optimal Control of Nonautonomous Ordinary Differential Equations

AMS Subj. Classification: 49J15, 49M15

On The Critical Points of some Iteration Methods for Solving Algebraic Equations. Global Convergence Properties

In this work we give su±cient conditions for k-th approximations of the polynomial roots of f(x) when the Maehly{Aberth{Ehrlich, Werner-Borsch-Supan, Tanabe, Improved Borsch-Supan iteration methods fail on the next step. For these methods all non-attractive sets are found. This is a subsequent improvement of previously developed techniques and known facts. The users of these methods can use the results presented here for software implementation in Distributed Applications and Simulation Environ- ments. Numerical examples with graphics are shown.

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

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

Courbure et Polygone de Newton

2000 Mathematics Subject Classification: 26E35, 14H05, 14H20.

The creation of Huey P. Newton

The purpose of this study was to examine the creation of Huey P. Newton, founder of the Black Panther Party in 1966. I argued that Huey P. Newton was a creation of several elements: the black ghetto of Oakland; the rise of Black Power and the death of non-violence in the civil rights movement; the New Left and its factions; and, the Black Panther Party through the "Free Huey" campaign. The "Free Huey" campaign that arose from Newton's imprisonment in 1968, constructed an iconic image of Newton that he inherited on his release in 1970. This study will contextualize Newton and refute the claims of Hugh Pearson, author of the 1994, The Shadow of the Panther, who deemed Newton as a common criminal, not worthy of historical debate.

An Efficient Precoder Design for Multiuser MIMO Cognitive Radio Networks with Interference Constraints

We consider a linear precoder design for an underlay cognitive radio multiple-input multiple-output broadcast channel, where the secondary system consisting of a secondary base-station (BS) and a group of secondary users (SUs) is allowed to share the same spectrum with the primary system. All the transceivers are equipped with multiple antennas, each of which has its own maximum power constraint. Assuming zero-forcing method to eliminate the multiuser interference, we study the sum rate maximization problem for the secondary system subject to both per-antenna power constraints at the secondary BS and the interference power constraints at the primary users. The problem of interest differs from the ones studied previously that often assumed a sum power constraint and/or single antenna employed at either both the primary and secondary receivers or the primary receivers. To develop an efficient numerical algorithm, we first invoke the rank relaxation method to transform the considered problem into a convex-concave problem based on a downlink-uplink result. We then propose a barrier interior-point method to solve the resulting saddle point problem. In particular, in each iteration of the proposed method we find the Newton step by solving a system of discrete-time Sylvester equations, which help reduce the complexity significantly, compared to the conventional method. Simulation results are provided to demonstrate fast convergence and effectiveness of the proposed algorithm.