Search

In this paper, an efficient multiscale finite element method via local defect-correction technique is developed. This method is used to solve the Schrödinger eigenvalue problem with three-dimensional domain. First, this paper considers a three-dimensional bounded spherical region, which is the truncation of a three-dimensional unbounded region. Using polar coordinate transformation, we successfully transform the three-dimensional problem into a series of one-dimensional eigenvalue problems. These one-dimensional eigenvalue problems also bring singularity. Second, using local refinement technique, we establish a new multiscale finite element discretization method. The scheme can correct the defects repeatedly on the local refinement grid, which can solve the singularity problem efficiently. Finally, the error estimates of eigenvalues and eigenfunctions are also proved. Numerical examples show that our numerical method can significantly improve the accuracy of eigenvalues.

Diffusion equations with Riemann–Liouville fractional derivatives are Volterra integro-partial differential equations with weakly singular kernels and present fundamental challenges for numerical computation. In this paper, we make a convergence analysis of the Schwarz waveform relaxation (SWR) algorithms with Robin transmission conditions (TCs) for these problems. We focus on deriving good choice of the parameter involved in the Robin TCs, at the continuous and fully discretized level. Particularly, at the space-time continuous level, we show that the derived Robin parameter is much better than the one predicted by the well-understood equioscillation principle. At the fully discretized level, the problem of determining a good Robin parameter is studied in the convolution quadrature framework, which permits us to precisely capture the effects of different temporal discretization methods on the convergence rate of the SWR algorithms. The results obtained in this paper will be preliminary preparations for our further study of the SWR algorithms for integro-partial differential equations.

In order to solve the complicated process and low efficiency and low accuracy of solving a class of matrix equations, this paper introduces the linear saturated system model neural network architecture to solve the bisymmetric solution of a class of matrix equations. Firstly, a class of matrix equations is constructed to determine the key problems of solving the equations. Secondly, the linear saturated system model neural network structure is constructed to determine the characteristic parameters in the process of bisymmetric solution. Then, the matrix equations is solved by using backpropagation neural network topology. Finally, the class normalization is realized by using the objective function of bisymmetric solution, and the bisymmetric solution of a class of matrix equations is realized. In order to verify the solving effect of the method in this paper, three indexes (accuracy, correction accuracy, and solving time) are designed in the experiment. The experimental results show that the proposed method can effectively reduce the solving time, can improve the accuracy and correction effect of the bisymmetric solution, and has high practicability.

This paper presents some new formulas and properties of the generalized fractional derivative with non-singular kernel that covers various types of fractional derivatives such as the Caputo–Fabrizio fractional derivative, the Atangana–Baleanu fractional derivative, and the weighted Atangana–Baleanu fractional derivative. These new properties extend many recent results existing in the literature. Furthermore, the paper proposes some interesting inequalities that estimate the generalized fractional derivatives of some specific functions. These inequalities can be used to construct Lyapunov functions with the aim to study the global asymptotic stability of several fractional-order systems arising from diverse fields of science and engineering.

This paper proposes a new class of difference methods with intrinsic parallelism for solving the Burgers–Fisher equation. A new class of parallel difference schemes of pure alternating segment explicit-implicit (PASE-I) and pure alternating segment implicit-explicit (PASI-E) are constructed by taking simple classical explicit and implicit schemes, combined with the alternating segment technique. The existence, uniqueness, linear absolute stability, and convergence for the solutions of PASE-I and PASI-E schemes are well illustrated. Both theoretical analysis and numerical experiments show that PASE-I and PASI-E schemes are linearly absolute stable, with 2-order time accuracy and 2-order spatial accuracy. Compared with the implicit scheme and the Crank–Nicolson (C-N) scheme, the computational efficiency of the PASE-I (PASI-E) scheme is greatly improved. The PASE-I and PASI-E schemes have obvious parallel computing properties, which show that the difference methods with intrinsic parallelism in this paper are feasible to solve the Burgers–Fisher equation.

In this paper, by using the partial order method, the existence and uniqueness of a solution for systems of a class of abstract operator equations in Banach spaces are discussed. The result obtained in this paper improves and unifies many recent results. Two applications to the system of nonlinear differential equations and the systems of nonlinear differential equations in Banach spaces are given, and the unique solution and interactive sequences which converge the unique solution and the error estimation are obtained.

