| Version 1.9 Build 803
|
|
Up: NOTE 224 - AIPS++ Least Squares background
Previous: Errors
An LSQ-object takes a total space of:
| 9 |
+ |
(administration) |
|
| (n + p)(n + p + 1)/2 |
+ |
(normal array) |
|
| 4m |
+ |
(error calculations) |
|
| m(m + p) |
+ |
(known sides) |
|
| (n + p + 1)/2 |
+ |
(pivot area) |
|
| (n + p) |
|
(solution) 8 byte words |
(44) |
where n is the number of unknowns (2n if complex); m the number of
simultaneously to be
solved equations; p the number of external constraint equations.
In the non-linear case two LSQ-objects are used. In cases where the inverted
normal array is calculated (known constraints)
a temporary storage of n2 8-byte words is used.
The following calls are available:
- To be given
wnb, August 28, 2004
Up: NOTE 224 - AIPS++ Least Squares background
Previous: Errors
Contents
Please send questions or comments about AIPS++ to aips2-request@nrao.edu.
Copyright © 1995-2000 Associated Universities Inc.,
Washington, D.C.
Return to AIPS++ Home Page
2004-08-28