cppf Goto Github PK

backward-difference-interpolation

Newton's (Newton-Gregory) Backward Difference formula is a way of approximating a function with an nth degree polynomial passing through (n+1) equally spaced points.

basic-parser

LLVM based parser in C++ for simpler BASIC.

basic-proposal

You have to design your own programming language ...

basic-scanner

Using of "flex" scanner for learning.

bisection-root

The Bisection method is a root-finding method that applies to any continuous functions for which one knows two values with opposite signs.

central-difference-interpolation

Stirling's Central Difference interpolation gives the average of the values obtained by Gauss forward and backward interpolation formulae.

cppf.github.io

Website for C/C++ header libraries.

divided-difference-interpolation

Newton’s divided difference interpolation formula is a interpolation technique used when the interval difference is not same for all sequence of values.

extra-array

Generic array in C.

extra-boolean

Boolean data type has two possible truth values to represent logic.

extra-lib-todo

Header-only library for C++

extra-macroarg

Manage arguments of macros in C.

extra-swap

Macros to swap variables in C.

fixed-point-root

Fixed-point iteration is a method of computing fixed points of a function, which is used with Newton's method to find roots of a differentiable function.

forward-difference-interpolation

Newton's (Newton-Gregory) Forward Difference formula is a way of approximating a function with an nth degree polynomial passing through (n+1) equally spaced points.

hello-world

A "Hello, World!" is an introductory computer program.

interpreter_expression

first step to be a number only expression

lagrange-interpolation

The Lagrange interpolation formula is a way to find a polynomial which takes on certain values at arbitrary points.

learn_struct

how can one return a struct in c++?

map_learn

Surprised that map["x"] = 1; map[id] => 0; where id = "x".

mpi-boruvka-mst

Get Minimum Spanning Tree of a connected Graph using Boruvka's Algorithm and MPI.

net-statistics

newton-root

Newton's (Newton–Raphson) method is a root-finding algorithm which produces successively better approximations to the roots of a real-valued function.

number-base-conversion

Base conversion is a method of changing the representation of a number from one set of symbols to another.

nvgraph.sh

CLI for nvGraph, which is a GPU-based graph analytics library written by NVIDIA, using CUDA.

opencv4-build

Ubuntu 18.04 build files of OpenCV 4.0.1

rectangular-integration

Rectangular integration is a numerical integration technique that approximates the integral of a function with a rectangle.

regula-falsi-root

The Regula–Falsi Method is a numerical method for estimating the roots of a polynomial f(x).

secant-root

The Secant method is a root-finding algorithm that uses a succession of roots of secant lines to better approximate a root of a function f.

trapezoidal-integration

Trapezoidal Rule is an integration rule that evaluates the area under the curves by dividing the total area into smaller trapezoids.