Skip to content
#edge computing Open access

Calculating CPTG Galaxy Rotation Curves

Sep 2026 · Zenodo (CERN European Organization for Nuclear Research)
Galaxies: Formation, Evolution, Phenomena Astronomy and Astrophysical Research

Abstract

This tutorial presents a step-by-step calculation of the Curvature Polarization Transport Gravity (CPTG) galaxy-limit equation using three worked rotation-curve examples: DDO-154, NGC-3198, and NGC-7814. Starting from SPARC-style rotation-curve inputs, the calculation converts the observed radius and velocity columns into physical acceleration fields, builds the CPTG baryonic source field, infers the object-dependent structural acceleration scale a⋆, derives the structural transport scale, computes the transport remnant, solves the implicit nonlinear acceleration equation, and recovers the model rotation curve. The three galaxies are treated separately. DDO-154 is a gas-rich dwarf system and a classic low-acceleration test case for dark matter and modified-gravity theories. NGC-3198 is a large spiral galaxy with an extended, nearly flat H I rotation curve and has long served as a standard reference case for disk-galaxy mass discrepancies. NGC-7814 is an edge-on, bulge-dominated spiral whose rotation-curve decomposition includes a large stellar bulge contribution. Together, the three examples show how the same locked CPTG galaxy calculation is carried through a low-mass dwarf, an extended disk, and a centrally concentrated bulge system. A fixed-a0, unit-source MOND/RAR-form calculation is retained as a quantitative contrast so that the different source mapping, acceleration law, predicted curve, and residual diagnostics can be followed from the same SPARC component inputs. The purpose of the paper is instructional: to make the CPTG rotation-curve calculation reproducible step by step.

View source

Similar papers

#computer vision Review Sep 2017

Agile Software Development Methods: Review and Analysis

This publication proposes a definition and a classification of agile software development approaches and analyses ten software development methods that can be characterized as being "agile" against the defined criterion.

P. Abrahamsson, O. Salo, Jussi Ronkainen et al. · 727 citations · ⚡54
#computer vision Jun 2008

The impact of agile practices on communication in software development

The study shows that agile practices improve both informal and formal communication, but indicates that, in larger development situations involving multiple external stakeholders, a mismatch of adequate communication mechanisms can sometimes even hinder the communication.

M. Pikkarainen, Jukka Haikara, O. Salo et al. · 401 citations · ⚡48
#machine learning Review Open access Oct 2014

Software development in startup companies: A systematic mapping study

The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.

Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al. · 394 citations · ⚡54

Related blog posts

Microsoft Research Blog Oct 29, 2026

Microsoft Research Focus – Edition #97

Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.