Finding the Maximal Eigenpair for a Large, Dense, Symmetric Matrix based on Mufa Chen's Algorithm (Q5129480): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.4208/cmr.2020-0005 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4208/cmr.2020-0005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3014591787 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4208/CMR.2020-0005 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:04, 30 December 2024

scientific article; zbMATH DE number 7266476
Language Label Description Also known as
English
Finding the Maximal Eigenpair for a Large, Dense, Symmetric Matrix based on Mufa Chen's Algorithm
scientific article; zbMATH DE number 7266476

    Statements

    Finding the Maximal Eigenpair for a Large, Dense, Symmetric Matrix based on Mufa Chen's Algorithm (English)
    0 references
    0 references
    0 references
    27 October 2020
    0 references
    maximal eigenpair
    0 references
    symmetric matrix
    0 references
    dense matrix
    0 references
    tridiagonal matrix
    0 references
    Householder transformation
    0 references
    complexity
    0 references
    iteration
    0 references

    Identifiers