Research on the degenerate versions of special polynomials provides a new area, introducing the $\lambda$-analogue of special polynomials and numbers, such as $\lambda$-Sheffer polynomials. In this paper, we propose a new variant of type 2 Bernoulli polynomials and numbers by modifying a generating function. Then we derive explicit expressions and their representations that provide connections among existing $\lambda$-Sheffer polynomials. Also, we provide the explicit representations of the proposed polynomials in terms of the degenerate Lah-Bell polynomials and the higher-order degenerate derangement polynomials to confirm the presented identities.

In this article, we provide a comprehensive convergence and stability analysis of a semi-Lagrangian scheme for solving nonlinear Burgers' equations with a high-order spatial discretization. The analysis is for the iteration-free semi-Lagrangian scheme comprising the second-order backward finite difference formula (BDF2) for total derivative and the fourth-order central finite difference for diffusion term along the trajectory. The main highlight of the study is to thoroughly analyze the order of convergence of the discrete ${\ell }_2$-norm error $\mathcal{O}(h^2+\mathrm{△}{x}^4+\mathrm{△}{x}^{p+1}/h)$ by managing the relationship between the local truncation errors from each discretization procedure and the interpolation properties with a symmetric high-order discretization of the diffusion term. Furthermore, stability is established by the uniform boundedness of the numerical solution using the discrete Grönwall's Lemma. We provide numerical examples to support the validity of the theoretical convergence and stability analysis for the propounded backward semi-Lagrangian scheme.

This paper analyzes the stability of numerical solutions for a nonlinear Schrödinger equation that is widely used in several applications in quantum physics, optical business, etc. One of the most popular approaches to solving nonlinear problems is the application of a linearization scheme. In this paper, two linearization schemes—Newton and Picard methods were utilized to construct systems of linear equations and finite difference methods. Crank-Nicolson and backward Euler methods were used to establish numerical solutions to the corresponding linearized problems. We investigated the stability of each system when a finite difference discretization is applied, and the convergence of the suggested approximation was evaluated to verify theoretical analysis.