Efficient algorithms for perturbed symmetrical Toeplitz-plus-Hankel systems

IF 2.1 2区数学 Q1 MATHEMATICS, APPLIED

Journal of Computational and Applied Mathematics Pub Date : 2024-10-24 DOI:10.1016/j.cam.2024.116333

Hcini Fahd , Skander Belhaj , Yulin Zhang

引用次数: 0

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.

查看原文本刊更多论文

扰动对称托普利兹加汉克尔系统的高效算法

本文研究了一类特殊的扰动托普利兹-加-汉克尔矩阵。我们介绍了为扰动对称中心对称 Toeplitz-plus-Hankel 系统设计的两种新算法，它们能缩短计算时间。此外，我们还介绍了基于这些算法的图像加密和解密应用。通过数值实验，我们证明了所提算法的有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Computational and Applied Mathematics 数学-应用数学

CiteScore

5.40

自引率

4.20%

发文量

437

审稿时长

3.0 months

期刊介绍： The Journal of Computational and Applied Mathematics publishes original papers of high scientific value in all areas of computational and applied mathematics. The main interest of the Journal is in papers that describe and analyze new computational techniques for solving scientific or engineering problems. Also the improved analysis, including the effectiveness and applicability, of existing methods and algorithms is of importance. The computational efficiency (e.g. the convergence, stability, accuracy, ...) should be proved and illustrated by nontrivial numerical examples. Papers describing only variants of existing methods, without adding significant new computational properties are not of interest. The audience consists of: applied mathematicians, numerical analysts, computational scientists and engineers.