Pith. sign in

REVIEW 5 major objections 4 minor 33 references

Semi-orthogonal Tribonacci Wavelets and Numerical Solutions of Nonlinear Singular BVPs Arising in a Chemical Reaction

T0 review · 5 major / 4 minor · reviewed 2026-08-07 · deepseek-v4-flash

Pith's one-line read The paper introduces a semi-orthogonal tribonacci wavelet and a quasilinearization collocation method that solves nonlinear singular boundary value problems, reporting maximum errors lower than NSFD, bvp4c, Taylor-wavelet…

desk verdict A usable collocation scheme under a broken theoretical frame: the SOTW basis is not semi-orthogonal by the paper's own definition and the convergence proof rests on a false identity. read the letter →

arxiv 2506.14814 v1 pith:XL7XALJS submitted 2025-06-06 math.NA cs.NA

classification math.NAcs.NA MSC 65T6034B1634D15
keywords tribonacciwaveletsemi-orthogonalcollocationmethodquasilinearizationLane-EmdenequationEmden-Fowlerequationssingularboundaryvalueproblemsperturbation
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper introduces a new semi-orthogonal wavelet built from tribonacci polynomials and combines it with a quasilinearization step and a collocation grid to solve nonlinear singular boundary value problems of the form $s''(t)+(\alpha/t)s'(t)+g(t,s(t))=0$. The motive is practical: such equations model thermal explosions in cylindrical and spherical vessels, isothermal gas spheres, and shallow membrane caps, and their singularity at $t=0$ makes them hard for standard solvers. The paper reports that the method produces maximum absolute errors as low as $10^{-8}$ to $10^{-9}$ on Lane-Emden, Emden-Fowler, and singular perturbation test problems, with lower errors than the NSFD, bvp4c, Taylor-wavelet, Fibonacci-wavelet, and Haar-wavelet baselines it compares against. If these results hold, the scheme offers a straightforward recipe for assembling a linear system from the wavelet expansion of the second derivative: integrate twice, impose the boundary conditions, collocate, and solve.

What carries the argument

The central object is the semi-orthogonal tribonacci wavelet, $W_{n,m}(t)=2^{(k-1)/2}\hat T_m(2^{k-1}t-n+1)$ supported on $[(n-1)/2^{k-1}, n/2^{k-1})$, where $\hat T_m$ is the $m$-th tribonacci polynomial $T_m$ normalized by its $L^2$ norm over $[0,1]$. The tribonacci polynomials are defined by the recurrence $T_l(t)=t^2T_{l-1}(t)+tT_{l-2}(t)+T_{l-3}(t)$, with $T_0=1$, $T_1=t$, $T_2=t^2$. The method's mechanism is to expand the second derivative of the unknown function in this basis, integrate twice to obtain an expression for the solution in terms of the unknown wavelet coefficients and two integration constants, fix these constants through the boundary conditions, and then collocate at the equally spaced midpoints $t_l=(2l-1)/(2^kM)$ of the subintervals to create a linear system; quasilinearization handles the nonlinear term $g(t,s)$ by a Taylor-series iteration.

What would settle it

One can test the convergence claim directly: from recurrence (7), $T_2(y)=y^2$ and $T_3(y)=4y^3+2y$, while $T_3'(y)/3=(12y^2+2)/3$, which is not $y^2$. Since the proof of Theorem 4.2 uses exactly this equality to bound the wavelet coefficients and the truncation error, this calculation shows the stated convergence estimate is not valid for the tribonacci wavelets as defined.

Watch

Extended reading notes

Core claim

The central claim is that the tribonacci polynomials, normalized and placed on dyadic subintervals, generate a semi-orthogonal wavelet basis for $L^2[0,1]$, and that expanding the second derivative of the BVP solution in this basis yields a convergent collocation method. Specifically, the SOTW basis is $W_{n,m}(t)=2^{(k-1)/2}\hat T_m(2^{k-1}t-n+1)$ on the interval $[(n-1)/2^{k-1}, n/2^{k-1})$, with $\hat T_m$ the $m$-th tribonacci polynomial divided by its $L^2$ norm over $[0,1]$. The method writes the second derivative as a truncated wavelet series, integrates twice to express the solution in terms of the coefficients and two integration constants, uses the boundary conditions to fix the constants, and collocates at the midpoints $t_l=(2l-1)/(2^kM)$ to obtain a square linear system for the coefficients; quasilinearization converts the nonlinear term $g(t,s)$ into a sequence of linear problems. The numerical sections show maximum absolute errors decreasing as $M$ increases for $k=1$, and compare favorably with the listed baselines, which is taken as evidence of the method's effectiveness.

