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

On Some Aspects of the Differential Operator

Mathew, Panakkal Jesu 28 July 2006 (has links)
The Differential Operator D is a linear operator from C1[0,1] onto C[0,1]. Its domain C1[0,1] is thoroughly studied as a meager subspace of C[0,1]. This is analogous to the status of the set of all rational numbers Q in the set of the real numbers R. On the polynomial vector space Pn the Differential Operator D is a nilpotent operator. Using the invariant subspace and reducing subspace technique an appropriate basis for the underlying vector space can be found so that the nilpotent operator admits its Jordan Canonical form. The study of D on Pn is completely carried out. Finally, the solution space V of the nth order differential equation with leading coefficient one is studied. The behavior of D on V is explored using some notions from linear algebra and linear operators. NOTE- Due to the limitation of the above being in "text only form" , further details of this abstract can be viewed in the pdf file.
2

The Exponential Function of Matrices

Smalls, Nathalie Nicholle 28 November 2007 (has links)
The matrix exponential is a very important subclass of functions of matrices that has been studied extensively in the last 50 years. In this thesis, we discuss some of the more common matrix functions and their general properties, and we specifically explore the matrix exponential. In principle, the matrix exponential could be computed in many ways. In practice, some of the methods are preferable to others, but none are completely satisfactory. Computations of the matrix exponential using Taylor Series, Scaling and Squaring, Eigenvectors, and the Schur Decomposition methods are provided.
3

Frequent Pattern Mining among Weighted and Directed Graphs

Cederquist, Aaron January 2009 (has links)
No description available.
4

Software tools for matrix canonical computations and web-based software library environments

Johansson, Pedher January 2006 (has links)
This dissertation addresses the development and use of novel software tools and environments for the computation and visualization of canonical information as well as stratification hierarchies for matrices and matrix pencils. The simplest standard shape to which a matrix pencil with a given set of eigenvalues can be reduced is called the Kronecker canonical form (KCF). The KCF of a matrix pencil is unique, and all pencils in the manifold of strictly equivalent pencils - collectively termed the orbit - can be reduced to the same canonical form and so have the same canonical structure. For a problem with fixed input size, all orbits are related under small perturbations. These relationships can be represented in a closure hierarchy with a corresponding graph depicting the stratification of these orbits. Since degenerate canonical structures are common in many applications, software tools to determine canonical information, especially under small perturbations, are central to understanding the behavior of these problems. The focus in this dissertation is the development of a software tool called StratiGraph. Its purpose is the computation and visualization of stratification graphs of orbits and bundles (i.e., union of orbits in which the eigenvalues may change) for matrices and matrix pencils. It also supports matrix pairs, which are common in control systems. StratiGraph is extensible by design, and a well documented plug-in feature enables it, for example, to communicate with Matlab(TM). The use and associated benefits of StratiGraph are illustrated via numerous examples. Implementation considerations such as flexible software design, suitable data representations, and good and efficient graph layout algorithms are also discussed. A way to estimate upper and lower bounds on the distance between an input S and other orbits is presented. The lower bounds are of Eckhart-Young type, based on the matrix representation of the associated tangent spaces. The upper bounds are computed as the Frobenius norm F of a perturbation such that S + F is in the manifold defining a specified orbit. Using associated plug-ins to StratiGraph this information can be computed in Matlab, while visualization alongside other canonical information remains within StratiGraph itself. Also, a proposal of functionality and structure of a framework for computation of matrix canonical structure is presented. Robust, well-known algorithms, as well algorithms improved and developed in this work, are used. The framework is implemented as a prototype Matlab toolbox. The intention is to collect software for computing canonical structures as well as for computing bounds and to integrate it with the theory of stratification into a powerful new environment called the MCS toolbox. Finally, a set of utilities for generating web computing environments related to mathematical and engineering library software is presented. The web interface can be accessed from a standard web browser with no need for additional software installation on the local machine. Integration with the control and systems library SLICOT further demonstrates the efficacy of this approach.
5

Canonical forms for Hamiltonian and symplectic matrices and pencils

Mehrmann, Volker, Xu, Hongguo 09 September 2005 (has links) (PDF)
We study canonical forms for Hamiltonian and symplectic matrices or pencils under equivalence transformations which keep the class invariant. In contrast to other canonical forms our forms are as close as possible to a triangular structure in the same class. We give necessary and sufficient conditions for the existence of Hamiltonian and symplectic triangular Jordan, Kronecker and Schur forms. The presented results generalize results of Lin and Ho [17] and simplify the proofs presented there.
6

Canonical forms for Hamiltonian and symplectic matrices and pencils

Mehrmann, Volker, Xu, Hongguo 09 September 2005 (has links)
We study canonical forms for Hamiltonian and symplectic matrices or pencils under equivalence transformations which keep the class invariant. In contrast to other canonical forms our forms are as close as possible to a triangular structure in the same class. We give necessary and sufficient conditions for the existence of Hamiltonian and symplectic triangular Jordan, Kronecker and Schur forms. The presented results generalize results of Lin and Ho [17] and simplify the proofs presented there.
7

