World Scientific News
EISSN 2392-2192
  • Login
  • Home
  • About
    • About Us
    • Editorial Board
    • Guide for Authors
    • Abstracting & Indexing
    • Instruction for Authors
    • Submit your Article
  • View Articles
    • 2026
    • 2025
    • 2024
    • 2023
    • 2022
    • 2021
    • 2020
    • 2019
    • 2018
    • 2017
    • 2016
    • 2015
    • 2014
    • 2013
  • Careers
  • News
No Result
View All Result
SUBMIT ARTICLE
Register
  • Home
  • About
    • About Us
    • Editorial Board
    • Guide for Authors
    • Abstracting & Indexing
    • Instruction for Authors
    • Submit your Article
  • View Articles
    • 2026
    • 2025
    • 2024
    • 2023
    • 2022
    • 2021
    • 2020
    • 2019
    • 2018
    • 2017
    • 2016
    • 2015
    • 2014
    • 2013
  • Careers
  • News
No Result
View All Result
World Scientific News
No Result
View All Result
Home 2026

A Modified Hybrid Steffensen’s Method Using Adaptive Weights for Solving Nonlinear Equations

Authors: Danny Darliansyah, Zhafir Al Haq Taqiyyuddin, Ali Aqil Badruzzaman, Sri Purwani, WSN 218 (2026) 127-138

2026-08-31
Reading Time: 3 mins read
0

https://doi.org/10.65770/BNRC9106

ABSTRACT

This paper proposes a modified hybrid Steffensen method for solving nonlinear equations, in which the fixed convex combination weight of the standard hybrid scheme is replaced by an adaptive residual-based weight. At each step, the forward and backward Steffensen candidates are computed and combined through a weight that automatically concentrates on whichever candidate has the smaller residual. The convergence analysis establishes that the proposed scheme retains second-order convergence and, under the condition that the derivative of the function at the simple root lies strictly between zero and one, achieves a smaller asymptotic error constant than the equal-weight combination. Numerical experiments on twenty test functions of polynomial, trigonometric, exponential, logarithmic, and mixed type confirm that the adaptive variant requires fewer or equal iterations than the constant-weight method in every case considered, with the largest reduction observed where the fixed weight is locally inefficient. The number of function evaluations and the computational order of convergence are reported alongside the iteration counts to give a balanced view of the cost of the adaptive scheme.

