Computing effective eigenvalues for neutron transport often requires a fine numerical resolution. The main challenge of such computations is the high memory effort classical solvers, which limits accuracy chosen discretizations. In this work, we derive method computation when underlying solution has low-rank structure. This accomplished by utilizing dynamical approximation (DLRA), an efficient ...

The aim of this paper is to propose a new faster iterative scheme (called AA-iteration) approximate the fixed point (b,η)-enriched contraction mapping in framework Banach spaces. It also proved that our iteration stable and converges than many iterations existing literature. For validity proposed scheme, we presented some numerical examples. Further, strong weak convergence results for b-enrich...

Data in the lambda calculus is usually represented using the "Church encoding", which gives closed terms for the constructors and which naturally allows to define functions by iteration. An additional nice feature is that in system F (polymorphically typed lambda calculus) one can define types for this data and the iteration scheme is well-typed. A problem is that primitive recursion is not dir...