TYAGI, A., VASHISTHA, S., & AKRAM, M. (2026). AT algorithm for fractal polynomiographs: A study on fast convergence under weak contraction mappings. Acta et Commentationes Universitatis Tartuensis de Mathematica, 30(1), 75. https://doi.org/10.12697/ACUTM.2026.30.05
Chicago Style (17th ed.) CitationTYAGI, AKANSHA, SACHIN VASHISTHA, and MOHAMMAD AKRAM. "AT Algorithm for Fractal Polynomiographs: A Study on Fast Convergence Under Weak Contraction Mappings." Acta Et Commentationes Universitatis Tartuensis De Mathematica 30, no. 1 (2026): 75. https://doi.org/10.12697/ACUTM.2026.30.05.
MLA (9th ed.) CitationTYAGI, AKANSHA, et al. "AT Algorithm for Fractal Polynomiographs: A Study on Fast Convergence Under Weak Contraction Mappings." Acta Et Commentationes Universitatis Tartuensis De Mathematica, vol. 30, no. 1, 2026, p. 75, https://doi.org/10.12697/ACUTM.2026.30.05.