Improving MATLAB's isprime performance without arbitrary-precision arithmetic

08/08/2021
by   Travis Near, et al.
0

MATLAB is a numerical computing platform used by scientists, engineers, mathematicians, and students which contains many mathematical functions, including isprime. MATLAB's isprime function determines which elements of an input array are prime. This research details modular arithmetic techniques, the Miller-Rabin primality test, vectorized operations, and division-minimizing strategies which harness the power of MATLAB's capabilities to improve isprime's performance. The results are typically 5 to 10 times faster for small integers and many hundreds of times faster for large integers and long arrays.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/31/2019

Efficient and secure modular operations using the Adapted Modular Number System

The Adapted Modular Number System (AMNS) is a sytem of representation of...
research
01/19/2021

Game values of arithmetic functions

Arithmetic functions in Number Theory meet the Sprague-Grundy function f...
research
06/18/2018

Numerical Evaluation of Elliptic Functions, Elliptic Integrals and Modular Forms

We describe algorithms to compute elliptic functions and their relatives...
research
10/11/2021

Learning Division with Neural Arithmetic Logic Modules

To achieve systematic generalisation, it first makes sense to master sim...
research
01/06/2021

On long arithmetic progressions in binary Morse-like words

We present results on the existence of long arithmetic progressions in t...
research
02/14/2018

500+ Times Faster Than Deep Learning (A Case Study Exploring Faster Methods for Text Mining StackOverflow)

Deep learning methods are useful for high-dimensional data and are becom...
research
10/16/2020

The Polylogarithm Function in Julia

The polylogarithm function is one of the constellation of important math...

Please sign up or login with your details

Forgot password? Click here to reset