Linearized model of the system is often used in control design. It is generally believed that we can obtain the linearized model as long as the Taylor expansion method is used for the nonlinear model. This paper points out that the Taylor expansion method is only applicable to the linearization of the original nonlinear function. If the Taylor expansion is used for the derived nonlinear equation, wrong results are often obtained. Taking the linearization model of the maglev system as an example, it is shown that the linearization should be carried out with the process of equation derivation. The model is verified by nonlinear system simulation in Simulink. The method in this paper is helpful to write the linearized equation of the control system correctly.

An adaptive high-order difference solution about a 2D nonlinear degenerate singular reaction-diffusion equation with a convection term is initially proposed in the paper. After the first and the second central difference operator approximating the first-order and the second-order spatial derivative, respectively, the higher-order spatial derivatives are discretized by applying the Taylor series rule and the temporal derivative is discretized by using the Crank–Nicolson (CN) difference scheme. An alternating direction implicit (ADI) scheme with a nonuniform grid is built in this way. Meanwhile, accuracy analysis declares the second order in time and the fourth order in space under certain conditions. Sequentially, the high-order scheme is performed on an adaptive mesh to demonstrate quenching behaviors of the singular parabolic equation and analyse the influence of combustion chamber size on quenching. The paper displays rationally that the proposed scheme is practicable for solving the 2D quenching-type problem.

This paper considers some multiscale radial basis function collocation methods for solving the two-dimensional Monge–Ampère equation with Dirichlet boundary. We discuss and study the performance of the three kinds of multiscale methods. The first method is the cascadic meshfree method, which was proposed by Liu and He (2013). The second method is the stationary multilevel method, which was proposed by Floater and Iske (1996), and is used to solve the fully nonlinear partial differential equation in the paper for the first time. The third is the hierarchical radial basis function method, which is constructed by employing successive refinement scattered data sets and scaled compactly supported radial basis functions with varying support radii. Compared with the first two methods, the hierarchical radial basis function method can not only solve the present problem on a single level with higher accuracy and lower computational cost but also produce highly sparse nonlinear discrete system. These observations are obtained by taking the direct approach of numerical experimentation.

This research paper is about the existence and uniqueness of the coupled system of nonlinear fractional Langevin equations with multipoint and nonlocal integral boundary conditions. The Caputo fractional derivative is used to formulate the fractional differential equations, and the fractional integrals mentioned in the boundary conditions are due to Atangana–Baleanu and Katugampola. The existence of solution has been proven by two main fixed-point theorems: O’Regan’s fixed-point theorem and Krasnoselskii’s fixed-point theorem. By applying Banach’s fixed-point theorem, we proved the uniqueness result for the concerned problem. This research paper highlights the examples related with theorems that have already been proven.

The paper investigates the dynamical behaviors of a two-species discrete predator-prey system with Crowley–Martin functional response incorporating prey refuge proportional to prey density. The existence of equilibrium points, stability of three fixed points, period-doubling bifurcation, Neimark–Sacker bifurcation, Marottos chaos, and Control Chaos are analyzed for the discrete-time domain. The time graphs, phase portraits, and bifurcation diagrams are obtained for different parameters of the model. Numerical simulations and graphics show that the discrete model exhibits rich dynamics, which also present that the system is a chaotic and complex one. This paper attempts to present a feedback control method which can stabilize chaotic orbits at an unstable equilibrium point.

Finding exact solutions of nonlinear equations plays an important role in nonlinear science, especially in engineering and mathematical physics. In this paper, we employed the complex method to get eight exact solutions of the modified BBM equation for the first time, including two elliptic function solutions, two simply periodic solutions, and four rational function solutions. We used the exp − ϕ z -expansion methods to get fourteen forms of solutions of the modified BBM equation. We also used the sine-cosine method to obtain eight styles’ exact solutions of the modified BBM equation. Only the complex method can obtain elliptic function solutions. We believe that the complex method presented in this paper can be more effectively applied to seek solutions of other nonlinear evolution equations.

