• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 34
  • 13
  • 6
  • 4
  • 3
  • 1
  • 1
  • 1
  • Tagged with
  • 63
  • 14
  • 12
  • 10
  • 9
  • 9
  • 8
  • 8
  • 8
  • 7
  • 7
  • 6
  • 6
  • 5
  • 5
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
31

3M relationship pattern for detection and estimation of unknown frequencies for unknown number of sinusoids based on Eigenspace Analysis of Hankel Matrix

Ahmed, A., Hu, Yim Fun January 2013 (has links)
No / Abstract: We develop a novel approach to estimate the n unknown constituent frequencies of a sinusoidal signal that comprises of unknown number, n, of sinusoids of unknown phases and unknown amplitudes. The approach has been applied to multiple sinusoidal signals in the presence of white Gaussian noise with varying signal to noise ratio (SNR). The approach is based on eigenspace analysis of Hankel matrix formed with the samples from averaged frequency spectrum of the signal obtained through multiple measurements. The eigenspace analysis is based on the newly developed 3M relationship which reflects and exploits the relationship between the consecutive sets of Maximum, Middle and Minimum eigenvalues of square symmetric matrix of the Hankel matrix. The 3M relationship exhibits a pattern in line with the order of the Hankel matrix and leads to parametric estimation of the constituent sinusoids. This paper also presents the relationship equation between the size of 3M relationship pattern and the dimensions of the Hankel matrix. The performance of the developed approach has been tested to correctly estimate multiple constituent frequencies within a noisy signal.
32

Etude d'une équation non linéaire, non dispersive et complètement integrable et de ses perturbations / Study of a nonlinear, non-dispersive, completely integrable equation and its perturbations

