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 7 of 7 for “"Overdetermined systems"”.

  1. Overdetermined Systems of Equations, Newton Polyhedra, and Resultants

    … to developing Newton polyhedra theory for overdetermined systems of equations. Let A1, . . . , Ak be finite sets in Z n and let Y ⊂ (C ∗ ) n be an algebraic variety defined by a system of equations f1 = . . . = fk = 0, where f1, . . . , fk are Laurent polynomials with supports in A1, . . . …

    toronto-retro Repository record for Overdetermined Systems of Equations, Newton Polyhedra, and Resultants (opens in a new tab)

  2. Aspects of overdetermined systems of partial differential equations in projective and conformal geometry

    This thesis discusses aspects of overdetermined systems of partial differential equations (PDEs) in projective and conformal geometry. The first part deals with projective differential geometry. A projective surface is a 2-dimensional smooth manifold equipped with a projective structure i.e. a …

    anu Repository record for Aspects of overdetermined systems of partial differential equations in projective and conformal geometry (opens in a new tab)

  3. Randomised Kaczmarz Method

    Solving systems of linear equations, iterative methods are widely used for computing e ciency, though direct methods are robust and accurate. Kaczmarz method was rst introduced in 1973 for square matrices in Euclidean space and was utilised in Computational Tomography, while it has been noticed …

    anu Repository record for Randomised Kaczmarz Method (opens in a new tab)

  4. Sparsity, Randomness and Convexity in Applied Algebraic Geometry

    … is to study the condition number of polynomial systems ‘on average’. Condition number is a vital invariant of polynomial systems which controls their computational complexity. We analyze the condition number of random polynomial systems for a broad family of distributions. Our work shows that …

    tamu Repository record for Sparsity, Randomness and Convexity in Applied Algebraic Geometry (opens in a new tab)

  5. Analysis and computer simulation of optimal active vibration control

    … control is larger than the number of actuators (overdetermined optimal control problems). The determined optimal control problems can be solved by applying the Independent Modal Space Control (IMSC) approach. Such an approach is implemented in the Beam Analogy (BA) method that solves the problem …

    sask Repository record for Analysis and computer simulation of optimal active vibration control (opens in a new tab)

  6. A study of computational and algorithmic techniques for solving complex computational problems

    … iterative methods are used for both overdetermined and underdetermined systems. A new approximate pseudoinverse preconditioning scheme, the Generic Approximate Sparse Pseudoinverse (GASP) schema, based on modified incomplete QR factorizations with Givens rotations, is designed and …

    greece Repository record for A study of computational and algorithmic techniques for solving complex computational problems (opens in a new tab)