Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 9 of 9 for “"k-matrix"”.

  1. Regge pole and K-matrix models for two particle reactions

    … reactions near 1 BeV/c are studied using the Kmatrix formalism. It is found that the general features of the experimental data, including the I = 1 peak in the total cross section are reproduced without the assumption of a KN resonance. It is found the agreement with experiment is best for the …

    uiuc Repository record for Regge pole and K-matrix models for two particle reactions (opens in a new tab)

  2. Strong-Coupling Limit of Regge Trajectories in the ϕ3 Ladder Model and a Three Particle K Matrix Model

    Submitted by Jesse Garrison (jagarris@illinois.edu) on 2012-01-11T18:08:24Z No. of bitstreams: 1 1974_miller.pdf: 8109299 bytes, checksum: 269f70d4e7e2f8ef96563f9f48e7801e (MD5)

    uiuc Repository record for Strong-Coupling Limit of Regge Trajectories in the ϕ3 Ladder Model and a Three Particle K Matrix Model (opens in a new tab)

  3. Strong-Coupling Limit of Regge Trajectories in the Phi-Cube Ladder Model and a Three Particle K Matrix Model

    Made available in DSpace on 2015-05-12T22:39:10Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 7511796.PDF: 3151814 bytes, checksum: 39e10b4c328137450aa4e1ed10696835 (MD5) Previous issue date: 1974

    uiuc Repository record for Strong-Coupling Limit of Regge Trajectories in the Phi-Cube Ladder Model and a Three Particle K Matrix Model (opens in a new tab)

  4. Sampling-based algorithms for dimension reduction

    … question, we consider the problem of low-rank matrix approximation: given a matrix A..., one wants to compute a rank-k matrix (where k << min{m, n}) nearest to A in the Frobenius norm (also known as the Hilbert-Schmidt norm). We prove that using a sample of roughly O(k/[epsilon]) rows of A one …

    mit Repository record for Sampling-based algorithms for dimension reduction (opens in a new tab)

  5. An analysis of pion-nucleon scattering

    … waves were parametrized as a coupled channel K-matrix whose elements are polynomials in energy plus an explicit pole term. A complete description of the investigation and the experimental data used are included as is a description of the theoretical models used for interpretation of the results.

    vt Repository record for An analysis of pion-nucleon scattering (opens in a new tab)

  6. Integrability from Chern-Simons theories

    … the boundary analogue of a quasi-classical $R$-matrix and classical $r$-matrix; realising $K$-matrices as the vacuum expectation values of Wilson lines in 4d Chern-Simons theory on a $\bbZ_2$ orbifold; deriving the order $\hbar$ contribution to a $K$-matrix in the rational case and verifying …

    cambridge Repository record for Integrability from Chern-Simons theories (opens in a new tab)

  7. A Unified Analysis of the B = 2 System

    Results are presented for a unified analysis of the reactions pp → pp, πd → πd and πd → pp over the center-of-mass energy interval from pion threshold to approximately 2.4 GeV. These results for πd → pp and πd elastic scattering are superior to previous VPI analyses of these reactions. In …

    vt Repository record for A Unified Analysis of the B = 2 System (opens in a new tab)

  8. Aspects of critical spin 1 chains and 2 dimensional symmetry protected topological phases of matter

    … using exact diagonalization (ED) and the density matrix renormalization group (DMRG) algorithm. In particular, the bosonization method gives a formula for the evolution of four Tomonaga-Luttinger liquid (TLL) parameters as a function of the lattice parameters. Using the analytic formulae for the …

    uiuc Repository record for Aspects of critical spin 1 chains and 2 dimensional symmetry protected topological phases of matter (opens in a new tab)

  9. Algorithms and algorithmic obstacles for probabilistic combinatorial structures

    … combinatorial optimization problems: Large Submatrix Selection, Maximum Cut (Max-Cut) of a graph and Matrix Completion. The Large Submatrix Selection problem is to find a k x k submatrix of an n x n matrix with i.i.d. standard Gaussian entries, which has the largest average entry. It was shown …

    mit Repository record for Algorithms and algorithmic obstacles for probabilistic combinatorial structures (opens in a new tab)