Essays about: "Computer Arithmetic"
Showing result 1 - 5 of 12 essays containing the words Computer Arithmetic.
-
1. An operator theoretic approach to the Riemann Hypothesis
University essay from Lunds universitet/Matematik (naturvetenskapliga fakulteten); Lunds universitet/MatematikcentrumAbstract : In 2023 an operator theoretic approach to the Prime Number Theorem was introduced by Olsen. In this thesis this approach is examined and applied to give a new, operator theoretic, proof of a different version of the Prime Number Theorem and of the Prime Number Theorem for arithmetic progressions. READ MORE
-
2. Hardware in Loop Simulations of Electric Drives
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Electric drives are crucial components of powertrain of modern vehicles. They need to be controlled effectively to deliver a comfortable and efficient driving experience. The control unit needs to be robust to handle extreme operating conditions and faults in a safe manner. READ MORE
-
3. Leveraging Posits for the Conjugate Gradient Linear Solver on an Application-Level RISC-V Core
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Emerging floating-point arithmetics provide a way to optimize the execution of computationally-intensive algorithms. This is the case with scientific computational kernels such as the Conjugate Gradient (CG) linear solver. Exploring new arithmetics is of paramount importance to maximize the accuracy and timing performance of these algorithms. READ MORE
-
4. A study of the s-step biconjugate gradient method
University essay from Lunds universitet/Matematik (naturvetenskapliga fakulteten); Lunds universitet/MatematikcentrumAbstract : In this thesis we will examine how to solve linear systems using the s-step biconjugate gradient algorithm, which is an iterative method based on the Krylov subspaces. It is useful especially when we have a large and sparse matrix. READ MORE
-
5. Simple formally verified compiler in Lean
University essay from Uppsala universitet/Institutionen för informationsteknologiAbstract : Computer checked proofs that a compiler is correct are important for increasing the confidence in programs. This report presents a simple compiler and a proof that the compiler is correct for terminating evaluations using the interactive theorem prover Lean, based on Concrete Semantics: with Isabelle/HOL. READ MORE