We prove that non-recursive base conversion can always be implemented by using a deterministic Markov process. Our paper discusses the pros and cons of recursive and non-recursive methods, in general. And we include a...
This paper proposes a novel approach for identifying distributed dynamic loads in the time domain.Using polynomial andmodal analysis,the load is transformed intomodal space for coefficient identification.This allows t...
This work was supported by the National Natural Science Foundation of China(Grant No.62071248);the Natural Science Foundation of Nanjing University of Posts and Telecommunications(Grant No.NY223109);China Postdoctoral Science Foundation(Grant No.2022M721693).
Quantum physics is primarily concerned with real eigenvalues,stemming from the unitarity of time evolutions.With the introduction of PT symmetry,a widely accepted consensus is that,even if the Hamiltonian of the syste...
The Owen’s T function is presented in four new ways, one of them as a series similar to the Euler’s arctangent series divided by 2π, which is its majorant series. All possibilities enable numerically stable and ...
Supported by the National Natural Science Foundation of China(62262031);Science and Technology Key Project of Education Department of Jiangxi Province(GJJ2200302,GJJ210307);the Graduate Innovative Special Fund Projects of Jiangxi Province(YJS2022064)
The traditional program refinement strategy cannot be refined to an executable program,and there are issues such as low verification reliability and automation.To solve the above problems,this paper proposes a nonline...
In this manuscript,we study a new version of the optical recursional binormal microbeam model for a flexible binormal microscale beam in terms of a binormal normalized operator.Also,we give new explanations for the op...
New approach to systems of polynomial recursions is developed based on the Carleman linearization procedure. The article is divided into two main sections: firstly, we focus on the case of uni-variable depth-one polyn...
Supported by the National Natural Science Foundation of China (61862033, 61762049, 61902162);Jiangxi Provincial Natural Science Foundation (20202BABL202026, 20202BABL202025, 20202BAB202015)。
The development of algebraic and numerical algorithms is a kind of complicated creative work and it is difficult to guarantee the correctness of the algorithms. This paper introduces a systematic and unified formal de...
partially support by the Saudi Center for Theoretical Physics(SCTP).
We present a formulation of quantum mechanics based on the theory of orthogonal polynomials.The wavefunction is expanded over a complete set of square integrable basis where the expansion coefficients are orthogonal p...
supported by the National Natural Science Foundation of China(No.11571192);the Natural Science Foundation of Ningbo(No.2015A610157);K.C.Wong Magna Fund in Ningbo University
In this paper, the authors define the noncommutative constrained KadomtsevPetviashvili(KP) hierarchy and multi-component noncommutative constrained KP hierarchy. Then they give the recursion operators for the noncommu...