Computational and Applied Mathematics

Abstract This study proposes a novel framework for evaluating the efficiency of two-stage network decision-making units by integrating the hyperbolic distance function (HDF) with conic optimization. Building on the direct HDF model of Hassanasab et al. (2019), the problem is reformulated within a conic programming structure that explicitly captures internal flows and inter-stage dependencies. The…

Abstract Efficient closure computation is a key challenge in fuzzy Formal Concept Analysis. Direct implicational systems, which allow for one-step closure calculation, offer a powerful solution, but their formalization and practical computation in the fuzzy setting have remained largely open problems. This paper provides a comprehensive contribution to fill this gap. We first extend the concept o…

Abstract In this paper, the spread of an epidemiological disease over time is modeled as a Bienaymé–Galton–Watson process. Therefore, a discrete random variable models the number of infections per infector and rules the branching process. Given this probabilistic model, the main aim is to compare computationally methodologies to get mass functions of further generations’ size: probability generat…

Abstract We propose $$C^1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mi>C</mml:mi> <mml:mn>1</mml:mn> </mml:msup> </mml:math> -conforming finite element methods for a class of nonlinear fourth-order partial differential equations arising in continuum physics. Our primary motivation is the Landau–Lifshitz–Baryakhtar equation in micromagnetics, although the framewor…

Abstract In this study, a reproducing kernel method based on shifted Legendre polynomials is proposed for obtaining numerical solutions to the nonlinear Duffing equation involving both integral and non-integral forcing terms subject to three types of boundary conditions. Unlike the classical reproducing kernel method, the proposed method employs Legendre polynomials to construct the reproducing k…