In this paper, the dependent competing risks’ model is considered in the constant-stress accelerated life test under the adaptive type-II progressive hybrid-censored scheme. The dependency between failure causes is modeled by Marshall–Olkin bivariate Gompertz distribution. The scale and shape parameters in the model both change with the stress levels, and the failure causes of some test units are unknown. Then, the maximum likelihood estimations and approximation confidence intervals of the unknown parameters are considered. And, the necessary and sufficient condition is established for the existence and uniqueness of the maximum likelihood estimations for unknown parameters. The Bayes approach is also employed to estimate the unknown parameters under suitable prior distributions. The Bayes estimations and highest posterior credible intervals of the unknown parameters are obtained. Finally, a simulation experiment has been performed to illustrate the methods proposed in this paper.

This paper focuses on a singular boundary value (SBV) problem of nonlinear fractional differential (NFD) equation defined as follows: D 0 + β υ τ + f τ , υ τ = 0 , τ ∈ 0,1 , υ 0 = υ ′ 0 = υ ″ 0 = υ ″ 1 = 0 , where 3 < β ≤ 4 , D 0 + β is the standard Riemann–Liouville fractional (RLF) derivative. The nonlinear function f τ , υ τ might be singular on the spatial and temporal variables. This paper proves that a positive solution to the SBV problem exists and is unique, taking advantage of Green’s function through a fixed-point (FP) theory on cones and mixed monotone operators.

Solving nonlinear equation systems for engineering applications is one of the broadest and most essential numerical studies. Several methods and combinations were developed to solve such problems by either finding their roots mathematically or formalizing such problems as an optimization task to obtain the optimal solution using a predetermined objective function. This paper proposes a new algorithm for solving square and nonsquare nonlinear systems combining the genetic algorithm (GA) and the homotopy analysis method (HAM). First, the GA is applied to find out the solution. If it is realized, the algorithm is terminated at this stage as the target solution is determined. Otherwise, the HAM is initiated based on the GA stage’s computed initial guess and linear operator. Moreover, the GA is utilized to calculate the optimum value of the convergence control parameter (h) algebraically without plotting the h-curves or identifying the valid region. Four test functions are examined in this paper to verify the proposed algorithm’s accuracy and efficiency. The results are compared to the Newton HAM (NHAM) and Newton homotopy differential equation (NHDE). The results corroborated the superiority of the proposed algorithm in solving nonlinear equation systems efficiently.

This paper is concerned with the quantized identification of rational systems, where the systems’ output is quantized by a logarithmic quantizer. Under the assumption that the systems’ input is periodic, the identification procedure is categorized into two steps. The first step is to identify the noise-free output of systems based on the quantized data. The second is to identify the unknown parameter based on the input and the estimation of the noise-free output. The identification algorithm is also summarized. Asymptotic convergence of the estimators is analyzed in detail, which shows that the estimators are convergent almost everywhere. A numerical example is given to illustrate the results obtained in this paper.

Recently, the development of neural network method for solving differential equations has made a remarkable progress for solving fractional differential equations. In this paper, a neural network method is employed to solve time-fractional telegraph equation. The loss function containing initial/boundary conditions with adjustable parameters (weights and biases) is constructed. Also, in this paper, a time-fractional telegraph equation was formulated as an optimization problem. Numerical examples with known analytic solutions including numerical results, their graphs, weights, and biases were also discussed to confirm the accuracy of the method used. Also, the graphical and tabular results were analyzed thoroughly. The mean square errors for different choices of neurons and epochs have been presented in tables along with graphical presentations.

This paper uses a merit function derived from the Fishcher–Burmeister function and formulates box-constrained stochastic variational inequality problems as an optimization problem that minimizes this merit function. A sufficient condition for the existence of a solution to the optimization problem is suggested. Finally, this paper proposes a Monte Carlo sampling method for solving the problem. Under some moderate conditions, comprehensive convergence analysis is included as well.

This paper studies and analyzes a model describing the flow of contaminated brines through the porous media under severe thermal conditions caused by the radioactive contaminants. The problem is approximated based on combining the mixed finite element method with the modified method of characteristics. In order to solve the resulting algebraic nonlinear equations efficiently, a two-grid method is presented and discussed in this paper. This approach includes a small nonlinear system on a coarse grid with size H and a linear system on a fine grid with size h . It follows from error estimates that asymptotically optimal accuracy can be obtained as long as the mesh sizes satisfy H = O h 1 / 3 .

