Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Abstract    present an algorithm that can find all the eigenvalues of an  n  ×  n  symmetric Pascal matrices in O( n  2 log  n ) operations.  take advantage of real symmetry and the Pascal structure. Our scheme consists of an O( n  2 log  n ) Lanczos tridiagonalization procedure and an O( n ) QR diagonalization method and the Fast Fourier Transform (FFT).
['Xiang Wang', 'Zhou Jituan']
I am writing a research paper on a idea A fast eigenvalue algorithm for Pascal matrices
[{"from": "human", "value": "I am writing a research paper on a idea A fast eigenvalue algorithm for Pascal matrices"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Abstract    present an algorithm that can find all the eigenvalues of an  n \u00a0\u00d7\u00a0 n  symmetric Pascal matrices in O( n  2 log\u00a0 n ) operations.  take advantage of real symmetry and the Pascal structure. Our scheme consists of an O( n  2 log\u00a0 n ) Lanczos tridiagonalization procedure and an O( n ) QR diagonalization method and the Fast Fourier Transform (FFT)."}]