Load-bearing premise

The convergence proof in Section 4.3 assumes the identity $T_m(y)=T'_{m+1}(y)/(m+1)$ for tribonacci polynomials; that identity is false for the polynomials defined in the paper, so the stated truncation-error bound does not follow from the argument given.

Editorial extensions

If this is right

  • The method solves the quoted nonlinear singular test problems—Lane-Emden with $s^5$ and $e^s$ nonlinearities, two third-order Emden-Fowler equations, and a linear singular perturbation problem—with reported maximum absolute errors in the $10^{-7}$ to $10^{-10}$ range, lower than each of the comparison baselines tabulated.
  • Both boundary-condition types used by the model, $s(0)=\zeta_1,\ s(1)=\zeta_2$ and $s'(0)=\zeta_3,\ ms(1)+ns'(1)=\zeta_4$, are folded into the linear system, so the scheme covers the boundary structures arising in the motivating physical problems.
  • Increasing the polynomial order $M$ at fixed resolution $k=1$ monotonically reduces the reported maximum error in every test example, with CPU time growing from well under a second to a few hundred seconds in the largest third-order cases.
  • Because the basis functions are polynomials on dyadic subintervals with closed form, the inner products forming the collocation system are computed analytically, which is what allows the method to run as a small linear solve at each quasilinearization iteration.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • All numerical experiments use $k=1$, so the dyadic-resolution lever of the wavelet construction is never exercised; a reader could rerun one of the examples at $k=2$ and $k=3$ to see whether the error decays in $k$ as the definition of the basis suggests.
  • The construction is a case of a general recipe: any polynomial family obeying a constant-coefficient recurrence can be normalized and placed on dyadic subintervals to form a semi-orthogonal wavelet, and the paper does not isolate how much of the reported accuracy comes from the tribonacci choice specifically rather than from the quasilinearization-plus-collocation framework.
  • The same integrate-twice-and-collocate pattern extends naturally to higher-order problems by carrying more integration constants, which is how the paper treats the third-order Emden-Fowler equations; a direct next test would be to apply the scheme to boundary layers with even smaller $\varepsilon$ than $1/128$.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

5 major / 4 minor

Summary. The paper introduces a family of basis functions called semi-orthogonal Tribonacci wavelets (SOTW), constructed from tribonacci polynomials on dyadic subintervals of [0,1], and proposes a quasilinearization-based collocation method (SOTWQCM) for nonlinear singular boundary value problems of Lane-Emden, Emden-Fowler, and singular-perturbation type. The manuscript reports numerical errors for several test problems, compares them against NSFD, bvp4c, Taylor, Fibonacci, and Haar wavelet methods, and states a convergence theorem for the SOTW expansion. The central advertised novelty is the semi-orthogonality of the wavelet family and the convergence guarantee that this property is claimed to provide.

Significance. If the SOTW basis were genuinely semi-orthogonal under the paper's Definition 2.3 and if the convergence theorem were valid, the method would offer a practically attractive, explicitly computable wavelet collocation scheme for a useful class of singular BVPs. The paper has a substantive numerical component: several test problems with known exact solutions are treated, and the reported maximum errors are often small and compare favorably with the cited alternatives. However, the two theoretical pillars of the paper are not established: the basis defined in (13) is not semi-orthogonal under the paper's own definition, and the convergence proof in Section 4.3 relies on a false polynomial identity. These are load-bearing flaws, not presentational issues. The numerical experiments may still indicate that a piecewise-polynomial collocation method is effective, but the manuscript as written does not support its advertised wavelet framework or convergence guarantee.

