Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Find the sum of Eigen Values of the given N*N matrix

  • Last Updated : 10 May, 2021

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: 6
Input: mat[][] = { 
{1, 2, 3, 4}, 
{5, 6, 7, 8}, 
{9, 10, 11, 12}, 
{13, 14, 15, 16}} 
Output: 34 
 

Attention reader! All those who say programming isn't for kids, just haven't met the right mentors yet. Join the  Demo Class for First Step to Coding Course, specifically designed for students of class 8 to 12. 

The students will get to learn more about the world of programming in these free classes which will definitely help them in making a wise career choice in the future.

 

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;
}
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..
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
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...
Javascript



<script>
 
// Javascript implementation of the approach
var N = 4;
 
// Function to return the sum of eigen
// values of the given matrix
function sumEigen(mat)
{
    var sum = 0;
 
    // Calculate the sum of
    // the diagonal elements
    for (var i = 0; i < N; i++)
        sum += (mat[i][i]);
 
    return sum;
}
 
// Driver code
var mat = [ [ 1, 2, 3, 4 ],
                  [ 5, 6, 7, 8 ],
                  [ 9, 10, 11, 12 ],
                  [ 13, 14, 15, 16 ] ];
document.write( sumEigen(mat));
 
</script>
Output: 
34
 



My Personal Notes
arrow_drop_up
Previous
Smallest number greater or equals to N such that it has no odd positioned bit set
Next

Amazon SDE I Off-campus Hiring
Recommended Articles
Page :
Generate a Matrix such that given Matrix elements are equal to Bitwise OR of all corresponding row and column elements of generated Matrix
15, Jan 21
Generate matrix from given Sparse Matrix using Linked List and reconstruct the Sparse Matrix
19, Apr 21
Calculate sum of the main diagonal and the number of rows and columns containing repeated values in a square matrix
16, Mar 21
Maximize sum of N X N upper left sub-matrix from given 2N X 2N matrix
28, Feb 17
Construct a Matrix such that each cell consists of sum of adjacent elements of respective cells in given Matrix
11, Nov 20
Generate a matrix having each element equal to the sum of specified submatrices of a given matrix
03, Feb 21
Construct a Matrix of size NxN with values in range [1, N^2] as per given conditions
11, Jun 20
Check if a given matrix can be converted to another given matrix by row and column exchanges
30, Apr 20
Maximize Matrix sum by replacing 0s such that Matrix remains sorted
29, Sep 21
Create matrix whose sum of diagonals in each sub matrix is even
13, Jul 20
Construct a square Matrix whose parity of diagonal sum is same as size of matrix
09, Aug 20
Find trace of matrix formed by adding Row-major and Column-major order of same matrix
04, Dec 17
Maximum determinant of a matrix with every values either 0 or n
01, Feb 17
Number of rows and columns in a Matrix that contain repeated values
16, Apr 20
Min number of moves to traverse entire Matrix through connected cells with equal values
29, Jun 20
Check if it is possible to make the given matrix increasing matrix or not
30, May 18
Program to convert given Matrix to a Diagonal Matrix
27, Nov 18
Maximum trace possible for any sub-matrix of the given matrix
12, Mar 19
Minimum swaps needed to convert given Binary Matrix A to Binary Matrix B
30, Jun 21
Minimum number of steps to convert a given matrix into Upper Hessenberg matrix
27, Jun 19
Minimum number of steps to convert a given matrix into Diagonally Dominant Matrix
04, Jul 19
Minimize count of adjacent row swaps to convert given Matrix to a Lower Triangular Matrix
06, Oct 20
Convert a Matrix into another Matrix of given dimensions
13, Jan 21
Coordinates of the last cell in a Matrix on which performing given operations exits from the Matrix
19, Feb 21
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
gp6
@gp6
Vote for difficulty





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!