computational-math

🧮 Solving the Black-Scholes equation by the finite-difference methods and researching of the Cuthill-McKee and the minimum degree algorithms

High-performance algorithmic solutions to Project Euler problems. Built to be flexible: these scripts don't just find the answer they provide a framework to solve the problem for any given input.

Implementação das séries de Taylor das funções seno e cosseno utilizando a linguagem Haskell, explorando conceitos fundamentais da programação funcional, como recursão, funções de alta ordem, listas infinitas e avaliação preguiçosa.

Repository containing algorithmic solutions to Project Euler challenges. Each solution has been methodically developed, optimized, and rigorously tested. Engage in mathematical and computational problem-solving.

A Python library for efficient number theory and abstract algebra.

A project to analyze and compare the performance of Strassen’s algorithm for matrix multiplication against standard matrix multiplication techniques.

Unleash the power of mathematics with this interactive Graph Generator! 🧮📈 Visualize Cartesian, Parametric, Polar, and 3D Surface equations dynamically. Simply enter your mathematical expression, tweak the parameters, and watch your graph come to life! 🚀🎨

Optimized prime finder for p² + 4q² form — NumPy vectorized sieve, multiprocessing, LRU caching, infinite stream generator

Visualizes Fourier series with rotating vectors (epicycles) using Unity.

A lean 4 project for finding and verifying prime number patterns via WSL. Includes formal proofs of impossible constellations and verified computational searches for twin, triplet, and quadruplet primes.

Console project allows you to convert numbers to all other digital systems.

🧪λ Функциональное программирование: Лабораторная работа №3

Репозиторий с выполнениями лабораторных работ по вычислительной математике (computational mathematics)

My GitHub main page.

🔢 Collection of High-Performance Algorithms and Computational Math written in 100% pure Sorayunara (.sora)

⏳Computational math MIPT course homeworks

Software related to the paper, "Sieve-Theoretic Reformulation of Goldbach’s Conjecture"

Modular signatures of integers via prime clocks and the Chinese Remainder Theorem

This project implements two methods for calculating Oddonacci numbers using Java: a linear tail-recursive approach and a multiple recursive approach. These methods are implemented to study their performance in terms of execution time and efficiency.

MIPT course in computational mathematics.