The well-known Stokes’ problems are reexamined by applying the Adomian decomposition method (ADM) associated with other mathematical techniques in this paper. Both the finite-depth (bounded) and infinite-depth (unbounded) cases are analyzed. The present paper raises and deals with two major concerns. The first one is that, for Stokes’ problems, it lacks one boundary condition at the expansion point to fully determine all coefficients of the ADM solution in which an unknown function appears. This unknown function which is dependent on the transformed variable will be determined by the boundary condition at the far end. The second concern is that the derived solution begins to deviate from the exact solution as the spatial variable grows for the unbounded problems. This can be greatly improved by introducing the Padé approximant to satisfy the boundary condition at the far end. For the second problems, the derived ADM solution can be easily separated into the steady-state and the transient parts for a deeper comprehension of the flow. The present result shows an excellent agreement with the exact solution. The ADM is therefore verified to be a reliable mathematical method to analyze Stokes’ problems of finite and infinite depths.

One of the most popular statistical models is a low-order polynomial response surface model, i.e., a polynomial of first order or second order. These polynomials can be used for global metamodels in weakly nonlinear simulation to approximate their global tendency and local metamodels in response surface methodology (RSM), which has been studied in various applications in engineering design and analysis. The order of the selected polynomial determines the number of sampling points (input combinations) and the resulting accuracy (validity, adequacy). This paper derives a novel method to obtain an accurate high-order polynomial while requiring fewer sampling points. This method uses a two-stage procedure such that the second stage modifies the low-order polynomial estimated in the first stage; this second stage does not require new points. This paper evaluates the performance of the method numerically by using several test functions. These numerical results show that the proposed method can provide more accurate predictions than the traditional method.

In this paper, we present a smoothing Newton method for solving the monotone weighted complementarity problem (WCP). In each iteration of our method, the iterative direction is achieved by solving a system of linear equations and the iterative step length is achieved by adopting a line search. A feature of the line search criteria used in this paper is that monotone and nonmonotone line search are mixed used. The proposed method is new even when the WCP reduces to the standard complementarity problem. Particularly, the proposed method is proved to possess the global convergence under a weak assumption. The preliminary experimental results show the effectiveness and robustness of the proposed method for solving the concerned WCP.

In this paper, we deal with the global behavior of the positive solutions of the system of k -difference equations u n + 1 1 = α 1 u n − 1 1 / β 1 + α 1 u n − 2 2 r 1 , u n + 1 2 = α 2 u n − 1 2 / β 2 + α 2 u n − 2 3 r 2 , … , u n + 1 k = α k u n − 1 k / β k + α k u n − 2 1 r k , n ∈ ℕ 0 , where the initial conditions u − l i l = 0,1,2 are nonnegative real numbers and the parameters α i , β i , γ i , and r i are positive real numbers for i = 1,2 , … , k , by extending some results in the literature. By the end of the paper, we give three numerical examples to support our theoretical results related to the system with some restrictions on the parameters.

In this paper, we investigate pattern dynamics with multivariable by using the method of matrix analysis and obtain a condition under which the system loses stability and Turing bifurcation occurs. In addition, we also derive the amplitude equation with multivariable. This is an effective tool to investigate multivariate pattern dynamics. The example and simulation used in this paper validate our theoretical results. The method presented is a novel approach to the investigation of specific real systems based on the model developed in this paper.

In this paper, the delayed doubly stochastic linear quadratic optimal control problem is discussed. It deduces the expression of the optimal control for the general delayed doubly stochastic control system which contained time delay both in the state variable and in the control variable at the same time and proves its uniqueness by using the classical parallelogram rule. The paper is concerned with the generalized matrix value Riccati equation for a special delayed doubly stochastic linear quadratic control system and aims to give the expression of optimal control and value function by the solution of the Riccati equation.

In this paper, a novel chaotic new three-dimensional system has been studied by Zhang et al. in 2012. In the system, there are three control parameters and three different nonlinear terms which governed equations. Zhang et al. studied elementary (preliminary) dynamic properties of the chaotic new three-dimensional system by means of bifurcation diagram, maximum Lyapunov exponent, phase portraits, dynamics behaviors by changing some parameters etc., using all possible theoretical analysis and numerical simulation. In this paper, we have demonstrated its complete synchronization. The proposed results are verified by numerical simulations.

