Least Squares Algorithms for Finding Solutions of Overdetermined Linear Equations Which Minimize Error in an Abstract Norm.
Numerische Mathematik, Tome 17 (1971), pp. 387-401
Cet article a éte moissonné depuis la source European Digital Mathematics Library
@article{NUMA_1971__17_132085,
author = {V.P. SREEDHARAN},
title = {Least {Squares} {Algorithms} for {Finding} {Solutions} of {Overdetermined} {Linear} {Equations} {Which} {Minimize} {Error} in an {Abstract} {Norm.}},
journal = {Numerische Mathematik},
pages = {387--401},
year = {1971},
volume = {17},
zbl = {0231.65040},
url = {http://geodesic.mathdoc.fr/item/NUMA_1971__17_132085/}
}
TY - JOUR AU - V.P. SREEDHARAN TI - Least Squares Algorithms for Finding Solutions of Overdetermined Linear Equations Which Minimize Error in an Abstract Norm. JO - Numerische Mathematik PY - 1971 SP - 387 EP - 401 VL - 17 UR - http://geodesic.mathdoc.fr/item/NUMA_1971__17_132085/ ID - NUMA_1971__17_132085 ER -
V.P. SREEDHARAN. Least Squares Algorithms for Finding Solutions of Overdetermined Linear Equations Which Minimize Error in an Abstract Norm.. Numerische Mathematik, Tome 17 (1971), pp. 387-401. http://geodesic.mathdoc.fr/item/NUMA_1971__17_132085/