131 |
On some Density Theorems in Number Theory and Group TheoryBardestani, Mohammad 08 1900 (has links)
Gowers, dans son article sur les matrices quasi-aléatoires, étudie la question, posée par Babai et Sos, de l'existence d'une constante $c>0$ telle que tout groupe fini possède un sous-ensemble sans produit de taille supérieure ou égale a $c|G|$. En prouvant que, pour tout nombre premier $p$ assez grand, le groupe $PSL_2(\mathbb{F}_p)$ (d'ordre noté $n$) ne posséde aucun sous-ensemble sans produit de taille $c n^{8/9}$, il y répond par la négative.
Nous allons considérer le probléme dans le cas des groupes compacts finis, et plus particuliérement des groupes profinis $SL_k(\mathbb{Z}_p)$ et $Sp_{2k}(\mathbb{Z}_p)$. La premiére partie de cette thése est dédiée à l'obtention de bornes inférieures et supérieures exponentielles pour la mesure suprémale des ensembles sans produit. La preuve nécessite d'établir préalablement une borne inférieure sur la dimension des représentations non-triviales des groupes finis $SL_k(\mathbb{Z}/(p^n\mathbb{Z}))$ et $Sp_{2k}(\mathbb{Z}/(p^n\mathbb{Z}))$. Notre théoréme prolonge le travail de Landazuri et Seitz, qui considérent le degré minimal des représentations pour les groupes de Chevalley sur les corps finis, tout en offrant une preuve plus simple que la leur.
La seconde partie de la thése à trait à la théorie algébrique des nombres. Un polynome monogéne $f$ est un polynome unitaire irréductible à coefficients entiers qui endengre un corps de nombres monogéne. Pour un nombre premier $q$ donné, nous allons montrer, en utilisant le théoréme de densité de Tchebotariov, que la densité des nombres premiers $p$ tels que $t^q -p$ soit monogéne est supérieure ou égale à $(q-1)/q$. Nous allons également démontrer que, quand $q=3$, la densité des nombres premiers $p$ tels que $\mathbb{Q}(\sqrt[3]{p})$ soit non monogéne est supérieure ou égale à $1/9$. / Gowers in his paper on quasirandom groups studies a question of Babai and Sos asking whether there exists a constant $c > 0$ such that every finite group $G$ has a product-free subset of size at least $c|G|$.
Answering the question negatively, he proves that for sufficiently large prime $p$, the group $\mathrm{PSL}_2(\mathbb{F}_p)$ has no product-free subset of size $\geq cn^{8/9}$, where $n$ is the order of $\mathrm{PSL}_2(\mathbb{F}_p)$.
We will consider the problem for compact groups and in particular for the profinite groups $\SL_k(\mathh{Z}_p)$ and $\Sp_{2k}(\mathbb{Z}_p)$.
In Part I of this thesis, we obtain lower and upper exponential bounds for the supremal measure of the product-free sets. The proof involves establishing a lower bound for the dimension of non-trivial representations of the finite groups $\SL_k(\mathbb{Z}/(p^n\mathbb{Z}))$ and $\Sp_{2k}(\mathbb{Z}/(p^n\mathbb{Z}))$. Indeed, our theorem extends and simplifies previous work of Landazuri and Seitz, where they consider the minimal degree of representations for Chevalley groups over a finite field.
In Part II of this thesis, we move to algebraic number theory. A monogenic polynomial $f$ is a monic irreducible polynomial with integer coefficients which produces a monogenic number field. For a given prime $q$, using the Chebotarev density theorem, we will show the density of primes $p$, such that $t^q-p$ is monogenic, is greater than or equal to $(q-1)/q$. We will also prove that, when $q=3$, the density of primes $p$, which $\mathbb{Q}(\sqrt[3]{p})$ is non-monogenic, is at least $1/9$.
|
132 |
Understanding Spatio-Temporal Variability and Associated Physical Controls of Near-Surface Soil Moisture in Different Hydro-ClimatesJoshi, Champa 03 October 2013 (has links)
Near-surface soil moisture is a key state variable of the hydrologic cycle and plays a significant role in the global water and energy balance by affecting several hydrological, ecological, meteorological, geomorphologic, and other natural processes in the land-atmosphere continuum. Presence of soil moisture in the root zone is vital for the crop and plant life cycle. Soil moisture distribution is highly non-linear across time and space. Various geophysical factors (e.g., soil properties, topography, vegetation, and weather/climate) and their interactions control the spatio-temporal evolution of soil moisture at various scales. Understanding these interactions is crucial for the characterization of soil moisture dynamics occurring in the vadose zone.
This dissertation focuses on understanding the spatio-temporal variability of near-surface soil moisture and the associated physical control(s) across varying measurement support (point-scale and passive microwave airborne/satellite remote sensing footprint-scale), spatial extents (field-, watershed-, and regional-scale), and changing hydro-climates. Various analysis techniques (e.g., time stability, geostatistics, Empirical Orthogonal Function, and Singular Value Decomposition) have been employed to characterize near-surface soil moisture variability and the role of contributing physical control(s) across space and time. Findings of this study can be helpful in several hydrological research/applications, such as, validation/calibration and downscaling of remote sensing data products, planning and designing effective soil moisture monitoring networks and field campaigns, improving performance of soil moisture retrieval algorithm, flood/drought prediction, climate forecast modeling, and agricultural management practices.
|
133 |
Εύρεση γεωμετρικών χαρακτηριστικών ερυθρών αιμοσφαιρίων από εικόνες σκεδασμένου φωτόςΤρικοίλης, Ιωάννης 20 September 2010 (has links)
Στην παρούσα διπλωματική εργασία θα γίνει μελέτη και εφαρμογή μεθόδων επίλυσης του προβλήματος αναγνώρισης γεωμετρικών χαρακτηριστικών ανθρώπινων ερυθρών αιμοσφαιρίων από προσομοιωμένες εικόνες σκέδασης ΗΜ ακτινοβολίας ενός He-Ne laser 632.8 μm. Στο πρώτο κεφάλαιο γίνεται μια εισαγωγή στις ιδιότητες και τα χαρακτηριστικά του ερυθροκυττάρου καθώς, επίσης, παρουσιάζονται διάφορες ανωμαλίες των ερυθροκυττάρων και οι μέχρι στιγμής χρησιμοποιούμενοι τρόποι ανίχνευσής των. Στο δεύτερο κεφάλαιο της εργασίας γίνεται μια εισαγωγή στις ιδιότητες της ΗΜ ακτινοβολίας, περιγράφεται το φαινόμενο της σκέδασης και παρουσιάζεται το ευθύ πρόβλημα σκέδασης ΗΜ ακτινοβολίας ανθρώπινων ερυθροκυττάρων. Το τρίτο κεφάλαιο αποτελείται από δύο μέρη. Στο πρώτο μέρος γίνεται εκτενής ανάλυση της θεωρίας των τεχνητών νευρωνικών δικτύων και περιγράφονται τα νευρωνικά δίκτυα ακτινικών συναρτήσεων RBF. Στη συνέχεια, αναφέρονται οι μέθοδοι εξαγωγής παραμέτρων και, πιο συγκεκριμένα, δίνεται το θεωρητικό και μαθηματικό υπόβαθρο των μεθόδων που χρησιμοποιήθηκαν οι οποίες είναι ο αλογόριθμος Singular Value Decomposition (SVD), o Angular Radial μετασχηματισμός (ART) και φίλτρα Gabor. Στο δεύτερο μέρος περιγράφεται η επίλυση του αντίστροφου προβλήματος σκέδασης. Παρουσιάζεται η μεθοδολογία της διαδικασίας επίλυσης όπου εφαρμόστηκαν ο αλογόριθμος συμπίεσης εικόνας SVD, o περιγραφέας σχήματος ART και ο περιγραφέας υφής με φίλτρα Gabor για την εύρεση των γεωμετρικών χαρακτηριστικών και νευρωνικό δίκτυο ακτινικών συναρτήσεων RBF για την ταξινόμηση των ερυθροκυττάρων. Στο τέταρτο και τελευταίο κεφάλαιο γίνεται δοκιμή και αξιολόγηση της μεθόδου και συνοψίζονται τα αποτελέσματα και τα συμπεράσματα που εξήχθησαν κατά τη διάρκεια της εκπόνησης αυτής της διπλωματικής. / In this thesis we study and implement methods of estimating the geometrical features of the human red blood cell from a set of simulated light scattering images produced by a He-Ne laser beam at 632.8 μm. Ιn first chapter an introduction to the properties and the characteristics of red blood cells are presented. Furthermore, we describe various abnormalities of erythrocytes and the until now used ways of detection. In second chapter the properties of electromagnetic radiation and the light scattering problem of EM radiation from human erythrocytes are presented. The third chapter consists of two parts. In first part we analyse the theory of neural networks and we describe the radial basis function neural network. Then, we describe the theoritical and mathematical background of the methods that we use for feature extraction which are Singular Value Decomposition (SVD), Angular Radial Transform and Gabor filters. In second part the solution of the inverse problem of light scattering is described. We present the methodology of the solution process in which we implement a Singular Value Decomposition approach, a shape descriptor with Angular Radial Transform and a homogenous texture descriptor which uses Gabor filters for the estimation of the geometrical characteristics and a RBF neural network for the classification of the erythrocytes. In the forth and last chapter the described methods are evaluated and we summarise the experimental results and conclusions that were extracted from this thesis.
|
134 |
Algebraic and multilinear-algebraic techniques for fast matrix multiplicationGouaya, Guy Mathias January 2015 (has links)
This dissertation reviews the theory of fast matrix multiplication from a multilinear-algebraic point of view, as
well as recent fast matrix multiplication algorithms based on discrete Fourier transforms over nite groups.
To this end, the algebraic approach is described in terms of group algebras over groups satisfying the triple
product Property, and the construction of such groups via uniquely solvable puzzles.
The higher order singular value decomposition is an important decomposition of tensors that retains some of
the properties of the singular value decomposition of matrices. However, we have proven a novel negative result
which demonstrates that the higher order singular value decomposition yields a matrix multiplication algorithm
that is no better than the standard algorithm. / Mathematical Sciences / M. Sc. (Applied Mathematics)
|
135 |
Méthodes numériques pour les problèmes des moindres carrés, avec application à l'assimilation de données / Numerical methods for least squares problems with application to data assimilationBergou, El Houcine 11 December 2014 (has links)
L'algorithme de Levenberg-Marquardt (LM) est parmi les algorithmes les plus populaires pour la résolution des problèmes des moindres carrés non linéaire. Motivés par la structure des problèmes de l'assimilation de données, nous considérons dans cette thèse l'extension de l'algorithme LM aux situations dans lesquelles le sous problème linéarisé, qui a la forme min||Ax - b ||^2, est résolu de façon approximative, et/ou les données sont bruitées et ne sont précises qu'avec une certaine probabilité. Sous des hypothèses appropriées, on montre que le nouvel algorithme converge presque sûrement vers un point stationnaire du premier ordre. Notre approche est appliquée à une instance dans l'assimilation de données variationnelles où les modèles stochastiques du gradient sont calculés par le lisseur de Kalman d'ensemble (EnKS). On montre la convergence dans L^p de l'EnKS vers le lisseur de Kalman, quand la taille de l'ensemble tend vers l'infini. On montre aussi la convergence de l'approche LM-EnKS, qui est une variante de l'algorithme de LM avec l'EnKS utilisé comme solveur linéaire, vers l'algorithme classique de LM ou le sous problème est résolu de façon exacte. La sensibilité de la méthode de décomposition en valeurs singulières tronquée est étudiée. Nous formulons une expression explicite pour le conditionnement de la solution des moindres carrés tronqués. Cette expression est donnée en termes de valeurs singulières de A et les coefficients de Fourier de b. / The Levenberg-Marquardt algorithm (LM) is one of the most popular algorithms for the solution of nonlinear least squares problems. Motivated by the problem structure in data assimilation, we consider in this thesis the extension of the LM algorithm to the scenarios where the linearized least squares subproblems, of the form min||Ax - b ||^2, are solved inexactly and/or the gradient model is noisy and accurate only within a certain probability. Under appropriate assumptions, we show that the modified algorithm converges globally and almost surely to a first order stationary point. Our approach is applied to an instance in variational data assimilation where stochastic models of the gradient are computed by the so-called ensemble Kalman smoother (EnKS). A convergence proof in L^p of EnKS in the limit for large ensembles to the Kalman smoother is given. We also show the convergence of LM-EnKS approach, which is a variant of the LM algorithm with EnKS as a linear solver, to the classical LM algorithm where the linearized subproblem is solved exactly. The sensitivity of the trucated sigular value decomposition method to solve the linearized subprobems is studied. We formulate an explicit expression for the condition number of the truncated least squares solution. This expression is given in terms of the singular values of A and the Fourier coefficients of b.
|
136 |
Decomposição aleatória de matrizes aplicada ao reconhecimento de faces / Stochastic decomposition of matrices applied to face recognitionMauro de Amorim 22 March 2013 (has links)
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / Métodos estocásticos oferecem uma poderosa ferramenta para a execução da compressão
de dados e decomposições de matrizes. O método estocástico para decomposição de matrizes
estudado utiliza amostragem aleatória para identificar um subespaço que captura a imagem de
uma matriz de forma aproximada, preservando uma parte de sua informação essencial. Estas
aproximações compactam a informação possibilitando a resolução de problemas práticos
de maneira eficiente. Nesta dissertação é calculada uma decomposição em valores singulares
(SVD) utilizando técnicas estocásticas. Esta SVD aleatória é empregada na tarefa de reconhecimento
de faces. O reconhecimento de faces funciona de forma a projetar imagens de faces sobre
um espaço de características que melhor descreve a variação de imagens de faces conhecidas.
Estas características significantes são conhecidas como autofaces, pois são os autovetores de
uma matriz associada a um conjunto de faces. Essa projeção caracteriza aproximadamente a
face de um indivíduo por uma soma ponderada das autofaces características. Assim, a tarefa
de reconhecimento de uma nova face consiste em comparar os pesos de sua projeção com os
pesos da projeção de indivíduos conhecidos. A análise de componentes principais (PCA) é um
método muito utilizado para determinar as autofaces características, este fornece as autofaces
que representam maior variabilidade de informação de um conjunto de faces. Nesta dissertação
verificamos a qualidade das autofaces obtidas pela SVD aleatória (que são os vetores singulares
à esquerda de uma matriz contendo as imagens) por comparação de similaridade com as autofaces
obtidas pela PCA. Para tanto, foram utilizados dois bancos de imagens, com tamanhos
diferentes, e aplicadas diversas amostragens aleatórias sobre a matriz contendo as imagens. / Stochastic methods offer a powerful tool for performing data compression and decomposition
of matrices. These methods use random sampling to identify a subspace that captures the
range of a matrix in an approximate way, preserving a part of its essential information. These
approaches compress the information enabling the resolution of practical problems efficiently.
This work computes a singular value decomposition (SVD) of a matrix using stochastic techniques.
This random SVD is employed in the task of face recognition. The face recognition is
based on the projection of images of faces on a feature space that best describes the variation of
known image faces. These features are known as eigenfaces because they are the eigenvectors
of a matrix constructed from a set of faces. This projection characterizes an individual face by a
weighted sum of eigenfaces. The task of recognizing a new face is to compare the weights of its
projection with the projection of the weights of known individuals. The principal components
analysis (PCA) is a widely used method for determining the eigenfaces. This provides the greatest
variability eigenfaces representing information from a set of faces. In this dissertation we
discuss the quality of eigenfaces obtained by a random SVD (which are the left singular vectors
of a matrix containing the images) by comparing the similarity with eigenfaces obtained
by PCA. We use two databases of images, with different sizes and various random sampling
applied on the matrix containing the images.
|
137 |
Decomposição aleatória de matrizes aplicada ao reconhecimento de faces / Stochastic decomposition of matrices applied to face recognitionMauro de Amorim 22 March 2013 (has links)
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / Métodos estocásticos oferecem uma poderosa ferramenta para a execução da compressão
de dados e decomposições de matrizes. O método estocástico para decomposição de matrizes
estudado utiliza amostragem aleatória para identificar um subespaço que captura a imagem de
uma matriz de forma aproximada, preservando uma parte de sua informação essencial. Estas
aproximações compactam a informação possibilitando a resolução de problemas práticos
de maneira eficiente. Nesta dissertação é calculada uma decomposição em valores singulares
(SVD) utilizando técnicas estocásticas. Esta SVD aleatória é empregada na tarefa de reconhecimento
de faces. O reconhecimento de faces funciona de forma a projetar imagens de faces sobre
um espaço de características que melhor descreve a variação de imagens de faces conhecidas.
Estas características significantes são conhecidas como autofaces, pois são os autovetores de
uma matriz associada a um conjunto de faces. Essa projeção caracteriza aproximadamente a
face de um indivíduo por uma soma ponderada das autofaces características. Assim, a tarefa
de reconhecimento de uma nova face consiste em comparar os pesos de sua projeção com os
pesos da projeção de indivíduos conhecidos. A análise de componentes principais (PCA) é um
método muito utilizado para determinar as autofaces características, este fornece as autofaces
que representam maior variabilidade de informação de um conjunto de faces. Nesta dissertação
verificamos a qualidade das autofaces obtidas pela SVD aleatória (que são os vetores singulares
à esquerda de uma matriz contendo as imagens) por comparação de similaridade com as autofaces
obtidas pela PCA. Para tanto, foram utilizados dois bancos de imagens, com tamanhos
diferentes, e aplicadas diversas amostragens aleatórias sobre a matriz contendo as imagens. / Stochastic methods offer a powerful tool for performing data compression and decomposition
of matrices. These methods use random sampling to identify a subspace that captures the
range of a matrix in an approximate way, preserving a part of its essential information. These
approaches compress the information enabling the resolution of practical problems efficiently.
This work computes a singular value decomposition (SVD) of a matrix using stochastic techniques.
This random SVD is employed in the task of face recognition. The face recognition is
based on the projection of images of faces on a feature space that best describes the variation of
known image faces. These features are known as eigenfaces because they are the eigenvectors
of a matrix constructed from a set of faces. This projection characterizes an individual face by a
weighted sum of eigenfaces. The task of recognizing a new face is to compare the weights of its
projection with the projection of the weights of known individuals. The principal components
analysis (PCA) is a widely used method for determining the eigenfaces. This provides the greatest
variability eigenfaces representing information from a set of faces. In this dissertation we
discuss the quality of eigenfaces obtained by a random SVD (which are the left singular vectors
of a matrix containing the images) by comparing the similarity with eigenfaces obtained
by PCA. We use two databases of images, with different sizes and various random sampling
applied on the matrix containing the images.
|
138 |
Image Structures For Steganalysis And EncryptionSuresh, V 04 1900 (has links) (PDF)
In this work we study two aspects of image security: improper usage and illegal access of images. In the first part we present our results on steganalysis – protection against improper usage of images. In the second part we present our results on image encryption – protection against illegal access of images.
Steganography is the collective name for methodologies that allow the creation of invisible –hence secret– channels for information transfer. Steganalysis, the counter to steganography, is a collection of approaches that attempt to detect and quantify the presence of hidden messages in cover media.
First we present our studies on stego-images using features developed for data stream classification towards making some qualitative assessments about the effect of steganography on the lower order bit planes(LSB) of images. These features are effective in classifying different data streams. Using these features, we study the randomness properties of image and stego-image LSB streams and observe that data stream analysis techniques are inadequate for steganalysis purposes. This provides motivation to arrive at steganalytic techniques that go beyond the LSB properties. We then present our steganalytic approach which takes into account such properties.
In one such approach, we perform steganalysis from the point of view of quantifying the effect of perturbations caused by mild image processing operations–zoom-in/out, rotation, distortions–on stego-images. We show that this approach works both in detecting and estimating the presence of stego-contents for a particularly difficult steganographic technique known as LSB matching steganography.
Next, we present our results on our image encryption techniques. Encryption approaches which are used in the context of text data are usually unsuited for the purposes of encrypting images(and multimedia objects) in general. The reasons are: unlike text, the volume to be encrypted could be huge for images and leads to increased computational requirements; encryption used for text renders images incompressible thereby resulting in poor use of bandwidth. These issues are overcome by designing image encryption approaches that obfuscate the image by intelligently re-ordering the pixels or encrypt only parts of a given image in attempts to render them imperceptible. The obfuscated image or the partially encrypted image is still amenable to compression. Efficient image encryption schemes ensure that the obfuscation is not compromised by the inherent correlations present in the image. Also they ensure that the unencrypted portions of the image do not provide information about the encrypted parts. In this work we present two approaches for efficient image encryption.
First, we utilize the correlation preserving properties of the Hilbert space-filling-curves to reorder images in such a way that the image is obfuscated perceptually. This process does not compromise on the compressibility of the output image. We show experimentally that our approach leads to both perceptual security and perceptual encryption. We then show that the space-filling curve based approach also leads to more efficient partial encryption of images wherein only the salient parts of the image are encrypted thereby reducing the encryption load.
In our second approach, we show that Singular Value Decomposition(SVD) of images is useful from the point of image encryption by way of mismatching the unitary matrices resulting from the decomposition of images. It is seen that the images that result due to the mismatching operations are perceptually secure.
|
139 |
Comparison of the 1st and 2nd order Lee–Carter methods with the robust Hyndman–Ullah method for fitting and forecasting mortality ratesWillersjö Nyfelt, Emil January 2020 (has links)
The 1st and 2nd order Lee–Carter methods were compared with the Hyndman–Ullah method in regards to goodness of fit and forecasting ability of mortality rates. Swedish population data was used from the Human Mortality Database. The robust estimation property of the Hyndman–Ullah method was also tested with inclusion of the Spanish flu and a hypothetical scenario of the COVID-19 pandemic. After having presented the three methods and making several comparisons between the methods, it is concluded that the Hyndman–Ullah method is overall superior among the three methods with the implementation of the chosen dataset. Its robust estimation of mortality shocks could also be confirmed.
|
140 |
Décomposition de petit rang, problèmes de complétion et applications : décomposition de matrices de Hankel et des tenseurs de rang faible / Low rank decomposition, completion problems and applications : low rank decomposition of Hankel matrices and tensorsHarmouch, Jouhayna 19 December 2018 (has links)
On étudie la décomposition de matrice de Hankel comme une somme des matrices de Hankel de rang faible en corrélation avec la décomposition de son symbole σ comme une somme des séries exponentielles polynomiales. On présente un nouvel algorithme qui calcule la décomposition d’un opérateur de Hankel de petit rang et sa décomposition de son symbole en exploitant les propriétés de l’algèbre quotient de Gorenstein . La base de est calculée à partir la décomposition en valeurs singuliers d’une sous-matrice de matrice de Hankel . Les fréquences et les poids se déduisent des vecteurs propres généralisés des sous matrices de Hankel déplacés de . On présente une formule pour calculer les poids en fonction des vecteurs propres généralisés au lieu de résoudre un système de Vandermonde. Cette nouvelle méthode est une généralisation de Pencil méthode déjà utilisée pour résoudre un problème de décomposition de type de Prony. On analyse son comportement numérique en présence des moments contaminés et on décrit une technique de redimensionnement qui améliore la qualité numérique des fréquences d’une grande amplitude. On présente une nouvelle technique de Newton qui converge localement vers la matrice de Hankel de rang faible la plus proche au matrice initiale et on montre son effet à corriger les erreurs sur les moments. On étudie la décomposition d’un tenseur multi-symétrique T comme une somme des puissances de produit des formes linéaires en corrélation avec la décomposition de son dual comme une somme pondérée des évaluations. On utilise les propriétés de l’algèbre de Gorenstein associée pour calculer la décomposition de son dual qui est définie à partir d’une série formelle τ. On utilise la décomposition d’un opérateur de Hankel de rang faible associé au symbole τ comme une somme des opérateurs indécomposables de rang faible. La base d’ est choisie de façon que la multiplication par certains variables soit possible. On calcule les coordonnées des points et leurs poids correspondants à partir la structure propre des matrices de multiplication. Ce nouvel algorithme qu’on propose marche bien pour les matrices de Hankel de rang faible. On propose une approche théorique de la méthode dans un espace de dimension n. On donne un exemple numérique de la décomposition d’un tenseur multilinéaire de rang 3 en dimension 3 et un autre exemple de la décomposition d’un tenseur multi-symétrique de rang 3 en dimension 3. On étudie le problème de complétion de matrice de Hankel comme un problème de minimisation. On utilise la relaxation du problème basé sur la minimisation de la norme nucléaire de la matrice de Hankel. On adapte le SVT algorithme pour le cas d’une matrice de Hankel et on calcule l’opérateur linéaire qui décrit les contraintes du problème de minimisation de norme nucléaire. On montre l’utilité du problème de décomposition à dissocier un modèle statistique ou biologique. / We study the decomposition of a multivariate Hankel matrix as a sum of Hankel matrices of small rank in correlation with the decomposition of its symbol σ as a sum of polynomialexponential series. We present a new algorithm to compute the low rank decomposition of the Hankel operator and the decomposition of its symbol exploiting the properties of the associated Artinian Gorenstein quotient algebra . A basis of is computed from the Singular Value Decomposition of a sub-matrix of the Hankel matrix . The frequencies and the weights are deduced from the generalized eigenvectors of pencils of shifted sub-matrices of Explicit formula for the weights in terms of the eigenvectors avoid us to solve a Vandermonde system. This new method is a multivariate generalization of the so-called Pencil method for solving Pronytype decomposition problems. We analyse its numerical behaviour in the presence of noisy input moments, and describe a rescaling technique which improves the numerical quality of the reconstruction for frequencies of high amplitudes. We also present a new Newton iteration, which converges locally to the closest multivariate Hankel matrix of low rank and show its impact for correcting errors on input moments. We study the decomposition of a multi-symmetric tensor T as a sum of powers of product of linear forms in correlation with the decomposition of its dual as a weighted sum of evaluations. We use the properties of the associated Artinian Gorenstein Algebra to compute the decomposition of its dual which is defined via a formal power series τ. We use the low rank decomposition of the Hankel operator associated to the symbol τ into a sum of indecomposable operators of low rank. A basis of is chosen such that the multiplication by some variables is possible. We compute the sub-coordinates of the evaluation points and their weights using the eigen-structure of multiplication matrices. The new algorithm that we propose works for small rank. We give a theoretical generalized approach of the method in n dimensional space. We show a numerical example of the decomposition of a multi-linear tensor of rank 3 in 3 dimensional space. We show a numerical example of the decomposition of a multi-symmetric tensor of rank 3 in 3 dimensional space. We study the completion problem of the low rank Hankel matrix as a minimization problem. We use the relaxation of it as a minimization problem of the nuclear norm of Hankel matrix. We adapt the SVT algorithm to the case of Hankel matrix and we compute the linear operator which describes the constraints of the problem and its adjoint. We try to show the utility of the decomposition algorithm in some applications such that the LDA model and the ODF model.
|
Page generated in 0.0515 seconds