Pocovnicu, Oana 29 September 2011 (has links)
On étudie dans cette thèse l'équation de Szegö sur la droite réelle ainsi que ses perturbations. Cette équation a été introduite il y a quelques années par Gérard et Grellier comme modèle mathématique d'une équation non linéaire totalement non dispersive.L'équation de Szegöapparait naturellement dans l'étude de l'équation de Schrödinger non linéaire (NLS) danscertaines situations sur-critiques où l'on constate un manque de dispersion, par exemplelorsque l'on considère NLS sur le groupe de Heisenberg. Par conséquent, une des motivationsde cette thèse est d'établir des résultats concernant l'équation de Szegö qui pourrontéventuellement être utilisés dans le contexte de l'équation de Schrödinger non linéaire.Le premier résultat de cette thèse est la classification des solitons de l'équation de Szegö.On montre que ce sont tous des fonctions rationnelles ayant un unique pôle qui est simple.De plus, on prouve que les solitons sont orbitalement stables.La propriété la plus remarquable de l'équation de Szegö est le fait qu'elle est complètement intégrable, ce qui permet notamment d'établir une formule explicite de sa solution.Comme applications de cette formule, on obtient les trois résultats suivants. (A) On montreque les solutions fonctions rationnelles génériques se décomposent en une somme de solitonset d'un reste qui est petit lorsque le temps tend vers l'infini. (B) On met en évidence unexemple de solution non générique dont les grandes normes de Sobolev tendent vers l'infiniavec le temps. (C) On détermine des coordonnées action-angle généralisées lorsque l'on restreintl'équation de Szegö à une sous-variété de dimension finie. En particulier, on en déduitqu'une grande partie des trajectoires de cette équation sont des spirales autour de cylindrestoroïdaux.Comme l'équation de Szegö est complètement intégrable, il est ensuite naturel d'étudierses perturbations et d'établir de nouvelles propriétés pour celles-ci à partir des résultatsconnus pour l'équation de Szegö. Une des perturbations de l'équation de Szegö est une équation desondes non linéaire (NLW) de donnée bien préparée.On prouve que si la donnée initiale de NLW est petite et à support dans l'ensemble desfréquences positives, la solution de NLW est alors approximée pour un temps long par lasolution de l'équation de Szegö. Autrement dit, on démontre ainsi que l'équation de Szegöest la première approximation de NLW. On construit ensuite une solution de NLW dont lesgrandes normes de Sobolev augmentent (relativement à la norme de la donnée initiale).Sur le tore T, Gérard et Grellier ont démontré un résultat analogue d'approximation deNLW. On améliore ce résultat en trouvant une approximation plus fine, de deuxième ordre.Dans une dernière partie, on s'intéresse à l'équation de Szegö perturbée par un potentielmultiplicatif petit. On étudie l'interaction de ce potentiel avec les solitons. Plus précisément,on montre que, si la donnée initiale est celle d'un soliton pour l'équation non perturbée, lasolution de l'équation perturbée garde la forme d'un soliton sur un long temps. De plus, ondéduit la dynamique effective, i.e. les équations différentielles satisfaites par les paramètresdu soliton. / In this Ph.D. thesis, we study the Szegö equation on the real lineas well as its perturbations.It was recently introduced by Gérard and Grellier as a toy model of a non-lineartotally non dispersive equation. The Szegö equation appears naturally in the study of thenon-linear Schrödinger equation (NLS) in super-critical situations where dispersion lacks,for example, when one considers NLS on the Heisenberg group. Consequently, one of themotivations of this Ph.D. thesis is fi nding new results for the Szegö equation in hope thatthey could be eventually used in the context of the non-linear Schrödinger equation.Our first result is a classification of the solitons of the Szegö equation. We show thatthey are all rational functions with one simple pole. In addition, we prove the orbitalstability of solitons.The Szegö equation has the remarkable property of being completely integrable. Thisallows us to find an explicit formula for solutions. We obtain three applications of thisformula. (A) We prove soliton resolution for solutions which are generic rational functions.(B) We construct an example of non-generic solution whose high Sobolev norms grow toinfinity over time. (C) We find generalized action-angle variables when restricting the Szegöequation to a finite dimensional sub-manifold. In particular, this yields that most of thetrajectories of the Szegö equation are spirals around toroidal cylinders.Since the Szegö equation is completely integrable, it is natural to study its perturbationsand deduce new properties of such perturbations from the known results for the Szegöequation. One perturbation of the Szegö equation is a non-linear wave equation(NLW) with small initial data.We prove that the Szegö equation is the first order approximation of NLW. More precisely,if an initial condition of NLW is small and supported only on non-negative frequencies, thenthe corresponding solution can be approximated by the solution of the Szegö equation, fora long time. We then construct a solution of NLW whose high Sobolev norms grow.On the torus T, Gérard and Grellier proved an analogous first order approximationresult for NLW. By considerning the second order approximation, we obtain an improvedresult with a smaller error.Lastly, we consider the Szegö equation perturbed by a small multiplicative potential.We study the interaction of this potential with solitons. More precisely, we show that, if theinitial condition is that of a soliton for the unperturbed Szegö equation, then the solutionpreserves the shape of a soliton for a long time. In addition, we prescribe the effectivedynamics, i.e. we derive the differential equations satisfied by the parameters of the soliton.
33

Degenerations of classical square matrices and their determinantal structure

