Statistics – Computation
Scientific paper
Jan 1994
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1994gregr..26...21a&link_type=abstract
General Relativity and Gravitation, Volume 26, Issue 1, pp.21-40
Statistics
Computation
1
Scientific paper
Algorithms for the symbolic computation of the NP spin coefficients and curvature components for a given null coframe based on the structural equations of Cartan and the complex vectorial formalism of Debever are described. The efficiency of the algorithms is compared theoretically and also empirically in a number of test cases using implementations in the computer algebra system Maple. The test results confirm the theoretical superiority of the algorithm based on Debever's formalism over the one based directly on Cartan's first structural equations for the computation of the spin coefficients both with respect to execution time and storage requirements. The algorithm for the computation of the curvature components based on Debever's formalism is generally superior to the one based on Cartan's second structural equations but the advantage is not as marked as for the spin coefficients.
Allen Stephanie
Fee G. J.
Kachura A. T.
Letniowski F. W.
McLenaghan Raymond G.
No associations
LandOfFree
Comparison of algorithms for the symbolic computation of the NP spin coefficients and curvature components does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Comparison of algorithms for the symbolic computation of the NP spin coefficients and curvature components, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Comparison of algorithms for the symbolic computation of the NP spin coefficients and curvature components will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-869458