• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 19
  • 10
  • 3
  • 3
  • 2
  • 1
  • Tagged with
  • 49
  • 49
  • 13
  • 10
  • 9
  • 7
  • 7
  • 7
  • 7
  • 6
  • 6
  • 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.
21

Interpolation of Subcouples, New Results and Applications

Sunehag, Peter January 2003 (has links)
Suppose that <b>X</b> and <b>Y</b> are Banach couples and suppose that there is a bounded linear couple map Q from <b>Y</b> to <b>X</b> which has the property that Q restricted to the endpoint spaces is injective and the images of the endpointspaces of <b>Y</b> are closed in the endpoint spaces of <b>X</b>, then we say that <b>Y</b> is a subcouple of <b>X.</b> If F is an interpolation functor we want to know how F(<b>Y</b>) is related to F(<b>X</b>). In particular we want to know for which F it holds that Q is an injection that maps F(<b>Y</b>) onto a closed subspace of F(<b>X</b>). In recent years interest has been paid to subcouples of finite codimension and in particular to subcouples of codimension one. We will in this thesis present an interpolation theory for subcouples of codimension one and then generalize it to finite codimension. Our theory will include both a larger class of couples and a larger class of interpolation functors than earlier results. The interpolation method that will be considered is the regular real method. Our general theory will imply older results by Kalton, Ivanov and Löfström. We will use the theory to answer questions about Hardy-type inequalities that were raised by Krugljak, Maligranda and Persson in 1999 and our new theory will also answer a question concerning interpolation of Banach algebras.
22

"Operator ideals on ordered Banach spaces"

Spinu, Eugeniu Unknown Date
No description available.
23

Zeros de polinômios e propriedades polinomiais em espaços de Banach / Zeros of polynomials and properties polynomials in Banach spaces

Tocha, Neusa Nogas 06 April 2006 (has links)
Neste trabalho temos por objetivo apresentar alguns resultados relacionados aos temas abordados por Aron, Choi e Llavona (1995), Aron e Dimant (2002) e Aron e Rueda (1997). Primeiramente, vamos estudar as propriedades polinomiais (P) e (RP) para os espaços de Banach e a propriedade ACL para as funções definidas entre as bolas unitárias fechadas do espaço. Vamos apresentar novos exemplos de espaços de Banach que possuem a propriedade (P) onde é possível exibir funções que satisfazem a propriedade ACL. Vamos ainda estudar o conjunto de continuidade seqüencial fraca de um polinômio N-homogêneo contínuo com valores vetoriais. Apresentamos as suas propriedades básicas e algumas conexões com o caso dos polinômios escalares. No espaço dual faremos uma breve análise dos polinômios com certo tipo de continuidade com relação à topologia fraca-estrela. Numa outra direção, estudamos os zeros de polinômios N-homogêneos em várias variáveis complexas, mais especificamente, dados n, N números naturais existe um número natural m tal que para cada polinômio N-homogêneo complexo P definido no espaço vetorial C^ existe um subespaço vetorial X_ contido no conjunto dos zeros do polinômio P de dimensão n. Aqui, o principal objetivo é melhorar as limitações para m encontradas por Aron e Rueda (1997) como também generalizar os seus resultados. / Our purpose here is to study some results regarding the articles of Aron, Choi and Llavona (1995), Aron and Dimant (2002) and Aron and Rueda (1997). Firstly, we study properties (P) and (RP) for the Banach spaces and the ACL property for the functions defined between the closed unit balls. We give new examples of Banach spaces which have (P) property and some functions defined in those spaces satisfying the ACL property. We also study the set of weak sequential continuity of a vector-valued continuous Nhomogeneous polynomial. In the dual space we study the N-homogeneous polynomials which are weak-star continuous on bounded sets. Finally, we study the zeros of complex N-homogeneous polynomials. This means, given positive integers n and N, there is a positive integer m such that an complex N-homogeneous polynomial P defined in C^ has an ndimensional subspace contained in its zero set. We discuss the problem of finding a good bound on m as a function of n and N. We improve the results given by Aron and Rueda (1997) as also generalize their results.
24

A concentration inequality based statistical methodology for inference on covariance matrices and operators