Medeiros, Rainelly Cunha de 10 March 2017 (has links)
Submitted by ANA KARLA PEREIRA RODRIGUES (anakarla_@hotmail.com) on 2017-08-25T13:37:53Z No. of bitstreams: 1 arquivototal.pdf: 1699241 bytes, checksum: 2f092c650c435ae41ec42c261fd9c3af (MD5) / Made available in DSpace on 2017-08-25T13:37:53Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 1699241 bytes, checksum: 2f092c650c435ae41ec42c261fd9c3af (MD5) Previous issue date: 2017-03-10 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / In thisthesis,westudycertaindegenerations/specializationsofthegenericsquare matrix overa eld k of characteristiczeroalongitsmainrelatedstructures,suchthe determinantofthematrix,theidealgeneratedbyitspartialderivatives,thepolarmap de ned bythesederivatives,theHessianmatrixandtheidealofsubmaximalminorsof the matrix.Thedegenerationtypesofthegenericsquarematrixconsideredhereare: (1) degenerationby\cloning"(repeating)avariable;(2)replacingasubsetofentriesby zeros, inastrategiclayout;(3)furtherdegenerationsoftheabovetypesstartingfrom certain specializationsofthegenericsquarematrix,suchasthegenericsymmetric matrix andthegenericsquareHankelmatrix.Thefocusinallthesedegenerations is intheinvariantsdescribedabove,highlightingonthehomaloidalbehaviorofthe determinantofthematrix.Forthis,weemploytoolscomingfromcommutativealgebra, with emphasisonidealtheoryandsyzygytheory. / Nesta tese,estudamoscertasdegenera c~oes/especializa c~oesdamatrizquadradagen erica sobre umcorpo k de caracter sticazero,aolongodesuasprincipaisestruturasrela- cionadas, taiscomoodeterminantedamatriz,oidealgeradoporsuasderivadasparci- ais, omapapolarde nidoporessasderivadas,amatrizHessianaeoidealdosmenores subm aximosdamatriz.Ostiposdedegenera c~aodamatrizquadradagen ericacon- siderados aquis~ao:(1)degenera c~aopor\clonagem"(repeti c~ao)deumavari avel;(2) substitui c~aodeumsubconjuntodeentradasporzeros,emumadisposi c~aoestrat egica; (3) outrasdegenera c~oesdostiposacimapartindodecertasespecializa c~oesdamatriz quadrada gen erica,taiscomoamatrizgen ericasim etricaeamatrizquadradagen erica de Hankel.Ofocoemtodasessasdegenera c~oes enosinvariantesdescritosacima, com destaqueparaocomportamentohomaloidaldodeterminantedamatriz.Paratal, empregamos ferramentasprovenientesda algebracomutativa,com^enfasenateoriade ideais enateoriadesiz gias.
34

Computation of invariant pairs and matrix solvents / Calcul de paires invariantes et solvants matriciels

Segura ugalde, Esteban 01 July 2015 (has links)
Cette thèse porte sur certains aspects symboliques-numériques du problème des paires invariantes pour les polynômes de matrices. Les paires invariantes généralisent la définition de valeur propre / vecteur propre et correspondent à la notion de sous-espaces invariants pour le cas nonlinéaire. Elles trouvent leurs applications dans le calcul numérique de plusieurs valeurs propres d’un polynôme de matrices; elles présentent aussi un intérêt dans le contexte des systèmes différentiels. En utilisant une approche basée sur les intégrales de contour, nous déterminons des expressions du nombre de conditionnement et de l’erreur rétrograde pour le problème du calcul des paires invariantes. Ensuite, nous adaptons la méthode des moments de Sakurai-Sugiura au calcul des paires invariantes et nous étudions le comportement de la version scalaire et par blocs de la méthode en présence de valeurs propres multiples. Le résultats obtenus à l’aide des approches directes peuvent éventuellement être améliorés numériquement grâce à une méthode itérative: nous proposons ici une comparaison de deux variantes de la méthode de Newton appliquée aux paires invariantes. Le problème des solvants de matrices est très proche de celui des paires invariants. Le résultats présentés ci-dessus sont donc appliqués au cas des solvants pour obtenir des expressions du nombre de conditionnement et de l’erreur, et un algorithme de calcul basé sur la méthode des moments. De plus, nous étudions le lien entre le problème des solvants et la transformation des polynômes de matrices en forme triangulaire. / In this thesis, we study some symbolic-numeric aspects of the invariant pair problem for matrix polynomials. Invariant pairs extend the notion of eigenvalue-eigenvector pairs, providing a counterpart of invariant subspaces for the nonlinear case. They have applications in the numeric computation of several eigenvalues of a matrix polynomial; they also present an interest in the context of differential systems. Here, a contour integral formulation is applied to compute condition numbers and backward errors for invariant pairs. We then adapt the Sakurai-Sugiura moment method to the computation of invariant pairs, including some classes of problems that have multiple eigenvalues, and we analyze the behavior of the scalar and block versions of the method in presence of different multiplicity patterns. Results obtained via direct approaches may need to be refined numerically using an iterative method: here we study and compare two variants of Newton’s method applied to the invariant pair problem. The matrix solvent problem is closely related to invariant pairs. Therefore, we specialize our results on invariant pairs to the case of matrix solvents, thus obtaining formulations for the condition number and backward errors, and a moment-based computational approach. Furthermore, we investigate the relation between the matrix solvent problem and the triangularization of matrix polynomials.
35

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 tensors

Harmouch, 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.
36

Asymptotic Analysis of Structured Determinants via the Riemann-Hilbert Approach

