Approximating Solutions of Non-Linear Troesch’s Problem via an Efficient Quasi-Linearization Bessel Approach

نویسندگان

چکیده

Two collocation-based methods utilizing the novel Bessel polynomials (with positive coefficients) are developed for solving non-linear Troesch’s problem. In first approach, by expressing unknown solution and its second derivative in terms of matrix form along with some collocation points, governing equation transforms into a algebraic equation. technique quasi-linearization is employed to linearize model problem and, then, method applied sequence linearized equations iteratively. latter we require solve linear each iteration. Moreover, error analysis series established. end, numerical simulations computational results provided illustrate utility applicability presented approaches. Numerical comparisons existing available performed validate our results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem

This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...

متن کامل

Linearization coefficients of Bessel polynomials

We prove positivity results about linearization and connection coefficients for Bessel polynomials. The proof is based on a recursion formula and explicit formulas for the coefficients in special cases. The result implies that the distribution of a convex combination of independent Studentt random variables with arbitrary odd degrees of freedom has a density which is a convex combination of cer...

متن کامل

Efficient SimRank Computation via Linearization

SimRank, proposed by Jeh and Widom, provides a good similarity measure that has been successfully used in numerous applications. While there are many algorithms proposed for computing SimRank, their computational costs are very high. In this paper, we propose a new computational technique, “SimRank linearization,” for computing SimRank, which converts the SimRank problem to a linear equation pr...

متن کامل

Three Solutions For A Quasi-Linear Elliptic Problem∗

This paper shows the existence of at least three solutions for Navier problem involving the p(x)-biharmonic operator. Our technical approach is based on a theorem obtained by B. Ricceri.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2021

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math9161841