Package pulse.problem.schemes
This package deals with abstractions associated with finite differences in
PULsE, including the definition of
Grids, which determine the
partitioning rules for space and time variables. Specific implementation of
the difference schemes may be found separately in a different package.- See Also:
Solver
-
Interface Summary Interface Description FixedPointIterations -
Class Summary Class Description ADIScheme AnADISchemeuses aGrid2Dto provide numerical capabilities needed to solve aProblem.BlockMatrixAlgorithm A modification of the algorithm for solving a system of linear equations, where the first and last equation contains references to the last and first elements of the solution, respectively.CoupledImplicitScheme DifferenceScheme ADifferenceSchemeis an abstract class that declares general methods for converting aProblemto a set of algebraic operations on aGrid.DistributedDetection An interface providing the ability to calculate the integral signal out from a finite-depth material layer.ExplicitScheme This class provides the necessary framework to enable a simple explicit finite-difference scheme (also called the forward-time centred space scheme) for solving the one-dimensional heat conduction problem.Grid AGridis used to partition the space and time domain of aProblemto allow a numeric solution with aDifferenceScheme.Grid2D AGrid2Dis used to partition the space and time domain of aProblem2Dto allow a numeric solution with aDifferenceScheme.ImplicitScheme An abstract implicit finite-difference scheme for solving one-dimensional heat conduction problems.MixedScheme An abstraction describing a weighted semi-implicit finite-difference scheme for solving the one-dimensional heat conduction problem.OneDimensionalScheme RadiativeTransferCoupling TridiagonalMatrixAlgorithm Implements the tridiagonal matrix algorithm (Thomas algorithms) for solving systems of linear equations.