References

  • [1] Bate, K. Senapati, S. George, I. K. Argyros, M. I. Argyros, Convergence analysis of Jarratt-like methods for solving nonlinear equations for thrice-differentiable operators. AppliedMath 5(2) (2025) 38.
  • [2] M. S. Bawazir, Ninth and twelfth-order iterative methods for roots of nonlinear equations. Journal of Mathematical Analysis and Modeling 6(1) (2025) 35-45.
  • [3] Candelario, A. Cordero, J. R. Torregrosa, M. P. Vassileva, Generalized conformable fractional Newton-type method for solving nonlinear systems. Numerical Algorithms 93 (2023) 1171-1208.
  • [4] Dzunic, M. S. Petkovic, A cubically convergent Steffensen-like method for solving nonlinear equations. Applied Mathematics Letters 25(11) (2012) 1881-1886.
  • [5] Eskandari, Hybrid Steffensen’s method for solving nonlinear equation. Applied Mathematics 13(11) (2022) 745-752.
  • [6] H. Geum, Derivation of a numerical method with free second-order derivatives. International Journal of Pure Mathematics 9 (2022) 7-9.
  • [7] Karri, S. K. Vishwakarma, R. Sharma, G. Kaushik, A. Bhatt, R. Saxena, Technical indicator-based stock price forecasting using an extreme learning machine with deterministic weight adjustment. Proceedings of the 2025 IEEE 5th International Conference on ICT in Business Industry and Government (ICTBIG 2025).
  • [8] Liu, Q. Zheng, A one-step Steffensen-type method with super-cubic convergence for solving nonlinear equations. Procedia Computer Science 29 (2014) 1870-1875.
  • [9] Liu, Q. Zheng, P. Zhao, A variant of Steffensen’s method of fourth-order convergence and its applications. Applied Mathematics and Computation 216(7) (2010) 1978-1983.
  • Matinfar, M. Aminzadeh, Three-step iterative methods with eighth-order convergence for solving nonlinear equations. Journal of Interpolation and Approximation in Scientific Computing 2013 (2013) 1-11.
  • K. Parida, D. K. Gupta, A cubic convergent iterative method for enclosing simple roots of nonlinear equations. Applied Mathematics and Computation 187(2) (2007) 1544-1551.
  • Turkyilmazoglu, A simple algorithm for high order Newton iteration formulae and some new variants. Hacettepe Journal of Mathematics and Statistics 49(1) (2020) 425-438.
  • Usman, S. Haq, A. Jan, A new iterative multi-step method for solving nonlinear equations. MethodsX 14 (2025) 103178.
  • C. N. Verheijen, D. Goswami, M. Lazar, SuperADMM: solving quadratic programs faster with dynamic weighting ADMM. Proceedings of the 29th International Conference on System Theory, Control and Computing (ICSTCC 2025) 569-575.
  • Weerakoon, T. G. I. Fernando, A variant of Newton’s method with accelerated third-order convergence. Applied Mathematics Letters 13(8) (2000) 87-93.
  • Yang, J. Liu, Z. Wu, S. He, A fusion algorithm based on whale and grey wolf optimization algorithm for solving real-world optimization problems. Applied Soft Computing 146 (2023) 110701.
  • F. Yumanova, One specification of Steffensen’s method for solving nonlinear operator equations. Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp’yuternye Nauki 26(4) (2016) 579-590.
  • Zafar, A. Cordero, S. Mujtaba, J. R. Torregrosa, A hybrid Steffensen-genetic algorithm for finding multi-roots of nonlinear equations and applications to biomedical engineering. Algorithms 18(9) (2025) 582.
  • Zheng, J. Wang, P. Zhao, L. Zhang, A Steffensen-like method and its higher-order variants. Applied Mathematics and Computation 214(1) (2009) 10-16.
  • Zheng, P. Zhao, L. Zhang, W. Ma, Variants of Steffensen-secant method and applications. Applied Mathematics and Computation 216(12) (2010) 3486-3496.
  • Zheng, F. Huang, X. Guo, X. Feng, Doubly-accelerated Steffensen’s methods with memory and their applications on solving nonlinear ODEs. Journal of Computational Analysis and Applications 15(5) (2013) 886-891.
  • Zhu, T. Niu, M. Petrongolo, Iterative CT reconstruction via minimizing adaptively reweighted total variation. Journal of X-Ray Science and Technology 22(2) (2014) 227-240.
  • Zhu, A. Zhou, D. He, S. Wang, A novel hybrid method based on genetic algorithms and neural networks. Proceedings of the 2011 International Conference on Network Computing and Information Security (NCIS 2011), Vol. 2 (2011) 20-23.

Download all article in PDF

WSN 218 (2026) 127-138


 

ADVERTISEMENT
Tags: Adaptive weightingConvex combinationIterative methods.Nonlinear EquationsSteffensen method
ShareTweetPin
Next Post

Alkaline Hydrolysis of Waste Pet Bottles for the Production of Terephthalic Acid and Ethylene Glycol

Synthesis and Mesomorphic Behavior of Azo-Cinnamate Containing Highly Polar Pyridine Derivatives

View free articles

  • Open access