This paper is intended to study the limit theorem of Markov chain function in the environment of single infinite Markovian systems. Moreover, the problem of the strong law of large numbers in the infinite environment is presented by means of constructing martingale differential sequence for the measurement under some different sufficient conditions. If the sequence of even functions gnx,n≥0 satisfies different conditions when the value ranges of x are different, we have obtained SLLN for function of Markov chain in the environment of single infinite Markovian systems. In addition, the paper studies the strong convergence of the weighted sums of function for finite state Markov Chains in single infinitely Markovian environments. Although the similar conclusions have been carried out, the difference results performed by previous scholars are that we give weaker different sufficient conditions of the strong convergence of weighted sums compared with the previous conclusions.

By using the semidiscrete method of differential equations, a new version of discrete analogue of stochastic fuzzy BAM neural networks was formulated, which gives a more accurate characterization for continuous-time stochastic neural networks than that by the Euler scheme. Firstly, the existence of the 2p-th mean almost periodic sequence solution of the discrete-time stochastic fuzzy BAM neural networks is investigated with the help of Minkowski inequality, Hölder inequality, and Krasnoselskii’s fixed point theorem. Secondly, the 2p-th moment global exponential stability of the discrete-time stochastic fuzzy BAM neural networks is also studied by using some analytical skills in stochastic theory. Finally, two examples with computer simulations are given to demonstrate that our results are feasible. The main results obtained in this paper are completely new, and the methods used in this paper provide a possible technique to study 2p-th mean almost periodic sequence solution and 2p-th moment global exponential stability of semidiscrete stochastic fuzzy models.

This paper first provides a concept of almost sure stability for uncertain delay differential equations and analyzes this new sort of stability. In addition, this paper derives three sufficient conditions for uncertain delay differential equations being stable almost surely. Finally, the relationship between almost sure stability and stability in measure for uncertain delay differential equations is discussed.

This paper investigates the consistency definition and the weight-deriving method for additive interval fuzzy preference relations (IFPRs) using a particular characterization based on logarithms. In a recently published paper, a new approach with a parameter is developed to obtain priority weights from fuzzy preference relations (FPRs), then a new consistency definition for the additive IFPRs is defined, and finally linear programming models for deriving interval weights from consistent and inconsistent IFPRs are proposed. However, the discussion of the parameter value is not adequate and the weights obtained by the linear models for inconsistent IFPRs are dependent on alternative labels and not robust to permutations of the decision makers’ judgments. In this paper, we first investigate the value of the parameter more thoroughly and give the closed form solution for the parameter. Then, we design a numerical example to illustrate the drawback of the linear models. Finally, we construct a linear model to derive interval weights from IFPRs based on the additive transitivity based consistency definition. To demonstrate the effectiveness of our proposed method, we compare our method to the existing method on three numerical examples. The results show that our method performs better on both consistent and inconsistent IFPRs.

The concept of diagonally invariant exponential stability (DIES) was originally introduced for single-model linear systems and subsequently expanded in the study of linear systems with interval-type uncertainties and linear systems with arbitrary switching. The results presented in this article refer to new approaches to DIES characterization for arbitrary switching systems, which exploit mathematical tools completely different from earlier work. The previous papers are based on the properties of matrix norms and measures applied to the constituent matrices defining the switching system, while the present paper uses the eigenvalues and eigenvectors of the column and row representatives built for a set of matrices derived from the constituent matrices of the switching system. The applicability of previous and new results, respectively, is illustrated by case studies (in both continuous- and discrete-time) that lead to relevant comparisons between the two classes of analysis methods.

