Solving least squares problems:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Philadelphia, Pa.
Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104)
1995
|
| Ausgabe: | "This SIAM edition is an unabridged, revised republication of the work first published by Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1974"--T.p. verso |
| Schriftenreihe: | Classics in applied mathematics
15 |
| Schlagworte: | |
| Online-Zugang: | TUM01 UBW01 UBY01 UER01 Volltext |
| Beschreibung: | Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader Includes bibliographical references (s. 312-326) and index Preface to the Classics edition -- Preface -- Chapter 1. Introduction -- Chapter 2. Analysis of the least squares problem -- Chapter 3. Orthogonal decomposition by certain elementary orthogonal transformations -- Chapter 4. Orthogonal decomposition by singular value decomposition -- Chapter 5. Perturbation theorems for singular values -- Chapter 6. Bounds for the condition number of a triangular matrix -- Chapter 7. The pseudoinverse -- Chapter 8. Perturbation bounds for the pseudoinverse -- Chapter 9. Perturbation bounds for the solution of problem LS -- Chapter 10. Numerical computations using elementary orthogonal transformations -- Chapter 11. Computing the solution for the overdetermined or exactly-- determined full rank problem -- Chapter 12. Computation of the covariance matrix of the solution parameters -- Chapter 13. Computing the solution for the underdetermined full rank problem -- Chapter 14. Computing the solution for problem LS with possibly deficient pseudorank -- Chapter 15. Analysis of computing errors for householder transformations -- Chapter 16. Analysis of computing errors for the problem LS -- Chapter 17. Analysis of computing errors for the problem LS using mixed precision arithmetic -- Chapter 18. Computation of the singular value decomposition and the solution of problem LS -- Chapter 19. Other methods for least squares problems -- Chapter 20. Linear least squares with linear equality constraints using a basis of the null space -- Chapter 21. Linear least squares with linear equality constraints by direct elimination -- Chapter 22. Linear least squares with linear equality constraints by weighting -- Chapter 23. Linear least squares with linear inequality constraints -- Chapter 24. Modifying a QR decomposition to add or remove column vectors -- Chapter 25. Practical analysis of least squares problems -- Chapter 26. Examples of some methods of analyzing a least squares problem -- Chapter 27. Modifying a QR decomposition to add or remove row vectors with Application to sequential processing of problems having a large or banded coefficient matrix -- Appendix A. Basic linear algebra including projections -- Appendix B. Proof of global quadratic convergence of the QR algorithm -- Appendix C. Description and use of FORTRAN codes for solving problem LS -- Appendix D. Developments from 1974 to 1995 -- Bibliography -- Index |
| Beschreibung: | 1 Online Ressource (xii, 337 Seiten) |
| ISBN: | 0898713560 9780898713565 |
| DOI: | 10.1137/1.9781611971217 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV039747314 | ||
| 003 | DE-604 | ||
| 005 | 20240215 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 111207s1995 sz |||| o||u| ||||||eng d | ||
| 010 | |a 95035178 | ||
| 020 | |a 0898713560 |c pbk. |9 0898713560 | ||
| 020 | |a 9780898713565 |c pbk. |9 9780898713565 | ||
| 024 | 7 | |a 10.1137/1.9781611971217 |2 doi | |
| 035 | |a (OCoLC)775728887 | ||
| 035 | |a (DE-599)BVBBV039747314 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a sz |c XA-CH | ||
| 049 | |a DE-91 |a DE-29 |a DE-706 |a DE-83 |a DE-20 | ||
| 084 | |a QH 234 |0 (DE-625)141549: |2 rvk | ||
| 084 | |a SK 910 |0 (DE-625)143270: |2 rvk | ||
| 100 | 1 | |a Lawson, Charles L. |d 194X- |e Verfasser |0 (DE-588)1062525639 |4 aut | |
| 245 | 1 | 0 | |a Solving least squares problems |c Charles L. Lawson, Richard J. Hanson |
| 250 | |a "This SIAM edition is an unabridged, revised republication of the work first published by Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1974"--T.p. verso | ||
| 264 | 1 | |a Philadelphia, Pa. |b Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) |c 1995 | |
| 300 | |a 1 Online Ressource (xii, 337 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Classics in applied mathematics |v 15 | |
| 500 | |a Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader | ||
| 500 | |a Includes bibliographical references (s. 312-326) and index | ||
| 500 | |a Preface to the Classics edition -- Preface -- Chapter 1. Introduction -- Chapter 2. Analysis of the least squares problem -- Chapter 3. Orthogonal decomposition by certain elementary orthogonal transformations -- Chapter 4. Orthogonal decomposition by singular value decomposition -- Chapter 5. Perturbation theorems for singular values -- Chapter 6. Bounds for the condition number of a triangular matrix -- Chapter 7. The pseudoinverse -- Chapter 8. Perturbation bounds for the pseudoinverse -- Chapter 9. Perturbation bounds for the solution of problem LS -- Chapter 10. Numerical computations using elementary orthogonal transformations -- Chapter 11. Computing the solution for the overdetermined or exactly-- determined full rank problem -- Chapter 12. Computation of the covariance matrix of the solution parameters -- Chapter 13. Computing the solution for the underdetermined full rank problem -- Chapter 14. Computing the solution for problem LS with possibly deficient pseudorank -- Chapter 15. Analysis of computing errors for householder transformations -- Chapter 16. Analysis of computing errors for the problem LS -- Chapter 17. Analysis of computing errors for the problem LS using mixed precision arithmetic -- Chapter 18. Computation of the singular value decomposition and the solution of problem LS -- Chapter 19. Other methods for least squares problems -- | ||
| 500 | |a Chapter 20. Linear least squares with linear equality constraints using a basis of the null space -- Chapter 21. Linear least squares with linear equality constraints by direct elimination -- Chapter 22. Linear least squares with linear equality constraints by weighting -- Chapter 23. Linear least squares with linear inequality constraints -- Chapter 24. Modifying a QR decomposition to add or remove column vectors -- Chapter 25. Practical analysis of least squares problems -- Chapter 26. Examples of some methods of analyzing a least squares problem -- Chapter 27. Modifying a QR decomposition to add or remove row vectors with Application to sequential processing of problems having a large or banded coefficient matrix -- Appendix A. Basic linear algebra including projections -- Appendix B. Proof of global quadratic convergence of the QR algorithm -- Appendix C. Description and use of FORTRAN codes for solving problem LS -- Appendix D. Developments from 1974 to 1995 -- Bibliography -- Index | ||
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Least squares / Data processing | |
| 650 | 0 | 7 | |a Methode der kleinsten Quadrate |0 (DE-588)4038974-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Ausgleichsrechnung |0 (DE-588)4143526-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datenverarbeitung |0 (DE-588)4011152-0 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Ausgleichsrechnung |0 (DE-588)4143526-6 |D s |
| 689 | 0 | 1 | |a Datenverarbeitung |0 (DE-588)4011152-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Methode der kleinsten Quadrate |0 (DE-588)4038974-1 |D s |
| 689 | 1 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 700 | 1 | |a Hanson, Richard J. |e Sonstige |0 (DE-588)1212251857 |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Paperback |z 0898713560 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Paperback |z 9780898713565 |
| 830 | 0 | |a Classics in applied mathematics |v 15 |w (DE-604)BV040633091 |9 15 | |
| 856 | 4 | 0 | |u https://doi.org/10.1137/1.9781611971217 |x Verlag |3 Volltext |
| 912 | |a ZDB-72-SIA | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-024594845 | ||
| 966 | e | |u https://doi.org/10.1137/1.9781611971217 |l TUM01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1137/1.9781611971217 |l UBW01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1137/1.9781611971217 |l UBY01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1137/1.9781611971217 |l UER01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804148637598482433 |
|---|---|
| any_adam_object | |
| author | Lawson, Charles L. 194X- |
| author_GND | (DE-588)1062525639 (DE-588)1212251857 |
| author_facet | Lawson, Charles L. 194X- |
| author_role | aut |
| author_sort | Lawson, Charles L. 194X- |
| author_variant | c l l cl cll |
| building | Verbundindex |
| bvnumber | BV039747314 |
| classification_rvk | QH 234 SK 910 |
| collection | ZDB-72-SIA |
| ctrlnum | (OCoLC)775728887 (DE-599)BVBBV039747314 |
| discipline | Mathematik Wirtschaftswissenschaften |
| doi_str_mv | 10.1137/1.9781611971217 |
| edition | "This SIAM edition is an unabridged, revised republication of the work first published by Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1974"--T.p. verso |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05361nmm a2200661zcb4500</leader><controlfield tag="001">BV039747314</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240215 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">111207s1995 sz |||| o||u| ||||||eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">95035178</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0898713560</subfield><subfield code="c">pbk.</subfield><subfield code="9">0898713560</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780898713565</subfield><subfield code="c">pbk.</subfield><subfield code="9">9780898713565</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1137/1.9781611971217</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)775728887</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV039747314</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">sz</subfield><subfield code="c">XA-CH</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 234</subfield><subfield code="0">(DE-625)141549:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 910</subfield><subfield code="0">(DE-625)143270:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lawson, Charles L.</subfield><subfield code="d">194X-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1062525639</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Solving least squares problems</subfield><subfield code="c">Charles L. Lawson, Richard J. Hanson</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">"This SIAM edition is an unabridged, revised republication of the work first published by Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1974"--T.p. verso</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Philadelphia, Pa.</subfield><subfield code="b">Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104)</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online Ressource (xii, 337 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Classics in applied mathematics</subfield><subfield code="v">15</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (s. 312-326) and index</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Preface to the Classics edition -- Preface -- Chapter 1. Introduction -- Chapter 2. Analysis of the least squares problem -- Chapter 3. Orthogonal decomposition by certain elementary orthogonal transformations -- Chapter 4. Orthogonal decomposition by singular value decomposition -- Chapter 5. Perturbation theorems for singular values -- Chapter 6. Bounds for the condition number of a triangular matrix -- Chapter 7. The pseudoinverse -- Chapter 8. Perturbation bounds for the pseudoinverse -- Chapter 9. Perturbation bounds for the solution of problem LS -- Chapter 10. Numerical computations using elementary orthogonal transformations -- Chapter 11. Computing the solution for the overdetermined or exactly-- determined full rank problem -- Chapter 12. Computation of the covariance matrix of the solution parameters -- Chapter 13. Computing the solution for the underdetermined full rank problem -- Chapter 14. Computing the solution for problem LS with possibly deficient pseudorank -- Chapter 15. Analysis of computing errors for householder transformations -- Chapter 16. Analysis of computing errors for the problem LS -- Chapter 17. Analysis of computing errors for the problem LS using mixed precision arithmetic -- Chapter 18. Computation of the singular value decomposition and the solution of problem LS -- Chapter 19. Other methods for least squares problems --</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Chapter 20. Linear least squares with linear equality constraints using a basis of the null space -- Chapter 21. Linear least squares with linear equality constraints by direct elimination -- Chapter 22. Linear least squares with linear equality constraints by weighting -- Chapter 23. Linear least squares with linear inequality constraints -- Chapter 24. Modifying a QR decomposition to add or remove column vectors -- Chapter 25. Practical analysis of least squares problems -- Chapter 26. Examples of some methods of analyzing a least squares problem -- Chapter 27. Modifying a QR decomposition to add or remove row vectors with Application to sequential processing of problems having a large or banded coefficient matrix -- Appendix A. Basic linear algebra including projections -- Appendix B. Proof of global quadratic convergence of the QR algorithm -- Appendix C. Description and use of FORTRAN codes for solving problem LS -- Appendix D. Developments from 1974 to 1995 -- Bibliography -- Index</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Least squares / Data processing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Methode der kleinsten Quadrate</subfield><subfield code="0">(DE-588)4038974-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Ausgleichsrechnung</subfield><subfield code="0">(DE-588)4143526-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Ausgleichsrechnung</subfield><subfield code="0">(DE-588)4143526-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Methode der kleinsten Quadrate</subfield><subfield code="0">(DE-588)4038974-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hanson, Richard J.</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1212251857</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Paperback</subfield><subfield code="z">0898713560</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Paperback</subfield><subfield code="z">9780898713565</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Classics in applied mathematics</subfield><subfield code="v">15</subfield><subfield code="w">(DE-604)BV040633091</subfield><subfield code="9">15</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1137/1.9781611971217</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-72-SIA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024594845</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611971217</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611971217</subfield><subfield code="l">UBW01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611971217</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611971217</subfield><subfield code="l">UER01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV039747314 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T00:10:18Z |
| institution | BVB |
| isbn | 0898713560 9780898713565 |
| language | English |
| lccn | 95035178 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024594845 |
| oclc_num | 775728887 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM DE-29 DE-706 DE-83 DE-20 |
| owner_facet | DE-91 DE-BY-TUM DE-29 DE-706 DE-83 DE-20 |
| physical | 1 Online Ressource (xii, 337 Seiten) |
| psigel | ZDB-72-SIA |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| publisher | Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) |
| record_format | marc |
| series | Classics in applied mathematics |
| series2 | Classics in applied mathematics |
| spelling | Lawson, Charles L. 194X- Verfasser (DE-588)1062525639 aut Solving least squares problems Charles L. Lawson, Richard J. Hanson "This SIAM edition is an unabridged, revised republication of the work first published by Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1974"--T.p. verso Philadelphia, Pa. Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) 1995 1 Online Ressource (xii, 337 Seiten) txt rdacontent c rdamedia cr rdacarrier Classics in applied mathematics 15 Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader Includes bibliographical references (s. 312-326) and index Preface to the Classics edition -- Preface -- Chapter 1. Introduction -- Chapter 2. Analysis of the least squares problem -- Chapter 3. Orthogonal decomposition by certain elementary orthogonal transformations -- Chapter 4. Orthogonal decomposition by singular value decomposition -- Chapter 5. Perturbation theorems for singular values -- Chapter 6. Bounds for the condition number of a triangular matrix -- Chapter 7. The pseudoinverse -- Chapter 8. Perturbation bounds for the pseudoinverse -- Chapter 9. Perturbation bounds for the solution of problem LS -- Chapter 10. Numerical computations using elementary orthogonal transformations -- Chapter 11. Computing the solution for the overdetermined or exactly-- determined full rank problem -- Chapter 12. Computation of the covariance matrix of the solution parameters -- Chapter 13. Computing the solution for the underdetermined full rank problem -- Chapter 14. Computing the solution for problem LS with possibly deficient pseudorank -- Chapter 15. Analysis of computing errors for householder transformations -- Chapter 16. Analysis of computing errors for the problem LS -- Chapter 17. Analysis of computing errors for the problem LS using mixed precision arithmetic -- Chapter 18. Computation of the singular value decomposition and the solution of problem LS -- Chapter 19. Other methods for least squares problems -- Chapter 20. Linear least squares with linear equality constraints using a basis of the null space -- Chapter 21. Linear least squares with linear equality constraints by direct elimination -- Chapter 22. Linear least squares with linear equality constraints by weighting -- Chapter 23. Linear least squares with linear inequality constraints -- Chapter 24. Modifying a QR decomposition to add or remove column vectors -- Chapter 25. Practical analysis of least squares problems -- Chapter 26. Examples of some methods of analyzing a least squares problem -- Chapter 27. Modifying a QR decomposition to add or remove row vectors with Application to sequential processing of problems having a large or banded coefficient matrix -- Appendix A. Basic linear algebra including projections -- Appendix B. Proof of global quadratic convergence of the QR algorithm -- Appendix C. Description and use of FORTRAN codes for solving problem LS -- Appendix D. Developments from 1974 to 1995 -- Bibliography -- Index Datenverarbeitung Least squares / Data processing Methode der kleinsten Quadrate (DE-588)4038974-1 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Ausgleichsrechnung (DE-588)4143526-6 gnd rswk-swf Datenverarbeitung (DE-588)4011152-0 gnd rswk-swf Ausgleichsrechnung (DE-588)4143526-6 s Datenverarbeitung (DE-588)4011152-0 s DE-604 Methode der kleinsten Quadrate (DE-588)4038974-1 s Algorithmus (DE-588)4001183-5 s Hanson, Richard J. Sonstige (DE-588)1212251857 oth Erscheint auch als Druck-Ausgabe, Paperback 0898713560 Erscheint auch als Druck-Ausgabe, Paperback 9780898713565 Classics in applied mathematics 15 (DE-604)BV040633091 15 https://doi.org/10.1137/1.9781611971217 Verlag Volltext |
| spellingShingle | Lawson, Charles L. 194X- Solving least squares problems Classics in applied mathematics Datenverarbeitung Least squares / Data processing Methode der kleinsten Quadrate (DE-588)4038974-1 gnd Algorithmus (DE-588)4001183-5 gnd Ausgleichsrechnung (DE-588)4143526-6 gnd Datenverarbeitung (DE-588)4011152-0 gnd |
| subject_GND | (DE-588)4038974-1 (DE-588)4001183-5 (DE-588)4143526-6 (DE-588)4011152-0 |
| title | Solving least squares problems |
| title_auth | Solving least squares problems |
| title_exact_search | Solving least squares problems |
| title_full | Solving least squares problems Charles L. Lawson, Richard J. Hanson |
| title_fullStr | Solving least squares problems Charles L. Lawson, Richard J. Hanson |
| title_full_unstemmed | Solving least squares problems Charles L. Lawson, Richard J. Hanson |
| title_short | Solving least squares problems |
| title_sort | solving least squares problems |
| topic | Datenverarbeitung Least squares / Data processing Methode der kleinsten Quadrate (DE-588)4038974-1 gnd Algorithmus (DE-588)4001183-5 gnd Ausgleichsrechnung (DE-588)4143526-6 gnd Datenverarbeitung (DE-588)4011152-0 gnd |
| topic_facet | Datenverarbeitung Least squares / Data processing Methode der kleinsten Quadrate Algorithmus Ausgleichsrechnung |
| url | https://doi.org/10.1137/1.9781611971217 |
| volume_link | (DE-604)BV040633091 |
| work_keys_str_mv | AT lawsoncharlesl solvingleastsquaresproblems AT hansonrichardj solvingleastsquaresproblems |