Spelling suggestions: "subject:"exact arithmetic"" "subject:"axact arithmetic""
1 |
Lazy exact real arithmetic using floating point operationsMcCleeary, Ryan 01 August 2019 (has links)
Exact real arithmetic systems can specify any amount of precision on the output of the computations. They are used in a wide variety of applications when a high degree of precision is necessary. Some of these applications include: differential equation solvers, linear equation solvers, large scale mathematical models, and SMT solvers. This dissertation proposes a new exact real arithmetic system which uses lazy list of floating point numbers to represent the real numbers. It proposes algorithms for basic arithmetic computations on these structures and proves their correctness. This proposed system has the advantage of algorithms which can be supported by modern floating point hardware, while still being a lazy exact real arithmetic system.
|
2 |
Constructible Numbers Exact ArithmeticWennberg, Pimchanok January 2024 (has links)
Constructible numbers are the numbers that can be constructed by using compass and straightedge in a finite sequence. They can be produced from natural numbers using only addition, subtraction, multiplication, division, and square root operations. These operations can be repeated, which creates more complicated expressions for a mathematical object. Calculation by computers only gives an approximation of the exact value, which could lead to a loss of accuracy. An alternative to approximation is exact arithmetic, which is the computation to find an exact value without rounding errors. In this thesis, we have presented a method of computing with the exact value of constructible numbers, specifically the rational numbers and its field extension as well as repeated field extension, through the basic operations. However, we only limit our implementation to the quadratic polynomial and the operations between two numbers of the same extension field. Future work on polynomials with higher degrees and algorithms to include operations with numbers from different extension fields and expression of number as an element of a new extension field remains to be done.
|
3 |
[en] ROBUST ALGORITHM FOR TRIANGULATED SURFACES INTERSECTION / [pt] ALGORITMO ROBUSTO PARA INTERSEÇÃO DE SUPERFÍCIES TRIANGULARESRICARDO CAVALCANTI MARQUES 13 January 2015 (has links)
[pt] O objetivo deste trabalho é projetar e implementar um algoritmo eficiente, confiável e preciso para a interseção de superfícies triangulares que representam modelos geológicos complexos. A grandeza das coordenadas espaciais desses modelos, em contraste com o relativamente pequeno tamanho médio de seus elementos, levam a problemas numéricos que podem gerar modelos ruins ou a erros graves do modelador geométrico. Além disso, um alto nível de precisão é desejável para se evitar erros de modelagem que possam gerar acidentes no campo de exploração. Neste trabalho, é proposta uma solução para reduzir os problemas numéricos com o uso de algumas estratégias geométricas e da Aritmética Exata. Exemplos demonstram estes problemas de robustez e validam o algoritmo proposto. / [en] The goal of this work is to design and to develop an efficient, reliable, and accurate algorithm for the intersection of triangular surfaces that represent complex geological models. The wide range of these models coordinates in contrast with the relatively small average size of its elements lead up to numerical instability problems, which may generate bad models or crash the geometric modeler. Additionally, a high degree of precision is desired in the model to avoid accidents in the field of oil exploration. In this work, it is proposed a solution to reduce the numerical issues by the use of some geometrical strategies and the Exact Arithmetic. Examples are used to demonstrate these robustness problems and to validate the proposed algorithm.
|
Page generated in 0.0654 seconds