Kashlak, Adam B. January 2017 (has links)
In the modern era of high and infinite dimensional data, classical statistical methodology is often rendered inefficient and ineffective when confronted with such big data problems as arise in genomics, medical imaging, speech analysis, and many other areas of research. Many problems manifest when the practitioner is required to take into account the covariance structure of the data during his or her analysis, which takes on the form of either a high dimensional low rank matrix or a finite dimensional representation of an infinite dimensional operator acting on some underlying function space. Thus, novel methodology is required to estimate, analyze, and make inferences concerning such covariances. In this manuscript, we propose using tools from the concentration of measure literature–a theory that arose in the latter half of the 20th century from connections between geometry, probability, and functional analysis–to construct rigorous descriptive and inferential statistical methodology for covariance matrices and operators. A variety of concentration inequalities are considered, which allow for the construction of nonasymptotic dimension-free confidence sets for the unknown matrices and operators. Given such confidence sets a wide range of estimation and inferential procedures can be and are subsequently developed. For high dimensional data, we propose a method to search a concentration in- equality based confidence set using a binary search algorithm for the estimation of large sparse covariance matrices. Both sub-Gaussian and sub-exponential concentration inequalities are considered and applied to both simulated data and to a set of gene expression data from a study of small round blue-cell tumours. For infinite dimensional data, which is also referred to as functional data, we use a celebrated result, Talagrand’s concentration inequality, in the Banach space setting to construct confidence sets for covariance operators. From these confidence sets, three different inferential techniques emerge: the first is a k-sample test for equality of covariance operator; the second is a functional data classifier, which makes its decisions based on the covariance structure of the data; the third is a functional data clustering algorithm, which incorporates the concentration inequality based confidence sets into the framework of an expectation-maximization algorithm. These techniques are applied to simulated data and to speech samples from a set of spoken phoneme data. Lastly, we take a closer look at a key tool used in the construction of concentration based confidence sets: Rademacher symmetrization. The symmetrization inequality, which arises in the probability in Banach spaces literature, is shown to be connected with optimal transport theory and specifically the Wasserstein distance. This insight is used to improve the symmetrization inequality resulting in tighter concentration bounds to be used in the construction of nonasymptotic confidence sets. A variety of other applications are considered including tests for data symmetry and tightening inequalities in Banach spaces. An R package for inference on covariance operators is briefly discussed in an appendix chapter.
25

Minimax methods for finding multiple saddle critical points in Banach spaces and their applications

Yao, Xudong 01 November 2005 (has links)
This dissertation was to study computational theory and methods for ?nding multiple saddle critical points in Banach spaces. Two local minimax methods were developed for this purpose. One was for unconstrained cases and the other was for constrained cases. First, two local minmax characterization of saddle critical points in Banach spaces were established. Based on these two local minmax characterizations, two local minimax algorithms were designed. Their ?ow charts were presented. Then convergence analysis of the algorithms were carried out. Under certain assumptions, a subsequence convergence and a point-to-set convergence were obtained. Furthermore, a relation between the convergence rates of the functional value sequence and corresponding gradient sequence was derived. Techniques to implement the algorithms were discussed. In numerical experiments, those techniques have been successfully implemented to solve for multiple solutions of several quasilinear elliptic boundary value problems and multiple eigenpairs of the well known nonlinear p-Laplacian operator. Numerical solutions were presented by their pro?les for visualization. Several interesting phenomena of the solutions of quasilinear elliptic boundary value problems and the eigenpairs of the p-Laplacian operator have been observed and are open for further investigation. As a generalization of the above results, nonsmooth critical points were considered for locally Lipschitz continuous functionals. A local minmax characterization of nonsmooth saddle critical points was also established. To establish its version in Banach spaces, a new notion, pseudo-generalized-gradient has to be introduced. Based on the characterization, a local minimax algorithm for ?nding multiple nonsmooth saddle critical points was proposed for further study.
26

Convergence Of Lotz-raebiger Nets On Banach Spaces