On Twin Observables in Entangled Mixed States

23 May 2001 (has links)
No description available.
8

Classification of second order symmetric tensors in the Lorentz metric

Hjelm Andersson, Hampus January 2010 (has links)
This bachelor thesis shows a way to classify second order symmetric tensors in the Lorentz metric. Some basic prerequisite about indefinite and definite algebra is introduced, such as the Jordan form, indefinite inner products, the Segre type, and the Minkowski space. There are also some results concerning the invariant 2-spaces of a symmetric tensor and a different approach on how to classify second order symmetric tensor.
9

Sums and products of square-zero matrices

Hattingh, Christiaan Johannes 03 1900 (has links)
Which matrices can be written as sums or products of square-zero matrices? This question is the central premise of this dissertation. Over the past 25 years a signi - cant body of research on products and linear combinations of square-zero matrices has developed, and it is the aim of this study to present this body of research in a consolidated, holistic format, that could serve as a theoretical introduction to the subject. The content of the research is presented in three parts: rst results within the broader context of sums and products of nilpotent matrices are discussed, then products of square-zero matrices, and nally sums of square-zero matrices. / Mathematical Sciences / M. Sc. (Mathematics)
10

Algorithmic transformation of multi-loop Feynman integrals to a canonical basis

Meyer, Christoph 30 January 2018 (has links)
Die Auswertung von Mehrschleifen-Feynman-Integralen ist eine der größten Herausforderungen bei der Berechnung präziser theoretischer Vorhersagen für die am LHC gemessenen Wirkungsquerschnitte. In den vergangenen Jahren hat sich die Nutzung von Differentialgleichungen bei der Berechnung von Feynman-Integralen als sehr erfolgreich erwiesen. Es wurde dabei beobachtet, dass die von den Feynman-Integralen erfüllte Differentialgleichung oftmals in eine sogenannte kanonische Form transformiert werden kann, welche die Integration der Differentialgleichung mittels iterierter Integrale wesentlich vereinfacht. Das zentrale Ergebnis der vorliegenden Arbeit ist ein Algorithmus zur Berechnung rationaler Transformationen von Differentialgleichungen von Feynman-Integralen in eine kanonische Form. Neben der Existenz einer solchen rationalen Transformation stellt der Algorithmus keinerlei weitere Bedingungen an die Differentialgleichung. Insbesondere ist der Algorithmus auf Mehrskalenprobleme anwendbar und erlaubt eine rationale Abhängigkeit der Differentialgleichung vom dimensionalen Regulator. Bei der Anwendung des Algorithmus wird zunächst das Transformationsgesetz im dimensionalen Regulator entwickelt, um Differentialgleichungen für die Koeffizienten in der Entwicklung der Transformation herzuleiten. Diese Differentialgleichungen werden dann mit einem rationalen Ansatz für die gesuchte Transformation gelöst. Es wird zudem eine Implementation des Algorithmus in dem Mathematica Paket CANONICA vorgestellt, welches das erste veröffentlichte Programm dieser Art ist, das auf Mehrskalenprobleme anwendbar ist. CANONICAs Potential für moderne Mehrschleifenrechnungen wird anhand mehrerer nicht trivialer Mehrschleifen-Integraltopologien demonstriert. Die gezeigten Topologien hängen von bis zu drei Variablen ab und umfassen auch vormals ungelöste Topologien, die zu Korrekturen höherer Ordnung zum Wirkungsquerschnitt der Produktion einzelner Top-Quarks am LHC beitragen. / The evaluation of multi-loop Feynman integrals is one of the main challenges in the computation of precise theoretical predictions for the cross sections measured at the LHC. In recent years, the method of differential equations has proven to be a powerful tool for the computation of Feynman integrals. It has been observed that the differential equation of Feynman integrals can in many instances be transformed into a so-called canonical form, which significantly simplifies its integration in terms of iterated integrals. The main result of this thesis is an algorithm to compute rational transformations of differential equations of Feynman integrals into a canonical form. Apart from requiring the existence of such a rational transformation, the algorithm needs no further assumptions about the differential equation. In particular, it is applicable to problems depending on multiple kinematic variables and also allows for a rational dependence on the dimensional regulator. First, the transformation law is expanded in the dimensional regulator to derive differential equations for the coefficients of the transformation. Using an ansatz in terms of rational functions, these differential equations are then solved to determine the transformation. This thesis also presents an implementation of the algorithm in the Mathematica package CANONICA, which is the first publicly available program to compute transformations to a canonical form for differential equations depending on multiple variables. The main functionality and its usage are illustrated with some simple examples. Furthermore, the package is applied to state-of-the-art integral topologies appearing in recent multi-loop calculations. These topologies depend on up to three variables and include previously unknown topologies contributing to higher-order corrections to the cross section of single top-quark production at the LHC.

Page generated in 0.0837 seconds