| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Polinomske aproksimacije funkcij ene spremenljivke s pomočjo Čebišovih interpolacijskih točk in Newtonovega polinoma deljenih diferenc na TI Nspire CAS računalih.
Authors:ID Švelc, Gorazd (Author)
ID Mencinger, Matej (Mentor) More about this mentor... New window
Files:.pdf UNI_Svelc_Gorazd_2013.pdf (2,14 MB)
MD5: 7445C598E4C47BF574022FD00A255114
 
Language:Slovenian
Work type:Diploma project paper
Organization:FGPA - Faculty of Civil Engineering, Transportation Engineering and Architecture
Abstract:Cilj te diplomske naloge je izdelava aproksimacijskega algoritma na podlagi teoretičnega ozadja polinomske aproksimacije funkcij ene spremenljivke. V sklopu algoritma delo obravnava posebno družino polinomov, ki definirajo interpolacijske točke, katere se asimptotično zgostijo proti začetku in na koncu intervala in s tem bistveno izboljšajo aproksimacijo. Delo povzema še konstrukcijo Newtonovega polinoma deljenih diferenc in njegovo vlogo pri polinomskih aproksimacijah funkcij, ter podaja nekaj primerov različnih interpolacijskih pristopov k aproksimaciji funkcij. To diplomsko delo vsebuje tudi izvorno kodo programa v programskem jeziku TI Basic, ki je avtorjevo izvirno delo.
Keywords:aproksimacija, interpolacija, deljene diference, polinomi Čebišova, TI Basic, TI Nspire CAS
Place of publishing:Maribor
Publisher:[G. Švelc]
Year of publishing:2013
PID:20.500.12556/DKUM-41231 New window
UDC:517.518.8
COBISS.SI-ID:18733846 New window
NUK URN:URN:SI:UM:DK:BHRAZQKU
Publication date in DKUM:20.08.2013
Views:2384
Downloads:226
Metadata:XML DC-XML DC-RDF
Categories:KTFMB - FG
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:English
Title:Polynomial approximation of one-variable functions by Newton's divided difference polynomial and Chebyshev interpolation nodes on TI Nspire CAS calculators.
Abstract:This diploma work aims to construct the approximation algorithm based on theory of polynomial approximation of arbitrary one-variable functions. It presents a group of polynomials that defines interpolation nodes with asymptotic accumulation towards the edges, for which maximum approximation error is guaranteed to diminish with increasing polynomial order. This document summarizes the construction of Newton’s divided differences polynomial and presents several cases of approximation with different interpolation methods. It also provides an original source code of the program, written in TI Basic programming language.
Keywords:approximation, interpolation, divided differences, Chebyshev polynomials, TI Basic, TI Nspire CAS


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica