Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The curvilinear coordinate method (C-method) is an exact method for analysing of electromagnetic waves scattering from rough surfaces. It is based on Maxll's equations under covariant form written in a non-orthogonal coordinate system. This method leads to an eigenvalue system. All the eigenvalues and eigenvectors of the scattering matrix are required. The QR algorithm seems to be a suitable solution for this high dimension, dense, non-symmetric and complex scattering matrix. ,  present the parallel QR algorithm that is specifically designed for the C-method.  define the "early shift" for the scattering matrix according to the property that  have observed.  mixed the "early shift", Wilkinson's shift and exceptional shift together to accelerate the convergence. Especially,  use the "early shift" first in order to have quick deflation of the real eigenvalues of the scattering matrix. The multi-window bulge chain chasing and parallel aggressive early deflation are used. The multi-window bulge chain chasing approach ensures that most computations are performed in 3 BLAS operations. The aggressive early deflation approach can detect deflation much quicker and thus accelerate convergence. Mixed MPI-OpenMP techniques are utilized for performing the codes to distributed memory platforms. Numerical experiments are performed and applications of this parallel QR algorithm are applied to a real physical problem of diffraction.
['Cihui Pan', 'Nahid Emad', 'Richard Dusséaux']
I am writing a research paper on a idea Parallel QR algorithm for the C-method: application to the diffraction by gratings and rough surfaces
[{"from": "human", "value": "I am writing a research paper on a idea Parallel QR algorithm for the C-method: application to the diffraction by gratings and rough surfaces"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The curvilinear coordinate method (C-method) is an exact method for analysing of electromagnetic waves scattering from rough surfaces. It is based on Maxll's equations under covariant form written in a non-orthogonal coordinate system. This method leads to an eigenvalue system. All the eigenvalues and eigenvectors of the scattering matrix are required. The QR algorithm seems to be a suitable solution for this high dimension, dense, non-symmetric and complex scattering matrix. ,  present the parallel QR algorithm that is specifically designed for the C-method.  define the \"early shift\" for the scattering matrix according to the property that  have observed.  mixed the \"early shift\", Wilkinson's shift and exceptional shift together to accelerate the convergence. Especially,  use the \"early shift\" first in order to have quick deflation of the real eigenvalues of the scattering matrix. The multi-window bulge chain chasing and parallel aggressive early deflation are used. The multi-window bulge chain chasing approach ensures that most computations are performed in 3 BLAS operations. The aggressive early deflation approach can detect deflation much quicker and thus accelerate convergence. Mixed MPI-OpenMP techniques are utilized for performing the codes to distributed memory platforms. Numerical experiments are performed and applications of this parallel QR algorithm are applied to a real physical problem of diffraction."}]