Darboux transformation and Rogue waves of the Kundu–nonlinear Schrödinger equation

In this paper, the Darboux transformation of the Kundu–nonlinear Schrödinger equation is derived and generalized to the matrix of n‐fold Darboux transformation. From known solution Q, the determinant representation of n‐th new solutions of Q^[n] are obtained by the n‐fold Darboux transformation. Then soliton solutions and positon solutions are generated from trivial seed solutions, breather solutions and rogue wave solutions that are obtained from periodic seed solutions. After that, the higher order rogue wave solutions of the Kundu–nonlinear Schrödinger equation are given. We show that free parameters in eigenfunctions can adjust the patterns of the higher order rogue waves. Meanwhile, the third‐order rogue waves are given explicitly. Copyright © 2014 John Wiley & Sons, Ltd.     

Surfaces and Curves Corresponding to the Solutions Generated from Periodic“Seed”of NLS Equation

The solutions q [n] generated from a periodic "seed" q = cei(as+bt) of the nonlinear Schrdinger(NLS) by n-fold Darboux transformation is represented by determinant.Furthermore,the s-periodic solution and t-periodic solution are given explicitly by using q [1].The curves and surfaces(F1,F2,F3) associated with q [n] are given by means of Sym formula.Meanwhile,we show periodic and asymptotic properties of these curves.     

Determinant representation of Darboux transformation for the AKNS system

The n-fold Darboux transform (DT) is a 2×2 matrix for the Ablowitz-Kaup-Newell-Segur (AKNS) system. In this paper, each element of this matrix is expressed by 2n 1 ranks' determinants. Using these formulae, the determinant expressions of eigenfunctions generated by the n-fold DT are obtained. Furthermore, we give out the explicit forms of the n-soliton surface of the Nonlinear Schrodinger Equation (NLS) by the determinant of eigenfunctions.     

Fast rectangular matrix multiplication and some applications

We study asymptotically fast multiplication algorithms for matrix pairs of arbitrary di- mensions, and optimize the exponents of their arithmetic complexity bounds. For a large class of input matrix pairs, we improve the known exponents. We also show some applications of our results:(i) we decrease from O(n~2 n~(1 o)(1)logq)to O(n~(1.9998) n~(1 o(1))logq)the known arithmetic complexity bound for the univariate polynomial factorization of degree n over a finite field with q elements; (ii) we decrease from 2.837 to 2.7945 the known exponent of the work and arithmetic processor bounds for fast deterministic(NC)parallel evaluation of the determinant, the characteristic polynomial, and the inverse of an n×n matrix, as well as for the solution to a nonsingular linear system of n equations; (iii)we decrease from O(m~(1.575)n)to O(m~(1.5356)n)the known bound for computing basic solutions to a linear programming problem with m constraints and n variables.     

A new look at the doubling algorithm for a structured palindromic quadratic eigenvalue problem

Recently, Guo and Lin [SIAM J. Matrix Anal. Appl., 31 (2010), 2784–2801] proposed an efficient numerical method to solve the palindromic quadratic eigenvalue problem (PQEP) (λ²A^T+λQ + A)z = 0 arising from the vibration analysis of high speed trains, where have special structures: both Q and A are, among others, m × m block matrices with each block being k × k (thus, n = mk), and moreover, Q is block tridiagonal, and A has only one nonzero block in the (1,m)th block position. The key intermediate step of the method is the computation of the so‐called stabilizing solution to the n × n nonlinear matrix equation X + A^TX⁻¹A = Q via the doubling algorithm. The aim of this article is to propose an improvement to this key step through solving a new nonlinear matrix equation having the same form but of only k × k in size. This new and much smaller matrix equation can also be solved by the doubling algorithm. For the same accuracy, it takes the same number of doubling iterations to solve both the larger and the new smaller matrix equations, but each doubling iterative step on the larger equation takes about 4.8 as many flops than the step on the smaller equation. Replacing Guo's and Lin's key intermediate step by our modified one leads to an alternative method for the PQEP. This alternative method is faster, but the improvement in speed is not as dramatic as just for solving the respective nonlinear matrix equations and levels off as m increases. Numerical examples are presented to show the effectiveness of the new method. Copyright © 2014 John Wiley & Sons, Ltd.     

