|
|
Effective Algorithms for High-Precision Computation of Elementary Functions
Chaloupka, Jan ; Kunovský, Jiří (referee) ; Šátek, Václav (advisor)
Nowadays high-precision computations are still more desired. Either for simulation on a level of atoms where every digit is important and inaccurary in computation can cause invalid result or numerical approximations in partial differential equations solving where a small deviation causes a result to be useless. The computations are carried over data types with precision of order hundred to thousand digits, or even more. This creates pressure on time complexity of problem solving and so it is essential to find very efficient methods for computation. Every complex physical problem is usually described by a system of equations frequently containing elementary functions like sinus, cosines or exponentials. The aim of the work is to design and implement methods that for a given precision, arbitrary elementary function and a point compute its value in the most efficent way. The core of the work is an application of methods based on AGM (arithmetic-geometric mean) with a time complexity of order $O(M(n)\log_2{n})$ 9(expresed for multiplication $M(n)$). The complexity can not be improved. There are many libraries supporting multi-precision atithmetic, one of which is GMP and is about to be used for efficent method implementation. In the end all implemented methods are compared with existing ones.
|
|
|
Monotonicity of functions which can be expressed using elementary functions
Peltan, Libor ; Bárta, Tomáš (advisor) ; Pyrih, Pavel (referee)
For certain types of functions expressible with formula (equivalently: functions from classes closed to arithmetic operations) under stated assumptions, we prove monotonicity at some neighbourhood of +∞. They are: formulas containing exp, log, sin, arctan, etc. with constrainted domain of these functions; power series with cofinite many coefficients positive; various classes of functions expressible with formulas with the requirement of preserving monotony in summation, or multiplication, or the monotony resulting from having a finite number of zero points; and finally formulas with square root. 1
|
|
| |
|
| |
|
|
Monotonicity of functions which can be expressed using elementary functions
Peltan, Libor ; Bárta, Tomáš (advisor) ; Pyrih, Pavel (referee)
For certain types of functions expressible with formula (equivalently: functions from classes closed to arithmetic operations) under stated assumptions, we prove monotonicity at some neighbourhood of +∞. They are: formulas containing exp, log, sin, arctan, etc. with constrainted domain of these functions; power series with cofinite many coefficients positive; various classes of functions expressible with formulas with the requirement of preserving monotony in summation, or multiplication, or the monotony resulting from having a finite number of zero points; and finally formulas with square root. 1
|
|
|
Effective Algorithms for High-Precision Computation of Elementary Functions
Chaloupka, Jan ; Kunovský, Jiří (referee) ; Šátek, Václav (advisor)
Nowadays high-precision computations are still more desired. Either for simulation on a level of atoms where every digit is important and inaccurary in computation can cause invalid result or numerical approximations in partial differential equations solving where a small deviation causes a result to be useless. The computations are carried over data types with precision of order hundred to thousand digits, or even more. This creates pressure on time complexity of problem solving and so it is essential to find very efficient methods for computation. Every complex physical problem is usually described by a system of equations frequently containing elementary functions like sinus, cosines or exponentials. The aim of the work is to design and implement methods that for a given precision, arbitrary elementary function and a point compute its value in the most efficent way. The core of the work is an application of methods based on AGM (arithmetic-geometric mean) with a time complexity of order $O(M(n)\log_2{n})$ 9(expresed for multiplication $M(n)$). The complexity can not be improved. There are many libraries supporting multi-precision atithmetic, one of which is GMP and is about to be used for efficent method implementation. In the end all implemented methods are compared with existing ones.
|
guest ::
