Sk. Safique Ahmad
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
Sk. Safique Ahmad has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Pinki Khatun
Department of Mathematics Indian Institute of Technology Indore 453552 Simrol Indore Madhya Pradesh India
5 shared publications - Neha Bhadala
Department of Computational and Data Sciences, Indian Institute of Science, Bengaluru, India
4 shared publications Rafikul Alam
4 shared publications- Istkhar Ali
School of Basic Sciences Discipline of Mathematics Indian Institute of Technology Indore
3 shared publications Pinki Khatun
2 shared publicationsSoumyendu Raha
Supercomputer Education and Research Centre (SERC), Indian Institute of Science, Bangalore 560012, India
2 shared publications
Latest Publications
- 10 December 2025
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 49 (7) , 6442-6457
On the Specific Solutions of Reduced Biquaternion Equality Constrained Least Squares Problem and Their Relative Forward Error Bound
This study focuses on addressing the challenge of solving the reduced biquaternion equality constrained least squares (RBLSE) problem. We develop algebraic techniques to derive real and complex solutions for the RBLSE problem by utilizing the real and complex forms of reduced biquaternion matrices. Furthermore, we propose algorithms and provide a detailed analysis of their computational complexity for finding special solutions to the RBLSE problem. A perturbation analysis is conducted, establishing an upper bound for the relative forward error of these solutions. This analysis ensures the accuracy and stability of the solutions in the presence of data perturbations, which is crucial for practical applications where errors arising from input inaccuracies can cause deviations between computed and true solutions. Numerical examples are presented to validate the proposed algorithms, demonstrate their effectiveness, and verify the accuracy of the established upper bound for the relative forward errors. These findings lay the groundwork for exploring applications in 3D and 4D algebra such as robotics, signal, and image processing, expanding their impact on practical and emerging domains.
- 10 December 2025
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 49 (7) , 6442-6457
On the Specific Solutions of Reduced Biquaternion Equality Constrained Least Squares Problem and Their Relative Forward Error Bound
This study focuses on addressing the challenge of solving the reduced biquaternion equality constrained least squares (RBLSE) problem. We develop algebraic techniques to derive real and complex solutions for the RBLSE problem by utilizing the real and complex forms of reduced biquaternion matrices. Furthermore, we propose algorithms and provide a detailed analysis of their computational complexity for finding special solutions to the RBLSE problem. A perturbation analysis is conducted, establishing an upper bound for the relative forward error of these solutions. This analysis ensures the accuracy and stability of the solutions in the presence of data perturbations, which is crucial for practical applications where errors arising from input inaccuracies can cause deviations between computed and true solutions. Numerical examples are presented to validate the proposed algorithms, demonstrate their effectiveness, and verify the accuracy of the established upper bound for the relative forward errors. These findings lay the groundwork for exploring applications in 3D and 4D algebra such as robotics, signal, and image processing, expanding their impact on practical and emerging domains.
- 25 July 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 509
A class of generalized shift-splitting preconditioners for double saddle point problems
- 25 July 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 509
A class of generalized shift-splitting preconditioners for double saddle point problems
- 18 July 2025
- Published by Springer Nature in Numerical Algorithms
- Vol. 102 (2) , 923-952
Partial condition numbers for double saddle point problems
- 18 July 2025
- Published by Springer Nature in Numerical Algorithms
- Vol. 102 (2) , 923-952
Partial condition numbers for double saddle point problems
- Open Access
Structured Backward Errors of Sparse Generalized Saddle Point Problems with Hermitian Block Matrices
In this paper, we derive the structured backward error (BE) for a class of generalized saddle point problems (GSPP) by preserving the sparsity pattern and Hermitian structures of the block matrices. Additionally, we construct the optimal backward perturbation matrices for which the structured BE is achieved. Our analysis also examines the structured BE in cases where the sparsity pattern is not maintained. Through numerical experiments, we demonstrate the reliability of the derived structured BEs and the corresponding optimal backward perturbations. Additionally, the derived structured BEs are used to assess the strong backward stability of numerical methods for solving the GSPP.
Open AccessStructured Backward Errors of Sparse Generalized Saddle Point Problems with Hermitian Block Matrices
In this paper, we derive the structured backward error (BE) for a class of generalized saddle point problems (GSPP) by preserving the sparsity pattern and Hermitian structures of the block matrices. Additionally, we construct the optimal backward perturbation matrices for which the structured BE is achieved. Our analysis also examines the structured BE in cases where the sparsity pattern is not maintained. Through numerical experiments, we demonstrate the reliability of the derived structured BEs and the corresponding optimal backward perturbations. Additionally, the derived structured BEs are used to assess the strong backward stability of numerical methods for solving the GSPP.
- 10 March 2025
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 713, 90-112
Structured backward errors for special classes of saddle point problems with applications
- 10 March 2025
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 713, 90-112
Structured backward errors for special classes of saddle point problems with applications
- Open Access
- 1 January 2025
- Published by Osterreichische Akademie der Wissenschaften, Verlag in ETNA - Electronic Transactions on Numerical Analysis
- Vol. 63, 401-423
Structured backward errors of sparse generalized saddle point problems with Hermitian block matrices
Electronic Transactions on Numerical Analysis (ETNA) is an electronic journal for the publication of significant new developments in numerical analysis and scientific computing. Papers of the highest quality that deal with the analysis of algorithms for the solution of continuous models and numerical linear algebra are appropriate for ETNA, as are papers of similar quality that discuss implementation and performance of such algorithms. New algorithms for current or new computer architectures are appropriate provided that they are numerically sound. However, the focus of the publication should be on the algorithm rather than on the architecture. The journal is published by the Kent State University Library in conjunction with the Institute of Computational Mathematics at Kent State University, and in cooperation with the Johann Radon Institute for Computational and Applied Mathematics of the Austrian Academy of Sciences (RICAM). Reviews of all ETNA papers appear in Mathematical Reviews and Zentralblatt für Mathematik. Reference information for ETNA papers also appears in the expanded Science Citation Index. ETNA is registered with the Library of Congress and has ISSN 1068-9613.
- 1 January 2025
- Published by Osterreichische Akademie der Wissenschaften, Verlag in ETNA - Electronic Transactions on Numerical Analysis
- Vol. 63, 401-423
Open AccessStructured backward errors of sparse generalized saddle point problems with Hermitian block matrices
Electronic Transactions on Numerical Analysis (ETNA) is an electronic journal for the publication of significant new developments in numerical analysis and scientific computing. Papers of the highest quality that deal with the analysis of algorithms for the solution of continuous models and numerical linear algebra are appropriate for ETNA, as are papers of similar quality that discuss implementation and performance of such algorithms. New algorithms for current or new computer architectures are appropriate provided that they are numerically sound. However, the focus of the publication should be on the algorithm rather than on the architecture. The journal is published by the Kent State University Library in conjunction with the Institute of Computational Mathematics at Kent State University, and in cooperation with the Johann Radon Institute for Computational and Applied Mathematics of the Austrian Academy of Sciences (RICAM). Reviews of all ETNA papers appear in Mathematical Reviews and Zentralblatt für Mathematik. Reference information for ETNA papers also appears in the expanded Science Citation Index. ETNA is registered with the Library of Congress and has ISSN 1068-9613.
- Open Access
- 1 January 2025
- Published by National Library of Serbia in Filomat
- Vol. 39 (12) , 3977-4002
Backward error analysis of generalized eigenvalue problems preserving block structures of matrices
This paper considers the backward error analysis of an approximate eigenpair of blockwise structured matrix pencils that becomes an exact eigenpair of an appropriately minimal perturbed block matrix pencil. The obtained perturbed pencil preserves the structures of different blocks for the Frobenius norm. In application, we discuss the different pencils arising in continuous-time linear quadratic optimal control problems, discrete-time linear quadratic optimal control, and port-Hamiltonian descriptor systems in optimal control. We also present several numerical examples to illustrate our framework.
- 1 January 2025
- Published by National Library of Serbia in Filomat
- Vol. 39 (12) , 3977-4002
Open AccessBackward error analysis of generalized eigenvalue problems preserving block structures of matrices
This paper considers the backward error analysis of an approximate eigenpair of blockwise structured matrix pencils that becomes an exact eigenpair of an appropriately minimal perturbed block matrix pencil. The obtained perturbed pencil preserves the structures of different blocks for the Frobenius norm. In application, we discuss the different pencils arising in continuous-time linear quadratic optimal control problems, discrete-time linear quadratic optimal control, and port-Hamiltonian descriptor systems in optimal control. We also present several numerical examples to illustrate our framework.
- 12 November 2024
- Published by Springer Nature in Numerical Algorithms
- p. 1-28
Outer inverse of reduced biquaternion matrices
- 12 November 2024
- Published by Springer Nature in Numerical Algorithms
- p. 1-28
Outer inverse of reduced biquaternion matrices
- Open Access
Structured Backward Error Analysis with Preserving Sparsity for Three-by-Three Block Saddle Point Problems
Backward error (\textit{BE}) analysis emerges as a powerful tool for assessing the backward stability and strong backward stability of iterative algorithms. In this paper, we explore structured \textit{BEs} for a class of three-by-three block saddle point problems (\textit{TBSPPs}), aiming to assess the strong backward stability of iterative algorithms devised to find their solution. Our investigations preserve the inherent matrix structure and sparsity pattern in the corresponding perturbation matrices and derive explicit formulae for the structure \textit{BEs}. Moreover, we provide formulae for the structure-preserving minimal perturbation matrices for which the structured \textit{BE} is attained. Furthermore, using the obtained structured \textit{BEs}, we propose three new termination criteria for the iterative algorithms to solve the \textit{TBSPP.} Numerical experiments are performed to test the strong backward stability of various iterative algorithms, as well as the reliability and effectiveness of the proposed termination criteria.
Open AccessStructured Backward Error Analysis with Preserving Sparsity for Three-by-Three Block Saddle Point Problems
Backward error (\textit{BE}) analysis emerges as a powerful tool for assessing the backward stability and strong backward stability of iterative algorithms. In this paper, we explore structured \textit{BEs} for a class of three-by-three block saddle point problems (\textit{TBSPPs}), aiming to assess the strong backward stability of iterative algorithms devised to find their solution. Our investigations preserve the inherent matrix structure and sparsity pattern in the corresponding perturbation matrices and derive explicit formulae for the structure \textit{BEs}. Moreover, we provide formulae for the structure-preserving minimal perturbation matrices for which the structured \textit{BE} is attained. Furthermore, using the obtained structured \textit{BEs}, we propose three new termination criteria for the iterative algorithms to solve the \textit{TBSPP.} Numerical experiments are performed to test the strong backward stability of various iterative algorithms, as well as the reliability and effectiveness of the proposed termination criteria.