6 Commits

Author	SHA1	Message	Date
Stefan Müller	8d4a5c2ed8	Changed root finder to use base-2 exponent of bound ... Since the root isolation algorithm uses a power of two as bound anyway, it makes sense to use it's exponent in method interfaces and throughout the algorithm. This simplifies multiplications to cheap shifts and will make it easier to detect when the isolating interval size is 1. Also added some method documentation.	2024-05-26 17:31:37 +02:00
Stefan Müller	ab453b347d	Renamed root finding class and methods, now class methods	2024-05-26 14:23:31 +02:00
Stefan Müller	ae30889bbb	Fixed calculation of root-isolating intervals and tests	2024-05-25 02:51:00 +02:00
Stefan Müller	baa1f8f31f	Added bisection root finding algorithm with custom upper bound	2024-05-24 20:47:52 +02:00
Stefan Müller	53e3922654	Updated bisection root finding algorithm and test case	2024-05-24 20:22:06 +02:00
Stefan Müller	53827acf9b	Added new unit for polynomial root finding algorithm	2024-05-13 15:22:18 +02:00