Efficient algorithms for perturbed symmetrical Toeplitz-plus-Hankel systems

Abstract

This paper investigates a specific class of perturbed Toeplitz-plus-Hankel matrices. We introduce two novel algorithms designed for perturbed symmetrical centrosymmetrical Toeplitz-plus-Hankel systems, offering reduced computational time. Furthermore, we present applications of image encryption and decryption based on these algorithms. Through numerical experiments, we demonstrate the effectiveness of our proposed algorithms.