Skip to main navigation
Skip to search
Skip to main content
Experts@Minnesota Home
Home
Profiles
Research units
University Assets
Projects and Grants
Research output
Datasets
Press/Media
Activities
Fellowships, Honors, and Prizes
Impacts
Search by expertise, name or affiliation
Matrix inverse-free algorithms for the general eigenvalue problem
Mohammed A Hasan
, A. A. Hasan
Electrical Engineering
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Matrix inverse-free algorithms for the general eigenvalue problem'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Matrix Inverse
100%
Eigenvalue Problem
100%
QR Factorization
100%
Inverse-free Algorithm
100%
Convergence Rate
50%
Newton's Method
50%
Invariant Subspace
50%
Singular Value Decomposition
50%
Novel Matrix
50%
Eigenvalue Decomposition
50%
Conventional Algorithm
50%
Orthogonal Projection
50%
Subspace Identification
50%
Quadratic Convergence Rate
50%
Cubic Convergence
50%
Block Matrix Decomposition
50%
Science Application
50%
Computer Science
Eigenvalue
100%
Matrix Inverse
100%
Decomposition Matrix
50%
Conventional Algorithm
50%
Engineering Science
50%
Newton's Method
50%
Singular Value
50%
Convergence Rate
50%
Orthogonal Projection
50%
Invariant Subspace
50%
Mathematics
Matrix
100%
Eigenvalue Problem
100%
QR Factorization
66%
Mathematics
33%
Matrix Decomposition
33%
Singular Value Decomposition
33%
Eigenvalue Decomposition
33%
Convergence Rate
33%
Newton's Method
33%
Block Matrix
33%
Orthogonal Projection
33%