Projective Synchronization of Fractional‐Order BAM Clifford‐Valued Delayed Memristive Neural Networks: An Inner Product‐Based Inequality

ABSTRACT This article is devoted to solving the global Mittag‐Leffler (GML) projective synchronization problem of a new type of fractional‐order BAM memristive Clifford‐valued delayed neural networks (FOBAMMCLVDNNs) using novel inner product‐based inequalities. Unlike existing studies that are based on decomposition methods, we establish novel inner product‐based inequalities using the sign function and the norm of Clifford numbers, allowing us to analyze the dynamics of FOBAMMCLVDNNs without decomposing them into real‐valued systems. Through the established inequalities, the lexicographical order method, and the construction of two new general Lyapunov functions, we obtain some new criteria for the GML projective synchronization problem of FOBAMMCLVDNNs. The derived results include GML complete synchronization and GML anti‐synchronization of FOBAMMCLVDNNs as special cases. To validate the effectiveness of the proposed synchronization criteria, numerical simulations for different cases are presented, accompanied by graphical analysis. Additionally, the obtained results are utilized to develop an image encryption algorithm, and the experimental results verify the proposed encryption algorithm's efficiency for secure communication applications.

Authors

Institutions

Publication Details

Journal
Mathematical Methods in the Applied Sciences
Published
2026-02-19
DOI
https://doi.org/10.1002/mma.70592
Primary Topic
Neural Networks Stability and Synchronization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Projective Synchronization of Fractional‐Order BAM Clifford‐Valued Delayed Memristive Neural Networks: An Inner Product‐Based Inequality

N. Manoj, R. Sriraman
Mathematical Methods in the Applied Sciences
Neural Networks Stability and Synchronization
article

Projective Synchronization of Fractional‐Order BAM Clifford‐Valued Delayed Memristive Neural Networks: An Inner Product‐Based Inequality

N. Manoj, R. Sriraman
article en

Abstract

ABSTRACT This article is devoted to solving the global Mittag‐Leffler (GML) projective synchronization problem of a new type of fractional‐order BAM memristive Clifford‐valued delayed neural networks (FOBAMMCLVDNNs) using novel inner product‐based inequalities. Unlike existing studies that are based on decomposition methods, we establish novel inner product‐based inequalities using the sign function and the norm of Clifford numbers, allowing us to analyze the dynamics of FOBAMMCLVDNNs without decomposing them into real‐valued systems. Through the established inequalities, the lexicographical order method, and the construction of two new general Lyapunov functions, we obtain some new criteria for the GML projective synchronization problem of FOBAMMCLVDNNs. The derived results include GML complete synchronization and GML anti‐synchronization of FOBAMMCLVDNNs as special cases. To validate the effectiveness of the proposed synchronization criteria, numerical simulations for different cases are presented, accompanied by graphical analysis. Additionally, the obtained results are utilized to develop an image encryption algorithm, and the experimental results verify the proposed encryption algorithm's efficiency for secure communication applications.

Mathematical Methods in the Applied Sciences
SRM Institute of Science and Technology (IN), Vellore Institute of Technology University (IN)
Reduced inequalities
Openalex Percentile: Top 58%
Neural Networks Stability and Synchronization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.