A Hilbert Matrix is a square matrix whose each element is a unit fraction.
- It is a symmetric matrix.
- Its determinant value is always positive.
- Hilbert Number
- Minimum steps required to convert the matrix into lower hessenberg matrix
- Minimum number of steps to convert a given matrix into Diagonally Dominant Matrix
- Minimum number of steps to convert a given matrix into Upper Hessenberg matrix
- Check if matrix can be converted to another matrix by transposing square sub-matrices
- Circular Matrix (Construct a matrix with numbers 1 to m*n in spiral way)
- Program to check diagonal matrix and scalar matrix
- Count frequency of k in a matrix of size n where matrix(i, j) = i+j
- Maximize sum of N X N upper left sub-matrix from given 2N X 2N matrix
- Check if it is possible to make the given matrix increasing matrix or not
- Program to check if a matrix is Binary matrix or not
- C++ program to Convert a Matrix to Sparse Matrix
- Program to convert given Matrix to a Diagonal Matrix
- Maximum trace possible for any sub-matrix of the given matrix
- Find trace of matrix formed by adding Row-major and Column-major order of same matrix
Input : N = 2 Output : 1 0.5 0.5 0.33 Input : N = 3 Output : 1.0000 0.5000 0.3333 0.5000 0.3333 0.2500 0.3333 0.2500 0.2000
Mathematically, Hilbert Matrix can be formed by the given formula:
Let H be a Hilbert Matrix of NxN. Then H(i, j) = 1/(i+j-1)
Below is the basic implementation of the above formula.
1 0.5 0.333333 0.5 0.333333 0.25 0.333333 0.25 0.2
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.