View Articles

  • 2013 (5)
    • Volume 1 (2013), pp. 1-14 (2)
    • Volume 2 (2013), pp. 1-29 (3)
  • 2014 (13)
    • Volume 3 (2014), pp. 1-21 (3)
    • Volume 4 (2014), pp. 1-16 (2)
    • Volume 5 (2014), pp. 1-36 (4)
    • Volume 6 (2014), pp. 1-23 (3)
  • 2015 (109)
    • Volume 10 (2015), pp. 1-100 (5)
    • Volume 11 (2015), pp. 1-96 (6)
    • Volume 12 (2015), pp. 1-76 (6)
    • Volume 13 (2015), pp. 1-130 (7)
    • Volume 14 (2015), pp. 1-55 (1)
    • Volume 15 (2015), pp. 1-25 (2)
    • Volume 16 (2015), pp. 1-158 (9)
    • Volume 17 (2015), pp. 1-63 (1)
    • Volume 18 (2015), pp. 1-127 (8)
    • Volume 19 (2015), pp. 1-111 (7)
    • Volume 20 (2015), pp. 1-336 (1)
    • Volume 21 (2015), pp. 1-89 (7)
    • Volume 22 (2015), pp. 1-119 (8)
    • Volume 23 (2015), pp. 1-127 (10)
    • Volume 24 (2015), pp. 1-87 (6)
    • Volume 7 (2015), pp. 1-237 (9)
    • Volume 8 (2015), pp. 1-203 (7)
    • Volume 9 (2015), pp. 1-160 (9)
  • 2016 (517)
    • Volume 25 (2016), pp. 1-16 (2)
    • Volume 26 (2016), pp. 1-19 (2)
    • Volume 27 (2016), pp. 1-16 (2)
    • Volume 28 (2016), pp. 1-100 (7)
    • Volume 29 (2016), pp. 1-95 (6)
    • Volume 30 (2016), pp. 1-142 (10)
    • Volume 31 (2016), pp. 1-124 (8)
    • Volume 32 (2016), pp. 1-81 (9)
    • Volume 33 (2016), pp. 1-121 (8)
    • Volume 34 (2016), pp. 1-145 (10)
    • Volume 35 (2016), pp. 1-133 (10)
    • Volume 36 (2016), pp. 1-152 (10)
    • Volume 37 (2016), pp. 1-303 (18)
    • Volume 38 (2016), pp. 1-59 (1)
    • Volume 39 (2016), pp. 1-30 (2)
    • Volume 40 (2016), pp. 1-299 (20)
    • Volume 41 (2016), pp. 1-287 (36)
    • Volume 42 (2016), pp. 1-316 (21)
    • Volume 43(1,2,3) (2016), pp. 1-157 (3)
      • Volume 43, Issue 1 (2016), pp. 1-55 (1)
      • Volume 43, Issue 2 (2016), pp. 56-103 (1)
      • Volume 43, Issue 3 (2016), pp. 104-157 (1)
    • Volume 44 (2016), pp. 1-301 (20)
    • Volume 45(1,2) (2016), pp. 1-383 (21)
      • Volume 45, Issue 1 (2016), pp. 1-62 (1)
      • Volume 45, Issue 2 (2016), pp. 63-383 (20)
    • Volume 46 (2016), pp. 1-286 (20)
    • Volume 47(1,2) (2016), pp. 1-350 (21)
      • Volume 47, Issue 1 (2016), pp. 1-61 (1)
      • Volume 47, Issue 2 (2016), pp. 62-350 (20)
    • Volume 48 (2016), pp. 1-163 (17)
    • Volume 49(1,2) (2016), pp. 1-404 (21)
      • Volume 49, Issue 1 (2016), pp. 1-58 (1)
      • Volume 49, Issue 2 (2016), pp. 59-404 (20)
    • Volume 50 (2016), pp. 1-316 (20)
    • Volume 51 (2016), pp. 1-71 (7)
    • Volume 52 (2016), pp. 1-275 (20)
    • Volume 53(1,2,3) (2016), pp. 1-429 (22)
      • Volume 53, Issue 1 (2016), pp. 1-66 (1)
      • Volume 53, Issue 2 (2016), pp. 67-109 (1)
      • Volume 53, Issue 3 (2016), pp. 110-429 (20)
    • Volume 54 (2016), pp. 1-299 (20)
    • Volume 55 (2016), pp. 1-288 (20)
    • Volume 56 (2015), pp. 1-266 (20)
    • Volume 57 (2016), pp. 1-570 (53)
    • Volume 58 (2016), pp. 1-161 (10)
    • Volume 59 (2016), pp. 1-128 (10)
    • Volume 60 (2016), pp. 1-120 (10)
  • 2017 (481)
    • Volume 61(1,2) (2017), pp. 1-194 (11)
      • Volume 61, Issue 1 (2017), pp. 1-51 (1)
      • Volume 61, Issue 2 (2017), pp. 52-194 (10)
    • Volume 62 (2017), pp. 1-146 (10)
    • Volume 63 (2017), pp. 1-240 (1)
    • Volume 64 (2017), pp. 1-140 (10)
    • Volume 65 (2017), pp. 1-175 (10)
    • Volume 66 (2017), pp. 1-300 (20)
    • Volume 67(1,2,) (2017), pp. 1-389 (21)
      • Volume 67, Issue 1 (2017), pp. 1-67 (1)
      • Volume 67, Issue 2 (2017), pp. 68-389 (20)
    • Volume 68 (2017), pp. 1-141 (1)
    • Volume 69 (2017), pp. 1-253 (20)
    • Volume 70(1,2) (2017), pp. 1-321 (21)
      • Volume 70, Issue 1 (2017), pp. 1-50 (1)
      • Volume 70, Issue 2 (2017), pp. 51-321 (20)
    • Volume 71 (2017), pp. 1-219 (18)
    • Volume 72 (2017), pp. 1-478 (46)
    • Volume 73 (2017), pp. 1-133 (15)
    • Volume 74 (2017), pp. 1-287 (20)
    • Volume 75 (2017), pp. 1-111 (12)
    • Volume 76 (2017), pp. 1-199 (20)
    • Volume 77(1,2) (2017), pp. 1-380 (21)
      • Volume 77, Issue 1 (2017), pp. 1-102 (1)
      • Volume 77, Issue 2 (2017), pp. 103-380 (20)
    • Volume 78 (2017), pp. 1-230 (24)
    • Volume 79 (2017), pp. 1-89 (1)
    • Volume 80 (2017), pp. 1-323 (20)
    • Volume 81(1,2) (2017), pp. 1-312 (21)
      • Volume 81, Issue 1 (2017), pp. 1-47 (1)
      • Volume 81, Issue 2 (2017), pp. 48-312 (20)
    • Volume 82 (2017), pp. 1-90 (1)
    • Volume 83 (2017), pp. 1-239 (20)
    • Volume 84 (2017), pp. 1-92 (1)
    • Volume 85 (2017), pp. 1-73 (10)
    • Volume 86(1,2,3) (2017), pp. 1-370 (22)
      • Volume 86, Issue 1 (2017), pp. 1-58 (1)
      • Volume 86, Issue 2 (2017), pp. 59-122 (1)
      • Volume 86, Issue 3 (2017), pp. 123-370 (20)
    • Volume 87 (2017), pp. 1-255 (20)
    • Volume 88(1,2) (2017), pp. 1-226 (11)
      • Volume 88, Issue 1 (2017), pp. 1-57 (1)
      • Volume 88, Issue 2 (2017), pp. 58-226 (10)
    • Volume 89 (2017), pp. 1-321 (33)
    • Volume 90 (2017), pp. 1-270 (20)
  • 2018 (486)
    • Volume 100 (2018), pp. 1-253 (20)
    • Volume 101 (2018), pp. 1-252 (20)
    • Volume 102 (2018), pp. 1-223 (20)
    • Volume 103 (2018), pp. 1-249 (18)
    • Volume 104 (2018), pp. 1-492 (40)
    • Volume 105 (2018), pp. 1-232 (20)
    • Volume 106 (2018), pp. 1-244 (20)
    • Volume 107 (2018), pp. 1-232 (20)
    • Volume 108 (2018), pp. 1-244 (20)
    • Volume 109 (2018), pp. 1-266 (19)
    • Volume 110 (2018), pp. 1-243 (20)
    • Volume 111 (2018), pp. 1-181 (17)
    • Volume 112 (2018), pp. 1-251 (20)
    • Volume 113 (2018), pp. 1-250 (26)
    • Volume 114 (2018), pp. 1-264 (20)
    • Volume 91 (2018), pp. 1-137 (10)
    • Volume 92(1,2) (2018), pp. 1-399 (21)
      • Volume 92, Issue 1 (2018), pp. 1-138 (1)
      • Volume 92, Issue 2 (2018), pp. 139-399 (20)
    • Volume 93 (2018), pp. 1-141 (15)
    • Volume 94(1,2) (2018), pp. 1-332 (21)
      • Volume 94, Issue 1 (2018), pp. 1-71 (1)
      • Volume 94, Issue 2 (2018), pp. 72-332 (20)
    • Volume 95 (2018), pp. 1-272 (20)
    • Volume 96 (2018), pp. 1-250 (20)
    • Volume 97 (2018), pp. 1-284 (20)
    • Volume 98 (2018), pp. 1-232 (20)
    • Volume 99 (2018), pp. 1-229 (19)
  • 2019 (467)
    • Volume 115 (2019), pp. 1-268 (20)
    • Volume 116 (2019), pp. 1-252 (19)
    • Volume 117 (2019), pp. 1-242 (20)
    • Volume 118 (2019), pp. 1-280 (20)
    • Volume 119 (2019), pp. 1-253 (20)
    • Volume 120(1,2) (2019), pp. 1-295 (21)
      • Volume 120, Issue 1 (2019), pp. 1-59 (1)
      • Volume 120, Issue 2 (2019), pp. 60-295 (20)
    • Volume 121 (2019), pp. 1-100 (13)
    • Volume 122 (2019), pp. 1-262 (20)
    • Volume 123 (2019), pp. 1-273 (20)
    • Volume 124(1,2) (2019), pp. 1-333 (21)
      • Volume 124, Issue 1 (2019), pp. 1-85 (1)
      • Volume 124, Issue 2 (2019), pp. 86-1-333 (20)
    • Volume 125 (2019), pp. 1-259 (20)
    • Volume 126 (2019), pp. 1-298 (20)
    • Volume 127(1,2,3) (2019), pp. 1-376 (22)
      • Volume 127, Issue 1 (2019), pp. 1-55 (1)
      • Volume 127, Issue 2 (2019), pp. 56-105 (1)
      • Volume 127, Issue 3 (2019), pp. 106-376 (20)
    • Volume 128(1,2) (2019), pp. 1-432 (21)
      • Volume 128, Issue 1 (2019), pp. 1-70 (1)
      • Volume 128, Issue 2 (2019), pp. 71-432 (20)
    • Volume 129 (2019), pp. 1-267 (20)
    • Volume 130 (2019), pp. 1-308 (20)
    • Volume 131 (2019), pp. 1-288 (20)
    • Volume 132 (2019), pp. 1-312 (24)
    • Volume 133 (2019), pp. 1-274 (20)
    • Volume 134(1,2) (2020), pp. 1-338 (21)
      • Volume 134, Issue 1 (2019), pp. 1-51 (1)
      • Volume 134, Issue 2 (2019), pp. 52-338 (20)
    • Volume 135 (2019), pp. 1-298 (22)
    • Volume 136 (2019), pp. 1-246 (16)
    • Volume 137 (2019), pp. 1-236 (14)
    • Volume 138(1,2) (2019), pp. 1-294 (13)
      • Volume 138, Issue 1 (2019), pp. 1-64 (1)
      • Volume 138, Issue 2 (2019), pp. 65-294 (12)
  • 2020 (179)
    • Volume 139(1,2) (2020), pp. 1-258 (13)
      • Volume 139, Issue 1 (2020), pp. 1-60 (1)
      • Volume 139, Issue 2 (2020), pp. 61-258 (12)
    • Volume 140 (2020), pp. 1-184 (10)
    • Volume 141 (2020), pp. 1-155 (10)
    • Volume 142 (2020), pp. 1-194 (12)
    • Volume 143 (2020), pp. 1-261 (16)
    • Volume 144 (2020), pp. 1-449 (30)
    • Volume 145 (2020), pp. 1-408 (30)
    • Volume 146 (2020), pp. 1-289 (18)
    • Volume 147 (2020), pp. 1-208 (12)
    • Volume 148 (2020), pp. 1-121 (8)
    • Volume 149 (2020), pp. 1-165 (10)
    • Volume 150 (2020), pp. 1-181 (10)
  • 2021 (143)
    • Volume 151 (2021), pp. 1-122 (8)
    • Volume 152 (2021), pp. 1-125 (8)
    • Volume 153(1,2) (2021), pp. 1-215 (13)
      • Volume 153, Issue 1 (2021), pp. 1-42 (1)
      • Volume 153, Issue 2 (2021), pp. 43-215 (12)
    • Volume 154 (2021), pp. 1-174 (10)
    • Volume 155 (2021), pp. 1-154 (10)
    • Volume 156 (2021), pp. 1-191 (12)
    • Volume 157 (2021), pp. 1-188 (10)
    • Volume 158 (2021), pp. 1-298 (16)
    • Volume 159 (2021), pp. 1-223 (14)
    • Volume 160 (2021), pp. 1-337 (20)
    • Volume 161 (2021), pp. 1-156 (10)
    • Volume 162 (2021), pp. 1-178 (12)
  • 2022 (125)
    • Volume 163 (2022), pp. 1-157 (8)
    • Volume 164 (2022), pp. 1-149 (8)
    • Volume 165 (2022), pp. 1-209 (12)
    • Volume 166 (2022), pp. 1-145 (10)
    • Volume 167 (2022), pp. 1-161 (9)
    • Volume 168 (2022), pp. 1-146 (10)
    • Volume 169 (2022), pp. 1-201 (10)
    • Volume 170 (2022), pp. 1-171 (10)
    • Volume 171 (2022), pp. 1-125 (8)
    • Volume 172 (2022), pp. 1-333 (20)
    • Volume 173 (2022), pp. 1-161 (10)
    • Volume 174 (2022), pp. 1-176 (10)
  • 2023 (132)
    • Volume 175 (2023), pp. 1-108 (8)
    • Volume 176 (2023), pp. 1-174 (10)
    • Volume 177 (2023), pp. 1-136 (8)
    • Volume 178 (2023), pp. 1-165 (10)
    • Volume 179 (2023), pp. 1-164 (10)
    • Volume 180 (2023), pp. 1-162 (12)
    • Volume 181 (2023), pp. 1-215 (12)
    • Volume 182 (2023), pp. 1-265 (18)
    • Volume 183 (2023), pp. 1-226 (14)
    • Volume 184 (2023), pp. 1-154 (10)
    • Volume 185 (2023), pp. 1-191 (10)
    • Volume 186 (2023), pp. 1-160 (10)
  • 2024 (183)
    • Volume 187 (2024), pp. 1-156 (10)
    • Volume 188 (2024), pp. 1-197 (12)
    • Volume 189 (2024), pp. 1-310 (20)
    • Volume 190(1,2) (2024), pp. 1-351 (18)
      • Volume 190, Issue 1 (2024), pp. 1-69 (1)
      • Volume 190, Issue 2 (2024), pp. 70-351 (17)
    • Volume 191 (2024), pp. 1-207 (12)
    • Volume 192 (2024), pp. 1-319 (20)
    • Volume 193(1,2) (2024), pp. 1-252 (13)
      • Volume 193, Issue 1 (2024), pp. 1-45 (1)
      • Volume 193, Issue 2 (2024), pp. 46-252 (12)
    • Volume 194 (2024), pp. 1-213 (13)
    • Volume 195 (2024), pp. 1-235 (13)
    • Volume 196 (2024), pp. 1-221 (14)
    • Volume 197 (2024), pp. 1-231 (15)
    • Volume 198 (2024), pp. 1-402 (23)
  • 2025 (169)
    • Volume 199 (2025), pp. 1-253 (16)
    • Volume 200 (2025), pp. 1-223 (14)
    • Volume 201 (2025), pp. 1-245 (12)
    • Volume 202 (2025), pp. 1-317 (17)
    • Volume 203 (2025), pp. 1-438 (15)
    • Volume 204 (2025), pp. 1-353 (19)
    • Volume 205 (2025), pp. 1-272 (16)
    • Volume 206 (2025), pp. 1-172 (13)
    • Volume 207 (2025), pp. 1-173 (12)
    • Volume 208 (2025), pp. 1-174 (11)
    • Volume 209 (2025), pp. 1-184 (12)
    • Volume 210 (2025), pp. 1-158 (12)
  • 2026 (111)
    • Volume 211 (2026), pp. 1-328 (20)
    • Volume 212 (2026), pp. 1-314 (17)
    • Volume 213 (2026), pp. 1-179 (12)
    • Volume 214 (2026), pp. 1-231 (13)
    • Volume 215 (2026), pp. 1-225 (13)
    • Volume 216 (2026), pp. 1-190 (11)
    • Volume 217 (2026), pp. 1-167 (12)
    • Volume 218 (2026), pp. (13)
  • Info (6)
  • News (3)
  • Open access (550)
  • Premium (41)

