Algorithms and Data Structures in Least Squares Adjustment

Lecturer:

Aleš Čepek (gar.)

Tutor:

Supervisor:

Department of Mapping and Cartography

Synopsis:

Algorithms and data structures of adjustment calculus and their computer implementation

Requirements:

Active knowledge of adjustment calculus and object oriented programming

Syllabus of lectures:

Main topics are: object oriented implemntation and analysis of adjustment practical implementation of XML for description of geodetic data, basic data structures (matices, point lists and lists of uncorrelated and correlated observations, inheritance in adjustment), normal equations vs orthogonal decompositions of the design matrix.

Syllabus of tutorials:

Study Objective:

Introduce students into the filed of computer based solution of adjustment calculus problems, with focus on the adjustment of geodetic networks

Study materials:

Note:

Time-table for winter semester 2011/2012:

Time-table is not available yet

Time-table for summer semester 2011/2012:

Time-table is not available yet

The course is a part of the following study plans: