default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammed A. Hasan
Person information
- affiliation: University of Minnesota, Duluth
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[c80]Mohammed A. Hasan:
Derivation of fractional order differentiators. LASCAS 2014: 1-4- [c79]Mohammed A. Hasan:
Methods for fractional delay approximation. LASCAS 2014: 1-4 - 2010
- [c78]Mohammed A. Hasan:
Reliable dynamical systems for canonical variate computation. ACC 2010: 4869-4874 - [c77]Mohammed A. Hasan:
On second derivative-free zero finding methods. ACC 2010: 6507-6512 - [c76]Mohammed A. Hasan:
On computing multi-dimensional generalized extreme and intermediate eigen subspaces. CDC 2010: 2831-2836 - [c75]Mohammed A. Hasan:
On computing multi-dimensional extreme eigen and singular subspaces. ISCAS 2010: 2570-2573 - [c74]Mohammed A. Hasan:
Low rank approximation of a set of matrices. ISCAS 2010: 3517-3520
2000 – 2009
- 2009
- [c73]Mohammed A. Hasan:
Stable algorithms for multiset canonical correlation analysis. ACC 2009: 1280-1285 - [c72]Mohammed A. Hasan:
Derivative-free family of higher order root finding methods. ACC 2009: 5351-5356 - [c71]Mohammed A. Hasan:
A weighted logarithmic merit function for canonical correlation analysis. ICASSP 2009: 1741-1744 - [c70]Mohammed A. Hasan:
Square-root free orthogonalization algorithms. ICASSP 2009: 3173-3176 - [c69]Mohammed A. Hasan:
Families of orthonormalization algorithms. IJCNN 2009: 1122-1127 - [c68]Mohammed A. Hasan:
On multi-set canonical correlation analysis. IJCNN 2009: 1128-1133 - [c67]Mohammed A. Hasan:
On Continuous Partial Singular Value Decomposition Algorithms. ISCAS 2009: 840-843 - [c66]Mohammed A. Hasan:
A Square Root Merit Function for Canonical Correlation Analysis. ISCAS 2009: 2473-2476 - [c65]Mohammed A. Hasan:
Computing Extreme Subspaces using Mirsky Theorem. ISCAS 2009: 2665-2668 - 2008
- [c64]Mohammed A. Hasan, Jawad A. K. Hasan:
Sanger's type dynamical systems for canonical variate analysis. ACC 2008: 4087-4092 - [c63]Mohammed A. Hasan, Jawad A. K. Hasan:
Gradient dynamical systems for principal singular subspace analysis. ACC 2008: 4666-4671 - [c62]Mohammed A. Hasan:
Joint computation of principal and minor components using gradient dynamical systems over stiefel manifolds. CDC 2008: 3287-3292 - [c61]Mohammed A. Hasan:
Low-rank approximations with applications to principal singular component learning systems. CDC 2008: 3293-3298 - [c60]Mohammed A. Hasan:
Dual systems for minor and principal component computation. ICASSP 2008: 1901-1904 - [c59]Mohammed A. Hasan:
A logarithmic cost function for principal singular component analysis. ICASSP 2008: 1933-1936 - 2007
- [c58]Mohammed A. Hasan:
A Framework for Eigen and Singular Component Analysis. ACC 2007: 1654-1659 - [c57]Mohammed A. Hasan:
On the Derivation of Higher Order Root-Finding Methods. ACC 2007: 2328-2333 - [c56]Mohammed A. Hasan:
Simultaneous Minor Component Extraction via Weighted Inverse Rayleigh Quotient. ICASSP (2) 2007: 561-564 - [c55]Mohammed A. Hasan:
Self-Normalizing Dual Systems for Minor and Principal Component Extraction. ICASSP (4) 2007: 885-888 - [c54]Mohammed A. Hasan:
Orthonormalization Learning Algorithms. IJCNN 2007: 1894-1899 - [c53]Mohammed A. Hasan:
Adaptive Diagonalization for Canonical Correlation Analysis. IJCNN 2007: 1906-1911 - [c52]Mohammed A. Hasan:
Upper-Triangulization of Non-Symmetric Matrices Using Sanger's Type Learning Systems. ISCAS 2007: 1009-1012 - [c51]Mohammed A. Hasan:
Generalizations of Oja's Learning Rule to Non-Symmetric Matrices. ISCAS 2007: 1779-1782 - [c50]Mohammed A. Hasan:
Lagrangian Gradient for Principal Singular Component Analysis. ISCAS 2007: 2315-2318 - 2006
- [c49]Mohammed A. Hasan:
Dynamical systems for joint principal and minor component analysis. ACC 2006: 1-6 - [c48]Mohammed A. Hasan:
Stability analysis of dynamical systems for minor and principal component analysis. ACC 2006: 1-6 - [c47]Mohammed A. Hasan:
Dynamical Systems for Joint Principal and Minor Component Analysis. ACC 2006: 4591-4596 - [c46]Mohammed A. Hasan:
New Dynamical Systems for Principal and Minor Subspace Analysis. CDC 2006: 5180-5185 - [c45]Mohammed A. Hasan:
New Families of Higher Order Iterative Methods for Solving Equations. CDC 2006: 6379-6384 - [c44]Mohammed A. Hasan:
Higher order convergent algorithms with applications to polynomials and matrices. ISCAS 2006 - [c43]Mohammed A. Hasan:
Differential and geometric properties of Rayleigh quotients with applications. ISCAS 2006 - 2005
- [c42]Mohammed A. Hasan:
Constrained quadratic optimization problems with applications. ACC 2005: 243-248vol.1 - [c41]Mohammed A. Hasan:
A Class of Higher Order Algorithms for Computing Polynomial Zeros. CDC/ECC 2005: 6573-6578 - [c40]Mohammed A. Hasan:
Root iterations and the computation of minimum and maximum zeros of polynomials. ISCAS (3) 2005: 2259-2262 - [c39]Mohammed A. Hasan:
Unconstrained functional criteria for canonical correlation analysis. ISCAS (3) 2005: 2317-2320 - [c38]Mohammed A. Hasan:
Natural gradient for minor component extraction. ISCAS (5) 2005: 5138-5141 - 2004
- [c37]Mohammed A. Hasan:
Generalized Wielandt and Cauchy-Schwarz inequalities. ACC 2004: 2142-2147 - [c36]Mohammed A. Hasan:
Inequalities and bounds for the zeros of polynomials using Perron-Frobenius and Gerschgorin theories. ACC 2004: 2745-2750 - [c35]Mohammed A. Hasan:
Line search and gradient method for solving constrained optimization problems. ICASSP (5) 2004: 789-792 - [c34]Mohammed A. Hasan:
A new approach for computing canonical correlations and coordinates. ISCAS (3) 2004: 309-312 - 2003
- [c33]Mohammed A. Hasan, Jawad A. K. Hasan:
New techniques for block eigenvalue decomposition. ACC 2003: 1464-1469 - [c32]Mohammed A. Hasan:
Algorithms for the generalized and nonlinear eigenvalue problems. ACC 2003: 1470-1475 - [c31]Mohammed A. Hasan:
Stability analysis via projections and eigen distribution in half-planes and disks. ACC 2003: 2738-2742 - [c30]Ali A. Hasan, Mohammed A. Hasan:
Constrained gradient descent and line search for solving optimization problem with elliptic constraints. ICASSP (2) 2003: 793-796 - [c29]Mohammed A. Hasan:
Sharper bounds for the zeros of polynomials. ISCAS (3) 2003: 16-19 - [c28]Mohammed A. Hasan, Mahmood R. Azimi-Sadjadi:
Fast algorithms for computing full and reduced rank Wiener filters. ISCAS (4) 2003: 41-44 - [c27]Mohammed A. Hasan, Ali A. Hasan:
Computation of projections and eigen distribution in half-planes and disks. ISCAS (4) 2003: 580-583 - [c26]Mohammed A. Hasan:
Algorithms for computating principal and minor invariant subspaces of large matrices. ISCAS (5) 2003: 669-672 - 2002
- [c25]Mohammed A. Hasan, Ali A. Hasan:
Trace inverse algorithms for the general eigenvalue problem. CDC 2002: 2111-2116 - [c24]Mohammed A. Hasan, Jawad A. K. Hasan:
Block eigenvalue decomposition using nth roots of the identity matrix. CDC 2002: 2119-2124 - [c23]Bassam R. Shaer, Mohammed A. Hasan:
New methods for computing the Pisarenko vector. ICASSP 2002: 3033-3036 - [c22]Mohammed A. Hasan, Ali A. Hasan:
Minor and major subspace computation of large matrices. ISCAS (4) 2002: 536-539 - [c21]Mohammed A. Hasan:
New algorithms for computing the minimum eigenpair of the generalized symmetric eigenvalue problem. ISCAS (4) 2002: 767-770 - 2001
- [c20]Mohammed A. Hasan, Ali A. Hasan, Khaled B. Ejaz:
Computation of matrix nth roots and the matrix sector function. CDC 2001: 4057-4062 - [c19]Mohammed A. Hasan, Ali A. Hasan, Khaled B. Ejaz:
Parallel methods for computating the matrix sign function with applications to the algebraic Riccati equation. CDC 2001: 4063-4068 - [c18]Mohammed A. Hasan, Ali A. Hasan:
Parallelizable eigenvalue decomposition techniques via the matrix sector function. ICASSP 2001: 1073-1076 - [c17]Jawad A. K. Hasan, Mohammed A. Hasan:
Rational and radical fixed point functions for the eigenvalue problem and polynomials. ICASSP 2001: 1077-1080 - [c16]Mohammed A. Hasan, Ali A. Hasan:
Matrix inverse-free algorithms for the general eigenvalue problem. ISCAS (3) 2001: 353-356 - [c15]Mohammed A. Hasan, Ali A. Hasan:
Principal and minor subspace computation with applications. ISSPA 2001: 92-95 - [c14]Mohammed A. Hasan:
Fast rational approximation algorithms of signal and noise subspaces. ISSPA 2001: 124-127 - [c13]Mohammed A. Hasan:
Sinusoidal estimation methods using fourth order cumulants. ISSPA 2001: 375-378 - 2000
- [j5]Mohammed A. Hasan, Mahmood R. Azimi-Sadjadi, Ali A. Hasan:
Rational invariant subspace approximations with applications. IEEE Trans. Signal Process. 48(11): 3032-3041 (2000) - [c12]Mohammed A. Hasan, Ali A. Hasan:
Principal and minor subspace computation with applications. ACC 2000: 799-800 - [c11]Mohammed A. Hasan, Jawad A. K. Hasan:
Algorithms for computing nth roots and the matrix sector function of nonsingular complex matrices. ACC 2000: 1390-1394 - [c10]Mohammed A. Hasan, Ali A. Hasan:
Subspace approximation with applications to system identification. ACC 2000: 2713-2714 - [c9]Mohammed A. Hasan, Jawad A. K. Hasan, Lucas Scharenbroich:
New integral representations and algorithms for computing nth roots and the matrix sector function of nonsingular complex matrices. CDC 2000: 4247-4252 - [c8]Mohammed A. Hasan, Ali A. Hasan, Syed Rahman:
Fixed point iterations for computing square roots and the matrix sign function of complex matrices. CDC 2000: 4253-4258 - [c7]Mohammed A. Hasan, Ali A. Hasan:
MUSIC and pencil-based sinusoidal estimation methods using fourth order cumulants. ISCAS 2000: 669-672
1990 – 1999
- 1999
- [j4]Mohammed A. Hasan:
DOA and frequency estimation using fast subspace algorithms. Signal Process. 77(1): 49-62 (1999) - [c6]Mohammed A. Hasan, Jawad A. K. Hasan:
Rational signal subspace approximation with applications to DOA estimation. ICASSP 1999: 1505-1508 - [c5]Mohammed A. Hasan, Ali A. Hasan:
Signal subspace approximation with applications to system identification. ISCAS (3) 1999: 243-246 - [c4]Mohammed A. Hasan, Ali A. Hasan:
ESPRIT and MUSIC-Based Sinusoidal Frequency Estimation Methods using Fourth Order Cumulants. SIP 1999: 84-88 - 1998
- [j3]Mohammed A. Hasan, Mahmood R. Azimi-Sadjadi, Gerald J. Dobeck:
Separation of multiple time delays using new spectral estimation schemes. IEEE Trans. Signal Process. 46(6): 1580-1590 (1998) - [c3]Mohammed A. Hasan, Jawad A. K. Hasan:
Matrix sign algorithm for sinusoidal frequency and DOA estimation problems. ICASSP 1998: 1369-1372 - 1996
- [j2]Mohammed A. Hasan, Ali A. Hasan:
A procedure for the positive definiteness of forms of even order. IEEE Trans. Autom. Control. 41(4): 615-617 (1996) - [j1]Mohammed A. Hasan, Mahmood R. Azimi-Sadjadi:
A modified block FTF adaptive algorithm with applications to underwater target detection. IEEE Trans. Signal Process. 44(9): 2172-2185 (1996) - [c2]Ali A. Hasan, Mohammed A. Hasan:
A fast transversal filter for the numerical factorization of polynomials. ICASSP 1996: 1299-1302 - 1993
- [c1]Mohammed A. Hasan, Mahmood R. Azimi-Sadjadi:
Noncausal image modeling with applications to image restoration. ISCAS 1993: 842-845
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-04-24 22:59 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:
