Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm (Q2550611): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q5543516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3250836 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chebyshev and $l^1 $-Solutions of Linear Equations Using Least Squares Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5543004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lawson Algorithm and Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions of overdetermined linear equations which minimize error in an abstract norm / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998487066 / rank
 
Normal rank

Latest revision as of 10:47, 30 July 2024

scientific article
Language Label Description Also known as
English
Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm
scientific article

    Statements

    Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm (English)
    0 references
    0 references
    1971
    0 references

    Identifiers