major comments (5)
  1. [Section 3, Definition 2.3, Eq. (13)] The basis defined in (13) is not semi-orthogonal under Definition 2.3, which requires <W_{j,k},W_{l,m}>=0 for j != l. Take k=2,n=1,m=0 and k=3,n=1,m=0. Since T_0=1 and z_0=1, these functions are sqrt(2) on [0,1/2) and 2 on [0,1/4), respectively. Their inner product is the integral from 0 to 1/4 of 2*sqrt(2), namely sqrt(2)/2, which is nonzero. Thus different resolution levels are not mutually orthogonal, and the family does not satisfy the defining property of a semi-orthogonal wavelet. Consequently, the expansions (14)-(16) are not semi-orthogonal wavelet expansions, and the theoretical framework of the paper is unsupported.
  2. [Section 4.3, Theorem 4.2, Eqs. (41)-(43)] The convergence proof uses the identity T_m(y)=T'_{m+1}(y)/(m+1), which is false for tribonacci polynomials. For m=2, T_2(y)=y^2, while T_3'(y)/3=(4y^3+2y)/3; these are not equal. This identity is used both to bound P^2W_{n,m}(t) and to bound the expansion coefficients |rho_{n,m}|, so the estimates that lead to the conclusion ||Delta_{k,M}|| -> 0 do not follow. Theorem 4.2 is therefore not proven as stated.
  3. [Section 5, Example 5.1, Tables 1 and 2] The reported maximum errors for the same method and parameters are inconsistent. Table 1 lists delta_max = 6.90402E-08 for k=1, M=9, while Table 2 lists 6.90402E-09 for the same k=1, M=9 entry and 6.74738E-10 for k=1, M=10. At least one of these entries is wrong, and the inconsistency affects the central numerical claim that increasing M reduces the error and that SOTWQCM outperforms the comparators. The numerical results for Example 5.1 are therefore not reproducible as reported.
  4. [Section 5, Example 5.5, Table 8] The text states that increasing M leads to a reduction in error for Example 5.5, but Table 8 shows delta_max = 1.11937E-06 for M=7 and delta_max = 4.23564E-06 for M=9, i.e., the error increases when M goes from 7 to 9 before decreasing again at M=11. This non-monotone behavior is not discussed, and it weakens the claim of systematic convergence with respect to M. The authors should either explain this behavior or qualify the convergence statement.
  5. [Section 5, Tables 2, 4, 7, 9, 10] The comparisons with the bvp4c MATLAB solver do not specify the tolerance settings used, and the reported bvp4c errors do not consistently improve with the reported mesh size; for example, in Table 10 with epsilon=1/64, the bvp4c error is 7.0150918E-05 at n=100 and 1.5422064E-04 at n=200. Because bvp4c is an adaptive solver, the reported n values are not meaningful without the tolerance parameters, so the claimed superiority over bvp4c is not established by the data as presented.
minor comments (4)
  1. [Section 3, Eq. (13)] The index k is omitted from the notation W_{n,m}(t) although k appears on the right-hand side. This is confusing, especially because the examples for k=3 use notation such as W_{1,0}; the authors should write W_{k,n,m}(t) or otherwise make the resolution level explicit.
  2. [Section 3, displayed SOTW basis for k=3, M=3] In the list of basis functions, W_{3,2}(t) on [1/2,3/4) is written as 2*sqrt(5)(4t-1)^2, but the local variable on this interval should be 4t-2, giving 2*sqrt(5)(4t-2)^2. This appears to be a typo; the other functions on their respective intervals are consistent with the shifted argument.
  3. [Section 5.1, Step 5, and Example 5.3] The initial guess vector is described as [1,1,...,1] in Example 5.1 and [0,0,...,0] in Example 5.2, but the algorithm does not state how initial guesses are generated when the problem has no obvious starting function, nor how many quasilinearization iterations are performed. Adding this information would improve reproducibility.
  4. [Throughout] The manuscript contains numerous typographical errors, including 'soluti ons' in the title, 'bi-infinte' in Definition 2.1, 'discritization' in Section 4, and inconsistent spacing around equations. A careful proofreading pass is needed.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: the SOTW basis and collocation scheme are independently defined and tested against known exact solutions; the flagged mathematical errors are soundness concerns, not circular reasoning.

full rationale

