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 20 of 824 for “"Square Root"”.

  1. Square Root Finding In Graphs

    Abstract: Root and root finding are concepts familiar to most branches of mathematics. In graph theory, H is a square root of G and G is the square of H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Graph square is a basic operation with a number of …

    brock Repository record for Square Root Finding In Graphs (opens in a new tab)

  2. Geometry and the Kato square root problem

    … primary focus of this thesis is to consider Kato square root problems for various divergence-form operators on manifolds. This is the study of perturbations of second-order differential operators by bounded, complex, measurable coefficients. In general, such operators are not self-adjoint but …

    anu Repository record for Geometry and the Kato square root problem (opens in a new tab)

  3. Schrodinger Operators and the Kato Square Root Problem

    … The second problem that we consider is the Kato square root problem for divergence form elliptic operators with potential V : R n → C. This is the equivalence statement (L + V ) 1 2 u L2(Rn) ' k∇ukL2(Rn) + V 1 2 u L2(Rn) , where L + V := −div (A∇) + V and the perturbation A is an L ∞ complex …

    anu Repository record for Schrodinger Operators and the Kato Square Root Problem (opens in a new tab)

  4. Improved algorithms for non-restoring division and square root

    … on improving the non-restoring division and square root algorithm. Although the non-restoring division algorithm is the fastest and has less complexity among other radix-2 digit recurrence division algorithms, there are some possibilities to enhance its performance. To improve its …

    texas Repository record for Improved algorithms for non-restoring division and square root (opens in a new tab)

  5. A New Algorithm for Computing the Square Root of a Matrix

    … are several different methods for computing a square root of a matrix. Previous research has been focused on Newton's method and improving its speed and stability by application of Schur decomposition called Schur-Newton. In this thesis, we propose a new method for finding a square root of a …

    rit Repository record for A New Algorithm for Computing the Square Root of a Matrix (opens in a new tab)

  6. Multitarget tracking and terrain-aided navigation using square-root consider filters

    … of these specialized techniques are known as square-root filters and consider filters. The former alleviates the fragility induced from estimating error covariance matrices by, instead, managing a factorized representation of that matrix, known as a square-root factor. The latter chooses to …

    must-thes Repository record for Multitarget tracking and terrain-aided navigation using square-root consider filters (opens in a new tab)

  7. Direct photon production at [the square root of]s=1.8 TeV

    Thesis (Ph. D.)--Michigan State University. Department of Physics and Astronomy, 1995

    msu Repository record for Direct photon production at [the square root of]s=1.8 TeV (opens in a new tab)

  8. Pseudoinverse Training for Neuromorphic Reservoir Computing Using Square-Root-Free Cholesky Decomposition

    … circuit. This thesis develops a fixed-point, square-root-free readout trainer for a windowed echo state network used in MIMO-OFDM symbol detection. The trainer streams regularized sufficient statistics into a banked, packed memory, factors the 48-by-48 normal matrix in place with a …

    vt Repository record for Pseudoinverse Training for Neuromorphic Reservoir Computing Using Square-Root-Free Cholesky Decomposition (opens in a new tab)

  9. Curves of genus 2 with real multiplication by a square root of 5

    Our aim in this work is to produce equations for curves of genus 2 whose Jacobians have real multiplication (RM) by $\mathbb{Q}(\sqrt{5})$, and to examine the conjecture that any abelian surface with RM by $\mathbb{Q}(\sqrt{5})$ is isogenous to a simple factor of the Jacobian of a modular curve …

    oxford Repository record for Curves of genus 2 with real multiplication by a square root of 5 (opens in a new tab)

  10. The classification of rank 3 reflective hyperbolic lattices over Z([square root of 2])

    There are 432 strongly squarefree symmetric bilinear forms of signature (2,1) defined over Z([square root of 2]) whose integral isometry groups are generated up to finite index by finitely many reflections. We adapted Allcock's method (based on Nikulin's) of analysis for the 2-dimensional Weyl …

    texas Repository record for The classification of rank 3 reflective hyperbolic lattices over Z([square root of 2]) (opens in a new tab)

  11. Low Cost/ High Precision Flight Dynamics Estimation Using the Square-Root Unscented Kalman Filter

    … (MOTRON), and outlines a method of utilizing the square-root Unscented Kalman filter (SR-UKF) to estimate aircraft flight dynamics, based on recorded flight data, as an alternative to the extended Kalman filter. While the results of the SR-UKF are not as precise as the NovAtel results, they …

    byu Repository record for Low Cost/ High Precision Flight Dynamics Estimation Using the Square-Root Unscented Kalman Filter (opens in a new tab) Download PDF for Low Cost/ High Precision Flight Dynamics Estimation Using the Square-Root Unscented Kalman Filter (opens in a new tab)

  12. Dijet angular distributions at square root of s = 1800 GeV using the D0 detector.

    Dijet angular distributions provide a excellent look at the interactions between partons. The measurements performed by the DO detector are the most precise accomplished to date at pp colliders and cover a larger angular range than previously possible. Both leading order and next-to-leading order …

    arizona-thes Repository record for Dijet angular distributions at square root of s = 1800 GeV using the D0 detector. (opens in a new tab)

  13. Square Root Multi-State Constraint Kalman Filter-Based Calibration and Localization of Multi-Sensor Systems

    Solving the localization problem is key to the success of any mobile robotic system and this success is predicated on having accurate sensor measurements and calibrations. Due to the possibility of intrinsic and extrinsic calibrations changing over time, sometimes suddenly, it is advantageous to …

    tamu Repository record for Square Root Multi-State Constraint Kalman Filter-Based Calibration and Localization of Multi-Sensor Systems (opens in a new tab)

Page 1 of 42