Erkursun, Nazife 01 June 2010 (has links) (PDF)
The concept of LR-nets was introduced and investigated firstly by H.P. Lotz in [27] and by F. Raebiger in [30]. Therefore we call such nets Lotz-Raebiger nets, shortly LR-nets. In this thesis we treat two problems on asymptotic behavior of these operator nets. First problem is to generalize well known theorems for Ces`aro averages of a single operator to LR-nets, namely to generalize the Eberlein and Sine theorems. The second problem is related to the strong convergence of Markov LR-nets on L1-spaces. We prove that the existence of a lower-bound functions is necessary and sufficient for asymptotic stability of LR-nets of Markov operators.
27

Minimax methods for finding multiple saddle critical points in Banach spaces and their applications

Yao, Xudong 01 November 2005 (has links)
This dissertation was to study computational theory and methods for ?nding multiple saddle critical points in Banach spaces. Two local minimax methods were developed for this purpose. One was for unconstrained cases and the other was for constrained cases. First, two local minmax characterization of saddle critical points in Banach spaces were established. Based on these two local minmax characterizations, two local minimax algorithms were designed. Their ?ow charts were presented. Then convergence analysis of the algorithms were carried out. Under certain assumptions, a subsequence convergence and a point-to-set convergence were obtained. Furthermore, a relation between the convergence rates of the functional value sequence and corresponding gradient sequence was derived. Techniques to implement the algorithms were discussed. In numerical experiments, those techniques have been successfully implemented to solve for multiple solutions of several quasilinear elliptic boundary value problems and multiple eigenpairs of the well known nonlinear p-Laplacian operator. Numerical solutions were presented by their pro?les for visualization. Several interesting phenomena of the solutions of quasilinear elliptic boundary value problems and the eigenpairs of the p-Laplacian operator have been observed and are open for further investigation. As a generalization of the above results, nonsmooth critical points were considered for locally Lipschitz continuous functionals. A local minmax characterization of nonsmooth saddle critical points was also established. To establish its version in Banach spaces, a new notion, pseudo-generalized-gradient has to be introduced. Based on the characterization, a local minimax algorithm for ?nding multiple nonsmooth saddle critical points was proposed for further study.
28

Parameter choice in Banach space regularization under variational inequalities

Hofmann, Bernd, Mathé, Peter 17 April 2012 (has links) (PDF)
The authors study parameter choice strategies for Tikhonov regularization of nonlinear ill-posed problems in Banach spaces. The effectiveness of any parameter choice for obtaining convergence rates depend on the interplay of the solution smoothness and the nonlinearity structure, and it can be expressed concisely in terms of variational inequalities. Such inequalities are link conditions between the penalty term, the norm misfit and the corresponding error measure. The parameter choices under consideration include an a priori choice, the discrepancy principle as well as the Lepskii principle. For the convenience of the reader the authors review in an appendix a few instances where the validity of a variational inequality can be established.
29

Výjimečné množiny v matematické analýze / Exceptional Sets in Mathematical Analysis

Rmoutil, Martin January 2014 (has links)
Title: Exceptional Sets in Mathematical Analysis Author: Martin Rmoutil Department: Department of Mathematical Analysis Supervisor: Doc. RNDr. Ondřej Kalenda, Ph.D., DSc., Department of Mathematical Analysis Abstract: The present thesis consists of four research articles. In the first paper we study the notion of σ-lower porous set; our main result is the existence of two closed sets A, B ⊂ R which are not σ-lower porous, but their product in R2 is lower porous. In the second and third article we use a set-theoretical method of el- ementary submodels involving the Lwenheim-Skolem theorem to prove that certain σ-ideals of sets in Banach spaces are separably determined. In the second article we do so for σ-porous sets and σ-lower porous sets. In the next article we refine these methods obtaining separable determination of a wide class of σ-ideals. In both cases we derive interesting corollaries which extend known theorems in separable spaces to the nonseparable setting; for example, we obtain the following theorem. Any continuous convex function on an Asplund space is Frchet differentiable outside a cone small set. In the fourth article we introduce the following notion. A closed set A ⊂ Rd is said to be c-removable if the following is true: Every real function on Rd is convex whenever it is continuous on Rd...
30

Kvantitativní vlastnosti Banachových prostorů / Quantitative properties of Banach spaces

Krulišová, Hana January 2016 (has links)
The present thesis consists of four research papers. Each article deals with quan- tifications of certain properties of Banach spaces. The first paper is devoted to the Grothendieck property. The main result is that the space ∞ enjoys its quan- titative version. The second paper investigates quantifications of the Banach- Saks and the weak Banach-Saks property. The relationship of compact, weakly compact, Banach-Saks, and weak Banach-Saks sets is quantified, as well as some characterizatons of weak Banach-Saks sets. In the third article we discuss possible quantifications of Pelczy'nski's property (V), their characterizations and relations to quantitative versions of other properties of Banach spaces. The last paper is a continuation of the third one. We prove that C∗ -algebras have a quantita- tive version of the property (V), which generalizes one of the results obtained in the previous paper. Moreover, we establish a relationship between quantita- tive versions of the property (V) and the Grothendieck property in dual Banach spaces. 1

Page generated in 0.0365 seconds