For two graphs G and H, the Ramsey number R(G, H) is the smallest integer n such that for any n-vertex graph, either it contains G or its complement contains H. Let be a star of order n and be a generalised wheel Previous studies by Wang and Chen (Graphs Comb 35(1):189–193, 2019) and Chng et al. (Discret Math 344(8):112440, 2021) imply that a tree is -good, -good, -good, and -good for In this paper, we study the Ramsey numbers and our results indicate that trees are not always -good.
This paper is devoted to studying the variational approximation for the higher order regular fractional Sturm-Liouville problems (FSLPs). Using variational principle, we demonstrate that the FSLP has a countable set of eigenvalues and corresponding unique eigenfunctions. Furthermore, we establish two results showing that the eigenfunctions corresponding to distinct eigenvalues are orthogonal, and the smallest (first) eigenvalue is the minimizer of the functional. To validate the theoretical result, we also present a numerical method using polynomials for as a basis function. Further, the Lagrange multiplier method is used to reduce the fractional variational problem into a system of algebraic equations. In order to find the eigenvalues and eigenfunctions, we solve the algebraic system of equations. Further, the analytical convergence and the absolute error of the method are analyzed.
A new set of generalized Jacobi rational functions of the first and second kinds, GJRFs-1 and GJRFs-2, which are mutually orthogonal in , are introduced and they are analytical eigensolutions to a new family of singular fractional Sturm-Liouville problems (SFSLPs) of the first and second kinds as non-polynomial functions. We establish some properties and optimal approximation results for these GJRFs-1 and GJRFs-2 in non-uniformly weighted Sobolev spaces involving fractional derivatives, which play important roles in the related spectral methods for a class of fractional differential equations. We develop Jacobi rational-Gauss quadrature type formulae and -orthogonal projections based on GJRFs-1 and GJRFs-2. As examples of applications, the two quadrature rules are proposed for Fermi-Dirac and Bose-Einstein integrals. Using various orthogonal properties of GJRFs-1 and GJRFs-2, the Petrov-Galerkin methods are proposed for fractional initial value problems and fractional boundary value problems. Numerical results demonstrate its efficient algorithm, and spectral accuracy for treating the above-mentioned classes of problems. The suggested numerical scheme provides an applicable substitutional to other competitive methods in the recent method-related accuracy.
An accelerated convergence scheme for temporal approximation of stochastic partial differential equation is presented. First, the regularity of the mild solution is provided. Combining the Itô formula and the remainder term of the exponential Euler scheme, this paper proposes a high accuracy time discretization method. Based on regularity results, a strong convergence rate for the discretization error is proved for arbitrarily small . Here is the uniform time step size. Finally, the theoretical results are verified by several numerical experiments.
In this paper, for generalized two-dimensional delay space-fractional Fisher equations with mixed boundary conditions, we present the stability and convergence computed by a novel numerical method. The unconditional stability of analytic solutions is first derived. Next, we have established the linear -method with the Grünwald-Letnikov operator, which has the first-order accuracy in spatial dimensions. Moreover, approaches involved error estimations and inequality reductions are utilized to prove the stability and convergence of numerical solutions under different values of . Eventually, we implement a numerical experiment to validate theoretical conclusions, where the interaction impacts of fractional derivatives have been further analyzed by applying two different harmonic operators.
An implicit variable-step BDF2 scheme is established for solving the space fractional Cahn-Hilliard equation derived from a gradient flow in the negative order Sobolev space , . The Fourier pseudo-spectral method is applied for the spatial approximation. The space fractional Cahn-Hilliard model poses significant challenges in theoretical analysis for variable time-stepping algorithms compared to the classical model, primarily due to the introduction of the fractional Laplacian. This issue is settled by developing a general discrete Hölder inequality involving the discretization of the fractional Laplacian. Subsequently, the unique solvability and the modified energy dissipation law are theoretically guaranteed. We further rigorously provided the convergence of the fully discrete scheme by utilizing the newly proved discrete Young-type convolution inequality to deal with the nonlinear term. Numerical examples with various interface widths and mobility are conducted to show the accuracy and the energy decay for different orders of the fractional Laplacian. In particular, we demonstrate that the adaptive time-stepping strategy, compared with the uniform time steps, captures the multiple time scale evolutions of the solution in simulations.
In this manuscript, a class of multi-term delay fractional differential equations (FDEs) under the Hilfer derivative is considered. Some newly updated results are established under boundary conditions. For the required results, we utilize the fixed point theory and tools of the nonlinear functional analysis. Further keeping in mind the importance of stability results, we develop some adequate results about the said aspect. The Hyers-Ulam (H-U)-type concept is used to derive the required stability for the solution of the considered problem. Finally, by appropriate test problems, we justify our findings.
This research aims to investigate the impact of diffusion on the stability and bifurcation behavior of advertising diffusion systems. The study findings suggest that in the absence of diffusion, a higher proportion of crowd contact positively contributes to the stability of the system. Specifically, the study employs the interval partitioning method to discuss the k-mode Turing bifurcation and derives a more explicit Turing bifurcation line. Moreover, the study examines the k-mode Hopf bifurcation with the proportion of crowd contact acting as the bifurcation parameter. Furthermore, the weakly nonlinear analysis method is implemented to scrutinize the pattern formation in the Turing instability region. Finally, numerical simulation is utilized to validate the analytical findings obtained in this study.
We introduce a new tensor integration method for time-dependent partial differential equations (PDEs) that controls the tensor rank of the PDE solution via time-dependent smooth coordinate transformations. Such coordinate transformations are obtained by solving a sequence of convex optimization problems that minimize the component of the PDE operator responsible for increasing the tensor rank of the PDE solution. The new algorithm improves upon the non-convex algorithm we recently proposed in Dektor and Venturi (2023) which has no guarantee of producing globally optimal rank-reducing coordinate transformations. Numerical applications demonstrating the effectiveness of the new coordinate-adaptive tensor integration method are presented and discussed for prototype Liouville and Fokker-Planck equations.
Based on the greedy randomized Kaczmarz (GRK) method, we propose a multi-step greedy Kaczmarz method for solving large-scale consistent linear systems, utilizing multi-step projection techniques. Its convergence is proved when the linear system is consistent. Numerical experiments demonstrate that the proposed method is effective and more efficient than several existing classical Kaczmarz methods.
Strong -tensors play a significant role in identifying the positive definiteness of an even-order real symmetric tensor. In this paper, first, an improved iterative algorithm is proposed to determine whether a given tensor is a strong -tensor, and the validity of the iterative algorithm is proved theoretically. Second, the iterative algorithm is employed to identify the positive definiteness of an even-order real symmetric tensor. Finally, numerical examples are presented to illustrate the advantages of the proposed algorithm.