Matters Computational [pdf]
The FXT page hosts a library of efficient algorithms, complemented by the fxtbook "Matters Computational." Authored by Jörg Arndt, it offers free downloads, demo programs, and comprehensive documentation on various computational topics.
Read original article
![Matters Computational [pdf]](/_next/image?url=https%3A%2F%2Fd1gedca7wo5ayv.cloudfront.net%2Fnews_image_40841355&w=1920&q=75)
The FXT page offers a library of low-level algorithms focusing on bit-manipulations, combinatorial generation, and fast transforms. Accompanied by the fxtbook "Matters Computational," the library emphasizes performance with routines known for their speed. The page provides access to download the latest FXT version, demo programs, and extensive documentation covering various topics such as binary polynomials, combinatorial objects, and fast transforms like FFTs and Hartley transforms. The fxtbook, previously known as "Algorithms for Programmers," is available for free download and mirrors the printed version. It includes a detailed table of contents, errata list, and references to integer sequences from the On-Line Encyclopedia of Integer Sequences. Authored by Jörg Arndt, the FXT page serves as a valuable resource for those interested in algorithmic computations and mathematical data.
Related
F (2006)
F is a functional concatenative language with K3 list operations and Joy's dip combinator. It enforces one-time assignment, supports floating-point and symbolic datatypes, and emphasizes function-valence and -charge theories. The language is purely functional, prohibiting side-effects and reassignment, with various primitives for arithmetic, logic, and list operations. F also provides interactive commands for debugging and manipulation, focusing on simplicity, efficiency, and functional programming paradigms.
As you learn Forth, it learns from you (1981)
The Forth programming language is highlighted for its unique features like extensibility, speed, and efficiency. Contrasted with Basic, Forth's threaded code system and data handling methods make it versatile.
Show HN: High-frequency trading and market-making backtesting tool with examples
The GitHub URL leads to the "HftBacktest" project, a Rust framework for high-frequency trading. It offers detailed simulation, order book reconstruction, latency considerations, multi-asset backtesting, and live trading bot deployment.
A FORTH compiler tutorial in x86 asm (2009)
This text introduces a tutorial and compiler for FORTH, a minimalist programming language known for creating complete operating systems in a few thousand lines. It covers FORTH's structure, direct threaded code, setup on Linux, and additional learning resources.
Convolutions, Fast Fourier Transform and Polynomials
Alvaro Revuelta explains efficient polynomial multiplication using Convolution, Fast Fourier Transform (FFT), and Python. FFT reduces complexity from $O(n^2)$ to $O(nlogn), showcasing significant efficiency gains for high-degree polynomials.
2 commentsRelated
F (2006)
F is a functional concatenative language with K3 list operations and Joy's dip combinator. It enforces one-time assignment, supports floating-point and symbolic datatypes, and emphasizes function-valence and -charge theories. The language is purely functional, prohibiting side-effects and reassignment, with various primitives for arithmetic, logic, and list operations. F also provides interactive commands for debugging and manipulation, focusing on simplicity, efficiency, and functional programming paradigms.
As you learn Forth, it learns from you (1981)
The Forth programming language is highlighted for its unique features like extensibility, speed, and efficiency. Contrasted with Basic, Forth's threaded code system and data handling methods make it versatile.
Show HN: High-frequency trading and market-making backtesting tool with examples
The GitHub URL leads to the "HftBacktest" project, a Rust framework for high-frequency trading. It offers detailed simulation, order book reconstruction, latency considerations, multi-asset backtesting, and live trading bot deployment.
A FORTH compiler tutorial in x86 asm (2009)
This text introduces a tutorial and compiler for FORTH, a minimalist programming language known for creating complete operating systems in a few thousand lines. It covers FORTH's structure, direct threaded code, setup on Linux, and additional learning resources.
Convolutions, Fast Fourier Transform and Polynomials
Alvaro Revuelta explains efficient polynomial multiplication using Convolution, Fast Fourier Transform (FFT), and Python. FFT reduces complexity from $O(n^2)$ to $O(nlogn), showcasing significant efficiency gains for high-degree polynomials.