|
RcdMathLib_doc
Open Source Library for Linear and Non-linear Algebra
|
| combinatorics.c | Calculate possible without repetition in ascending order |
| combinatorics.h | Calculate possible without repetition in ascending order |
| damped_newton_raphson.c | Implement the damped Newton–Raphson algorithm |
| damped_newton_raphson.h | Implement the damped Newton–Raphson algorithm |
| dist_based_fi.c | Error function of distance-based localization systems |
| dist_based_fi.h | Error function of distance-based localization systems |
| dist_based_jacobian.c | Jacobian function of distance-based localization systems |
| dist_based_jacobian.h | Jacobian function of distance-based localization systems |
| dist_based_position.c | Functions of distance-based localization systems |
| dist_based_position.h | Functions of distance-based localization systems |
| distance_based_test.c | Examples of localization algorithms of distance-based positioning systems |
| distance_based_test.h | Examples of localization algorithms of distance-based positioning systems |
| DOP.c | Compute the Position Dilution of Precision (PDOP) |
| DOP.h | Compute the Position Dilution of Precision (PDOP) |
| fsolve.c | Solve multi-variant nonlinear equation systems |
| fsolve.h | Solve multi-variant nonlinear equation systems |
| fsolve_test.c | Examples of solving non-linear equation systems |
| fsolve_test.h | Examples of solving non-linear equation systems |
| givens_test.c | Examples of the Givens algorithm |
| givens_test.h | Examples of the Givens algorithm |
| householder_test.c | Examples of the Householder algorithm |
| householder_test.h | Examples of the Householder algorithm |
| levenberg_marquardt.c | Implement the Levenberg–Marquardt (LVM) algorithm |
| levenberg_marquardt.h | Implement the Levenberg–Marquardt (LVM) algorithm |
| loc_gauss_newton.c | Implement the Gauss–Newton algorithm |
| loc_gauss_newton.h | Implement the Gauss–Newton algorithm for position optimization |
| loc_levenberg_marquardt.c | Implement the Levenberg–Marquardt (LVM) algorithm |
| loc_levenberg_marquardt.h | Implement the Levenberg–Marquardt (LVM) algorithm for position optimization |
| lu_decomp.c | Computes the LU decomposition of the matrix |
| lu_decomp.h | Computes the LU decomposition of the matrix |
| lu_decomp_test.c | Examples of the LU algorithm with pivoting |
| lu_decomp_test.h | Examples of the LU algorithm with pivoting |
| magnetic_based_fi.c | Error function of DC-pulsed, magnetic localization system |
| magnetic_based_fi.h | Error function of DC-pulsed, magnetic localization system |
| magnetic_based_jacobian.c | Jacobian function of DC-pulsed, magnetic localization system |
| magnetic_based_jacobian.h | Jacobian function of DC-pulsed, magnetic localization system |
| magnetic_based_position.c | Functions of of DC-pulsed, magnetic localization system |
| magnetic_based_position.h | Functions of of DC-pulsed, magnetic localization system |
| magnetic_based_test.c | Examples of localization algorithms of magnetic-based positioning systems |
| magnetic_based_test.h | Examples of localization algorithms of magnetic-based positioning systems |
| matrix.c | Matrix computations |
| matrix.h | Matrix computations |
| matrix_test.c | Examples of matrix computations |
| matrix_test.h | Examples of matrix computations |
| modified_gauss_newton.c | Implement the Gauss–Newton algorithm |
| modified_gauss_newton.h | Implement the Gauss–Newton algorithm |
| moore_penrose_pinv_test.c | Examples of the Moore–Penrose algorithm |
| moore_penrose_pinv_test.h | Examples of the Moore–Penrose algorithm |
| moore_penrose_pseudo_inverse.c | Moore–Penrose algorithm to compute the pseudo-inverse of a rectangular matrix |
| moore_penrose_pseudo_inverse.h | Moore–Penrose algorithm to compute the pseudo-inverse of a matrix |
| multipath_algo_own_norm_distr_test.c | Example of the algorithm for the recognition and mitigation of multipath effects |
| multipath_algo_own_norm_distr_test.h | Example of the algorithm for the recognition and mitigation of multipath effects |
| multipath_dist_detection_mitigation.c | Implement the Multipath Distance Detection and Mitigation (MDDM) algorithm |
| multipath_dist_detection_mitigation.h | Implement the Multipath Distance Detection and Mitigation (MDDM) algorithm |
| newton_raphson.c | Implement the Newton–Raphson algorithm |
| newton_raphson.h | Implement the Newton–Raphson algorithm |
| norm_dist_rnd_generator.c | Generating normally distributed random numbers |
| norm_dist_rnd_generator.h | Generating normally distributed random numbers |
| optimization_test.c | Examples of optimization algorithms |
| optimization_test.h | Examples of optimization algorithms |
| pos_algos_common_test.c | Examples of common algorithms of localization systems |
| pos_algos_common_test.h | Examples of common algorithms of localization systems |
| position_optimization_test.c | Examples of optimization algorithms for localization systems |
| position_optimization_test.h | Examples of optimization algorithms for localization systems |
| pseudo_inverse.h | Compute the pseudo-inverse of a matrix |
| qr_common.c | Common definitions and implementations for the QR-decomposition. Provide necessary methods to construct Q- and R- matrices using |
| qr_common.h | Common definitions and implementations for the QR-decomposition. Provide necessary methods to construct Q- and R- matrices using |
| qr_givens.c | Givens algorithm for the QR-decomposition. Provide necessary methods to construct Q- and R- matrices using Givens rotations. A = QR, where Q is an (m n)-matrix with orthonormal columns and R is an (n n) upper triangular matrix |
| qr_givens.h | Givens algorithm for the QR-decomposition. Provide necessary methods to construct Q- and R- matrices using Givens rotations. A = QR, where Q is an (m n)-matrix with orthonormal columns and R is an (n n) upper triangular matrix |
| qr_householder.c | Householder algorithm for the QR-decomposition |
| qr_householder.h | Householder algorithm for the QR-decomposition |
| qr_pinv_test.c | Examples of the QR-based pseudo-inverse algorithm |
| qr_pinv_test.h | Examples of the QR-based pseudo-inverse algorithm |
| qr_pseudo_inverse.c | QR decomposition algorithms to compute the pseudo-inverse of a matrix |
| qr_pseudo_inverse.h | QR decomposition algorithms to compute the pseudo-inverse of a matrix |
| shell_sort.c | Implement the Shell sort algorithm |
| shell_sort.h | Implement the Shell sort algorithm |
| solve.c | Enables to solve systems of linear equations Ax = b for x |
| solve.h | Enables to solve systems of linear equations Ax = b for x |
| solve_test.c | Examples of solving linear equation systems |
| solve_test.h | Examples of solving linear equation systems |
| svd.c | Algorithm for the Singular Value Decomposition (SVD). Provide necessary methods to compute the compact SVD of a matrix. A = U*S*V, where U is a (m x l) orthogonal matrix, S is a (l x l) diagonal matrix, V is a (l x n) orthogonal matrix, and l = min(m,n). The SVD is computed by using the Golub–Kahan–Reinsch algorithm that works in two phases: bidiagonalization and a reduction to the diagonal form phase |
| svd.h | Algorithm for the Singular Value Decomposition (SVD) |
| svd_test.c | Examples of the SVD algorithm |
| svd_test.h | Examples of the SVD algorithm |
| trilateration.c | Implement the trilateration algorithm |
| trilateration.h | Implement the trilateration algorithm |
| utils.c | Utilities for linear algebra. Utility-functions are needed by the linear algebra-module as well as other modules such as the position algorithm-module |
| utils.h | Utilities for linear algebra |
| utils_test.c | Examples of the utility functions |
| utils_test.h | Examples of the utility functions |
| vector.c | Vector computations. Vector computations include operations such as addition, subtraction, and inner product (dot product) |
| vector.h | Vector computations |
| vector_test.c | Examples of vector computations |
| vector_test.h | Examples of vector computations |