default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSk. Safique Ahmad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j5]Sk. Safique Ahmad
, Prince Kanhya:
Backward error analysis of specified eigenpairs for sparse matrix polynomials. Numer. Linear Algebra Appl. 30(4) (2023)- 2021
- [j4]Sk. Safique Ahmad, Prince Kanhya:
Backward error analysis and inverse eigenvalue problems for Hankel and Symmetric-Toeplitz structures. Appl. Math. Comput. 406: 126288 (2021) - 2019
- [j3]Rafikul Alam, Sk. Safique Ahmad:
Sensitivity Analysis of Nonlinear Eigenproblems. SIAM J. Matrix Anal. Appl. 40(2): 672-695 (2019) - 2010
- [j2]Sk. Safique Ahmad, Rafikul Alam, Ralph Byers:
On Pseudospectra, Critical Points, and Multiple Eigenvalues of Matrix Pencils. SIAM J. Matrix Anal. Appl. 31(4): 1915-1933 (2010) - 2009
- [j1]Sk. Safique Ahmad, Nigam Chandra Parida, Soumyendu Raha:
The fully implicit stochastic-α method for stiff stochastic differential equations. J. Comput. Phys. 228(22): 8263-8282 (2009)
Informal and Other Publications
- 2024
- [i11]Sk. Safique Ahmad, Pinki Khatun:
A robust parameterized enhanced shift-splitting preconditioner for three-by-three block saddle point problems. CoRR abs/2402.17357 (2024) - [i10]Sk. Safique Ahmad, Pinki Khatun:
Structured Backward Errors for Special Classes of Saddle Point Problems with Applications. CoRR abs/2408.11610 (2024) - [i9]Sk. Safique Ahmad, Pinki Khatun:
A class of Parameterized Shift-Splitting Preconditioners for Regularized Three-by-Three Block Saddle Point Problems. CoRR abs/2408.11750 (2024) - [i8]Sk. Safique Ahmad, Pinki Khatun:
Structured Backward Error Analysis with Preserving Sparsity for Three-by-Three Block Saddle Point Problems. CoRR abs/2408.14019 (2024) - 2023
- [i7]Sk. Safique Ahmad, Pinki Khatun:
Structured condition numbers for generalized saddle point systems. CoRR abs/2305.05629 (2023) - [i6]Sk. Safique Ahmad, Pinki Khatun:
Condition numbers for the Moore-Penrose inverse and the least squares problem involving rank-structured matrices. CoRR abs/2306.12177 (2023) - [i5]Sk. Safique Ahmad, Neha Bhadala:
L-structure least squares solutions of reduced biquaternion matrix equations with applications. CoRR abs/2311.06461 (2023) - [i4]Sk. Safique Ahmad, Neha Bhadala:
Algebraic technique for mixed least squares and total least squares problem in the reduced biquaternion algebra. CoRR abs/2311.06464 (2023) - [i3]Sk. Safique Ahmad, Neha Bhadala:
Special least squares solutions of the reduced biquaternion matrix equation with applications. CoRR abs/2311.06472 (2023) - 2015
- [i2]Sk. Safique Ahmad, Istkhar Ali:
Localization theorems for eigenvalues of quaternionic matrices. CoRR abs/1502.08014 (2015) - 2008
- [i1]Sk. Safique Ahmad, Nagalinga Rajan, Soumyendu Raha:
The Stochastic Logarithmic Norm for Stability Analysis of Stochastic Differential Equations. CoRR abs/0809.0062 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
