This HTML5 document contains 63 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n19https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
n9https://web.archive.org/web/20051023160408/http:/130.15.26.66/servlet/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
dbpedia-pthttp://pt.dbpedia.org/resource/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:List_of_contributors_to_general_relativity
dbo:wikiPageWikiLink
dbr:Cartan–Karlhede_algorithm
Subject Item
dbr:Curvature_invariant
dbo:wikiPageWikiLink
dbr:Cartan–Karlhede_algorithm
Subject Item
dbr:Index_of_physics_articles_(C)
dbo:wikiPageWikiLink
dbr:Cartan–Karlhede_algorithm
Subject Item
dbr:Vanishing_scalar_invariant_spacetime
dbo:wikiPageWikiLink
dbr:Cartan–Karlhede_algorithm
Subject Item
dbr:Mathematics_of_general_relativity
dbo:wikiPageWikiLink
dbr:Cartan–Karlhede_algorithm
Subject Item
dbr:Cartan-Karlhede_algorithm
dbo:wikiPageWikiLink
dbr:Cartan–Karlhede_algorithm
dbo:wikiPageRedirects
dbr:Cartan–Karlhede_algorithm
Subject Item
dbr:Cartan's_equivalence_method
dbo:wikiPageWikiLink
dbr:Cartan–Karlhede_algorithm
Subject Item
dbr:Cartan–Karlhede_algorithm
rdf:type
dbo:AnatomicalStructure yago:Abstraction100002137 yago:Method105660268 yago:PsychologicalFeature100023100 yago:Ability105616246 yago:Cognition100023271 yago:Know-how105616786 yago:WikicatMathematicalMethodsInGeneralRelativity
rdfs:label
Cartan–Karlhede algorithm Algoritmo de Cartan-Karlhede
rdfs:comment
The Cartan–Karlhede algorithm is a procedure for completely classifying and comparing Riemannian manifolds. Given two Riemannian manifolds of the same dimension, it is not always obvious whether they are locally isometric. Élie Cartan, using his exterior calculus with his method of moving frames, showed that it is always possible to compare the manifolds. Carl Brans developed the method further, and the first practical implementation was presented by in 1980. O algoritmo de Cartan-Karlhede é um procedimento para classificar e comparar completamente variedades de Riemann. Dadas duas variedades de Riemann de mesma dimensão, nem sempre é óbvio se são localmente isométricas. Élie Cartan, usando seu com o seu método de , mostrou que é sempre possível comparar as variedades. desenvolveu o método, e a primeira aplicação prática foi apresentada por em 1980.
dcterms:subject
dbc:Mathematical_methods_in_general_relativity dbc:Riemannian_geometry
dbo:wikiPageID
2680495
dbo:wikiPageRevisionID
1061337626
dbo:wikiPageWikiLink
dbr:Frame_fields_in_general_relativity dbr:SHEEP_(symbolic_computation_system) dbr:General_relativity dbc:Mathematical_methods_in_general_relativity dbr:Carl_Brans dbr:Null_dust_solution dbr:Definite_bilinear_form dbr:Lie_group dbr:Moving_frames dbr:Riemannian_manifold dbr:Lorentz_group dbr:Petrov_classification dbr:Local_isometry dbr:Compact_group dbc:Riemannian_geometry dbr:Covariant_derivative dbr:Fluid_solution dbr:Vanishing_scalar_invariant_spacetime dbr:Exterior_derivative dbr:Riemann_tensor dbr:Élie_Cartan dbr:Vacuum_solution_(general_relativity) dbr:Curvature_invariant dbr:Metric_tensor dbr:Computer_algebra_system
dbo:wikiPageExternalLink
n9:GRDB2.GRDBServlet
owl:sameAs
dbpedia-pt:Algoritmo_de_Cartan-Karlhede freebase:m.07xjmq wikidata:Q5047049 n19:4ftwj
dbp:wikiPageUsesTemplate
dbt:Ill
dbo:abstract
The Cartan–Karlhede algorithm is a procedure for completely classifying and comparing Riemannian manifolds. Given two Riemannian manifolds of the same dimension, it is not always obvious whether they are locally isometric. Élie Cartan, using his exterior calculus with his method of moving frames, showed that it is always possible to compare the manifolds. Carl Brans developed the method further, and the first practical implementation was presented by in 1980. The main strategy of the algorithm is to take covariant derivatives of the Riemann tensor. Cartan showed that in n dimensions at most n(n+1)/2 differentiations suffice. If the Riemann tensor and its derivatives of the one manifold are algebraically compatible with the other, then the two manifolds are isometric. The Cartan–Karlhede algorithm therefore acts as a kind of generalization of the Petrov classification. The potentially large number of derivatives can be computationally prohibitive. The algorithm was implemented in an early symbolic computation engine, SHEEP, but the size of the computations proved too challenging for early computer systems to handle. For most problems considered, far fewer derivatives than the maximum are actually required, and the algorithm is more manageable on modern computers. On the other hand, no publicly available version exists in more modern software. O algoritmo de Cartan-Karlhede é um procedimento para classificar e comparar completamente variedades de Riemann. Dadas duas variedades de Riemann de mesma dimensão, nem sempre é óbvio se são localmente isométricas. Élie Cartan, usando seu com o seu método de , mostrou que é sempre possível comparar as variedades. desenvolveu o método, e a primeira aplicação prática foi apresentada por em 1980.
gold:hypernym
dbr:Procedure
prov:wasDerivedFrom
wikipedia-en:Cartan–Karlhede_algorithm?oldid=1061337626&ns=0
dbo:wikiPageLength
5826
foaf:isPrimaryTopicOf
wikipedia-en:Cartan–Karlhede_algorithm
Subject Item
dbr:List_of_things_named_after_Élie_Cartan
dbo:wikiPageWikiLink
dbr:Cartan–Karlhede_algorithm
Subject Item
wikipedia-en:Cartan–Karlhede_algorithm
foaf:primaryTopic
dbr:Cartan–Karlhede_algorithm