The paper's derivation chain does not reduce to its own inputs. The semi-orthogonal Tribonacci wavelet basis in Eq. (13) is defined directly from the tribonacci polynomials in Eq. (7) via an explicit normalization factor 1/sqrt(z_m), with no parameter fitted to the target solutions or to the benchmark data. The collocation coefficients are obtained by solving the linear system B = G D^{-1} with D = <W,W>, which is a standard projection step and not a disguised restatement of the numerical results. The numerical tests compare SOTWQCM errors against known exact solutions and against external methods (NSFD, bvp4c, Taylor, Fibonacci, Haar wavelets), so the central claim that the method is accurate is externally checkable rather than self-referential. The paper contains self-citations, notably [11], [27], [31], and [32], but these are used for background, quasilinearization, and comparison baselines; none is invoked as the sole justification of the central convergence or accuracy claim. The serious issues in the paper are mathematical correctness problems, not circularity: the identity T_m(y) = T'_{m+1}(y)/(m+1) used in Theorem 4.2 is false (e.g., T_2 = y^2 while T'_3/3 = (4y^3 + 2y)/3), and the basis in Eq. (13) fails the paper's own Definition 2.3 of semi-orthogonality because wavelets at different resolution levels can have nonzero inner products. These flaws undermine the convergence proof and the advertised wavelet framework, but they are not instances of predictions being equivalent to fitted inputs or of load-bearing self-citations. Accordingly, the appropriate circularity finding is low, with the score reflecting only the presence of minor non-load-bearing self-citations that do not affect the independence of the numerical evidence.

Assumptions & free parameters 0 free parameters · 3 assumptions · 1 invented entities

The central claim rests on the smoothness of the underlying BVP, the convergence of the quasilinearization iteration, and the convergence of the SOTW expansion. The last of these is not established because the proof uses a false derivative identity for tribonacci polynomials. No fitted free parameters are present; k and M are user-chosen resolution parameters. The SOTW basis is the only invented entity, and it lacks independent evidence outside the paper's internal tests.

assumptions (3)
  • domain assumption The nonlinear term g(t,s) is continuous in t and twice continuously differentiable in s, and the quasilinearization sequence converges to the solution of the original BVP.
    Used in Theorem 4.1 to linearize Eq (22); convergence of the iterative scheme is assumed standard but not proven here.
  • domain assumption The solution s(t) of (4) is sufficiently smooth so that s'' is bounded and square-integrable on [0,1].
    Required for the SOTW expansion (35) and the convergence theorem 4.2.
  • ad hoc to paper The SOTW family (13) provides a convergent approximation in L2[0,1] with the coefficient formula (18).
    This is the claimed novelty; the proof relies on the incorrect derivative identity, so it is not established.
invented entities (1)
  • Semi-orthogonal Tribonacci wavelet (SOTW) basis
    purpose: Used as the approximation basis in the collocation method for solving nonlinear singular BVPs.
    Defined in Eq (13) from normalized tribonacci polynomials; its wavelet-theoretic properties (Riesz basis, dual wavelet, semi-orthogonality) are asserted but not proven, and its usefulness is supported only by the paper's own numerical examples.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Semi-orthogonal Tribonacci Wavelets and Numerical Solutions of Nonlinear Singular BVPs Arising in a Chemical Reaction." pith.science (2026). https://pith.science/paper/XL7XALJS

@misc{pith2026250614814,
  author       = {Pith},
  title        = {Pith review of: Semi-orthogonal Tribonacci Wavelets and Numerical Solutions of Nonlinear Singular BVPs Arising in a Chemical Reaction},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/XL7XALJS}},
  note         = {Machine review of arXiv:2506.14814}
}
read the original abstract

In this article, we introduce a semi-orthogonal tribonacci wavelet and develop a semi-orthogonal tribonacci wavelet collocation method, offering an effective numerical method for solving a class of non-linear singular BVPs.

Figures

Figures reproduced from arXiv: 2506.14814 by the authors.

Figure 3.1
Figure 3.1. Graph of the SOTW for k = 3, M = 3. 5 [PITH_FULL_IMAGE:figures/full_fig_p005_3_1.png] view at source ↗
Figure 3.2
Figure 3.2. Plot of function approximation of g(t) and corressponding absoulte error using SOTW method. 4 Methodology This section presents the methodology for computing solution of nonlinear singular differential equation of the different form using the semi-orthogonal tribonacci wavelet collocation method (SOTWCM) combined with quasilinearization. Quasilinearization is first used to linearize the NSBVPs. The numerical solutio… view at source ↗

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

