• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 3
  • Tagged with
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 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.
1

The Weighted Space Odyssey

Křepela, Martin January 2017 (has links)
The common topic of this thesis is boundedness of integral and supremal operators between weighted function spaces. The first type of results are characterizations of boundedness of a convolution-type operator between general weighted Lorentz spaces. Weighted Young-type convolution inequalities are obtained and an optimality property of involved domain spaces is proved. Additional provided information includes an overview of basic properties of some new function spaces appearing in the proven inequalities. In the next part, product-based bilinear and multilinear Hardy-type operators are investigated. It is characterized when a bilinear Hardy operator inequality holds either for all nonnegative or all nonnegative and nonincreasing functions on the real semiaxis. The proof technique is based on a reduction of the bilinear problems to linear ones to which known weighted inequalities are applicable. Further objects of study are iterated supremal and integral Hardy operators, a basic Hardy operator with a kernel and applications of these to more complicated weighted problems and embeddings of generalized Lorentz spaces. Several open problems related to missing cases of parameters are solved, thus completing the theory of the involved fundamental Hardy-type operators. / Operators acting on function spaces are classical subjects of study in functional analysis. This thesis contributes to the research on this topic, focusing particularly on integral and supremal operators and weighted function spaces. Proving boundedness conditions of a convolution-type operator between weighted Lorentz spaces is the first type of a problem investigated here. The results have a form of weighted Young-type convolution inequalities, addressing also optimality properties of involved domain spaces. In addition to that, the outcome includes an overview of basic properties of some new function spaces appearing in the proven inequalities.  Product-based bilinear and multilinear Hardy-type operators are another matter of focus. It is characterized when a bilinear Hardy operator inequality holds either for all nonnegative or all nonnegative and nonincreasing functions on the real semiaxis. The proof technique is based on a reduction of the bilinear problems to linear ones to which known weighted inequalities are applicable.  The last part of the presented work concerns iterated supremal and integral Hardy operators, a basic Hardy operator with a kernel and applications of these to more complicated weighted problems and embeddings of generalized Lorentz spaces. Several open problems related to missing cases of parameters are solved, completing the theory of the involved fundamental Hardy-type operators. / <p>Artikel 9 publicerad i avhandlingen som manuskript med samma titel.</p>
2

Parameter estimation for nonincreasing exponential sums by Prony-like methods

Potts, Daniel, Tasche, Manfred 02 May 2012 (has links) (PDF)
For noiseless sampled data, we describe the close connections between Prony--like methods, namely the classical Prony method, the matrix pencil method and the ESPRIT method. Further we present a new efficient algorithm of matrix pencil factorization based on QR decomposition of a rectangular Hankel matrix. The algorithms of parameter estimation are also applied to sparse Fourier approximation and nonlinear approximation.
3

Parameter estimation for nonincreasing exponential sums by Prony-like methods

Potts, Daniel, Tasche, Manfred January 2012 (has links)
For noiseless sampled data, we describe the close connections between Prony--like methods, namely the classical Prony method, the matrix pencil method and the ESPRIT method. Further we present a new efficient algorithm of matrix pencil factorization based on QR decomposition of a rectangular Hankel matrix. The algorithms of parameter estimation are also applied to sparse Fourier approximation and nonlinear approximation.

Page generated in 0.0956 seconds