Sökning: "characteristic polynomial"

Visar resultat 1 - 5 av 14 uppsatser innehållade orden characteristic polynomial.

  1. 1. Wavelength-dependent limb darkeningin the analysis oftransit spectroscopy of exoplanets

    L3-uppsats, Uppsala universitet/Institutionen för fysik och astronomi

    Författare :Alberto García Ribas; [2023]
    Nyckelord :;

    Sammanfattning : Limb darkening, an optical effect characteristic of stars, where the limb (edge) seemsto be darker than the centre of the stellar body; plays an important role in our under-standing of exoplanetary transits, as it is fundamental for developing light curve modelsthat can help to undercover extrasolar companions. To recover atmospheric featuresfrom exoplanets, a principal component analysis method is typically used. LÄS MER

  3. 2. Relating the Arnoldi approximation to the best Chebyshev approximation of the characteristic polynomial - A study using a complex valued variant of the Remez algorithm

    Kandidat-uppsats, Lunds universitet/Matematik (naturvetenskapliga fakulteten); Lunds universitet/Matematikcentrum

    Författare :Thomas Renström; [2022]
    Nyckelord :Chebyshev; Arnoldi; Remez; Tang; approximation; matrix; complex; characteristic polynomial; Mathematics and Statistics;

    Sammanfattning : The Remez algorithm is a beautiful algorithm that finds the best approximation to a function by finding points satisfying the alternation condition. In 1987 Ping Tang published his doctoral thesis detailing a version of the Remez algorithm modified for functions of complex values with complex coefficients. LÄS MER

  4. 3. Exploring and extending eigensolvers for Toeplitz(-like) matrices : A study of numerical eigenvalue and eigenvector computations combined with matrix-less methods

    Kandidat-uppsats, Uppsala universitet/Institutionen för informationsteknologi

    Författare :Martin Knebel; Fredrik Cers; Oliver Groth; [2022]
    Nyckelord :Toeplitz matrices; eigenvalue computation; eigenvector computation; matrix-less methods;

    Sammanfattning : We implement an eigenvalue solving algorithm proposed by Ng and Trench, specialized for Toeplitz(-like) matrices, utilizing root finding in conjunction with an iteratively calculated version of the characteristic polynomial. The solver also yields corresponding eigenvectors as a free bi-product. LÄS MER

  5. 4. A Semi Supervised Support Vector Machine for a Recommender System : Applied to a real estate dataset

    Master-uppsats, Linköpings universitet/Statistik och maskininlärning

    Författare :José Méndez; [2021]
    Nyckelord :SVM; Support Vector Machines; Semisupervised Learning; Machine Learning; Semi-supervised learning;

    Sammanfattning : Recommender systems are widely used in e-commerce websites to improve the buying experience of the customer. In recent years, e-commerce has been quickly expanding and its growth has been accelerated during the COVID-19 pandemic, when customers and retailers were asked to keep their distance and do lockdowns. LÄS MER

  7. 5. Ramification of polynomials

    Master-uppsats, Linnéuniversitetet/Institutionen för matematik (MA)

    Författare :Ana Strikic; [2021]
    Nyckelord :non-pleasantly ramified polynomials; minimally ramified polynomial; lower ramification numbers; minimal ramification; discrete dynamical systems; iterating polynomials; ultrametric fields;

    Sammanfattning : In this research,we study iterations of non-pleasantly ramified polynomials over fields of positive characteristic and subsequently, their lower ramification numbers. Of particular interest for this thesis are polynomials for which both the multiplicity and  the degree of its iterates grow exponentially. LÄS MER