The capability of Extended tanh–coth, sine–cosine and Exp-Function methods as alternative approaches to obtain the analytic solution of different types of applied differential equations in engineering mathematics has been revealed. In this study, the generalized nonlinear Schrödinger (GNLS) equation is solved by three different methods. To obtain the single-soliton solutions for the equation, t...

Fourier transform is an essential ingredient in Shor’s factoring algorithm. In the standard quantum circuit model with the gate set U 2 , controlled-NOT , the discrete Fourier transforms FN= ij N N, i , j=0,1 ,... ,N −1, =e2 i/N, can be realized exactly by quantum circuits of size O n2 , n=ln N, and so can the discrete sine or cosine transforms. In topological quantum computing, the simplest un...

We derive a new algorithm for computing the action f(A)V of the cosine, sine, hyperbolic cosine, and hyperbolic sine of a matrix A on a matrix V , without first computing f(A). The algorithm can compute cos(A)V and sin(A)V simultaneously, and likewise for cosh(A)V and sinh(A)V , and it uses only real arithmetic when A is real. The algorithm exploits an existing algorithm expmv of Al-Mohy and Hi...

The Clenshaw Curtis method for numerical integration is extended to semiinfinite ([_0, 30] and infinite [-0% oc] intervals. The common framework for both these extensions and for integration on a finite interval is to (1) map the integration domain to tc[0, z], (2) compute a Fourier sine or cosine approximation to the transformd integrand via interpolation, and (3) integrate the approximation. ...