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 11 of 11 for “"Resultant matrix"”.

  1. Structured matrix methods for computations on Bernstein basis polynomials

    This thesis considers structure preserving matrix methods for computations on Bernstein polynomials whose coefficients are corrupted by noise. The ill-posed operations of greatest common divisor computations and polynomial division are considered, and it is shown that structure preserving matrix …

    whiterose Download PDF for Structured matrix methods for computations on Bernstein basis polynomials (opens in a new tab)

  2. In search of more stable hierarchical trees: devising new algorithms to improve upon the stability of neighbor joining

    … sphere is increased. Once this is complete the resultant matrix is converted into a tree by sequentially joining the most associated points. The new algorithm proved to generate more stable trees compared to neighbour joining when applied to random or real data.

    guelph Repository record for In search of more stable hierarchical trees: devising new algorithms to improve upon the stability of neighbor joining (opens in a new tab)

  3. Identification of Moving Bottlenecks in Production Systems

    … was preprocessed using Python 3.7 to obtain a matrix of ones and zeros. The resultant matrix was fed into a complete linkage hierarchical agglomerative clustering algorithm to obtain clusters containing potential bottleneck workstations. Results obtained was validated using results obtained …

    wvu Repository record for Identification of Moving Bottlenecks in Production Systems (opens in a new tab)

  4. Blind Image Deconvolution Using The Sylvester Matrix

    … function. It is shown that the Sylvester resultant matrix enables the blurring function to be calculated using approx- imate greatest common divisor computations, rather than greatest common divisor computations. A developed method for the com- putation of an approximate greatest common …

    whiterose Download PDF for Blind Image Deconvolution Using The Sylvester Matrix (opens in a new tab)

  5. Approximate controllability and observability measures in control systems design

    … uses the restricted input-state (state-output) matrix pencil and then deploys exterior algebra that reduces the overall problem to the standard problem of distance of a set of polynomials from non-coprimeness. Results on the distance of the Sylvester Resultants from singularity provide the new …

    city-london Download PDF for Approximate controllability and observability measures in control systems design (opens in a new tab)

  6. Changes in morphological disparity in eutherian mammals across the K-Pg boundary and Palaeocene-Eocene Thermal Maximum using discrete morphofunctional characters

    … the Late Cretaceous, Palaeocene and Eocene. The resultant matrix was then used to quantify morphological disparity and changes in morphospace occupancy in eutherians over time using Principal Co-Ordinate Analysis (PCoA) and non-metric multidimensional scaling (NMDS), using both epoch and …

    salford Download PDF for Changes in morphological disparity in eutherian mammals across the K-Pg boundary and Palaeocene-Eocene Thermal Maximum using discrete morphofunctional characters (opens in a new tab)

  7. Macroeconomic Analysis of Poverty and Inequality in Sri Lanka: An Integrated Approach Using a Computable General Equilibrium (CGE) Model Based on a Social Accounting Matrix (SAM) and Econometric Model

    … of 2017 was analysed, and a Social Accounting Matrix (SAM) was constructed. The resultant matrix represented the economic structure of Sri Lanka. This matrix depicts the flow of goods, services, and income between different sectors of the economy. This also provided a comprehensive picture of …

    dundee Repository record for Macroeconomic Analysis of Poverty and Inequality in Sri Lanka: An Integrated Approach Using a Computable General Equilibrium (CGE) Model Based on a Social Accounting Matrix (SAM) and Econometric Model (opens in a new tab) Embargoed until 2028-04-30

  8. Blind Image Deconvolution using Approximate Greatest Common Divisor and Approximate Polynomial Factorisation

    … The developed method uses the Sylvester resultant matrix algorithm in the computation of the AGCD and the QR decomposition for computing the degree of the AGCD. It is shown that the AGCD is equal to the PSF and the deblurred image can be computed from the coprime polynomials. In practice, …

    whiterose Download PDF for Blind Image Deconvolution using Approximate Greatest Common Divisor and Approximate Polynomial Factorisation (opens in a new tab)

  9. Numerical methods for frequency dependent line parameters with applications to microstrip lines and pipe-type cables

    … For the subconductors system, an impedance matrix is then built using Ohm's law and the concept of Geometric Mean Distances (GMD). Secondly, the current distributions in the subconductors are solved from the telegrapher's equations. Thirdly, a linear current distribution is evaluated from …

    ubc Repository record for Numerical methods for frequency dependent line parameters with applications to microstrip lines and pipe-type cables (opens in a new tab) Download PDF for Numerical methods for frequency dependent line parameters with applications to microstrip lines and pipe-type cables (opens in a new tab)

  10. Value orientation in relation to emphasis in the process of diagnosing the family in state of crisis

    … on a seven point scale. A factor analysis of the resultant matrix of correlations between these thirty-one items produced nine dimensions. An orthogonal rotation was used in the factor analysis. The nine factor dimensions are characterized by their titles as follows: (1) External as Opposed to …

    portland-state Repository record for Value orientation in relation to emphasis in the process of diagnosing the family in state of crisis (opens in a new tab)

  11. Αλγεβρικοί αλγόριθμοι για την επίλυση πολυωνυμικών συστημάτων και εφαρμογές

    … of study in this dissertation is the sparse resultant. Resultants are defined in the sparse (or toric) context in order to exploit the structure of the polynomials as expressed by their Newton polytopes. We consider sparse elimination theory in order to describe the Newton polytope of the …

    greece Repository record for Αλγεβρικοί αλγόριθμοι για την επίλυση πολυωνυμικών συστημάτων και εφαρμογές (opens in a new tab)