33 extracted references · 31 canonical work pages

  1. [1]

    Nonlinear boundary value p roblems for shallow membrane caps, ii

    John V Baxley and Stephen B Robinson. Nonlinear boundary value p roblems for shallow membrane caps, ii. Journal of Computational and Applied Mathematics , 88(1):203–224, 1998

  2. [2]

    P. L. Chambr´ e. On the solution of the Poisson-Boltzmann equat ion with application to the theory of thermal explosions. The Journal of Chemical Physics , 20(11):1795–1797, 1952

  3. [3]

    An introduction to wavelets , volume 1

    Charles K Chui. An introduction to wavelets , volume 1. Academic press, 1992

  4. [4]

    Ten lectures on wavelets

    Ingrid Daubechies. Ten lectures on wavelets . SIAM, 1992

  5. [5]

    Rotationally symmetric solutions for shallow membrane c aps

    R W Dickey. Rotationally symmetric solutions for shallow membrane c aps. Quarterly of Applied Mathematics , 47(3):571–581, 1989

  6. [6]

    Fibonacci-tribonacci

    Mark Feinberg. Fibonacci-tribonacci. The Fibonacci Quarterly , 1(3):71–74, 1963

  7. [7]

    On solving fir st-kind integral equations using wavelets on a bounded interval

    Jaideva C Goswami, Andrew K Chan, and Charles K Chui. On solving fir st-kind integral equations using wavelets on a bounded interval. IEEE Transactions on antennas and propagation , 43(6):614–622, 1995

  8. [8]

    Taylor wavelet solution of linear and nonlinear Lan e-Emden equations

    Sevin G¨ umg¨ um. Taylor wavelet solution of linear and nonlinear Lan e-Emden equations. Applied Numerical Mathematics, 158:44–53, 2020

