{ "vercy": "1.0-draft", "publication": { "status": "research-draft", "adjudicationStatus": "unreviewed", "publishableCanonical": false, "generatedAt": "2026-09-12T09:56:26Z", "providers": [ "Codex" ], "breadth": "recalled by Codex without web access - no source was read", "missingProviders": [], "pass": 2, "cost": { "grok": { "seconds": 26.9, "error": "Reading additional input from stdin...\nOpenAI Codex v0.153.4\n--------\nworkdir: R:\\02_PROJECTS\\02_Meta_Models_Platforms\\Ver.cy\\current\\thing-registry-backlog\nmodel: gpt-6-astra\nprovider: openai\napproval: never\nsandbox: read-only\nreasoning effort: none\nreasoning summaries: none\nsession id: 01a0950a-c3e8-7272-981d-ca6166878edc\n--------\nuser\nDescribe what is already known about one registered thing. Answer as JSON only, no prose around it.\n\nThing: Galerkin method\nSense to describe: (none recorded)\nDomain code: ACT.ACT\nAlso known as: (none)\n\n\nContext for this batch of 1001 things:\n# Batch 043: 1001", "usd": 0.0, "recall": true }, "codex": { "seconds": 81.0, "error": "Reading additional input from stdin...\nOpenAI Codex v0.153.4\n--------\nworkdir: R:\\02_PROJECTS\\02_Meta_Models_Platforms\\Ver.cy\\current\\thing-registry-backlog\nmodel: gpt-6-astra\nprovider: openai\napproval: never\nsandbox: read-only\nreasoning effort: none\nreasoning summaries: none\nsession id: 01a0950a-c3f5-7e11-9466-d3115e4401e7\n--------\nuser\nYou are drafting a Vercy meta-model for one registered thing. Answer as JSON only, no prose around it.\n\nThing: Galerkin method\nRegistry id: vr.tr.galerkin-method\nPlane / domain: ACT / ACT.ACT\nRegistry definition: (none recorded)\nNames folded into this entry: (" } }, "enrichment": { "pass": 3, "engine": "claude", "producedAt": "2026-10-06T12:00:00Z", "ingestedAt": "2026-10-06T08:45:15+00:00", "fields": [ "agent_conduct", "ethics", "failure_modes_and_hazards", "owners", "visual_identification" ] }, "gate": { "passed": true, "version": "1.0", "at": "2026-10-07T10:10:26+00:00", "evidence": [ "completeness 1.00", "sense: Wikidata description", "2 live sources", "review by codex: pass" ] } }, "metaModel": { "id": "THING-Q1491980", "registryId": "vr.tr.galerkin-method", "name": "Galerkin method", "version": "0.1.0-research.1", "entryKind": "thing", "family": "Thing Registry", "domain": [ "ACT.ACT" ], "status": "research-draft" }, "canonicalUrl": "https://ver.cy/models/thing/q1491980/", "model": { "registry_id": "vr.tr.galerkin-method", "name": "Galerkin method", "purpose": "Enable an agent to recognise a Galerkin formulation, assess its mathematical and numerical adequacy, and choose justified approximation or verification actions.", "definition": "The Galerkin method approximates an operator equation in a finite-dimensional trial space by requiring its residual to vanish against every function in a chosen test space, classically the same space as the trial variations.", "scope_statement": "This model owns the Galerkin method as a procedure for constructing finite-dimensional approximations by requiring a residual to vanish against a specified test space, including the formulation choices and evidence needed to assess an application.", "in_scope": [ "Residual equations, variational forms and the pairing used for testing", "Trial and test spaces, bases and treatment of boundary constraints", "Discrete equations and their relationship to the continuous problem", "Consistency, stability, approximation error and convergence evidence", "Boundaries between classical Galerkin and named Galerkin variants" ], "out_of_scope": [ "Physical laws and constitutive models defining the underlying problem", "Mesh generation algorithms as independent methods", "Finite element technology beyond its role in constructing Galerkin spaces", "Linear and nonlinear solver algorithms as independent methods", "Time integration schemes except where time itself is treated by a Galerkin formulation", "Biographies and historical attribution beyond method identification" ], "distinguishing_features": [ "Identify an explicit trial approximation and require its residual to vanish against every test function in a specified finite-dimensional space.", "For classical Bubnov-Galerkin, test and trial variation spaces coincide; compare spaces after accounting for nonhomogeneous boundary lifting, rather than comparing basis labels.", "Distinguish testing against functions from enforcing the strong equation only at collocation points.", "Require an identified variational functional before describing a Galerkin approximation as a Ritz minimisation.", "Identify the projection formulation independently of whether its basis comes from finite elements, global spectral functions or reduced-order snapshots." ], "characteristics": [ { "name": "Formulation family", "kind": "category", "unit_or_values": "Bubnov-Galerkin; Petrov-Galerkin; discontinuous; mixed; stabilised; other explicitly defined variant; overlapping labels permitted", "why_it_matters": "Determines which space relationships and mathematical guarantees require examination." }, { "name": "Trial and test space relationship", "kind": "relation", "unit_or_values": "Named ambient and discrete spaces, inclusions, boundary constraints and equality or difference of variation spaces", "why_it_matters": "Makes the defining testing operation inspectable." }, { "name": "Discrete dimension", "kind": "measurement", "unit_or_values": "Number of independent trial coefficients and test equations", "why_it_matters": "Exposes approximation capacity and whether the discrete problem is square or requires additional treatment." }, { "name": "Approximation resolution", "kind": "measurement", "unit_or_values": "Mesh size h in domain units, polynomial degree p, spectral truncation N or reduced-basis dimension r, as applicable", "why_it_matters": "Identifies the actual refinement controls." }, { "name": "Conformity", "kind": "category", "unit_or_values": "Conforming; nonconforming; broken-space formulation; unresolved", "why_it_matters": "Determines whether continuous-space arguments transfer directly or need modified forms and estimates." }, { "name": "Stability evidence", "kind": "state", "unit_or_values": "Proved under recorded assumptions; numerically supported over a stated range; failed; unassessed", "why_it_matters": "Prevents treating solvability of one discrete system as a general stability guarantee." }, { "name": "Error assessment", "kind": "measurement", "unit_or_values": "Error or estimator value with norm, units, reference solution and refinement level", "why_it_matters": "Makes accuracy claims comparable and separates solution error from algebraic residual." }, { "name": "Discrete consistency", "kind": "state", "unit_or_values": "Exact for the stated formulation; perturbed with quantified defect; unresolved", "why_it_matters": "Tracks changes introduced by quadrature, geometry approximation and added terms." } ], "affordances": [ "Classify a proposed discretisation from its trial space, test space and residual pairing.", "Construct discrete equations from a specified variational problem and basis.", "Check admissibility of spaces and enforcement of boundary or interface conditions.", "Select an applicable stability or error argument and record unmet assumptions.", "Design refinement studies that separate approximation, integration and solver errors.", "Recommend refinement, a different space pair or a justified stabilisation when evidence identifies a failure." ], "agent_conduct": { "may": [ "Explain the Galerkin method and its variants, such as finite element methods.", "Apply it in models the agent is authorized to build and check." ], "must_not": [ "Present approximate solutions as exact.", "Use results without convergence and error checks for safety-critical designs.", "Fabricate numerical results." ], "requires_human": [ "Using simulation results to certify safety-critical structures or systems." ] }, "ethics": { "considerations": [ "Numerical results guide designs that people's safety depends on.", "Transparency about approximations matters for trust in engineering." ], "affected_parties": [ "Engineers", "Users of designed systems" ] }, "owners": { "steward": "Nobody owns the method; the analyst answers for each model.", "master_systems": [] }, "visual_identification": [ "Appears as equations and weak forms in technical documents; results are shown as meshes and field plots." ], "failure_modes_and_hazards": [ "Poor choice of spaces gives unstable or inaccurate solutions.", "Mesh-dependent errors mislead designs." ], "what_it_is_for": [ "The Galerkin method is used in numerical analysis to approximate differential and other operator equations with finite-dimensional systems.", "It appears in finite element and spectral formulations for applications such as structural mechanics, fluid flow and heat transfer.", "A formulation is assessed through its trial and test spaces, boundary conditions, stability and approximation error." ], "facets_not_applicable": { "interfaces": "No universal standard or regulation governs the Galerkin method itself, although particular engineering applications can have verification requirements." } }, "sources": [ { "id": "wikidata", "title": "Wikidata item Q1491980: Galerkin method", "url": "https://www.wikidata.org/wiki/Q1491980", "url_status": "live", "what_it_supports": "identity and sense of the item", "checked_by": "wikidata-api" }, { "id": "wikipedia-en", "title": "Wikipedia: Galerkin method", "url": "https://en.wikipedia.org/wiki/Galerkin_method", "url_status": "live", "what_it_supports": "general description of the item", "checked_by": "wikidata-api sitelink" } ], "structure": { "bundles": [ { "id": "galerkin-identity", "name": "Galerkin identity", "description": "Identify the mathematical operation and the convention under which an application is called Galerkin.", "rationale": "The method name alone does not specify the trial-test relationship or the scope of a named variant.", "layers": [ { "id": "residual-testing", "name": "Residual testing", "description": "Record what is approximated and how its residual is tested.", "findings": [ { "id": "defining-discrete-condition", "name": "Defining discrete condition", "description": "For the conforming linear formulation, seek u_h in V_h with a(u_h,v_h)=l(v_h) for every v_h in V_h. [Massing's Galerkin course notes](https://www.math.ntnu.no/emner/MA8502/2024h/lectures/html/chapter_02/galerkin_methods.html).", "questions": [ { "text": "What residual functional must vanish, and against which complete discrete test space?", "kind": "definition", "id": "defining-discrete-condition-q01" }, { "text": "Does testing use an inner product, a duality pairing or a specified discrete approximation?", "kind": "definition", "id": "defining-discrete-condition-q02" } ] } ] }, { "id": "variant-boundaries", "name": "Variant boundaries", "description": "Separate the core operation from conventions and neighbouring methods.", "findings": [ { "id": "named-variant-contract", "name": "Named variant contract", "description": "Record what each variant label changes in the spaces, differential operators or discrete form.", "questions": [ { "text": "Does the cited author use Galerkin narrowly for equal variation spaces or broadly to include Petrov-Galerkin formulations?", "kind": "provenance", "id": "named-variant-contract-q01" }, { "text": "What equations establish the claimed relationship to Ritz, collocation or least-squares methods?", "kind": "boundary", "id": "named-variant-contract-q02" }, { "text": "Which features belong to a linked specialised variant rather than to every Galerkin application?", "kind": "boundary", "id": "named-variant-contract-q03" } ] } ] } ] }, { "id": "continuous-problem-contract", "name": "Continuous problem contract", "description": "Specify the problem whose solution the discrete construction is intended to approximate.", "rationale": "A discrete system cannot be judged without its continuous formulation and admissibility conditions.", "layers": [ { "id": "operator-and-weak-form", "name": "Operator and weak form", "description": "Relate the supplied equation to the form actually discretised.", "findings": [ { "id": "formulation-equivalence", "name": "Formulation equivalence", "description": "Record the operator, forcing, domain, regularity requirements and derivation of the tested formulation.", "questions": [ { "text": "What operator equation or variational problem is being approximated?", "kind": "definition", "id": "formulation-equivalence-q01" }, { "text": "Under which regularity assumptions does the chosen weak formulation represent the intended original problem?", "kind": "boundary", "id": "formulation-equivalence-q02" } ] } ] }, { "id": "boundary-and-nullspace-conditions", "name": "Boundary and nullspace conditions", "description": "Record constraints that determine admissible solutions and uniqueness.", "findings": [ { "id": "constraint-realisation", "name": "Constraint realisation", "description": "Track essential and natural boundary conditions, lifting functions, compatibility conditions and any nullspace constraints.", "questions": [ { "text": "Which boundary conditions are imposed through spaces, lifting, boundary terms or weak enforcement?", "kind": "definition", "id": "constraint-realisation-q01" }, { "text": "What compatibility or normalisation condition is required if the operator has a nullspace?", "kind": "action", "id": "constraint-realisation-q02" } ] } ] } ] }, { "id": "approximation-spaces", "name": "Approximation spaces", "description": "Describe the finite-dimensional representation and its admissibility.", "rationale": "Space selection governs what the approximation can express and which analysis applies.", "layers": [ { "id": "trial-test-construction", "name": "Trial and test construction", "description": "Identify spaces independently of their particular basis representation.", "findings": [ { "id": "space-and-basis-record", "name": "Space and basis record", "description": "Record basis construction, dimensions, support, continuity and component structure.", "questions": [ { "text": "How are trial and test spaces constructed, and how many independent degrees of freedom does each contain?", "kind": "definition", "id": "space-and-basis-record-q01" }, { "text": "Are apparently different bases spanning the same space or genuinely different spaces?", "kind": "boundary", "id": "space-and-basis-record-q02" } ] } ] }, { "id": "conformity-and-enrichment", "name": "Conformity and enrichment", "description": "Assess admissibility and the available routes to improved approximation.", "findings": [ { "id": "admissible-refinement", "name": "Admissible refinement", "description": "Record continuous-space membership, interface treatment and how a sequence of spaces gains approximation power.", "questions": [ { "text": "Do the discrete functions satisfy the continuous space requirements, or which broken-space or nonconforming construction replaces them?", "kind": "boundary", "id": "admissible-refinement-q01" }, { "text": "Should accuracy be improved by mesh refinement, degree increase, additional modes or basis enrichment?", "kind": "action", "id": "admissible-refinement-q02" }, { "text": "What approximation or density evidence supports the selected refinement sequence?", "kind": "provenance", "id": "admissible-refinement-q03" } ] } ] } ] }, { "id": "discrete-equations", "name": "Discrete equations", "description": "Connect the declared formulation to the equations actually assembled and solved.", "rationale": "Integration choices and added terms can materially change the mathematical method being executed.", "layers": [ { "id": "assembly-and-integration", "name": "Assembly and integration", "description": "Record the translation from functions and forms to coefficient equations.", "findings": [ { "id": "coefficient-system", "name": "Coefficient system", "description": "For a linear form, basis substitution gives A_ij=a(phi_j,phi_i) and b_i=l(phi_i). [Massing's Galerkin course notes](https://www.math.ntnu.no/emner/MA8502/2024h/lectures/html/chapter_02/galerkin_methods.html).", "questions": [ { "text": "What matrix, nonlinear residual or semidiscrete evolution system follows from the chosen bases?", "kind": "definition", "id": "coefficient-system-q01" }, { "text": "Which quadrature and geometry approximations alter the exact tested equations?", "kind": "measurement", "id": "coefficient-system-q02" } ] } ] }, { "id": "modified-forms-and-solution", "name": "Modified forms and solution", "description": "Track formulation modifications and the fidelity of the computed solve.", "findings": [ { "id": "implementation-defects", "name": "Implementation defects", "description": "Record fluxes, penalties, stabilisation terms and solver tolerances with their intended mathematical roles.", "questions": [ { "text": "Which interface, penalty or stabilisation terms are present, and what consistency argument supports them?", "kind": "provenance", "id": "implementation-defects-q01" }, { "text": "How small must the algebraic or nonlinear solve error be relative to the intended discretisation accuracy?", "kind": "action", "id": "implementation-defects-q02" } ] } ] } ] }, { "id": "stability-and-error", "name": "Stability and error", "description": "Assess whether the approximation is reliable and what evidence justifies further action.", "rationale": "Residual testing alone does not establish stability, convergence or sufficient accuracy.", "layers": [ { "id": "applicable-error-theory", "name": "Applicable error theory", "description": "Attach mathematical claims to the assumptions and norms under which they hold.", "findings": [ { "id": "orthogonality-and-quasioptimality", "name": "Orthogonality and quasioptimality", "description": "Consistent conforming linear Galerkin gives a(u-u_h,v_h)=0; Céa's estimate additionally requires the stated boundedness and coercivity assumptions. [Massing's Galerkin course notes](https://www.math.ntnu.no/emner/MA8502/2024h/lectures/html/chapter_02/galerkin_methods.html).", "questions": [ { "text": "Does exact Galerkin orthogonality hold, or what consistency defect replaces it?", "kind": "measurement", "id": "orthogonality-and-quasioptimality-q01" }, { "text": "Which coercivity, inf-sup or other stability result applies, and are its constants uniform under refinement and parameter changes?", "kind": "provenance", "id": "orthogonality-and-quasioptimality-q02" }, { "text": "In which norm and under which solution regularity assumptions is an error bound justified?", "kind": "boundary", "id": "orthogonality-and-quasioptimality-q03" } ] } ] }, { "id": "verification-and-adaptation", "name": "Verification and adaptation", "description": "Use computations to assess accuracy and choose the next approximation.", "findings": [ { "id": "error-evidence-and-response", "name": "Error evidence and response", "description": "Record benchmark errors, estimators, observed refinement behaviour and the specific decision each supports.", "questions": [ { "text": "What manufactured, exact or independently resolved solution supports the reported convergence behaviour?", "kind": "provenance", "id": "error-evidence-and-response-q01" }, { "text": "Which measured norm or quantity-of-interest error meets the application's acceptance threshold?", "kind": "measurement", "id": "error-evidence-and-response-q02" }, { "text": "Does the evidence call for refinement, better integration, a tighter solve or a change of spaces or formulation?", "kind": "action", "id": "error-evidence-and-response-q03" } ] } ] } ] }, { "id": "evidence-and-external-alignment", "name": "Evidence and external alignment", "description": "What the world already says about this thing, gathered so the model can be checked against it.", "rationale": "A model that cannot be lined up against existing standards, identifiers and practice cannot be adopted by anyone who already uses them.", "layers": [ { "id": "reported-evidence", "name": "Reported evidence", "description": "Findings from the breadth pass, kept separate from the structural claims.", "findings": [ { "id": "evidence-confidence-notes", "name": "Check these first", "description": "Recalled without web access and unsourced; every item is a lead to verify.", "evidence": [ "Usage varies: Galerkin sometimes means strictly identical trial variation and test spaces, while broader usage includes Petrov-Galerkin formulations.", "The listed varieties overlap; a formulation can be both spectral and conforming, or both mixed and discontinuous.", "No universal accuracy range or convergence order applies; claims require a specified equation, approximation space, regularity assumptions, and stability conditions." ], "questions": [ { "id": "evidence-confidence-notes-q01", "text": "Which of these check these first hold for the sense of Galerkin method this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-kinds", "name": "Kinds and varieties", "description": "Recalled without web access and unsourced; every item is a lead to verify.", "evidence": [ "Conforming Galerkin methods", "Nonconforming Galerkin methods", "Discontinuous Galerkin methods", "Spectral Galerkin methods", "Mixed Galerkin methods", "Petrov-Galerkin methods, which use distinct trial and test spaces" ], "questions": [ { "id": "evidence-kinds-q01", "text": "Which of these kinds and varieties hold for the sense of Galerkin method this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-real-world-use", "name": "Real-world use", "description": "Recalled without web access and unsourced; every item is a lead to verify.", "evidence": [ "Finite element approximation of elasticity and structural mechanics problems.", "Numerical solution of heat transfer and diffusion equations.", "Simulation of fluid flow and transport.", "Numerical solution of electromagnetic field equations.", "Projection of large dynamical systems onto reduced-order approximation spaces." ], "questions": [ { "id": "evidence-real-world-use-q01", "text": "Which of these real-world use hold for the sense of Galerkin method this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-measurements", "name": "Typical measurements", "description": "Recalled without web access and unsourced; every item is a lead to verify.", "evidence": [ { "quantity": "Approximation error in a specified norm", "typical_range": "Problem-dependent; assessed against an exact solution, reference solution, or error estimator.", "unit": "Depends on the solution variables and norm" }, { "quantity": "Observed convergence order", "typical_range": "Depends on approximation degree, solution regularity, mesh properties, and the measured norm.", "unit": "Dimensionless" } ], "questions": [ { "id": "evidence-measurements-q01", "text": "Which of these typical measurements hold for the sense of Galerkin method this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-failure-modes-and-hazards", "name": "Failure modes and hazards", "description": "Recalled without web access and unsourced; every item is a lead to verify.", "evidence": [ "Unstabilized formulations can produce spurious oscillations in advection-dominated problems.", "Incompatible approximation spaces in mixed formulations can violate stability conditions and generate spurious modes.", "Insufficient resolution or low solution regularity can prevent the expected convergence rate.", "Poorly conditioned algebraic systems can amplify numerical error and slow iterative solvers.", "Incorrect boundary conditions, numerical quadrature, or weak-form implementation can yield an inaccurate solution despite a small algebraic residual." ], "questions": [ { "id": "evidence-failure-modes-and-hazards-q01", "text": "Which of these failure modes and hazards hold for the sense of Galerkin method this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-neighbours", "name": "Neighbouring kinds and how to tell them apart", "description": "Recalled without web access and unsourced; every item is a lead to verify.", "evidence": [ { "name": "Finite element method", "difference": "Finite elements specify approximation spaces constructed over a mesh; Galerkin specifies a projection principle and also works with global bases." }, { "name": "Rayleigh-Ritz method", "difference": "Rayleigh-Ritz obtains an approximation through stationarity or minimization of a variational functional; it coincides with Galerkin for suitable variational problems." }, { "name": "Collocation method", "difference": "Collocation enforces the governing equation at selected points, whereas Galerkin enforces residual orthogonality through testing." }, { "name": "Least-squares method", "difference": "Least-squares formulations minimize a specified residual norm; classical Galerkin imposes residual orthogonality to the trial variation space." }, { "name": "Weighted residual methods", "difference": "This broader family includes Galerkin; the choice of weighting or test functions distinguishes its members." } ], "questions": [ { "id": "evidence-neighbours-q01", "text": "Which of these neighbouring kinds and how to tell them apart hold for the sense of Galerkin method this model covers, and on what evidence?", "kind": "provenance" } ] } ] } ] } ] }, "openQuestions": [ "Which naming convention should the registry adopt for the relationship between Galerkin, Bubnov-Galerkin and Petrov-Galerkin?", "Which specialised variants already have registry or world-model coverage and should be linked rather than modelled again here?", "How should this model represent Galerkin approximation sequences used in existence proofs, where no numerical implementation is intended?", "Which additional formulation-specific criteria are needed for nonlinear, eigenvalue and time-dependent applications?", "What evidence thresholds should distinguish experimentally supported stability and convergence from proved guarantees?" ], "statistics": { "bundles": 6, "layers": 11, "findings": 16, "questions": 30 } }