Package io.github.andreipunko.math.pde.solver

package io.github.andreipunko.math.pde.solver

Numerical PDE solvers using finite differences and the Thomas algorithm.

Grid steps h and tau: solvers only require positive finite steps and build a tensor-product grid. They do not enforce physical stability conditions (such as CFL bounds typical of explicit schemes). The implemented schemes are implicit, which generally improves stability relative to explicit methods, but accuracy still depends on resolving the relevant space–time scales: h and tau should be chosen using the problem physics or standard discretization theory. Poor choices can yield inaccurate results or poorly conditioned tridiagonal systems; the latter may trigger IllegalArgumentException from AbstractEquationSolver.solve3DiagonalEquationsSystem(double[], double[], double[], double[], io.github.andreipunko.math.pde.solver.AbstractEquationSolver.KappaNu, io.github.andreipunko.math.pde.solver.AbstractEquationSolver.KappaNu).

Class	Description
AbstractEquationSolver<E extends Equation>	Abstract base class for partial differential equation solvers.
AbstractEquationSolver.KappaNu	Record class to store boundary condition parameters for the tridiagonal algorithm.
EquationSolver<E extends Equation>	Interface for numerical solvers of partial differential equations.
HyperbolicEquationSolver	Solver for hyperbolic partial differential equations.
ParabolicEquationSolver	Solver for parabolic partial differential equations.
Solution<E extends Equation>	Numerical PDE solution on a space-time domain: equation(), area(), and grid values matrix() (Matrix2D — rows are time layers, columns are spatial nodes).