An Implementation for the Algorithm of Janet bases of Linear Differential Ideals in the Maple System

In this paper, an algorithm for computing the Janet bases of linear differential equations is described, which is the differential analogue of the algorithm JanetBasis improved by Gerdt. An implementation of the algorithm in Maple is given. The implemented algorithm includes some subalgorithms: Janet division,Pommaret division, the judgement of involutive divisor and reducible, the judgement of conventional divisor and reducible, involutive normal form and conventional normal form, involutive autoreduction and conventional autoreduction, PJ-autoreduction and so on. As an application, the Janet Bases of the determining system of classical Lie symmetries of some partial differential equations are obtained using our package.     

On the Computation of Square Roots in Finite Fields

In this paper, two improvements for computing square roots in finite fields are presented. Firstly, we give a simple extension of a method by O. Atkin, which requires two exponentiations in FM _q , when q9 mod 16. Our second method gives a major improvement to the Cipolla–Lehmer algorithm, which is both easier to implement and also much faster. While our method is independent of the power of 2 in q–1, its expected running time is equivalent to 1.33 as many multiplications as exponentiation via square and multiply. Several numerical examples are given that show the speed-up of the proposed methods, compared to the routines employed by Mathematica, Maple, respectively Magma.     

An Incremental Algorithm for the Maximum Flow Problem

An incremental algorithm may yield an enormous computational time saving to solve a network flow problem. It updates the solution to an instance of a problem for a unit change in the input. In this paper we have proposed an efficient incremental implementation of maximum flow problem after inserting an edge in the network G. The algorithm has the time complexity of O((n)² m), where n is the number of affected vertices and m is the number of edges in the network. We have also discussed the incremental algorithm for deletion of an edge in the network G.     

Explicit Finitism

This paper takes the first steps in developing a theory of explicit finitism which puts explicit limits on the size of finite objects. We provide motivation in the physics of computation sense, survey some of the difficulties and describe the appropriate computing machinery. We introduce the subset J of the real numbers that is the central mathematical object emerging from considerations of explicit finitism, and take the first steps in studying its properties.     

Statistical properties of eigenvalues for an operating quantum computer with static imperfections

We investigate the transition to quantum chaos, induced by static imperfections, for an operating quantum computer that simulates efficiently a dynamical quantum system, the sawtooth map. For the different dynamical regimes of the map, we discuss the quantum chaos border induced by static imperfections by analyzing the statistical properties of the quantum computer eigenvalues. For small imperfection strengths the level spacing statistics is close to the case of quasi-integrable systems while above the border it is described by the random matrix theory. We have found that the border drops exponentially with the number of qubits, both in the ergodic and quasi-integrable dynamical regimes of the map characterized by a complex phase space structure. On the contrary, the regime with integrable map dynamics remains more stable against static imperfections since in this case the border drops only algebraically with the number of qubits. Received 19 June 2002 / Received in final form 30 September 2002 Published online 17 Decembre 2002 RID="a" ID="a"e-mail: dima@irsamc.ups-tlse.fr RID="b" ID="b"UMR 5626 du CNRS     

On nonoscillating integrals for computing inhomogeneous Airy functions

Integral representations are considered of solutions of the inhomogeneous Airy differential equation . The solutions of these equations are also known as Scorer functions. Certain functional relations for these functions are used to confine the discussion to one function and to a certain sector in the complex plane. By using steepest descent methods from asymptotics, the standard integral representations of the Scorer functions are modified in order to obtain nonoscillating integrals for complex values of . In this way stable representations for numerical evaluations of the functions are obtained. The methods are illustrated with numerical results.

     

Performance of equal phase-shift search for one iteration

Grover presented the phase-shift search by replacing the selective inversions by selective phase shifts of π/3. In this paper, we investigate the phase-shift search with general equal phase shifts. We show that for small uncertainties, the failure probability of the phase-π/3 search is smaller than the general phase-shift search and for large uncertainties, the success probability of the large phase-shift search is larger than the phase-π/3 search. Therefore, the large phase-shift search is suitable for large-size of databases.     

Three‐dimensional computation for flow‐induced vibrations in in‐line and cross‐flow directions of a circular cylinder

We present numerical results for in‐line and cross‐flow vibrations of a circular cylinder, which is immersed in a uniform flow and is elastically supported by damper‐spring systems to compute vibrations of a rigid cylinder. In the case of a circular cylinder with a low Scruton number, it is well‐known that two types of self‐excited vibrations appear in the in‐line direction in the range of low reduced velocities. On the other hand, a cross‐flow vibration of the circular cylinder can be excited in the range of high reduced velocities. Therefore, we compute the flow‐induced vibrations of the circular cylinder in the wide range of the reduced velocities at low and high Scruton numbers and discuss about excitation mechanisms in the in‐line and cross‐flow directions. Copyright © 2011 John Wiley & Sons, Ltd.     

Quantum superposition of localized and delocalized phases of photons

Based on a variant of 2-site Jaynes–Cummings–Hubbard model constructed using superconducting circuits, we propose a method to coherently superpose the localized and delocalized phases of microwave photons, which makes it possible to engineer the collective features of multiple photons in the quantum way using an individual two-level system. Our proposed architecture is also a promising candidate for implementing distributed quantum computation since it is capable of coupling remote qubits in separate resonators in a controllable way.