Examples of RealQRDecomposition

stallone.algebra.RealQRDecomposition
QR decomposition.

For an m-by-n matrix A with m >= n, the QR decomposition is an m-by-n orthogonal matrix Q and an n-by-n upper triangular matrix R so that
```
 A = Q*R. 
```
The QR decompostion always exists, even if the matrix does not have full rank, so the method will never fail.

The primary use of the QR decomposition is in the least squares solution of nonsquare systems of simultaneous linear equations. This will fail if {@link #isFullRank()} returns false.
@author Martin Senne

Examples of stallone.algebra.RealQRDecomposition


    }


    public IQRDecomposition QRSolver(final IDoubleArray A)
    {
        final IQRDecomposition decomposition = new RealQRDecomposition();
        decomposition.setMatrix(A);


        return decomposition;


    }

View Full Code Here

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.