The complexity of cancer has motivated the development of different approaches to understand the dynamics of this large group of diseases. One that may allow us to better comprehend the behavior of cancer cells, in both short- and long-term, is mathematical modelling through ordinary differential equations. Several ODE mathematical models concerning tumor evolution and immune response have been formulated through the years, but only a few may exhibit chaotic attractors and oscillations such as stable limit cycles and periodic orbits; these dynamics are not that common among cancer systems. In this paper, we apply the Localization of Compact Invariant Sets (LCIS) method and Lyapunov stability theory to investigate the global dynamics and the main factors involved in tumor growth and immune response for a chaotic-cancer system presented by Itik and Banks in 2010. The LCIS method allows us to compute what we define as the localizing domain, which is formulated by the intersection of all lower and upper bounds of each cells population in the nonnegative octant, R+,03. Bounds of this domain are given by inequalities in terms of the system parameters. Then, we apply Lyapunov stability theory and LaSalle’s invariance principle to establish existence conditions of a global attractor. The latter implies that given any nonnegative initial condition, all trajectories will go to the largest compact invariant set (a stable equilibrium point, limit cycles, periodic orbits, or a chaotic attractor) located either inside or at the boundaries of the localizing domain. In order to complement our analysis, numerical simulations are performed throughout the paper to illustrate all mathematical results and to better explain their biological implications.

Correlation among variables must be considered to accurately reflect the level of structure reliability. This problem has referential value to engineering practice and has attracted attention from relevant scholars and industries. In this paper, Copula function was used to build the joint probability density function among all variables. The key is to describe the correlation among variables, solve the correlation parameter θ of Copula function, and select the type of correlation structure among variables. The correlation parameter θ of Copula function was solved using Pearson linear correlation coefficient and maximum likelihood estimation. Based on the Akaike information criteria (AIC) and Bayesian information criteria (BIC), the optimal Copula function was selected, and the correlation structure among variables was determined. Monte Carlo method, which is based on Nataf inverse transformation, was introduced and used to evaluate the reliability of the correlated variable. Finally, this paper proposed the reliability calculation method based on dual neural network and direct integration by establishing the dual neural network of original and integrand functions. Compared with the Monte Carlo method, the proposed method can be utilized to efficiently and precisely calculate the structure reliability of multiple correlated random variables.

This paper deals with the nonmonotone projection algorithm for constrained nonlinear equations. For some starting points, the previous projection algorithms for the problem may encounter slow convergence which is related to the monotone behavior of the iterative sequence as well as the iterative direction. To circumvent this situation, we adopt the nonmonotone technique introduced by Dang to develop a nonmonotone projection algorithm. After constructing the nonmonotone projection algorithm, we show its convergence under some suitable condition. Preliminary numerical experiment is reported at the end of this paper, from which we can see that the algorithm we propose converges more quickly than that of the usual projection algorithm for some starting points.

This paper researched three definitions of Gauss map and found that the definition of “Gauss map” in the paper of Arasomwan and Adewumi may be incoherent with other publications. In addition, we analyzed the difference of continuous Gauss map and the floating-point Gauss map, and we pointed out that the floating-point simulation behaved significantly differently from the continuous Gauss map.

This paper aims to study the stability of fractional differential equations involving the new generalized Hattaf fractional derivative which includes the most types of fractional derivatives with nonsingular kernels. The stability analysis is obtained by means of the Lyapunov direct method. First, some fundamental results and lemmas are established in order to achieve the goal of this study. Furthermore, the results related to exponential and Mittag–Leffler stability existing in recent studies are extended and generalized. Finally, illustrative examples are presented to show the applicability of our main results in some areas of science and engineering.

This paper is concerned with the existence of stationary distribution and extinction for multispecies stochastic Lotka-Volterra predator-prey system. The contributions of this paper are as follows. (a) By using Lyapunov methods, the sufficient conditions on existence of stationary distribution and extinction are established. (b) By using the space decomposition technique and the continuity of probability, weaker conditions on extinction of the system are obtained. Finally, a numerical experiment is conducted to validate the theoretical findings.

The first aim of the paper is to present a survey of possible approaches for the study of fuzzy stochastic differential or integral equations. They are stochastic counterparts of classical approaches known from the theory of deterministic fuzzy differential equations. For our aims we present first a notion of fuzzy stochastic integral with a semimartingale integrator and its main properties. Next we focus on different approaches for fuzzy stochastic differential equations. We present the existence of fuzzy solutions to such equations as well as their main properties. In the first approach we treat the fuzzy equation as an abstract relation in the metric space of fuzzy sets over the space of square integrable random vectors. In the second one the equation is interpreted as a system of stochastic inclusions. Finally, in the last section we discuss fuzzy stochastic integral equations with solutions being fuzzy stochastic processes. In this case the notion of the stochastic Itô’s integral in the equation is crisp; that is, it has single-valued level sets. The second aim of this paper is to show that there is no extension to more general diffusion terms.

