Nogludinoša histosplaina konstruēšana ar modificēto Simpleksa metodi
Loading...
Date
Authors
Advisor
Journal Title
Journal ISSN
Volume Title
Publisher
Latvijas Universitāte
Language
N/A
Abstract
Darbs ir veltīts gadījuma lieluma histogrammas aproksimācijai ar nogludinošiem histosplainiem. Nogludinošais histosplains tiek meklēts kā kvadrātiskās programmēšanas uzdevuma atrisinājums. Ar Vulfa – Daugaveta metodi uzdevums tiek reducēts uz lineārās programmēšanas uzdevumu ar dažiem nelineāriem papildus nosacījumiem. Uzdevuma risināšanai tika uzrakstīta programma Visual Basic valodā, kas realizē simpleksa algoritma modifikāciju, kura ievēro nelineāros nosacījumus. Algoritms ir testēts, konstruējot histogrammas histosplainu.
Atslēgvārdi: nogludinošie splaini, simpleksa metode, kvadrātiskās programmēšanas uzdevums.
This work is dedicated to the approximation of the random value histogramm with the smoothing histosplines. The smoothing histosplines are searched as the solution of the quadratic programming problem. This problem is transformed by Wolf – Daugavet method into the linear programming problem with several additional non-linear conditions. To solve a problem is offered the program in Visual Basic programming language that realizes the modification of simplex algorithm taking into consideration non-linear conditions. This algorithm has been tested by constructing histograms of histosplines. Key words: smoothing histospline, simplex method, quadratic programming problem.
This work is dedicated to the approximation of the random value histogramm with the smoothing histosplines. The smoothing histosplines are searched as the solution of the quadratic programming problem. This problem is transformed by Wolf – Daugavet method into the linear programming problem with several additional non-linear conditions. To solve a problem is offered the program in Visual Basic programming language that realizes the modification of simplex algorithm taking into consideration non-linear conditions. This algorithm has been tested by constructing histograms of histosplines. Key words: smoothing histospline, simplex method, quadratic programming problem.