The Constrained Solutions of Two Matrix Equations

We study the symmetric positive semidefinite solution of the matrix equation AX ₁ A ^T + BX ₂ B ^T = C, where A is a given real m×n matrix, B is a given real m×p matrix, and C is a given real m×m matric, with m, n, p positive integers; and the bisymmetric positive semidefinite solution of the matrix equation D ^T XD = C, where D is a given real n×m matrix, C is a given real m×m matrix, with m, n positive integers. By making use of the generalized singular value decomposition, we derive general analytic formulae, and present necessary and sufficient conditions for guaranteeing the existence of these solutions. Received December 17, 1999, Revised January 10, 2001, Accepted March 5, 2001     

A functional equation arising from multiplication of quantum integers

For the quantum integer [n]_q=1+q+q²+?+qⁿ⁻¹ there is a natural polynomial multiplication such that [m]_q⊗_q[n]_q=[mn]_q. This multiplication leads to the functional equation f_m(q)f_n(q^m)=f_mn(q), defined on a given sequence of polynomials. This paper contains various results concerning the construction and classification of polynomial sequences that satisfy the functional equation, as well open problems that arise from the functional equation.     

Superconvergence of the direct discontinuous Galerkin method for a time‐fractional initial‐boundary value problem

A time‐fractional reaction–diffusion initial‐boundary value problem with periodic boundary condition is considered on Q ? Ω × [0, T] , where Ω is the interval [0, l] . Typical solutions of such problem have a weak singularity at the initial time t = 0. The numerical method of the paper uses a direct discontinuous Galerkin (DDG) finite element method in space on a uniform mesh, with piecewise polynomials of degree k ≥ 2 . In the temporal direction we use the L1 approximation of the Caputo derivative on a suitably graded mesh. We prove that at each time level of the mesh, our L1‐DDG solution is superconvergent of order k + 2 in L²(Ω) to a particular projection of the exact solution. Moreover, the L1‐DDG solution achieves superconvergence of order (k + 2) in a discrete L²(Q) norm computed at the Lobatto points, and order (k + 1) superconvergence in a discrete H¹(Q) seminorm at the Gauss points; numerical results show that these estimates are sharp.     

A numerical method for computing radially symmetric solutions of a dissipative nonlinear modified Klein‐Gordon equation

In this article we develop a finite‐difference scheme to approximate radially symmetric solutions of a dissipative nonlinear modified Klein‐Gordon equation subject to smooth initial conditions ? and ψ in an open sphere D around the origin, with constant internal and external damping coefficients—β and γ, respectively—, and nonlinear term of the form G′(w) = w^p, with p > 1 an odd number. The functions ? and ψ are radially symmetric in D, and ?, ψ, r?, and rψ are assumed to be small at infinity. We prove that our scheme is consistent order ??(Δt²) + ??(Δr²) for G′ identically equal to zero and provide a necessary condition for it to be stable order n. Part of our study will be devoted to compare the physical effects of β and γ. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005     

The generalized centro‐symmetric and least squares generalized centro‐symmetric solutions of the matrix equation AYB + CYTD = E

An n×n real matrix P is said to be a symmetric orthogonal matrix if P = P^?1 = P^T. An n × n real matrix Y is called a generalized centro‐symmetric with respect to P, if Y = PYP. It is obvious that every matrix is also a generalized centro‐symmetric matrix with respect to I. In this work by extending the conjugate gradient approach, two iterative methods are proposed for solving the linear matrix equation and the minimum Frobenius norm residual problem over the generalized centro‐symmetric Y, respectively. By the first (second) algorithm for any initial generalized centro‐symmetric matrix, a generalized centro‐symmetric solution (least squares generalized centro‐symmetric solution) can be obtained within a finite number of iterations in the absence of round‐off errors, and the least Frobenius norm generalized centro‐symmetric solution (the minimal Frobenius norm least squares generalized centro‐symmetric solution) can be derived by choosing a special kind of initial generalized centro‐symmetric matrices. We also obtain the optimal approximation generalized centro‐symmetric solution to a given generalized centro‐symmetric matrix Y₀ in the solution set of the matrix equation (minimum Frobenius norm residual problem). Finally, some numerical examples are presented to support the theoretical results of this paper. Copyright © 2011 John Wiley & Sons, Ltd.     

Efficient generation of random nonsingular matrices

We present an efficient algorithm for generating an n × n nonsingular matrix uniformly over a finite field. This algorithm is useful for several cryptographic and checking applications. Over GF[2] our algorithm runs in expected time M(n) + O(n²), where M(n) is the time needed to multiply two n × n matrices, and the expected number of random bits it uses is n² + 3. (Over other finite fields we use n² + O(1) random field elements on average.) This is more efficient than the standard method for solving this problem, both in terms of expected running time and the expected number of random bits used. The standard method is to generate random n × n matrices until we produce one with nonzero determinant. In contrast, our technique directly produces a random matrix guaranteed to have nonzero determinant. We also introduce efficient algorithms for related problems such as uniformly generating singular matrices or matrices with fixed determinant. © 1993 John Wiley & Sons, Inc.     

Asymptotic behavior of solutions to viscous conservation laws with slowly varying external forces

This paper considers the existence and large time behavior of solutions to the convection-diffusion equation u _t −Δu+b(x)·∇(u|u| ^{q −1})=f(x, t) in ℝ ⁿ ×[0,∞), where f(x, t) is slowly decaying and q≥1+1/n (or in some particular cases q≥1). The initial condition u ₀ is supposed to be in an appropriate L ^p space. Uniform and nonuniform decay of the solutions will be established depending on the data and the forcing term.This work is partially supported by an AMO Grant     

Asymptotic Behavior of Variable-Coefficient Toeplitz Determinants

For a continuous function s\sigma defined on [0,1]×\mathbbT[0,1]\times\mathbb{T}, let \ops\op\sigma stand for the (n+1)×(n+1)(n+1)\times(n+1) matrix whose (j,k)(j,k)-entries are equal to \frac1 2pò₀^2p s( \fracjn,e^iq) e^-i(j-k)q  dq,        j,k = 0,1,...,n . \displaystyle \frac{1} {2\pi}\int_0^{2\pi} \sigma \left( \frac{j}{n},e^{i\theta}\right) e^{-i(j-k)\theta} \,d\theta, \qquad j,k =0,1,\dots,n~. These matrices can be thought of as variable-coefficient Toeplitz matrices or as the discrete analogue of pseudodifferential operators. Under the assumption that the function s\sigma possesses a logarithm which is sufficiently smooth on [0,1]×\mathbbT[0,1]\times\mathbb{T}, we prove that the asymptotics of the determinants of \ops\op\sigma are given by det[\ops] ~ G[s]⁽ⁿ⁺¹⁾E[s]     \text as   n?￥ , \det \left[\op\sigma\right] \sim G[\sigma]^{(n+1)}E[\sigma] \quad \text{ as \ } n\to\infty~, where G[s]G[\sigma] and E[s]E[\sigma] are explicitly determined constants. This formula is a generalization of the Szegö Limit Theorem. In comparison with the classical theory of Toeplitz determinants some new features appear.     

Young‐measure solutions to a generalized Benjamin–Bona–Mahony equation

We consider the evolution of microstructure under the dynamics of the generalized Benjamin–Bona–Mahony equation (1) with u: ?² → ?. If we model the initial microstructure by a sequence of spatially faster and faster oscillating classical initial data vⁿ, we obtain a sequence of spatially highly oscillatory classical solutions uⁿ. By considering the Young measures (YMs) ν and µ generated by the sequences vⁿ and uⁿ, respectively, as n → ∞, we derive a macroscopic evolution equation for the YM solution µ, and show exemplarily how such a measure‐valued equation can be exploited in order to obtain classical evolution equations for effective (macroscopic) quantities of the microstructure for suitable initial data vⁿ and non‐linearities f. Copyright © 2005 John Wiley & Sons, Ltd.     

Divergence of Infinite-Variance Nonradial Solutions to the 3D NLS Equation

