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 4 of 4 for “"Exact linear algebra"”.

  1. Topics in exact precision mathematical programming

    … advancement of theory and computation related to exact precision mathematical programming. Optimization software based on floating-point arithmetic can return suboptimal or incorrect resulting because of round-off errors or the use of numerical tolerances. Exact or correct results are necessary …

    gatech Repository record for Topics in exact precision mathematical programming (opens in a new tab)

  2. Deterministic Unimodularity Certification and Applications for Integer Matrices

    The asymptotically fastest algorithms for many linear algebra problems on integer matrices, including solving a system of linear equations and computing the determinant, use high-order lifting. For a square nonsingular integer matrix A, high-order lifting computes B congruent to A^{-1} mod X^k and …

    waterloo Repository record for Deterministic Unimodularity Certification and Applications for Integer Matrices (opens in a new tab)

  3. High-Performance Software for Quantum Chemistry and Hierarchical Matrices

    Linear algebra is the underpinning of a significant portion of the computation done in the modern age. Applications relying on linear algebra include physical and chemical simulations, machine learning, artificial intelligence, optimization, partial differential equations, and many more. However, …

    gatech Repository record for High-Performance Software for Quantum Chemistry and Hierarchical Matrices (opens in a new tab)

  4. Fast algorithms for computing with integer matrices: normal forms and applications

    … is on fundamental computational problems in exact integer linear algebra. Specifically, for a nonsingular integer input matrix A of dimension n, we consider problems such as linear system solving and computing integer matrix normal forms. Our goal is to design algorithms that have complexity …

    waterloo Repository record for Fast algorithms for computing with integer matrices: normal forms and applications (opens in a new tab)