A GPU-accelerated finite element analysis framework with JAX.
Project description
FEAX
A simulation node in your JAX workflow
Documentation | Install guide | API
FEAX (Finite Element Analysis with JAX) is a fully differentiable finite element engine. Every stage — from assembly to solve — runs on XLA and is compatible with jax.jit, jax.grad, and jax.vmap, enabling gradient-based optimization and machine learning directly on PDE simulations.
Why FEAX?
FEAX is a fully differentiable finite element engine built on JAX. All solvers — including the GPU-accelerated direct solver via cuDSS — are compatible with JAX transformations (jit, grad, vmap). This means you can compute exact gradients through the entire simulation pipeline without any approximation.
- JAX Transformations: Solvers work seamlessly with
jax.jit,jax.grad, andjax.vmap, and arbitrary compositions such asjit(grad(...)). - GPU Direct Solver: Native cuDSS integration for sparse direct solves on GPU, with automatic matrix property detection (General / Symmetric / SPD).
- End-to-End Differentiability: Gradients flow through assembly, boundary conditions, linear/nonlinear solvers, and post-processing — enabling topology optimization, inverse problems, and physics-informed learning.
- Neural Network Research: The consistent differentiability makes FEAX a natural building block for coupling neural networks with PDE solvers.
Quick Example
3D cantilever beam under traction — solve and compute gradients in a few lines:
import feax as fe
import jax
import jax.numpy as np
# Mesh and material
mesh = fe.mesh.box_mesh((100, 10, 10), mesh_size=2)
E, nu = 70e3, 0.3
# Define the constitutive law
class LinearElasticity(fe.problem.Problem):
def get_tensor_map(self):
def stress(u_grad, *args):
mu = E / (2. * (1. + nu))
lmbda = E * nu / ((1 + nu) * (1 - 2 * nu))
eps = 0.5 * (u_grad + u_grad.T)
return lmbda * np.trace(eps) * np.eye(self.dim) + 2 * mu * eps
return stress
def get_surface_maps(self):
def surface_map(u, x, traction_mag):
return np.array([0., 0., traction_mag])
return [surface_map]
left = lambda point: np.isclose(point[0], 0., atol=1e-5)
right = lambda point: np.isclose(point[0], 100., atol=1e-5)
problem = LinearElasticity(mesh, vec=3, dim=3, location_fns=[right])
# Boundary conditions: fix the left face
bc_config = fe.DCboundary.DirichletBCConfig([
fe.DCboundary.DirichletBCSpec(location=left, component="all", value=0.)
])
bc = bc_config.create_bc(problem)
# Internal variables (surface traction magnitude)
traction = fe.InternalVars.create_uniform_surface_var(problem, 1e-3)
internal_vars = fe.InternalVars(volume_vars=(), surface_vars=[(traction,)])
# Create solver (auto-selects cuDSS on GPU, sparse direct on CPU)
solver = fe.create_solver(problem, bc,
solver_options=fe.DirectSolverOptions(), iter_num=1,
internal_vars=internal_vars)
initial = fe.zero_like_initial_guess(problem, bc)
# Solve
sol = solver(internal_vars, initial)
# Differentiate through the entire solve
grad_fn = jax.grad(lambda iv: np.sum(solver(iv, initial) ** 2))
grads = grad_fn(internal_vars)
See examples/ for more, including topology optimization.
Features
- Assembly-based solvers: Sparse direct (cuDSS on GPU, spsolve on CPU) and iterative (CG, BiCGSTAB, GMRES) solvers with automatic matrix property detection.
- Matrix-free Newton solver: JVP-based tangent operator for problems with custom energy contributions (cohesive zones, phase-field fracture) — no sparse matrix assembly.
- Multi-variable problems: Coupled multi-physics via a high-level weak form interface (
get_weak_form()), with automatic interpolation and integration. - Multipoint constraints: Prolongation matrix support for periodic boundary conditions and other constraint types.
- Topology optimization: Built-in
genetoolkit with MMA optimizer, density filters, Heaviside continuation, and adaptive remeshing. - Computational homogenization:
flattoolkit for periodic unit cell analysis with graph-based lattice structure definition.
Installation
pip install feax[cuda13]
pip install --no-build-isolation git+https://github.com/johnviljoen/spineax.git
License
FEAX is licensed under the GNU General Public License v3.0. See LICENSE for the full license text.
Acknowledgments
FEAX builds upon the excellent work of:
- JAX for automatic differentiation and compilation
- JAX-FEM for inspiration and reference implementations
- Spineax for cuDSS solver implementation
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Filter files by name, interpreter, ABI, and platform.
If you're not sure about the file name format, learn more about wheel file names.
Copy a direct link to the current filters
File details
Details for the file feax-0.5.1.tar.gz.
File metadata
- Download URL: feax-0.5.1.tar.gz
- Upload date:
- Size: 178.2 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/6.2.0 CPython/3.12.3
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
a3901b87de0aceba23e77610045c9ac70faefc17de972ca5434b98b9f4a55902
|
|
| MD5 |
c06cafddfbd4e5a3599c6768e6dddc6f
|
|
| BLAKE2b-256 |
8fa96ffa8e3b906feafbba9742b41898ddc7602403baced86f54e3d0685e1153
|
File details
Details for the file feax-0.5.1-py3-none-any.whl.
File metadata
- Download URL: feax-0.5.1-py3-none-any.whl
- Upload date:
- Size: 175.2 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/6.2.0 CPython/3.12.3
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
61bd149dbb64b5de8d9ff92535810fac0d804e43f092ce8d1bd3144446d686ae
|
|
| MD5 |
59706fd9a46b3175dec0466ecf798a23
|
|
| BLAKE2b-256 |
a38780e42f3aef71e299f69196d623a7364332cc1c84741c05f80544b0cd9759
|