Find the sum of Eigen Values of the given N*N matrix
Given an N*N matrix mat[][], the task is to find the sum of Eigen values of the given matrix.
Examples:
Input: mat[][] = {
{2, -1, 0},
{-1, 2, -1},
{0, -1, 2}}
Output: 6Input: mat[][] = {
{1, 2, 3, 4},
{5, 6, 7, 8},
{9, 10, 11, 12},
{13, 14, 15, 16}}
Output: 34
Approach: The sum of Eigen values of a matrix is equal to the trace of the matrix. The trace of an n × n square matrix A is defined to be the sum of the elements on the main diagonal (the diagonal from the upper left to the lower right) of A.
Below is the implementation of the above approach:
C++
// C++ implementation of the approach #include <bits/stdc++.h> using namespace std; #define N 4 // Function to return the sum of eigen // values of the given matrix int sumEigen(int mat[N][N]) { int sum = 0; // Calculate the sum of // the diagonal elements for (int i = 0; i < N; i++) sum += (mat[i][i]); return sum; } // Driver code int main() { int mat[N][N] = { { 1, 2, 3, 4 }, { 5, 6, 7, 8 }, { 9, 10, 11, 12 }, { 13, 14, 15, 16 } }; cout << sumEigen(mat); return 0; } |
chevron_right
filter_none
Java
// Java implementation of the approach import java.io.*; class GFG { static int N = 4; // Function to return the sum of eigen // values of the given matrix static int sumEigen(int mat[][]) { int sum = 0; // Calculate the sum of // the diagonal elements for (int i = 0; i < N; i++) sum += (mat[i][i]); return sum; } // Driver code public static void main (String[] args) { int mat[][] = { { 1, 2, 3, 4 }, { 5, 6, 7, 8 }, { 9, 10, 11, 12 }, { 13, 14, 15, 16 } }; System.out.println (sumEigen(mat)); } } // The code is contributed by Tushil.. |
chevron_right
filter_none
Python3
# Python3 implementation of the approach N=4 # Function to return the sum of eigen # values of the given matrix def sumEigen(mat): sum = 0 # Calculate the sum of # the diagonal elements for i in range(N): sum += (mat[i][i]) return sum # Driver code mat= [ [ 1, 2, 3, 4 ], [ 5, 6, 7, 8 ], [ 9, 10, 11, 12 ], [ 13, 14, 15, 16 ] ] print(sumEigen(mat)) # This code is contributed by mohit kumar 29 |
chevron_right
filter_none
C#
// C# implementation of the approach using System; class GFG { static int N = 4; // Function to return the sum of eigen // values of the given matrix static int sumEigen(int [,]mat) { int sum = 0; // Calculate the sum of // the diagonal elements for (int i = 0; i < N; i++) sum += (mat[i,i]); return sum; } // Driver code static public void Main () { int [,]mat = { { 1, 2, 3, 4 }, { 5, 6, 7, 8 }, { 9, 10, 11, 12 }, { 13, 14, 15, 16 } }; Console.Write(sumEigen(mat)); } } // The code is contributed by ajit... |
chevron_right
filter_none
Output:
34
Recommended Posts:
- Maximum determinant of a matrix with every values either 0 or n
- Find trace of matrix formed by adding Row-major and Column-major order of same matrix
- Find if a 2-D array is completely traversed or not by following the cell values
- Find sub-matrix with the given sum
- Find row with maximum sum in a Matrix
- Find the mean vector of a Matrix
- Find if given matrix is Toeplitz or not
- Find a sub matrix with maximum XOR
- Find number of cavities in a matrix
- Find Nth term (A matrix exponentiation example)
- Program to find all types of Matrix
- Find single Movement in a Matrix
- Find safe cells in a matrix
- Find maximum element of each row in a matrix
- Find orientation of a pattern in a matrix
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.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.
- Find the number of p-sided squares in a grid with K blacks painted
- Count number of ways to reach destination in a Maze using BFS
- Find the sum of elements of the Matrix generated by the given rules
- Minimum number of steps to convert a given matrix into Diagonally Dominant Matrix
- Print all the sub diagonal elements of the given square matrix
- Print an N x M matrix such that each row and column has all the vowels in it
- Print all the super diagonal elements of the given square matrix
- Check if Matrix remains unchanged after row reversals
- Minimum number of steps to convert a given matrix into Upper Hessenberg matrix
- Maximise matrix sum by following the given Path