Roozbeh Gharakhloo (6943460) 16 December 2020 (has links)
<div><div>In this work we use and develop Riemann-Hilbert techniques to study the asymptotic behavior of structured determinants. In chapter one we will review the main underlying</div><div>definitions and ideas which will be extensively used throughout the thesis. Chapter two is devoted to the asymptotic analysis of Hankel determinants with Laguerre-type and Jacobi-type potentials with Fisher-Hartwig singularities. In chapter three we will propose a Riemann-Hilbert problem for Toeplitz+Hankel determinants. We will then analyze this Riemann-Hilbert problem for a certain family of Toeplitz and Hankel symbols. In Chapter four we will study the asymptotics of a certain bordered-Toeplitz determinant which is related to the next-to-diagonal correlations of the anisotropic Ising model. The analysis is based upon relating the bordered-Toeplitz determinant to the solution of the Riemann-Hilbert problem associated to pure Toeplitz determinants. Finally in chapter ve we will study the emptiness formation probability in the XXZ-spin 1/2 Heisenberg chain, or equivalently, the asymptotic analysis of the associated Fredholm determinant.</div></div>
37

Non-convex methods for spectrally sparse signal reconstruction via low-rank Hankel matrix completion

Wang, Tianming 01 May 2018 (has links)
Spectrally sparse signals arise in many applications of signal processing. A spectrally sparse signal is a mixture of a few undamped or damped complex sinusoids. An important problem from practice is to reconstruct such a signal from partial time domain samples. Previous convex methods have the drawback that the computation and storage costs do not scale well with respect to the signal length. This common drawback restricts their applicabilities to large and high-dimensional signals. The reconstruction of a spectrally sparse signal from partial samples can be formulated as a low-rank Hankel matrix completion problem. We develop two fast and provable non-convex solvers, FIHT and PGD. FIHT is based on Riemannian optimization while PGD is based on Burer-Monteiro factorization with projected gradient descent. Suppose the underlying spectrally sparse signal is of model order r and length n. We prove that O(r^2log^2(n)) and O(r^2log(n)) random samples are sufficient for FIHT and PGD respectively to achieve exact recovery with overwhelming probability. Every iteration, the computation and storage costs of both methods are linear with respect to signal length n. Therefore they are suitable for handling spectrally sparse signals of large size, which may be prohibited for previous convex methods. Extensive numerical experiments verify their recovery abilities as well as computation efficiency, and also show that the algorithms are robust to noise and mis-specification of the model order. Comparing the two solvers, FIHT is faster for easier problems while PGD has a better recovery ability.
38

Desenvolvimento de antenas de microfita com Patch em anel utilizando materiais ferrimagn?ticos e metamateriais

