Series Solutions of Delay Integral Equations via a Modified Approach of Homotopy Analysis Method

In this paper, the series solutions of a non-linear delay integral equations are considered by a modified approach of homotopy analysis method (MAHAM). We split the function into infinite sums. The outcomes of the illustrated examples are included to confirm the accuracy and efficiency of the MAHAM. The exact solution can be obtained using special values of the convergence parameter.

Assessing the Impact of Precision Parameter Prior in Bayesian Non-parametric Growth Curve Modeling

Bayesian non-parametric (BNP) modeling has been developed and proven to be a powerful tool to analyze messy data with complex structures. Despite the increasing popularity of BNP modeling, it also faces challenges. One challenge is the estimation of the precision parameter in the Dirichlet process mixtures. In this study, we focus on a BNP growth curve model and investigate how non-informative prior, weakly informative prior, accurate informative prior, and inaccurate informative prior affect the model convergence, parameter estimation, and computation time. A simulation study has been conducted. We conclude that the non-informative prior for the precision parameter is less preferred because it yields a much lower convergence rate, and growth curve parameter estimates are not sensitive to informative priors.

An Enhanced Grasshopper Optimization Algorithm to the Bin Packing Problem

The grasshopper optimization algorithm (GOA) is a novel metaheuristic algorithm. Because of its easy deployment and high accuracy, it is widely used in a variety of industrial scenarios and obtains good solution. But, at the same time, the GOA algorithm has some shortcomings: (1) original linear convergence parameter causes the processes of exploration and exploitation unbalanced; (2) unstable convergence speed; and (3) easy to fall into the local optimum. In this paper, we propose an enhanced grasshopper optimization algorithm (EGOA) using a nonlinear convergence parameter, niche mechanism, and the β-hill climbing technique to overcome the abovementioned shortcomings. In order to evaluate EGOA, we first select the benchmark set of GOA authors to test the performance improvement of EGOA compared to the basic GOA. The analysis includes exploration ability, exploitation ability, and convergence speed. Second, we select the novel CEC2019 benchmark set to test the optimization ability of EGOA in complex problems. According to the analysis of the results of the algorithms in two benchmark sets, it can be found that EGOA performs better than the other five metaheuristic algorithms. In order to further evaluate EGOA, we also apply EGOA to the engineering problem, such as the bin packing problem. We test EGOA and five other metaheuristic algorithms in SchWae2 instance. After analyzing the test results by the Friedman test, we can find that the performance of EGOA is better than other algorithms in bin packing problems.

Yaglom limits can depend on the starting state

We construct a simple example, surely known to Harry Kesten, of anR-transient Markov chain on a countable state spaceS∪ {δ}, where δ is absorbing. The transition matrixKonSis irreducible and strictly substochastic. We determine the Yaglom limit, that is, the limiting conditional behavior given nonabsorption. Each starting statex∈Sresults in a different Yaglom limit. Each Yaglom limit is anR-1-invariant quasi-stationary distribution, whereRis the convergence parameter ofK. Yaglom limits that depend on the starting state are related to a nontrivialR-1-Martin boundary.

The International Standards on Auditing as a convergence parameter between US GAAP and IFRS

The present study involves the US GAAP and IFRS accounting frameworks, and how these are evaluated by accounting professionals in four (4) European countries, two of which have been severely impacted by the global economic crisis (Greece and Portugal) and two that remained relatively strong during the period of the European economic crisis (France and Germany). The main purpose of the study is to point out that the economy of a country does indeed affect the perception of listed companies towards a potential convergence. The issues that arise are of interest of the global accounting and auditing community, as well as this study. Academic literature has not shown much interest in recent years. In contrast, the professional bibliography is very rich and has greatly enhanced the bibliographic review. The results of the quantitative study reveal that there are differences between the factors affecting a potential convergence at a country level, as well as at an economy level. Stronger economies seem to pay more attention to economic and regulatory factors, and weaker economies seem more reluctant towards coordination and cooperation in order for the convergence to be achieved.

New Modified Adomian Decomposition Recursion Schemes for Solving Certain Types of Nonlinear Fractional Two-Point Boundary Value Problems

We apply new modified recursion schemes obtained by the Adomian decomposition method (ADM) to analytically solve specific types of two-point boundary value problems for nonlinear fractional order ordinary and partial differential equations. The new modified recursion schemes, which sometimes utilize the technique of Duan’s convergence parameter, are derived using the Duan-Rach modified ADM. The Duan-Rach modified ADM employs all of the given boundary conditions to compute the remaining unknown constants of integration, which are then embedded in the integral solution form before constructing recursion schemes for the solution components. New modified recursion schemes obtained by the method are generated in order to analytically solve nonlinear fractional order boundary value problems with a variety of two-point boundary conditions such as Robin and separated boundary conditions. Some numerical examples of such problems are demonstrated graphically. In addition, the maximal errors (MEn) or the error remainder functions (ERn(x)) of each problem are calculated.

A Fast Convergence Parameter for Monte Carlo–Neumann Solution of Linear Stochastic Systems

The Neumann series is a well-known technique to aid the solution of uncertainty propagation problems. However, convergence of the Neumann series can be very slow, often making its use highly inefficient. In this article, a fast convergence parameter (λ) convergence parameter is introduced, which yields accurate and efficient Monte Carlo–Neumann (MC-N) solutions of linear stochastic systems using first-order Neumann expansions. The λ convergence parameter is found as a solution to the distance minimization problem, for an approximation of the inverse of the system matrix using the Neumann series. The method presented herein is called Monte Carlo–Neumann with λ convergence, or simply the MC-N λ method. The accuracy and efficiency of the MC-N λ method are demonstrated in application to stochastic beam-bending problems.

Smoothing Analysis of Distributive Red-Black Jacobi Relaxation for Solving 2D Stokes Flow by Multigrid Method

Smoothing analysis process of distributive red-black Jacobi relaxation in multigrid method for solving 2D Stokes flow is mainly investigated on the nonstaggered grid by using local Fourier analysis (LFA). For multigrid relaxation, the nonstaggered discretizing scheme of Stokes flow is generally stabilized by adding an artificial pressure term. Therefore, an important problem is how to determine the zone of parameter in adding artificial pressure term in order to make stabilization of the algorithm for multigrid relaxation. To end that, a distributive red-black Jacobi relaxation technique for the 2D Stokes flow is established. According to the 2h-harmonics invariant subspaces in LFA, the Fourier representation of the distributive red-black Jacobi relaxation for discretizing Stokes flow is given by the form of square matrix, whose eigenvalues are meanwhile analytically computed. Based on optimal one-stage relaxation, a mathematical relation of the parameter in artificial pressure term between the optimal relaxation parameter and related smoothing factor is well yielded. The analysis results show that the numerical schemes for solving 2D Stokes flow by multigrid method on the distributive red-black Jacobi relaxation have a specified convergence parameter zone of the added artificial pressure term.