The paper focuses on studying the Noether theorem for nonholonomic systems with time delay. Firstly, the differential equations of motion for nonholonomic systems with time delay are established, which is based on the Hamilton principle with time delay and the Lagrange multiplier rules. Secondly, based upon the generalized quasi-symmetric transformations for nonconservative systems with time delay, the Noether theorem for corresponding holonomic systems is given. Finally, we obtain the Noether theorem for the nonholonomic nonconservative systems with time delay. At the end of the paper, an example is given to illustrate the application of the results.

This paper presents an efficient outer space branch-and-bound algorithm for globally solving a minimax linear fractional programming problem (MLFP), which has a wide range of applications in data envelopment analysis, engineering optimization, management optimization, and so on. In this algorithm, by introducing auxiliary variables, we first equivalently transform the problem (MLFP) into the problem (EP). By using a new linear relaxation technique, the problem (EP) is reduced to a sequence of linear relaxation problems over the outer space rectangle, which provides the valid lower bound for the optimal value of the problem (EP). Based on the outer space branch-and-bound search and the linear relaxation problem, an outer space branch-and-bound algorithm is constructed for globally solving the problem (MLFP). In addition, the convergence and complexity of the presented algorithm are given. Finally, numerical experimental results demonstrate the feasibility and efficiency of the proposed algorithm.

The basic notions in rough set theory are lower and upper approximation operators defined by a fixed binary relation. This paper proposes an intuitionistic fuzzy rough set (IFRS) model which is a combination of intuitionistic fuzzy set (IFS) and rough set. We approximate an IFS by using soft binary relations instead of fixed binary relations. By using this technique, we get two pairs of intuitionistic fuzzy (IF) soft sets, called the upper approximation and lower approximation with respect to foresets and aftersets. Properties of newly defined rough set model (IFRS) are studied. Similarity relations between IFS with respect to this rough set model (IFRS) are also studied. Finally, an algorithm is constructed depending on these approximations of IFSs and score function for decision-making problems, although a method of decision-making algorithm has been introduced for fuzzy sets already. But, this new IFRS model is more accurate to solve the problem because IFS has degree of nonmembership and degree of hesitant.

The aim of this paper is to unify the extended Mittag-Leffler function and generalized Q function and define a unified Mittag-Leffler function. Both the extended Mittag-Leffler function and generalized Q function can be obtained from the unified Mittag-Leffler function. The Laplace, Euler beta, and Whittaker transformations are applied for this function, and generalized formulas are obtained. These formulas reproduce integral transformations of various deduced Mittag-Leffler functions and Q function. Also, the convergence of this unified Mittag-Leffler function is proved, and an associated fractional integral operator is constructed.

The rationale of the paper is to present a new probability distribution that can model both the monotonic and nonmonotonic hazard rate shapes and to increase their flexibility among other probability distributions available in the literature. The proposed probability distribution is called the New Weighted Lomax (NWL) distribution. Various statistical properties have been studied including with the estimation of the unknown parameters. To achieve the basic objectives, applications of NWL are presented by means of two real-life data sets as well as a simulated data. It is verified that NWL performs well in both monotonic and nonmonotonic hazard rate function than the Lomax (L), Power Lomax (PL), Exponential Lomax (EL), and Weibull Lomax (WL) distribution.

In this paper, we consider the limit properties of the largest entries of sample covariance matrices and the sample correlation matrices. In order to make the statistics based on the largest entries of the sample covariance matrices and the sample correlation matrices more applicable in high-dimensional tests, the identically distributed assumption of population is removed. Under some moment’s assumption of the underlying distribution, we obtain that the almost surely limit and asymptotical distribution of the extreme statistics as both the dimension p and sample size n tend to infinity.

