General concepts

How meshes, finite element fields, weak forms, and solvers fit together.

A Rodin application connects a geometric domain, a discrete field space, a weak problem and an algebraic solver. These guides develop those objects in that order and identify the C++ interfaces used at each stage. The examples and tutorials supply complete numerical problems; the module reference describes individual APIs.

Choose a reading route

TaskStarting pointContinue with
Build and run a first solveInstallation and setupA first problem
Understand the finite element constructionCiarlet's definition of a finite elementFinite element spaces and Weak formulations
Translate a model into C++ formsVariational formulations in RodinBoundary conditions and Solvers
Inspect a computed fieldInput, output, and visualizationGallery and Examples and tutorials
Move a local problem to a distributed backendBackends and supported configurationsDistributed computing with MPI and Parallel solvers and distributed linear algebra with PETSc

Start with a complete problem

The introductory sequence assumes basic C++ and familiarity with calculus and linear algebra. Detailed finite element background is introduced in the guides below.

  1. Installation and setup — Configure the dependencies, build Rodin, and verify the installation.
  2. First steps with Rodin — Build a small program and identify the roles of a mesh, a finite element space, and symbolic fields.
  3. A first problem — Build and run a Poisson solve, then inspect the exported solution.
  4. Core concepts — Follow the complete path from geometric data to the assembled algebraic system.

Describe the domain

A mesh records both geometric coordinates and topological relations. These guides establish the distinction before introducing integration and fields. Incidence relations describe adjacency; geometric maps supply coordinates, Jacobians and measures for evaluation and integration.

  • Meshes — Create, load, inspect, and traverse a mesh.
  • Polytopes — Cells, faces, reference elements, and mappings.
  • Connectivity — Incidence relations between vertices, edges, faces, and cells.

Approximate fields on the mesh

A finite element specifies local approximation and degrees of freedom; identifying compatible degrees of freedom across cells produces a global space. Field range, geometric mapping and coefficient ordering are separate choices in this construction.

Express and solve equations

The continuous weak problem determines the forms, boundary conditions, and algebraic properties that a solver must respect. Follow a derivation before selecting the corresponding form expressions, then check constraints, quadrature and solver status against that problem.

Inspect and exchange results

Mesh topology, geometric coordinates and field coefficients must be exported together with their interpretation. The I/O guides distinguish stored data, visualization output and time-dependent snapshots.

Build application models

These guides combine the preceding concepts into fitting, design evolution and constitutive models. Their application examples expose geometry checks, objective histories and residual or derivative checks appropriate to each workflow.

Choose an execution backend

The local workflow provides the starting point. Parallel execution adds ownership, communication, and synchronization requirements. Establish the discrete problem locally before following the backend-specific construction and collective-operation rules.

Further reference

The notation reference defines mathematical symbols. The module reference provides API declarations, and the project repository hosts source code and issue discussions.