Vasconcelos, Cristhianne de F?tima Linhares de 19 April 2010 (has links)
Made available in DSpace on 2014-12-17T14:54:56Z (GMT). No. of bitstreams: 1 Tese_Cristhianne.pdf: 1342088 bytes, checksum: 1c3372509a24d25d30a4e89f11cd641e (MD5) Previous issue date: 2010-04-19 / Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior / In general, the materials used as substrates in the project of microstrip antennas are: isotropic, anisotropic dielectrics and ferrimagnetic materials (magnetic anisotropy). The use of ferrimagnetic materials as substrates in microstrip patch antennas has been concentrated on the analysis of antennas with circular and rectangular patches. However, a new class of materials, called metamaterials, has been currently the focus of a great deal of interest. These materials exhibit bianisotropic characteristics, with permittivity and permeability tensors. The main objective of this work is to develop a theoretical and numerical analysis for the radiation characteristics of annular ring microstrip antennas, using ferrites and metamaterials as substrates. The full wave analysis is performed in the Hankel transform domain through the application of the Hertz vector potentials. Considering the definition of the Hertz potentials and imposing the boundary conditions, the dyadic Green s function components are obtained relating the surface current density components at the plane of the patch to the electric field tangential components. Then, Galerkin s method is used to obtain a system of matrix equations, whose solution gives the antenna resonant frequency. From this modeling, it is possible to obtain numerical results for the resonant frequency, radiation pattern, return loss, and antenna bandwidth as a function of the annular ring physical parameters, for different configurations and substrates. The theoretical analysis was developed for annular ring microstrip antennas on a double ferrimagnetic/isotropic dielectric substrate or metamaterial/isotropic dielectric substrate. Also, the analysis for annular ring microstrip antennas on a single ferrimagnetic or metamaterial layer and for suspended antennas can be performed as particular cases / Em geral, os materiais utilizados como substratos no projeto de antenas de microfita s?o: diel?tricos isotr?picos, diel?tricos anisotr?picos e ferrimagn?ticos (anisotr?picos magn?ticos). No entanto, o uso de materiais ferrimagn?ticos em substratos de antenas de microfita do tipo patch tem-se concentrado em an?lises que utilizam geometrias circulares e retangulares. Na ?ltima d?cada, uma nova classe de materiais com caracter?sticas bianisotr?picas, apresentando permissividade e permeabilidade tensoriais, tem surgido e despertado bastante interesse, sendo denominados metamateriais. Portanto, este trabalho apresenta uma an?lise te?rica e num?rica das caracter?sticas ressonantes de uma antena de microfita com patch em anel, utilizando como substratos materiais ferrimagn?ticos e metamateriais. A an?lise utiliza o formalismo de onda completa atrav?s da aplica??o do m?todo dos potenciais vetoriais de Hertz, no dom?nio da transformada de Hankel. A defini??o dos potenciais vetoriais de Hertz e a imposi??o das condi??es de contorno adequadas ? estrutura permitem determinar as fun??es di?dicas de Green, relacionando as componentes da densidade de corrente no patch com as componentes tangenciais do campo el?trico. O m?todo de Galerkin ? ent?o usado para obter a equa??o matricial, cuja solu??o n?o trivial fornece a freq??ncia de resson?ncia da antena. A partir da modelagem, ? poss?vel obter resultados para a freq??ncia de resson?ncia em fun??o de v?rios par?metros da antena de microfita com patch em anel, para diferentes configura??es e substratos, al?m do diagrama de radia??o, perda de retorno e da largura de banda. S?o consideradas estruturas de antenas de microfita com patch em anel sobre m?ltiplas camadas ferrimagn?tica/metamaterial sobre diel?trico isotr?pico. A an?lise num?rica para antenas com uma ?nica camada ferrimagn?tica ou metamaterial e para antenas suspensas s?o obtidas como casos particulares
39

Hankel and sub-Hankel determinants ( a detailed study of their polar ideals)

Maral, Mostafazadehfard 31 January 2014 (has links)
Submitted by Danielle Karla Martins Silva (danielle.martins@ufpe.br) on 2015-03-12T16:03:51Z No. of bitstreams: 2 TESE Maral Mostafazadehfard.pdf: 759835 bytes, checksum: 0db918f26f85cab03090a30fba1d2b36 (MD5) license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) / Made available in DSpace on 2015-03-12T16:03:51Z (GMT). No. of bitstreams: 2 TESE Maral Mostafazadehfard.pdf: 759835 bytes, checksum: 0db918f26f85cab03090a30fba1d2b36 (MD5) license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Previous issue date: 2014 / CNPq / Os resultados desta tese se enquadram na teoria dos polin^omios homaloidais, com ^enfase no caso de determinantes. O objetivo principal e o estudo das propriedades homol ogicas do determinante da matriz gen erica de Hankel e de uma de suas degenera c~oes, como um m etodo de abordar o seu comportamento de natureza homal oide. No caso da matriz de Hankel gen erica, em caracter stica zero, concluimos que o Hessiano do determinante e n~ao nulo (equivalentemente, o mapa polar associado e dominante), mas o determinante n~ao e homal oide. No caso degenerado, sabese que o determinante e homal oide (provado por Cilibert-Russo-Simis [3]); aqui, determinamos os invariantes num ericos e homol ogicos do respectivo ideal gradiente (polar), esses podendo ser usados para simpli car algumas passagens no argumento de [3]. Os principais resultados da tese s~ao baseados em ferramentas n~ao triviais da algebra comutativa e a natureza do uso dessas ferramentas e um dos recursos importantes desta tese.
40

Application of AAK theory for sparse approximation

Pototskaia, Vlada 16 October 2017 (has links)
No description available.

Page generated in 0.0499 seconds