In this paper, we propose a novel reduced differential transform method (RDTM) to compute analytical and semianalytical approximate solutions of fractional order Airy’s ordinary differential equations and fractional order Airy’s and Airy’s type partial differential equations subjected to certain initial conditions. The performance of the proposed method was analyzed and compared with a convergent series solution form with easily computable coefficients. The behavior of approximated series solutions at different values of fractional order α and its modeling in 2-dimensional and 3-dimensional spaces are compared with exact solutions using MATLAB graphical method analysis. Moreover, the physical and geometrical interpretations of the computed graphs are given in detail within 2- and 3-dimensional spaces. Accordingly, the obtained approximate solutions of fractional order Airy’s ordinary differential equations and fractional order Airy’s and Airy’s type partial differential equations subjected to certain initial conditions exactly fit with exact solutions. Hence, the proposed method reveals reliability, effectiveness, efficiency, and strengthening of computed mathematical results in order to easily solve fractional order Airy’s type differential equations.

In this paper, we aim to develop a partially linear additive spatial autoregressive model (PLASARM), which is a generalization of the partially linear additive model and spatial autoregressive model. It can be used to simultaneously evaluate the linear and nonlinear effects of the covariates on the response for spatial data. To estimate the unknown parameters and approximate nonparametric functions by Bayesian P-splines, we develop a Bayesian Markov Chain Monte Carlo approach to estimate the PLASARM and design a Gibbs sampler to explore the joint posterior distributions of unknown parameters. Furthermore, we illustrate the performance of the proposed model and estimation method by a simulation study and analysis of Chinese housing price data.

A quantitative mathematical model of neurons should not only include enough details to consider the dynamics of single neurons but also minimize the complexity of the model so that the model calculation is convenient. The two-dimensional Prescott model provides a good compromise between the authenticity and computational efficiency of a neuron. The dynamic characteristics of the Prescott model under external electrical stimulation are studied by combining analytical and numerical methods in this paper. Through the analysis of the equilibrium point distribution, the influence of model parameters and external stimulus on the dynamic characteristics is described. The occurrence conditions and the type of Hopf bifurcation in the Prescott model are analyzed, and the analytical determination formula of the Hopf bifurcation type in the neuron model is obtained. Washout filter control is used to change the Hopf bifurcation type, so that the subcritical Hopf bifurcation transforms to supercritical Hopf bifurcation, so as to realize the change of the dynamic characteristics of the model.

This paper is concerned with the numerical solutions of semilinear stochastic delay differential equations driven by G-Brownian motion (G-SLSDDEs). The existence and uniqueness of exact solutions of G-SLSDDEs are studied by using some inequalities and the Picard iteration scheme first. Then the numerical approximation of exponential Euler method for G-SLSDDEs is constructed, and the convergence and the stability of the numerical method are studied. It is proved that the exponential Euler method is convergent, and it can reproduce the stability of the analytical solution under some restrictions. Numerical experiments are presented to confirm the theoretical results.

Large-scale social graph data poses significant challenges for social analytic tools to monitor and analyze social networks. The information-theoretic distance measure, namely, resistance distance, is a vital parameter for ranking influential nodes or community detection. The superiority of resistance distance and Kirchhoff index is that it can reflect the global properties of the graph fairly, and they are widely used in assessment of graph connectivity and robustness. There are various measures of network criticality which have been investigated for underlying networks, while little is known about the corresponding metrics for mixed networks. In this paper, we propose the positive walk algorithm to construct the Hermitian matrix for the mixed graph and then introduce the Hermitian resistance matrix and the Hermitian Kirchhoff index which are based on the eigenvalues and eigenvectors of the Hermitian Laplacian matrix. Meanwhile, we also propose a modified algorithm, the directed traversal algorithm, to select the edges whose removal will maximize the Hermitian Kirchhoff index in the general mixed graph. Finally, we compare the results with the algebraic connectivity to verify the superiority of the proposed strategy.

In this paper, we propose an improved new class of exponential-ratio-type estimators for estimating the finite population mean using the conventional and the nonconventional measures of the auxiliary variable. Expressions for the bias and MSE are obtained under large sample approximation. Both simulation and numerical studies are conducted to validate the theoretical findings. Use of the conventional and the nonconventional measures of the auxiliary variable is very common in survey research, but we observe that this does not add much value in many of the estimators except for our proposed class of estimators.