Show all 33 references
  1. [9]

    Application of Legendre wavelets for solving fractional differential equations

    Hossein Jafari, Sohrab Ali Yousefi, MA Firoozjaee, Shaher Moma ni, and Chaudry Masood Khalique. Application of Legendre wavelets for solving fractional differential equations . Computers & Mathematics with Applications , 62(3):1038–1045, 2011

  2. [10]

    An overview of wavelet based multiresolution analyses

    Bj¨ orn Jawerth and Wim Sweldens. An overview of wavelet based multiresolution analyses. SIAM Review , 36(3):377–412, September 1994

  3. [11]

    On the choice of denomin ator functions and convergence of NSFD schemes for a class of nonlinear SBVPs

    Sheerin Kayenat and Amit Kumar Verma. On the choice of denomin ator functions and convergence of NSFD schemes for a class of nonlinear SBVPs. Mathematics and Computers in Simulation , 200:263–284, 2022

  4. [12]

    Bernoulli wavelet op erational matrix of fractional order integra- tion and its applications in solving the fractional order differential eq uations

    E Keshavarz, Y Ordokhani, and M Razzaghi. Bernoulli wavelet op erational matrix of fractional order integra- tion and its applications in solving the fractional order differential eq uations. Applied Mathematical Modelling , 38(24):6038–6051, 2014

  5. [13]

    Solution of third-or der Emden–Fowler-type equations using wavelet methods

    Arshad Khan, Mo Faheem, and Akmal Raza. Solution of third-or der Emden–Fowler-type equations using wavelet methods. Engineering Computations, 38(6):2850–2881, January 2021

  6. [14]

    Khuri and A

    S.A. Khuri and A. Sayfy. A novel approach for the solution of a class of singular boundary value problems arising in physiology. Mathematical and Computer Modelling , 52(3–4):626–636, August 2010

  7. [15]

    Fibonacci and Lucas Numbers with Applications, Volume 2

    Thomas Koshy. Fibonacci and Lucas Numbers with Applications, Volume 2 . John Wiley & Sons, 2019

  8. [16]

    Homer J Lane. On the theoretical temperature of the sun, un der the hypothesis of a gaseous mass maintaining its volume by its internal heat, and depending on the laws of gases as known to terrestrial experiment. American Journal of Science , 2(148):57–74, 1870

  9. [17]

    Numerical solution of differential equations using Haar wav elets

    ¨Ulo Lepik. Numerical solution of differential equations using Haar wav elets. Mathematics and computers in simulation, 68(2):127–143, 2005

  10. [18]

    Weak formulation based Haar wavelet method for solving differential equations

    J¨ uri Majak, Meelis Pohlak, Martin Eerme, and Toomas Lepikult. Weak formulation based Haar wavelet method for solving differential equations. Applied Mathematics and Computation , 211(2):488–494, May 2009

  11. [19]

    Quasilinearization approach to non linear problems in physics with application to nonlinear odes

    VB Mandelzweig and F Tabakin. Quasilinearization approach to non linear problems in physics with application to nonlinear odes. Computer Physics Communications , 141(2):268–281, 2001

  12. [20]

    Solving nonline ar boundary value problems using the higher order Haar wavelet method

    Mart Ratas, J¨ uri Majak, and Andrus Salupere. Solving nonline ar boundary value problems using the higher order Haar wavelet method. Mathematics, 9(21):2809, November 2021

  13. [21]

    Non-uniform Haar wavelet metho d for solving singularly perturbed differential difference equations of neuronal variability

    Akmal Raza and Arshad Khan. Non-uniform Haar wavelet metho d for solving singularly perturbed differential difference equations of neuronal variability. Applications and Applied Mathematics: An International Jo urnal (AAM), 15(3):5, 2020. 14

  14. [22]

    Fibonacci wavelets and their applications for solving two classes of time-varying delay problems

    Sedigheh Sabermahani, Yadollah Ordokhani, and Sohrab-Ali You sefi. Fibonacci wavelets and their applications for solving two classes of time-varying delay problems. Optimal Control Applications and Methods , 41(2):395–416, 2020

  15. [23]

    A new algorithm for solving generalized systems of second-order boundary value problems using nonpolynomial spline technique

    Shahna and Arshad Khan. A new algorithm for solving generalized systems of second-order boundary value problems using nonpolynomial spline technique. Proceedings of the National Academy of Sciences, India Sect ion A: Physical Sciences , 91(2):225–235, October 2020

  16. [24]

    Singular boundary value problems for ODE s

    Lawrence F Shampine. Singular boundary value problems for ODE s. Applied Mathematics and Computation , 138(1):99–112, 2003

  17. [25]

    An efficient numerical techniq ue for the solution of nonlinear singular boundary value problems

    Randhir Singh and Jitendra Kumar. An efficient numerical techniq ue for the solution of nonlinear singular boundary value problems. Computer Physics Communications , 185(4):1282–1289, April 2014

  18. [26]

    An introduction to the study of stellar structure , volume 2

    Subrahmanyan and Chandrasekhar. An introduction to the study of stellar structure , volume 2. Courier Corpo- ration, 1957

  19. [27]

    Highe r order Emden-Fowler type equations via uniform Haar wavelet resolution technique

    Swati, Karanjeet Singh, Amit K Verma, and Mandeep Singh. Highe r order Emden-Fowler type equations via uniform Haar wavelet resolution technique. Journal of Computational and Applied Mathematics , 376:112836, 2020

  20. [28]

    Quadrature formulae and as ymptotic error expansions for wavelet approxi- mations of smooth functions

    Wim Sweldens and Robert Piessens. Quadrature formulae and as ymptotic error expansions for wavelet approxi- mations of smooth functions. SIAM Journal on Numerical Analysis , 31(4):1240–1264, August 1994

  21. [29]

    A family of poly nomial spline wavelet transforms

    Michael Unser, Akram Aldroubi, and Murray Eden. A family of poly nomial spline wavelet transforms. Signal Processing, 30(2):141–162, January 1993

  22. [30]

    Verma, Biswajit Pandit, Lajja Verma, and Ravi P

    Amit K. Verma, Biswajit Pandit, Lajja Verma, and Ravi P. Agarw al. A review on a class of second order nonlinear singular bvps. Mathematics, 8(7), 2020

  23. [31]

    Higher resolution methods based o n quasilinearization and Haar wavelets on Lane-Emden equations

    Amit K Verma and Diksha Tiwari. Higher resolution methods based o n quasilinearization and Haar wavelets on Lane-Emden equations. International Journal of Wavelets, Multiresolution and In formation Processing , 17(03):1950005, 2019

  24. [32]

    Numerical solutions of generalized Rosenau–KDV–RL W equa- tion by using Haar wavelet collocation approach coupled with nonstan dard finite difference scheme and quasilin- earization

    Amit Kumar Verma and Mukesh Kumar Rawani. Numerical solutions of generalized Rosenau–KDV–RL W equa- tion by using Haar wavelet collocation approach coupled with nonstan dard finite difference scheme and quasilin- earization. Numerical Methods for Partial Differential Equations , ...

  25. [33]

    Solving two Emden-Fowler type equations o f third order by the variational iteration method

    Abdul-Majid Wazwaz. Solving two Emden-Fowler type equations o f third order by the variational iteration method. Applied Mathematics & Information Sciences , 9(5):2429, 2015. 15

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.