Ru-Ru Ma
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ru-Ru Ma has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Jie Wu
Jiangnan University
9 shared publications Kexing Wu
Department of Credit Management, School of Finance, Shanghai Lixin University of Accounting and Finance, Shanghai 201209, People's Republic of China
3 shared publications- Weiye Wang
Jiangnan University
3 shared publications Zhicai Ma
School of Sciences, Lanzhou University of Technology, Lanzhou 730050, People’s Republic of China
3 shared publications- Chenchen Yu
Qingdao Haier Air Conditioning Electronics Co., Ltd
2 shared publications Jiabing Zhu
Inspur Software Group Co., Ltd
2 shared publications
Latest Publications
- Open Access
- 20 October 2026
- Published by IOP Publishing in Physica Scripta
- Vol. 101 (42) , 425201
Reservoir-computing-based chaos synchronization and its application to medical image encryption
Chaos synchronization provides a physically interpretable route for generating common dynamical states at spatially separated terminals, but most existing schemes require an accurate model and explicitly injected actuation. This paper develops a data-driven synchronization framework based on reservoir computing that learns nonlinear state couplings directly from observed trajectories. A gray wolf optimizer calibrates six influential reservoir hyperparameters, and a single measured state is then used to reconstruct the remaining states online. Numerical studies on the Lorenz and Rössler systems show that the learned reservoir reaches stable synchronization from multiple initial conditions without adding a control term to the governing equations. The synchronized trajectory is treated as reproducible public session context rather than as a cryptographic secret. The image-protection architecture uses PBKDF2-HMAC-SHA-256, HKDF-separated keys, a fresh nonce, an authenticated header, and HMAC-SHA-256 verification to avoid circular plaintext-dependent masking. The evaluation includes quantitative comparisons, channel-imperfection tests, reservoir ablations, and expanded image-security experiments. In these expanded tests, 120 deterministic tiles from six source exemplars yield a mean ciphertext entropy of 7.9925 bits and a mean maximum absolute adjacent-pixel correlation of 0.0232 . One-bit perturbations give mean NPCR 99.6025 % and UACI 33.4446 % , with exact recovery in every accepted trial. These measurements are descriptive algorithmic diagnostics only; the dependent tiles do not represent 120 independent patients, clinical validation, or a cryptographic security proof.
- 20 October 2026
- Published by IOP Publishing in Physica Scripta
- Vol. 101 (42) , 425201
Open AccessReservoir-computing-based chaos synchronization and its application to medical image encryption
Chaos synchronization provides a physically interpretable route for generating common dynamical states at spatially separated terminals, but most existing schemes require an accurate model and explicitly injected actuation. This paper develops a data-driven synchronization framework based on reservoir computing that learns nonlinear state couplings directly from observed trajectories. A gray wolf optimizer calibrates six influential reservoir hyperparameters, and a single measured state is then used to reconstruct the remaining states online. Numerical studies on the Lorenz and Rössler systems show that the learned reservoir reaches stable synchronization from multiple initial conditions without adding a control term to the governing equations. The synchronized trajectory is treated as reproducible public session context rather than as a cryptographic secret. The image-protection architecture uses PBKDF2-HMAC-SHA-256, HKDF-separated keys, a fresh nonce, an authenticated header, and HMAC-SHA-256 verification to avoid circular plaintext-dependent masking. The evaluation includes quantitative comparisons, channel-imperfection tests, reservoir ablations, and expanded image-security experiments. In these expanded tests, 120 deterministic tiles from six source exemplars yield a mean ciphertext entropy of 7.9925 bits and a mean maximum absolute adjacent-pixel correlation of 0.0232 . One-bit perturbations give mean NPCR 99.6025 % and UACI 33.4446 % , with exact recovery in every accepted trial. These measurements are descriptive algorithmic diagnostics only; the dependent tiles do not represent 120 independent patients, clinical validation, or a cryptographic security proof.
- 30 September 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Modern Physics C
Delay-aware adaptive chemotherapy for tumor-immune dynamics using proximal policy optimization
The design of adaptive chemotherapy is complicated by nonlinear tumor-immune interactions, delayed drug transport and uncertainty in state evolution. This study develops a delay-aware computational framework that couples a normalized normal-tumor-immune model with central and peripheral pharmacokinetic compartments. A Proximal Policy Optimization (PPO) agent observes the population states, their rates of change and both drug concentrations, and selects a bounded continuous infusion action. Pharmacodynamic killing is driven by peripheral exposure, thereby distinguishing systemic administration from the concentration acting at the tumor site. Positivity and boundedness of the deterministic biological-pharmacokinetic system are established for nonnegative initial states and bounded infusion. The learning objective jointly penalizes tumor burden, positive tumor growth, cumulative exposure, abrupt normalized-action variation and depletion of normal and immune populations. Numerical experiments compare untreated and periodic regimens, one- and two-compartment environments, nominal and stochastic transitions, and PPO with two actor-critic baselines. Explicit distribution dynamics change the learned policy from a sustained high-action plateau to an early loading phase followed by gradual tapering. Moderate transition randomization yields the smallest reported tumor-tracking errors and reduced trajectory dispersion, whereas stronger perturbations substantially widen the uncertainty bands. These results identify pharmacokinetic representation as a consequential component of learning-based treatment design. The framework is an in-silico mechanism study rather than a clinical dosing recommendation and requires drug-specific calibration, hard toxicity constraints, complete statistical evaluation and biological validation.
- 30 September 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Modern Physics C
Delay-aware adaptive chemotherapy for tumor-immune dynamics using proximal policy optimization
The design of adaptive chemotherapy is complicated by nonlinear tumor-immune interactions, delayed drug transport and uncertainty in state evolution. This study develops a delay-aware computational framework that couples a normalized normal-tumor-immune model with central and peripheral pharmacokinetic compartments. A Proximal Policy Optimization (PPO) agent observes the population states, their rates of change and both drug concentrations, and selects a bounded continuous infusion action. Pharmacodynamic killing is driven by peripheral exposure, thereby distinguishing systemic administration from the concentration acting at the tumor site. Positivity and boundedness of the deterministic biological-pharmacokinetic system are established for nonnegative initial states and bounded infusion. The learning objective jointly penalizes tumor burden, positive tumor growth, cumulative exposure, abrupt normalized-action variation and depletion of normal and immune populations. Numerical experiments compare untreated and periodic regimens, one- and two-compartment environments, nominal and stochastic transitions, and PPO with two actor-critic baselines. Explicit distribution dynamics change the learned policy from a sustained high-action plateau to an early loading phase followed by gradual tapering. Moderate transition randomization yields the smallest reported tumor-tracking errors and reduced trajectory dispersion, whereas stronger perturbations substantially widen the uncertainty bands. These results identify pharmacokinetic representation as a consequential component of learning-based treatment design. The framework is an in-silico mechanism study rather than a clinical dosing recommendation and requires drug-specific calibration, hard toxicity constraints, complete statistical evaluation and biological validation.
- 11 September 2026
- Published by IOP Publishing in Physica Scripta
- Vol. 101 (37) , 375202
A reduced-input PPO method for synchronizing Chua’s chaotic circuits
This study addresses model-free synchronization of two Chua chaotic circuits when one of the three candidate actuation channels is unavailable. The method constructs a proximal policy optimization (PPO) controller from the synchronization errors and practically estimated error derivatives. The policy outputs only two bounded control signals, while the middle channel is fixed at zero. To sharpen learning near the synchronization manifold, the conventional Manhattan-distance reward is augmented by a fractional-power error term. A circuit-level drive–response schematic is supplied to clarify how the two learned actions enter the response circuit, and the numerical implementation is supplemented by solver-consistency and derivative-estimation protocols. Simulation results show that the selected two-input structure synchronizes all three circuit states. Relative to the conventional reward under identical network and actuation settings, the refined reward reduces residual error and settling time across the reported nominal, Gaussian-noise, parameter-mismatch, and initial-condition tests. Phase portraits, paired state time series, error surfaces, and control-effort results further demonstrate contraction of the response trajectory toward the drive attractor. These findings support reduced-input PPO as a flexible numerical synchronization strategy, while physical prototyping remains necessary before claims of hardware-level performance can be made.
- 11 September 2026
- Published by IOP Publishing in Physica Scripta
- Vol. 101 (37) , 375202
A reduced-input PPO method for synchronizing Chua’s chaotic circuits
This study addresses model-free synchronization of two Chua chaotic circuits when one of the three candidate actuation channels is unavailable. The method constructs a proximal policy optimization (PPO) controller from the synchronization errors and practically estimated error derivatives. The policy outputs only two bounded control signals, while the middle channel is fixed at zero. To sharpen learning near the synchronization manifold, the conventional Manhattan-distance reward is augmented by a fractional-power error term. A circuit-level drive–response schematic is supplied to clarify how the two learned actions enter the response circuit, and the numerical implementation is supplemented by solver-consistency and derivative-estimation protocols. Simulation results show that the selected two-input structure synchronizes all three circuit states. Relative to the conventional reward under identical network and actuation settings, the refined reward reduces residual error and settling time across the reported nominal, Gaussian-noise, parameter-mismatch, and initial-condition tests. Phase portraits, paired state time series, error surfaces, and control-effort results further demonstrate contraction of the response trajectory toward the drive attractor. These findings support reduced-input PPO as a flexible numerical synchronization strategy, while physical prototyping remains necessary before claims of hardware-level performance can be made.
- 11 August 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Modern Physics C
Synchronization and explosive synchronization of two-layer second-order Kuramoto oscillator networks
In the study of synchronization on complex networks, the second-order Kuramoto model has attracted extensive attention because the inclusion of inertia and damping enables a more realistic description of coupled systems with inertial and dissipative characteristics, such as power networks. However, existing studies on synchronization in second-order Kuramoto oscillator networks have mainly focused on single-layer networks, and the combined effects of inter-layer coupling, topological heterogeneity, and inertia in multilayer structures remain insufficiently explored. To address this issue, we extend the second-order Kuramoto model to two-layer oscillator networks with different architectures and allow flexible random inter-layer connections, and then systematically examine through numerical simulations the effects of damping/inertia, coupling strengths, topology variation, and layer size on synchronization. We find that when the inertia m is small, a moderate increase in the damping d can maintain a continuous synchronization transition while enhancing the overall synchronization level. In contrast, when m is large and d is small, explosive synchronization can be induced in the two-layer network. In addition, topologies with stronger degree heterogeneity are generally unfavorable for collective synchronization, and collective synchronization is more likely to be dominated by the larger layer. Layer-size mismatch can enhance the synchronization level of the two-layer system, and the global synchronization consistency of the whole system gradually increases as the size mismatch between the two layers becomes larger.
- 11 August 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Modern Physics C
Synchronization and explosive synchronization of two-layer second-order Kuramoto oscillator networks
In the study of synchronization on complex networks, the second-order Kuramoto model has attracted extensive attention because the inclusion of inertia and damping enables a more realistic description of coupled systems with inertial and dissipative characteristics, such as power networks. However, existing studies on synchronization in second-order Kuramoto oscillator networks have mainly focused on single-layer networks, and the combined effects of inter-layer coupling, topological heterogeneity, and inertia in multilayer structures remain insufficiently explored. To address this issue, we extend the second-order Kuramoto model to two-layer oscillator networks with different architectures and allow flexible random inter-layer connections, and then systematically examine through numerical simulations the effects of damping/inertia, coupling strengths, topology variation, and layer size on synchronization. We find that when the inertia m is small, a moderate increase in the damping d can maintain a continuous synchronization transition while enhancing the overall synchronization level. In contrast, when m is large and d is small, explosive synchronization can be induced in the two-layer network. In addition, topologies with stronger degree heterogeneity are generally unfavorable for collective synchronization, and collective synchronization is more likely to be dominated by the larger layer. Layer-size mismatch can enhance the synchronization level of the two-layer system, and the global synchronization consistency of the whole system gradually increases as the size mismatch between the two layers becomes larger.
- 25 July 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Modern Physics B
Toward the synchronization of two-layer multi-rate kuramoto-oscillator networks
Collective synchronization in multilayer oscillator networks is a key topic in complex systems. However, most existing two-layer Kuramoto models mainly focus on first-order oscillators and pay limited attention to the combined effects of inertia, damping, and inter-layer interactions. In this work, a two-layer multi-rate Kuramoto model containing both first-order and second-order oscillators is developed within a unified framework. Numerical simulations are performed to explore the effects of coupling strength, topology, inertia, damping, and inter-layer coupling on synchronization behavior. The results show that stronger intra-layer and inter-layer coupling generally enhance synchronization. Compared with the first-order layer, the second-order layer reaches synchronization at a lower threshold but is more sensitive to parameter variations. In addition, asymmetric layer sizes and Erdős–Rényi (ER) topologies are found to promote global synchronization more easily. Larger inertia and weaker damping suppress synchronization, especially in the second-order layer. The study also reveals that multi-rate dynamics can produce asymmetric synchronization between layers. These findings help improve the understanding of synchronization mechanisms in heterogeneous multilayer networks.
- 25 July 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Modern Physics B
Toward the synchronization of two-layer multi-rate kuramoto-oscillator networks
Collective synchronization in multilayer oscillator networks is a key topic in complex systems. However, most existing two-layer Kuramoto models mainly focus on first-order oscillators and pay limited attention to the combined effects of inertia, damping, and inter-layer interactions. In this work, a two-layer multi-rate Kuramoto model containing both first-order and second-order oscillators is developed within a unified framework. Numerical simulations are performed to explore the effects of coupling strength, topology, inertia, damping, and inter-layer coupling on synchronization behavior. The results show that stronger intra-layer and inter-layer coupling generally enhance synchronization. Compared with the first-order layer, the second-order layer reaches synchronization at a lower threshold but is more sensitive to parameter variations. In addition, asymmetric layer sizes and Erdős–Rényi (ER) topologies are found to promote global synchronization more easily. Larger inertia and weaker damping suppress synchronization, especially in the second-order layer. The study also reveals that multi-rate dynamics can produce asymmetric synchronization between layers. These findings help improve the understanding of synchronization mechanisms in heterogeneous multilayer networks.
- Open Access
- 12 June 2026
- Published by IOP Publishing in Physica Scripta
- Vol. 101 (23) , 235209
A dual-critic network architecture for personalized tumor treatment under a dynamical tumor model
Deep reinforcement learning (DRL) shows immense promise for devising dynamic, personalized dosing strategies for complex diseases like cancer. However, the inherent ‘double-edged’ nature of drugs remains a challenge, which possess both therapeutic efficacy and toxicity. Consequently, an optimal therapeutic strategy must balance these competing objectives rather than merely maximizing efficacy. Conventional DRL algorithms often scalarize these conflicting goals into a single reward signal, a process that blurs the learning objective and may lead to suboptimal policies. To overcome this limitation, we introduce a novel framework: the Risk-Aware Advantage Actor-Critic (RA-A2C). This framework disaggregates the feedback signal into distinct ‘reward’ and ‘risk’ components, processed in parallel by specialized reward-critic and risk-critic networks. Such a design equips each critic with a well-defined, singular objective, allowing for more accurate guidance for the actor. We also incorporate a risk preference coefficient to offer a simple and interpretable mechanism for modulating the trade-off between reward and risk. In comparative experiments against multiple state-of-the-art DRL baselines, the proposed RA-A2C model demonstrated faster convergence and superior treatment performance. RA-A2C achieved an 89.80% tumor reduction rate with the highest drug utilization rate (0.70) while requiring substantially less drug than SAC. Moreover, the proposed method maintained robust performance across mild and severe scenarios, achieving tumor reduction rates of 84.5% and 75.5%, respectively. A sensitivity analysis further showed that the risk preference coefficient can flexibly adjust treatment styles from ‘aggressive’ to ‘conservative,’ providing a flexible framework for personalized precision medicine.
- 12 June 2026
- Published by IOP Publishing in Physica Scripta
- Vol. 101 (23) , 235209
Open AccessA dual-critic network architecture for personalized tumor treatment under a dynamical tumor model
Deep reinforcement learning (DRL) shows immense promise for devising dynamic, personalized dosing strategies for complex diseases like cancer. However, the inherent ‘double-edged’ nature of drugs remains a challenge, which possess both therapeutic efficacy and toxicity. Consequently, an optimal therapeutic strategy must balance these competing objectives rather than merely maximizing efficacy. Conventional DRL algorithms often scalarize these conflicting goals into a single reward signal, a process that blurs the learning objective and may lead to suboptimal policies. To overcome this limitation, we introduce a novel framework: the Risk-Aware Advantage Actor-Critic (RA-A2C). This framework disaggregates the feedback signal into distinct ‘reward’ and ‘risk’ components, processed in parallel by specialized reward-critic and risk-critic networks. Such a design equips each critic with a well-defined, singular objective, allowing for more accurate guidance for the actor. We also incorporate a risk preference coefficient to offer a simple and interpretable mechanism for modulating the trade-off between reward and risk. In comparative experiments against multiple state-of-the-art DRL baselines, the proposed RA-A2C model demonstrated faster convergence and superior treatment performance. RA-A2C achieved an 89.80% tumor reduction rate with the highest drug utilization rate (0.70) while requiring substantially less drug than SAC. Moreover, the proposed method maintained robust performance across mild and severe scenarios, achieving tumor reduction rates of 84.5% and 75.5%, respectively. A sensitivity analysis further showed that the risk preference coefficient can flexibly adjust treatment styles from ‘aggressive’ to ‘conservative,’ providing a flexible framework for personalized precision medicine.
- 19 March 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Modern Physics C
- Vol. 38 (06)
Robust long-term prediction of memristive chaotic systems under partial observability via IVYA-ODRC method
The memristor-based chaotic system (MCS) exhibits extreme sensitivity to initial conditions, rendering accurate prediction of its behavior highly challenging. This study integrates an enhanced reservoir computing (RC) approach with the Ivy algorithm (IVYA) so as to propose a novel prediction framework for MCS, termed IVYA-based one-dimensional RC (IVYA-ODRC). Unlike traditional approaches requiring precise mathematical models, IVYA-ODRC operates without prior knowledge of the system. Additionally, while conventional RC methods typically perform only single-step or autonomous prediction, IVYA-ODRC can accurately predict long-term dynamics using only a single state variable. It offers an innovative approach for prediction tasks under low-dimensional observation scenarios. Remarkably, the IVYA-ODRC method effectively mitigates error accumulation, maintaining robust prediction performance over extended periods. Given a sufficiently long sequence of observations, the method maintains stable performance over extended periods. Moreover, experimental results demonstrate the robustness of IVYA-ODRC under high levels of stochastic noise, with strong performance maintained when noise is introduced in the prediction phase as well as in both training and prediction phases.
- 19 March 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Modern Physics C
- Vol. 38 (06)
Robust long-term prediction of memristive chaotic systems under partial observability via IVYA-ODRC method
The memristor-based chaotic system (MCS) exhibits extreme sensitivity to initial conditions, rendering accurate prediction of its behavior highly challenging. This study integrates an enhanced reservoir computing (RC) approach with the Ivy algorithm (IVYA) so as to propose a novel prediction framework for MCS, termed IVYA-based one-dimensional RC (IVYA-ODRC). Unlike traditional approaches requiring precise mathematical models, IVYA-ODRC operates without prior knowledge of the system. Additionally, while conventional RC methods typically perform only single-step or autonomous prediction, IVYA-ODRC can accurately predict long-term dynamics using only a single state variable. It offers an innovative approach for prediction tasks under low-dimensional observation scenarios. Remarkably, the IVYA-ODRC method effectively mitigates error accumulation, maintaining robust prediction performance over extended periods. Given a sufficiently long sequence of observations, the method maintains stable performance over extended periods. Moreover, experimental results demonstrate the robustness of IVYA-ODRC under high levels of stochastic noise, with strong performance maintained when noise is introduced in the prediction phase as well as in both training and prediction phases.
- 1 October 2025
- Published by IOP Publishing in Physica Scripta
- Vol. 100 (10) , 105235
Stabilizing and synchronizing the chaotic PMSM systems via improving A2C algorithm
This paper presents a model-free deep reinforcement learning (DRL) framework for the stabilization and synchronization of chaotic permanent magnet synchronous motor (PMSM) systems, addressing the limitations of traditional control methods that rely on precise system models. The proposed approach employs a modified Advantage-Actor-Critic (A2C) algorithm, featuring a novel nonlinear error-sensitive reward function that significantly enhances convergence speed by amplifying learning signals in the vicinity of the target state. Unlike conventional DRL applications, the control strategy utilizes only two control inputs, reducing implementation complexity and energy cost. Experimental results demonstrate that the proposed method achieves single-system stabilization within 0.28 s and synchronization between two PMSMs within 0.32 s—improving convergence speed by over 40% compared to standard A2C and other reward designs. Under Gaussian noise, the trained policy achieves significantly lower mean absolute errors, demonstrating high control precision and strong robustness. These results highlight the practical potential of DRL in real-world motor control applications, where system uncertainties and external disturbances are inevitable. The integration of a mechanism-driven reward design with reduced control effort represents a significant advancement in intelligent control of nonlinear electromechanical systems.
- 1 October 2025
- Published by IOP Publishing in Physica Scripta
- Vol. 100 (10) , 105235
Stabilizing and synchronizing the chaotic PMSM systems via improving A2C algorithm
This paper presents a model-free deep reinforcement learning (DRL) framework for the stabilization and synchronization of chaotic permanent magnet synchronous motor (PMSM) systems, addressing the limitations of traditional control methods that rely on precise system models. The proposed approach employs a modified Advantage-Actor-Critic (A2C) algorithm, featuring a novel nonlinear error-sensitive reward function that significantly enhances convergence speed by amplifying learning signals in the vicinity of the target state. Unlike conventional DRL applications, the control strategy utilizes only two control inputs, reducing implementation complexity and energy cost. Experimental results demonstrate that the proposed method achieves single-system stabilization within 0.28 s and synchronization between two PMSMs within 0.32 s—improving convergence speed by over 40% compared to standard A2C and other reward designs. Under Gaussian noise, the trained policy achieves significantly lower mean absolute errors, demonstrating high control precision and strong robustness. These results highlight the practical potential of DRL in real-world motor control applications, where system uncertainties and external disturbances are inevitable. The integration of a mechanism-driven reward design with reduced control effort represents a significant advancement in intelligent control of nonlinear electromechanical systems.
- 1 September 2025
- Published by IOP Publishing in Physica Scripta
- Vol. 100 (9) , 095218
Predefined-time smooth consensus of nonlinear multi-agent systems with undirected and directed graphs
This study addresses the predefined-time leader-following consensus problems for nonlinear multi-agent systems (MASs) under both undirected and directed topologies, respectively. The key contribution lies in the proposed differentiable consensus control protocols, which eliminate chattering by avoiding discontinuous absolute value and sign functions-overcoming a limitation of traditional designs. A critical advantage is that the upper bound of the settling time for predefined-time consensus (PTC) is an explicit, adjustable constant, preassignable without dependence on network topology, initial states, or system parameters, distinguishing it from finite-time or fixed-time paradigms. Using multi-layer communication networks and Lyapunov stability analysis, two sets of sufficient conditions are derived to ensure global PTC for the MASs. Numerical simulations with the Kuramoto model validate the theoretical results.
- 1 September 2025
- Published by IOP Publishing in Physica Scripta
- Vol. 100 (9) , 095218
Predefined-time smooth consensus of nonlinear multi-agent systems with undirected and directed graphs
This study addresses the predefined-time leader-following consensus problems for nonlinear multi-agent systems (MASs) under both undirected and directed topologies, respectively. The key contribution lies in the proposed differentiable consensus control protocols, which eliminate chattering by avoiding discontinuous absolute value and sign functions-overcoming a limitation of traditional designs. A critical advantage is that the upper bound of the settling time for predefined-time consensus (PTC) is an explicit, adjustable constant, preassignable without dependence on network topology, initial states, or system parameters, distinguishing it from finite-time or fixed-time paradigms. Using multi-layer communication networks and Lyapunov stability analysis, two sets of sufficient conditions are derived to ensure global PTC for the MASs. Numerical simulations with the Kuramoto model validate the theoretical results.
- 21 May 2025
- Published by IOP Publishing in Physica Scripta
- Vol. 100 (6) , 065226
Preconditioned structure-preserving Jacobi algorithms for computing the SVD of a quaternion matrix
The singular value decomposition (SVD) of quaternion matrices is a cornerstone of color image compression. However, existing computational methods for quaternion SVD remain inefficient, often lacking the speed and scalability required for real-world applications. To address this challenge, we introduce two novel preconditioned structure-preserving Jacobi algorithms designed to compute the SVD of quaternion matrices efficiently. Central to our approach is the use of quaternion rank-revealing QR (QRRQR) factorization as a preprocessing step, which serves as a robust dimension reduction strategy for both one-sided and two-sided Jacobi methods. Notably, we rigorously analyze the off-diagonal structure of the upper triangular matrix generated by QRRQR, a key innovation that enables significant acceleration of the two-sided Jacobi algorithm. By exploiting this structural property, we effectively reduce computational overhead while preserving numerical stability. Extensive numerical experiments validate the superior efficiency, accuracy, and scalability of our algorithms compared to some conventional approaches, demonstrating their potential for practical deployment in large-scale color image processing tasks.
- 21 May 2025
- Published by IOP Publishing in Physica Scripta
- Vol. 100 (6) , 065226
Preconditioned structure-preserving Jacobi algorithms for computing the SVD of a quaternion matrix
The singular value decomposition (SVD) of quaternion matrices is a cornerstone of color image compression. However, existing computational methods for quaternion SVD remain inefficient, often lacking the speed and scalability required for real-world applications. To address this challenge, we introduce two novel preconditioned structure-preserving Jacobi algorithms designed to compute the SVD of quaternion matrices efficiently. Central to our approach is the use of quaternion rank-revealing QR (QRRQR) factorization as a preprocessing step, which serves as a robust dimension reduction strategy for both one-sided and two-sided Jacobi methods. Notably, we rigorously analyze the off-diagonal structure of the upper triangular matrix generated by QRRQR, a key innovation that enables significant acceleration of the two-sided Jacobi algorithm. By exploiting this structural property, we effectively reduce computational overhead while preserving numerical stability. Extensive numerical experiments validate the superior efficiency, accuracy, and scalability of our algorithms compared to some conventional approaches, demonstrating their potential for practical deployment in large-scale color image processing tasks.