Last Articles

  • All
  • Premium
  • Open access

Travel blogs and perceived destination image: theoretical background

2024-02-14

Comparative study on transistor based full adder designs

2024-01-23

Ethnomedicinal Importance, and Ecological Role of Blumea Species in East Singhbhum District, Jharkhand (India): Emphasis on Plant–Insect Interactions

2026-03-13

Popular Articles

  • About Us

    About Us

    0 shares
    Share 0 Tweet 0
  • Submit your Article

    0 shares
    Share 0 Tweet 0
  • Jeevamrut – A Natural Fertilizer

    0 shares
    Share 0 Tweet 0
  • Abstracting & Indexing

    0 shares
    Share 0 Tweet 0
  • Guide for Authors

    0 shares
    Share 0 Tweet 0

Careers

  • All
  • Careers
No Content Available
World Scientific News

World Scientific News (WSN) is an open-access fully peer-reviewed scholarly journal. The monthly – interdisciplinary journal is directed in the first place to scientists who want to publish their findings, insights, observations, conclusions, etc.

READ MORE

Menu

  • Home
  • About Us
  • Editorial Board
  • Guide for Authors
  • Instruction for Authors
  • Abstracting & Indexing
  • Submit your Article
  • Careers
  • News

Other databases

Crossref

CAS
Google Scholar
Google Scholar Metrics
ICZN
ProQuest
Road Directory
ZooBank

AGRO

 

EISSN 2392-2192

Login / Register
Privacy Policy
Cookie Policy

made by fixfix

No Result
View All Result
  • Home
  • About
    • About Us
    • Editorial Board
    • Guide for Authors
    • Abstracting & Indexing
    • Instruction for Authors
    • Submit your Article
  • View Articles
    • 2026
    • 2025
    • 2024
    • 2023
    • 2022
    • 2021
    • 2020
    • 2019
    • 2018
    • 2017
    • 2016
    • 2015
    • 2014
    • 2013
  • Careers
  • News

made by fixfix

Welcome Back!

Login to your account below

Forgotten Password?

Retrieve your password

Please enter your username or email address to reset your password.

Log In
Are you sure want to unlock this post?
Unlock left : 0
Are you sure want to cancel subscription?
We use cookies to ensure that we give you the best experience on our website. If you continue to use this site we will assume that you are happy with it.