×

NP: A maple package for performing calculations in the Newman-Penrose formalism. (English) Zbl 0613.53033

A symbolic algebra package is presented for performing computations in the Newman-Penrose formation. We illustrate the power of the package by using it to carry out a complex calculation that arises in the integration of the Petrov type-D vacuum field equations.

MSC:

53B50 Applications of local differential geometry to the sciences
83-04 Software, source code, etc. for problems pertaining to relativity and gravitational theory
83C05 Einstein’s equations (general structure, canonical formalism, Cauchy problems)

Software:

NP; Maple
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Buchberger, B. (1976).ACM SIGSAM Bull.,10, 3.
[2] Char, B. W., Fee, G. J., Geddes, K. O., Gonnet, G. H., and Monagan, M. B. (1986).J. Sym. Comp.,2, 2.
[3] Char, B. W., Geddes, K. O., Gonnet, G. H., and Watt, S. M. (1985).Maple User’s Guide (WATCOM Publications, Waterloo, Ontario).
[4] Char, B. W., Geddes, K. O., Gentleman, W. M., and Gonnet, G. H. (1983). InLecture Notes in Computer Science,162, p. 101.
[5] Czapor, S. R., and Geddes, K. O. (1986). Proceedings of the 1986 Symposium on Symbolic and Algebraic Computation (SYMSAC ’86), B. W. Char, ed., Waterloo, Ontario.
[6] Czapor, S. R., and McLenaghan, R. G. (1982).J. Math. Phys.,23, p. 2159. · Zbl 0495.53023
[7] Kramer, D., Stephani, H., Herlt, E., and MacCallum, M. (1980). InExact Solutions of Einstein’s Field Equations, E. Schmutzer, ed. (Cambridge University Press, Cambridge). · Zbl 0449.53018
[8] Newman, E., and Penrose, R. (1962).J. Math. Phys.,3, p. 566. · Zbl 0108.40905
[9] Pirani, F. A. E. (1964). InLectures on General Relativity, S. Deser and W. Ford, ed. (Prentice-Hall, New Jersey), 1964.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.