We consider solutions u(t) to the 3d NLS equation i? _t u + Δu + |u|² u = 0 such that ‖xu(t)‖ _{L ²}  = ∞ and u(t) is nonradial. Denoting by M[u] and E[u], the mass and energy, respectively, of a solution u, and by Q(x) the ground state solution to ?Q + ΔQ + |Q|² Q = 0, we prove the following: if M[u]E[u] < M[Q]E[Q] and ‖u ₀‖ _{L ²} ‖?u ₀‖ _{L ²}  > ‖Q‖ _{L ²} ‖?Q‖ _{L ²} , then either u(t) blows-up in finite positive time or u(t) exists globally for all positive time and there exists a sequence of times t _n  → + ∞ such that ‖?u(t _n )‖ _{L ²}  → ∞. Similar statements hold for negative time.     

Random lifts of graphs: Independence and chromatic number

For a graph G, a random n‐lift of G has the vertex set V(G)×[n] and for each edge [u, v] ∈ E(G), there is a random matching between {u}×[n] and {v}×[n]. We present bounds on the chromatic number and on the independence number of typical random lifts, with G fixed and n→∞. For the independence number, upper and lower bounds are obtained as solutions to certain optimization problems on the base graph. For a base graph G with chromatic number χ and fractional chromatic number χ_f, we show that the chromatic number of typical lifts is bounded from below by const ? and also by const ? χ_f/log²χ_f (trivially, it is bounded by χ from above). We have examples of graphs where the chromatic number of the lift equals χ almost surely, and others where it is a.s. O(χ/logχ). Many interesting problems remain open. © 2002 John Wiley & Sons, Inc. Random Struct. Alg., 20, 1–22, 2002     

Global boundary regularity for the $ \bar \partial $‐equation on q‐pseudoconvex domains

We introduce a notion of q ‐pseudoconvex domain of new type for a bounded domain of ?ⁿ and prove that for given a ‐closed (p, r)‐form, r ≥ q, that is smooth up to the boundary, there exists a (p, r – 1)‐form smooth up to the boundary which is a solution of ‐equation on a bounded q ‐pseudoconvex domain. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Boundedness properties of the difference equation x n+1=(α+βx n +δx n−2)/(x n−1)

Consider the third-order difference equation x _n+1 = (α+βx _n +δx _n ? 2)/(x _n ? 1) with α ∈ [0,∞) and β,δ ∈ (0,∞). It is shown that this difference equation has unbounded solutions if and only if δ>β.     

Generalized Stokes resolvent equations in an infinite layer with mixed boundary conditions

In this paper we prove unique solvability of the generalized Stokes resolvent equations in an infinite layer Ω₀ = ℝ^{n –1} × (–1, 1), n ≥ 2, in L^q ‐Sobolev spaces, 1 < q < ∞, with slip boundary condition of on the “upper boundary” ∂Ω⁺₀ = ℝ^{n –1} × {1} and non‐slip boundary condition on the “lower boundary” ∂Ω^–₀ = ℝ^{n –1} × {–1}. The solution operator to the Stokes system will be expressed with the aid of the solution operators of the Laplace resolvent equation and a Mikhlin multiplier operator acting on the boundary. The present result is the first step to establish an L^q ‐theory for the free boundary value problem studied by Beale [9] and Sylvester [22] in L ²‐spaces. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

nth order Stieltjes differential boundary operators and Stieltjes differential boundary systems

This article discusses linear differential boundary systems, which include nth-order differential boundary relations as a special case, in $\text{L}$_n^p[0,1] × $\text{L}$_n^p[0,1], 1 ? p < ∞. The adjoint relation in $\text{L}$_n^q[0,1] × $\text{L}$_n^q[0,1], $\text{1}\text{p}\text{+}\text{1}\text{q}\text{= 1}$, is derived. Green's formula is also found. Self-adjoint relations are found in $\text{L}$_n²[0,1] × $\text{L}$_n²[0,1], and their connection with Coddington's extensions of symmetric operators on subspaces of $\text{L}$_n^p[0,1] × $\text{L}$_n²[0,1] is established.