A faster, more stable method for comuting the pth roots of positive definite matrices (Q1258164): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q750894
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: William D. Hoskins / 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.1016/0024-3795(79)90176-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968564862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster method of computing the square root of a matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: The matrix sign function and computations in systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4060241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A high-order method of solution for the Lyapunov matrix equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5734756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank

Latest revision as of 02:23, 13 June 2024

scientific article
Language Label Description Also known as
English
A faster, more stable method for comuting the pth roots of positive definite matrices
scientific article

    Statements

    A faster, more stable method for comuting the pth roots of positive definite matrices (English)
    0 references
    0 references
    0 references
    1979
    0 references
    0 references
    Stable Method
    0 references
    Roots of Positive Definite Matrices
    0 references
    Numerical Examples
    0 references
    Generalization of Newton's Method
    0 references
    0 references