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 10 of 10 for “"rational arithmetic"”.

  1. Rational Arithmetic as a Means of Matrix Inversion

    … is to obtain an exact A-1 through the use of rational arithmetic, and to study the behavior of rational numbers when used in arithmetic calculations. This study describes a matrix inversion program written in SPS II, utilizing the concept of rational arithmetic. This program, using the …

    utahstate Repository record for Rational Arithmetic as a Means of Matrix Inversion (opens in a new tab)

  2. Exact computation using extended-precision single-modulus residue arithmetic

    … uses extended-precision single-modulus residue arithmetic to perform computations in an environment totally free of machine roundoff error.</p> <p>We perform computations using the set of order-N Farey fractions</p> <p>F<sub>N</sub> = { a/b: 0 ≤ a ≤ N, 0 ≤ <b>|</b>b<b>|</b> ≤ N, and gcd(a,b) = 1 …

    ut-knoxville Repository record for Exact computation using extended-precision single-modulus residue arithmetic (opens in a new tab)

  3. Foundational Factorization Algorithms for the Efficient Roundoff-Error-Free Solution of Optimization Problems

    … (REF) constructed exclusively in integer arithmetic: the REF LU and Cholesky factorizations. Additionally, it develops supplementary integer-preserving substitution algorithms, thereby providing a complete tool set for solving systems of linear equations (SLEs) exactly and efficiently. An …

    tamu Repository record for Foundational Factorization Algorithms for the Efficient Roundoff-Error-Free Solution of Optimization Problems (opens in a new tab)

  4. Instruction systolic arrays for exact parallel linear algebraic computation

    … for parallel/distributed error-free (exact) rational (real and complex) computing and its applications to exact linear algebraic computing. The practical realization of these parallel algorithms in VLSI systems using a new concept known as Instruction Systolic Arrays (ISA) is considered. …

    waikato-masters Repository record for Instruction systolic arrays for exact parallel linear algebraic computation (opens in a new tab) Download file for Instruction systolic arrays for exact parallel linear algebraic computation (opens in a new tab)

  5. Topics in 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 for some applications. Implementing software entirely in rational arithmetic can be …

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

  6. Optimization Modulo Theories with OptiMathSAT

    … –the Boolean, the mixed Linear Integer and Rational Arithmetic, the Bit-Vector and the Floating Point domain– including (Partial Weighted) MaxSMT. We validate our theoretical contributions experimentally, by comparing the performance of OptiMathSAT against other, competing, OMT solvers. …

    trento Repository record for Optimization Modulo Theories with OptiMathSAT (opens in a new tab)

  7. Efficient Algorithms for the Exact Solution of Sparse Linear Systems in Time Proportional to Arithmetic Work

    Obtaining the exact rational solution of sparse systems of linear equations (SLEs), Ax =b, is a fundamental problem in mathematics, engineering, and computer science. The two most common tools used to solve these sparse linear systems are LU and Cholesky factorizations. However, despite the …

    tamu Repository record for Efficient Algorithms for the Exact Solution of Sparse Linear Systems in Time Proportional to Arithmetic Work (opens in a new tab)

  8. New Results on Lattice Reduction Algorithms using Deep Insertions

    … we provide (1) proofs of correctness assuming rational arithmetic, (2) theoretical notions of reducedness, (3) theoretical bounds on runtime, (4) theoretical bounds on output quality (except when the measure is SS), and (5) extensive experimental analysis to compare their runtime efficiency and …

    kent Download PDF for New Results on Lattice Reduction Algorithms using Deep Insertions (opens in a new tab)

  9. Abstractions for Reverse Engineering

    Increasingly sophisticated systems are being integrated into our daily lives, raising the need to verify their safety and reliability. Formal methods offer a range of techniques for providing sound guarantees of a system's correctness with respect to its specification. The continuous evolution of …

    trento Repository record for Abstractions for Reverse Engineering (opens in a new tab)