The m-file finds the elimination matrices (and scaling matrices) to reduce any A matrix to the identity matrix using the Gauss-Jordan elimination method without pivoting. Using the matrices gotten it computes the inverse of the A matrix.
VMatrixLib is a little, handy, Java matrix library which implements a set of utility functions (such as calculus of the determinant of a matrix, calculus of the rank, inverse matrix, and many others..) that anyone who have to use matrices needs.
CUTE works with all modern browsers without the need of additional plugins.
Example
syms a b c d e f g h i; cute ({inv([a, b, c; d, e, f; g, h, i]); ... sqrt(sinh(a)/acosh(b) - ... 42*log(c)) + ... ...
DIRECT METHODS FOR SOLUTION OF LINEAR SYSTEMS Gaussian Elimination Algorithm Gauss-Jordan Algorithm Factoring algorithm
ITERATIVE METHODS FOR SOLVING SYSTEMS OF EQUATIONS Jacobi algorithm Gauss-Seidel algorithm
This is a templated library of numerical base classes which implement basic data structures like complex numbers, dynamic vectors, static vectors, different types of matrices like full matrices, band matrices, sparse matrices, etc. and also...
This script will determine the lower-upper factorization of a square matrix "A" through Gauss elimination.
Anthropomorphic arm with 6 DOF and spherical wrist It calculates the Inverse Kinematic of an Anthropomorphic arm with 6 DOF. 'q' is the solutions in radiant and K is the direct Kinematic matrix.
K = [ n s a p; 0 0 0...
It calculates the Inverse Kinematic of an Anthropomorphic arm with 3 DOF. 'q' is the solutions in radiant and K is the direct Kinematic matrix.
K = [ n s a p; 0 0 0 1] where n, s, a are three vectors fo 3 elements...
function W = euklid_W(ws,d,n) function W = euklid_invW(ws,d,n) PURPOSE: create an (inverse) euklidean distance spatial weight matrix (n x m 'moving-window' style matrix with distance to center cell weighted.) ...
Calculates the inverse I of a matrix A.
In this project i have coded (C++) Gauss elimination matrix solver for cfd applications
Inverse every 2D matrix slice (the first two dimensions) for multi-dimensional array M: M(:,:,p,q,...) * X(:,:,p,q,...) = repmat(eye(m),[1,1,p,q,...]), where input M is a N-D array (m x m x [p x q x ...]), for all possible...
The code implements the so called Faddeev-Leverrier algorithm to compute the coefficients of the characteristic polynomial of a given matrix and to get the inverse of the matrix without extra cost.
write_matrix_bin(f,m) saves the matrix "m" in a binary file "f". write_matrix_bin is a lot faster than the built in function save(), and takes up much less diskspace than the old "save -v6" which doesn't use...
This is an implementantion of the Gauss algorithm for block tridiagonal systems. The blocks must all be the same size. This approach requires for loops so is of value when the matrix is large. Ideal for solving 1D BVPs using finite element or...
We can exploit the symmetry of a real, positive definite, symmetric matrix by using the Cholesky decomposition to compute the inverse.
The built-in MATLAB inv function uses LU decomposition which requires extra pivots and operations....
this function is contains "Transformation" and "Inverse"...which means Transfom 2D matrix or image, and then the user can use the same function for inverse to return 2D matrix
The JSparse Matrix Package, developed by Philipp GeigenmA?ller during an internship at the prudsys AG in Chemnitz, Germany, is an extension of the well-known Java Matrix Package (JAMA) and allows the use of sparse matrices and related algorithms.
The project models a Matrix in JAVA with a complete Object Oriented approach, from its values to its access and indices. There are specialized classes for tables(2), cubes(3), and arbitrary(N) dimensions matrices
Open-source Java libraries, supporting generalized smart arrays and matrices with elements of any types (1 bit, 8/16/32/64-bit integers, 32/64-bit floating point values and any other Java types). The libraries contain a wide set of 2D-, 3D- and... |