Skip to content

Scrollable formula. Use Left and Right arrow keys to reveal hidden content.

Scrollable table. Use Left and Right arrow keys to reveal additional columns.

Scrollable figure. Use Left and Right arrow keys to inspect hidden content.

A method is useful only after its mathematical object, domain, data, and success test have been fixed. This index starts from the operation a gravity calculation must perform, then routes to the shortest preparation and to a physical treatment where the method is actually used. It is a map, not a substitute for those derivations or for problem-specific verification.

TaskStart hereSee it used in gravityMinimum check before trusting the result
Manipulate vectors, duals, tensors, bilinear forms, or eigenproblemsLinear Algebra and Tensor ComputationTensor Fields and Natural OperationsIdentify the vector spaces, basis dependence, inner product, index type, and conditioning; verify one invariant or basis-independent reconstruction.
Differentiate discontinuities or represent concentrated sourcesDistributions and Generalized FunctionsDistributional CurvatureName the test-function space and topology, check density and sign conventions, and do not form a product or pullback until its hypotheses are known.
Use weak limits, compactness, or elliptic regularity in geometric PDEAnalysis for Mathematical RelativityLow-Regularity Spacetimes and Weak SolutionsName the space, topology, measure, operator, domain, and boundary hypotheses; do not pass weak limits through nonlinear terms without compactness or a defect term.
Decompose waves into modes or analyze a continuous spectrumFourier and Spectral AnalysisMode Green Functions and WronskiansState transform signs and 2π2\pi factors, function space, boundary conditions, contour or sheet, and the reconstruction or Parseval-type check.
Solve an initial-value, boundary-value, or eigenvalue ODEODE Initial-, Boundary-, and Eigenvalue ProblemsODE, Boundary-Value, and Spectral ComputationCount free data against boundary conditions, inspect singular endpoints, and test residuals, conditioning, and convergence rather than a solver success flag.
Propagate fields, impose causal support, or invert a PDEPDEs and Green FunctionsRetarded and Advanced Green FunctionsClassify the operator, state domain and boundary or initial data, choose retarded, advanced, elliptic, or other support, and verify the defining distributional equation.
Connect regions governed by different scalesAsymptotics and Matched ExpansionsMatched Asymptotic Expansions Across the ThroatIdentify the small parameter and overlap domain, match the same variables and gauge, and test the remainder in both outer and inner limits.
Establish that a computation solves the intended equationsNumerical Analysis, Verification, and ValidationSolution Verification and ConvergenceSeparate code verification from model validation; report residuals, constraints, resolution or tolerance studies, conserved quantities, and failure cases.
Infer parameters or compare models from noisy dataProbability and Statistical InferenceBayesian and Frequentist InferenceDeclare likelihood, priors or sampling law, selection effects, calibration and nuisance models, uncertainty convention, and predictive or coverage checks.

The rows are deliberately operation-first. “Spectral,” for example, can mean an analytic decomposition, an operator spectrum, or a numerical collocation basis; those uses share vocabulary but not automatically a domain, norm, or error estimate.

Start with the quantity you need, not with a favorite technique.

  1. State the output. Is it an identity, a weak solution, an eigenfrequency, a causal response, an asymptotic coefficient, a numerical field, or a posterior statement?
  2. Write the operator and its domain. Include the measure, inner product, regularity class, coordinate or gauge choices, and boundary or initial conditions. The same differential expression on two domains can define different problems.
  3. Identify the controlled approximation. Record the expansion parameter, truncation order, regulator, discretization, or statistical model. A formal series and a converged approximation are different claims.
  4. Choose an independent diagnostic. Useful examples are a conserved quantity, limiting case, distributional test, residual norm, refinement rate, alternative formulation, synthetic-data recovery, or comparison with an exact benchmark.
  5. Route interpretation to the physical application. A method establishes what the calculation does; the linked page supplies the geometry, observable, regime, and scientific conclusion.

Formal equality versus defined operation. Symbolic manipulation does not establish that a product of distributions, an unbounded-operator composition, or a divergent integral exists. The function space and limiting prescription are part of the result.

Small residual versus small physical error. A discretized equation can have a tiny residual while solving the wrong boundary-value problem or a poorly conditioned formulation. Pair residuals with convergence, constraints, and a problem-level benchmark.

Mode completeness versus useful approximation. Locating poles or eigenvalues does not by itself prove completeness, dominance, or an accurate time-domain reconstruction. Check branch cuts, continuous spectra, prompt response, late-time behavior, and the norm in which an expansion is claimed.

Posterior precision versus information in the data. A narrow posterior may reflect prior support, a fixed calibration, an incomplete noise model, or unmodeled selection. Report sensitivity to those choices before interpreting width as measurement precision.

Each row in the task table now opens a concise record for that method family. Use those records to fix conventions, domains, data, approximations, and independent checks; use the application column for the full physical or mathematical treatment.