Computer Science and Mathematics

Article
Computer Science and Mathematics
Mathematics

Pham Van Khanh

Abstract: We investigate a restricted Chen sieve in which Rosser's lower weights are used at level \(D = \lfloor N^{\theta} \rfloor\), with \(3/4 < \theta < 1\), and switching is confined to a prescribed interval of large prime divisors. We obtain an unconditional lower bound for the main term with an explicit coefficient, determine its exact positivity threshold, and evaluate the coefficient as \(\frac{50}{49}\log\frac{2544}{2405}\) at the principal parameters. The threshold for this coefficient is strictly greater than \(2/3\). For admissible parameters with \(c \le 1/3\), we construct exact negative values of the sieve kernel on its arithmetic summation set and prove that its minimum is at most \(-\exp\left(c_{\theta}\sqrt{\log N}\right)\) for infinitely many even \(N\). We also characterize the union of the supports of all \(k\)-factorable sequences of a given level by a generalized Schinzel–Szekeres function. For squarefree moduli, the corresponding strict sublevel set identifies the intersection of the upper and lower Rosser supports. This criterion excludes every switched modulus from the support of triply factorable weights at the sieve level. Further results establish the optimal constant \(\log 3\) in the dimension-one condition for the Goldbach density and an unconditional mean-value estimate for the full remainder, yielding the weighted lower bound for almost all even integers. A companion construction using parity-weighted cofactor minorants admits an exact reweighting envelope, an explicit gain function, and unconditional mean-value estimates.

Article
Computer Science and Mathematics
Mathematics

Yuzhuo Zhang

,

Yun Wang

Abstract: This paper studies the nonlinear programming problem with quaternion self-conjugate negative semidefinite matrix constraints(QNSDP). A theoretical framework for QNSDP is constructed, and an efficient numerical algorithm is designed. First, a projection operator on the space of quaternion self-conjugate matrices is defined, and constraint qualifications such as the Robinson constraint qualification, the constraint nondegeneracy condition, and the strict complementarity condition are provided. It is proved that the Lagrange multiplier set is nonempty and bounded if and only if the Robinson constraint qualification holds, among other results. Second, the KKT conditions and second-order optimality conditions are established, and an explicit expression for the critical cone is given, then SQP-type methods for solving QNSDP is proposed. Under the different assumptions, the convergence of the algorithm is proved. Finally, numerical experiments verify the effectiveness of the algorithm.

Review
Computer Science and Mathematics
Mathematics

John Constantine Venetis

Abstract: This paper presents a comprehensive philosophical and historical critique of mathematical Platonism, arguing instead for an instrumentalist framework where mathematics evolves as an open-ended, highly adaptive sequence of pragmatic conventions driven by utility and the empirical demands of physical reality. By deconstructing foundational transitions across geometry, analysis, logic, and mathematical physics, we illustrate how mathematical rigour routinely relies on conceptual accommodations rather than a priori absolute truths. We begin by exposing a material paradox in Euclidean geometry: the physical act of constructing a circle via a compass violates Euclid’s Elements (c. 300 BC) definitions of dimensionless points and two-dimensional surfaces by piercing a three-dimensional substrate. Moving to projective geometry, we explore the visual and structural conventions of the vanishing point as an engineered fiction designed to satisfy the pragmatic utility of sight. In mathematical analysis, we examine how numerical approximations of transcendental constants—from Archimedes’ bounding of π to the modern proofs of transcendence for e (1873) and π (1882)—reveal a qualitative mutation where discrete rational sequences transform into irrational realities upon touching infinity, necessitating artificial axioms of completeness. Furthermore, we unpack the conceptual paradoxes of complex analysis, highlighting Euler’s arbitrary branch cuts designed to domesticate the multi-valued nature of the logarithm of negative numbers. We contextualize these foundational constraints through Gödel’s Incompleteness Theorems (1931) and Turing’s Halting Problem (1936), demonstrating that formal systems cannot achieve closed autonomy and must look outward for new conventions when encountering unprovable truths. This dependency is mirrored in continuum mechanics, where Cauchy’s stress tensor (1827) introduced a nine-component algebraic entity born purely out of the physical necessity to couple force vectors with oriented surfaces, fracturing classical vector spaces to satisfy empirical constraints. Crucially, we extend this critique to computational fluid dynamics and field simulations, demonstrating how contemporary mesh-based solvers violently subvert the Eulerian assumption of mutually independent spatial and temporal variables, shackling them through the pragmatic constraints of the Courant-Friedrichs-Lewy (CFL) stability criterion. Finally, we deconstruct the relativism of numerical truth through modular arithmetic, tracing its formalization from Gauss’s Disquisitiones Arithmeticae (1801) to its contemporary manifestation in asymmetric cryptography (RSA, 1978). By demonstrating how the structural modulus shifts the output of basic operations, we illustrate that numbers are pliable symbols conforming to the spaces we construct for them. Ultimately, this essay conceptualizes mathematics as a fluid, dynamic conceptual technology whose validation and internal cohesion are dictated not by a transcendental realm, but by its instrumental utility in decoding and manipulating the physical universe.

Article
Computer Science and Mathematics
Mathematics

Pranjal Srivastava

Abstract: This paper presents a simple geometric activity that begins with an elementary question: if an unknown angle is given and only a compass is available, can its measure be determined? We show that repeated copying of the angle around a circle provides a natural algorithm for measuring every rational degree angle exactly and for approximating irrational degree angles. Although the construction is purely geometric, understanding why it works introduces ideas from different areas of mathematics. The process leads to modular arithmetic, where the return of the copied ray is governed by divisibility and the greatest common divisor. This explains why the method succeeds for rational angles and why irrational angles never return exactly to the starting position. The same construction can also be interpreted algebraically by representing each rotation as multiplication by eiθ on the unit circle. From this viewpoint, repeated compass steps generate finite cyclic groups, the return condition becomes an equation involving roots of unity, and the construction connects naturally to cyclotomic polynomials and the classical theory of regular polygons. Rather than presenting new mathematical results, this paper shows how one accessible geometric problem can bridge geometry, number theory, and complex numbers. The same construction is viewed from three complementary perspectives: as a geometric algorithm, a number-theoretic explanation based on modular arithmetic, and an algebraic interpretation using roots of unity. This unified viewpoint illustrates how concepts usually taught separately can emerge naturally from a single geometric process and may help students develop a more connected understanding of mathematics.

Article
Computer Science and Mathematics
Mathematics

Jaiok Roh

Abstract: Let A be a unital JB*-algebra with unit 1, Jordan product ∘ and involution \( * \). Since the commutator formed from the Jordan product vanishes, we measure deviations by the Jordan associator {x, w} := (x ∘ w) ∘ w − x ∘ (w ∘ w). Let S(A) consist of those z ∈ A for which {z, a} = 0 for every a ∈ A. A mapping δ : A→ A is called an S(A)-extended Jordan \( * \)-derivation if additivity, the Jordan derivation identity and the involution condition hold modulo S(A). We assume that A ≠ C1, S(A) = C1, and the associator controls the distance to S(A); these conditions hold for Mn(C), n ≥ 2. Under dyadic summability and decay assumptions on the errors in a three-variable functional inequality and in the product and involution conditions, we obtain a unique S(A)-extended Jordan \( * \)-derivation L(x) = limn→∞2nδ(x/2n); an analogous result holds for limn→∞2−nδ(2nx). These limits exist in norm, whereas the quantitative approximation estimates control the associator error and the distance of L(x) − δ(x) to C1. The limit is additive and exactly \( * \)-preserving. An additional one-variable decay condition yields δ = L (superstability), and a unimodular version of the functional inequality yields C-linearity. Matrix examples demonstrate a nonzero limit and the distinction between associator control and full norm control.

Concept Paper
Computer Science and Mathematics
Mathematics

Zubair Hussain

Abstract: We study structural constraints on finite-time singularities of the three-dimensional incompressible Navier–Stokes equations, motivated by the recently announced construction of blow-up with a smooth, compactly supported force, which addresses alternatives (C) and (D) of the Clay Millennium formulation. First, we prove an angular-momentum budget for the azimuthal mean of an arbitrary smooth solution: the supremum of the mean circulation ru‾θ is bounded by its initial value, by the time integral of the azimuthal moment of the force and by the time integral of a flux produced by non-axisymmetric fluctuations. Consequently, a Type II singularity whose mean swirl satisfies |u‾θ |≳(T-t)-1/2-h at distance ≃(T-t)1/2 from the axis, as in the announced leading profile, is incompatible with axial symmetry near the singular time for any force satisfying the Clay decay conditions, and it requires fluctuations that deliver a divergent angular-momentum flux; a scaling argument further indicates that these fluctuations remain comparable to the mean swirl. Second, we derive necessary exponent windows for singular structures of amplitude (T-t)-a concentrated on the length scale (T-t)b, and we show that the exponents of the announced profile lie in the range in which the energy equality persists through the singular time, so that the singularity carries no anomalous dissipation provided that the full solution obeys the same scaling. Third, we use the dyadic model of Katz–Pavlović and Cheskidov as a laboratory: we compute the inviscid blow-up time and the front-propagation law, prove that a prescribed self-similar front requires a force that is time-integrable but unbounded unless its residual cancels at leading order in every shell, and report numerical evidence on the interval of dissipation exponents between the known blow-up and regularity thresholds. Finally, we assess the published objections to the forced construction and list the requirements that any construction for the unforced problem must satisfy. No claim is made concerning the unforced problem.

Article
Computer Science and Mathematics
Mathematics

Thomas R. Caulfield

Abstract: Quantum gravity requires a common language in which microscopic quantum structure, dynamical geometry, and the maps between them carry compatible mathematical types. We develop one from an eleven-generator real quadratic carrier of adopted signature (4,7), whose Clifford algebra Cl(4,7) has 2048 real basis blades; we call the resulting structure Rolandion algebra (R11). We establish an exact ordered-blade multiplication law, identify the 1024-dimensional even subalgebra, and separate 110 directed blade-replacement channels from the 55 metric-skew generators of so(4,7). Scale dependence is carried by a Clifford–Jordan family interpolating between the associative Clifford product and its Jordan symmetrization; the complete associator is obtained in closed form and shown, at fixed scale and for the declared regular bimodule, to be a Hochschild coboundary. Scale-labelled subalgebras with canonical defects form one category, while typed transfer restrictions generate a separate path category and presheaf topos. In a direct-sum Hilbert realization, adjoint-paired transfer blocks yield a self-adjoint Hamiltonian, unitary evolution, and exact antisymmetric population currents. The demonstrated gravitational branch is a four-dimensional Lorentzian base with an internal R11 bundle and a real covariant effective action; an eleven-dimensional geometric interpretation remains conditional. A three-qubit information-transfer model and normalized gravitational-wave, CMB, and laboratory responses illustrate constraint interfaces; no ultraviolet completeness is claimed.

Article
Computer Science and Mathematics
Mathematics

Lei Zhou

Abstract: We study similarity of matrices over the algebra of ordered pairs of normalized real numbers (OPNs) using its native shifted matrix cubes. For three fixed OPNs centers, the three independently given similarity classes determine the original class in every dimension if and only if all pairwise center differences are units. Three is the least uniform number of such observations. The substantive recovery step is a real matrix theorem: any three distinct real shifts suffice, whereas any two admit a six-dimensional real counterexample. The proof combines a finite-weight argument on a cubic rotation lattice, polynomial interpolation, and noncritical Jordan blocks; critical output blocks need not be used. The OPNs criterion follows through the two real characters of the coefficient algebra. As a complementary invariant, we show that labelled nullities of shifted powers through order ⌈n/2⌉, at all complex scalar parameters, determine similarity with an optimal uniform cutoff. Classical Smith–Fitting invariants and explicit higher evaluation modules place both descriptions in a self-contained algebraic framework.

Article
Computer Science and Mathematics
Mathematics

Dae Gwan Lee

Abstract: We prove that every four-interval partition of the unit interval admits a partition of the integers such that each frequency union is a Riesz spectrum for the corresponding union of intervals, and also for every interval with the same measure.

Article
Computer Science and Mathematics
Mathematics

Lei Zhou

Abstract: Forward and inverse iterates of F(x) = 2x −1 give binary weights whose sum is normalized to one. We prove that every interior initial value has continuum many representations, although the greedy rule selects a unique canonical code. In the product topology the canonical coding map is left-continuous; its discontinuities are exactly the interior points at which the greedy expansion terminates. These points form a countable dense set. Finite prefixes provide an upper approximation to the initial value with a uniform geometric error bound, while two canonical finite codes can differ in only one digit. Consecutive finite carries are impossible, but separated finite carries occur at a sequence of exact thresholds. Finite normalizations also have multiplicative identities which yield a transcendence theorem under Schanuel’s conjecture: no such normalization can contain an algebraic orbit value at or before its last selected index. We give the complete rank argument, distinguish unconditional low-depth results from this conditional theorem, and analyze a separate coordinate-resetting map without identifying it with a shift of the original code.

Article
Computer Science and Mathematics
Mathematics

Lei Zhou

Abstract: We study the Shannon entropy increment generated by the self-power escort transformation on a finite probability simplex, in which each coordinate is raised to its own value and the resulting weights are normalized. With the continuous boundary convention 00 = 1, we prove that entropy increases strictly at every nonuniform probability vector, in every dimension. The proof establishes the stronger fact that the entropy increment is strictly Schur-convex in the interior. Its main ingredient is a monotonicity estimate for the coordinate derivatives, based on an aggregation inequality for self-powers and a uniform two-point weight bound. A facewise argument extends strict entropy increase to all boundary points. We also prove binary output majorization and construct interior counterexamples to output majorization in every dimension at least five. Finally, we determine the sharp quadratic entropy-production coefficient near the uniform distribution. All map-specific ingredients are derived here; the entropy theorem does not assume a separate convergence or contraction theorem for the transformation.

Article
Computer Science and Mathematics
Mathematics

Lei Zhou

Abstract: For a fixed integer \( n\ge2 \), let \( \Delta_{n-1} \) denote the standard probability simplex in $\( \mathbb R^n \)$. We introduce and analyze the self-power escort transformation \( T_n:\Delta_{n-1}\to\Delta_{n-1} \) defined by \( \begin{equation*}T_n(p)_i=\frac{p_i^{p_i}}{\sum_{j=1}^n p_j^{p_j}},\qquad i=1,\ldots,n,\end{equation*} \) with the continuous boundary convention \( 0^0=1 \). Unlike the usual power escort transformation, whose exponent is an external parameter, the exponent here is the coordinate itself; equivalently, each coordinate is reweighted by \( \exp(p_i\log p_i) \). The paper proves that this elementary self-feedback rule has a rigid global dynamics. Every boundary point is immediately activated, every orbit enters an explicitly described compact core after one step, the uniform distribution is the unique fixed point, and the Hilbert log-diameter contracts exponentially after core entrance. Consequently every orbit converges exponentially to the uniform distribution, and no nontrivial periodic orbit exists. We then compute the complete linear spectrum and second-order normal form at the uniform state, obtaining a sign transition between the binary and higher-dimensional systems. For \( n\ge4 \), the post-core Hilbert contraction constant is sharpened to a two-variable min--max problem involving only the smallest and largest coordinates. We also classify the entire one-step uniformization fiber \( T_n^{-1}(\nu_n) \): besides the vertices and the uniform point, each dimension \( n\ge3 \) has exactly one nonuniform interior orbit type, up to permutation. Finally, in the binary case we prove global contraction in logit coordinates and an arithmetic escape phenomenon: algebraic irrational inputs become transcendental after one step, while rational nonuniform inputs become transcendental after two steps.

Article
Computer Science and Mathematics
Mathematics

Ilyas Khan

,

Talha Anwar

,

Osman Abdalla Adam Osman

Abstract: We introduce a Hausdorff-type fuzzy partial metric in the family of compact nonempty subsets of a fuzzy partial metric space (FPMS) and investigate its basic properties. The construction allows the usual set-valued Hausdorff approach to be formulated in a setting in which both fuzziness and nonzero self-distances are present. Using this structure, we establish a FP theorem for multivalued fuzzy (η)-contractive mappings on 1-complete FPMSs. The proof is based on the construction of an iterative sequence, the derivation of a geometric estimate through the function (η), and the completeness of the underlying space. An example is provided to verify the hypotheses of the main FP theorem and to illustrate the resulting FP. We further study a parameterized multivalued mapping and prove a homotopy FP theorem under suitable contractive, parameter-continuity, boundary, and local stability conditions. The result shows that the existence of a FP is preserved between the two endpoints of the parameter interval. These results extend the study of multivalued FP problems from partial metric and fuzzy metric settings to the combined framework of FPMSs.

Article
Computer Science and Mathematics
Mathematics

Saeid Jafari

Abstract: The purpose of this paper is to establish a systematic connection between multi-valued topological groups and neutrosophic multi-valued functions. Multi-valued algebraic structures generalize ordinary algebraic operations by allowing the product of two elements to be a nonempty subset rather than a single element. Hypergroups in the sense of Marty constitute one of the principal frameworks for such structures. On the other hand, neutrosophic theory incorporates truth, indeterminacy, and falsity components, while multi-valued neutrosophic sets permit these components to take sets of values rather than single numbers. We introduce a class of neutrosophic multi-valued functions adapted to compact-valued mappings and construct the neutrosophic lift of a multi-valued topological group. We define neutrosophic translations, neutrosophic hyperoperations, neutrosophic inverse maps, neutrosophic subgroups, and neutrosophic continuous homomorphisms. Several structural results are proved. In particular, we show that a Vietoris-continuous multi-valued group operation induces a natural neutrosophic multi-valued group-valued function whenever its three neutrosophic components are Vietoris-continuous. Conversely, suitable level-set conditions allow one to recover the underlying multi-valued topology from the neutrosophic representation. A principal result establishes an equivalence, under natural regularity conditions, between continuity of a neutrosophic multi-valued operation and simultaneous continuity of its truth, indeterminacy, and falsity components. We also investigate neutrosophic α-cuts, level hypergroups, neutrosophic subgroups, homomorphisms, quotient structures, and convergence. The resulting theory provides a bridge between topological hyperstructure theory, set-valued analysis, and neutrosophic mathematics.

Article
Computer Science and Mathematics
Mathematics

Lei Zhou

Abstract: Recursive interval algebras are built from \(R = \mathbb{Z}[\Omega^{-1}]\), where \(\Omega > 1\) is an integer, by repeated formation of ordered pairs. The component operations \(\operatorname{pos}\) and \(\operatorname{len}\) define arithmetic between arbitrary finite depths by descent to scalars. The finite levels realize commutative algebras with square-zero generators, and their path coordinates connect algebraic structure with a recursively weighted norm. A sharp one-level multiplication estimate yields exact constants for prescribed, possibly unequal, depths, with all equality cases and their attainability over the original coefficient ring. Both tensor orientations have fixed-block norm factorization and an exact criterion for mixed-depth inner-product factorization. Integral exponential and logarithmic operations determine normalized consecutive-block decompositions of units. Recursive derivative evaluation characterizes coefficient-ring preservation and gives sharp bounds on homogeneous inputs. Across unrestricted finite depths, local boundedness on a fixed-scalar fiber holds exactly when all derivative data of order at least two vanish. Degree scaling makes products contractive precisely on a Euclidean parameter ball, and outside that ball no finite depth-independent bound exists. Tensor concatenation further gives sharp commutator and Jordan associator estimates, including block-length-dependent constants and arithmetic conditions for attaining their endpoints.

Article
Computer Science and Mathematics
Mathematics

Ward Blondé

Abstract: Class ordinals and class cardinals are first defined as an extension of ordinals and cardinals, which are called set ordinals and set cardinals. In order to create an unambiguous definition of a maximally large class, this definition needs to quantify over all set theories. Accordingly, the Axiom of Maximal Strength (AMS) asserts that there exists a class cardinal that does not Ω+-provably exist in any MK-extending TM-fragment that has an injective theorem-preserving Ω+-interpretation into a ZFC-extending TM-fragment that is definable by a formula without parameters in the infinitary first-order language L∞,∞, where Ω+-provability and Ω+-interpretability are defined in a logic that can make a number of deductive steps equal to the number of sentences in L∞,∞. This logic is called Ω+-logic. The meta-theory TM that interprets AMS is presupposed to be Ω+-sound, Ω+-complete, and an infinitary extension of MK. It is then proven that TM is Ω+-consistent with AMS, that TM is maximally strong, and that the class Ord of all the ordinals TM proves to exist, is an Ω+-consistent version of Cantor's absolute infinite Ω.

Article
Computer Science and Mathematics
Mathematics

Mhamed Zineddine

,

Ray Zawdovski

Abstract: We introduce a Gaussian spectral-packet detector for horizontal displacement of the non-trivial zeros of the Riemann zeta function and connect it quantitatively to the prime side of the explicit formula. For distinct zeros \(\rho=\beta_\rho+i\gamma_\rho\) with multiplicity \(m_\rho\), let \(S_\lambda(t)=\sum_\rho m_\rho e^{-\lambda(z_\rho-t)^2},\qquad z_\rho=\gamma_\rho-i(\beta_\rho-\tfrac12),\) and for a compact interval \(I\), \(Q_I=\max\left\{0,\sup_\rho\left[(\beta_\rho-\tfrac12)^2-\mathrm{dist}(\gamma_\rho,I)^2\right]\right\}\). We prove that the logarithmic exponential rate of \(\sup_{t\in I}|S_\lambda(t)|\) is exactly \(Q_I\): a limsup for arbitrary compact \(I\), and a genuine limit when \(I\) has positive length. The interval lower bound uses an \(O(1/\lambda)\) micro-shift and a finite-dimensional norm-separation argument, preventing dominant-cluster phase cancellation from destroying the exponential rate. This yields an exact RH-equivalent subexponential-growth criterion. Using an even shifted Gaussian and the Guinand–Weil formula in a fixed \(2\pi\) Fourier convention, we derive \(S_\lambda=B_\lambda+G_\lambda-P_\lambda\) and prove an explicit uniform prime-tail estimate. In particular, a finite arithmetic reconstruction preserves the same exponential rate when \(\log N(\lambda)\ge(2+\varepsilon)\lambda\). We then examine the pre-asymptotic regime computationally: finite-prime peak reconstruction, blind synthetic off-critical-pair recovery, multi-pair interference, and nuisance-projected waveform identifiability. These computations test finite-scale identifiability only; they do not prove RH or identify an actual off-critical zero.

Article
Computer Science and Mathematics
Mathematics

Peter Jean-Paul

,

Shanaz Wahid

Abstract: The quantum measurement problem asks how the smooth, unitary evolution of a superposition gives way to a single, definite outcome when a macroscopic detector interacts with a quantum system. This paper presents a geometric toy model of this interaction, with a deterministic factorization stage and a probabilistic selection step. The entangled state of a quantum system and a detector is embedded into semi-structured complex (ℍ) state space, where newly introduced projection operators, called trigger transformations, factorize the entangled state into a tensor product of two identical subsystems: one describing the quantum system and one describing what the detector registers. This mirrored factorization is shown to reduce exactly to the original entangled state on projection back to standard Hilbert space. Branch-indexed selector operators R, also introduced here, then return the state to Hilbert space and retain a single branch (or measurement outcome), with the standard quantum probabilities acting as structural weights of the branches. The model thereby confines the non-unitary step of measurement to a single, explicitly defined selection operation, offering an alternative to an ad-hoc wave function collapse. In its present form, the outcome rule and the Born weights are stated as an explicit postulate rather than derived, and a possible coupling to background vacuum fluctuations is identified as a route to future experimental tests.

Article
Computer Science and Mathematics
Mathematics

Dae Gwan Lee

Abstract: We prove that every partition of \( [0,1) \) into five intervals admits a partition of \( \mathbb Z \) whose nonempty unions are Riesz spectra for the corresponding unions of intervals. No arithmetic assumption on the endpoints is required. The proof combines folding along the primes with local constructions in the rational affine space determined by the lengths. The rational-rank \( 3 \) case is based on a computer-assisted verification of a finite family of Fourier minors by exact integer arithmetic.

Article
Computer Science and Mathematics
Mathematics

Ahmed Hadi Hussain

,

Zahir Dobeas Al-Nafie

Abstract: In this study, the numerical comparison is performed in solving first-order neutrosophic initial value problems employing two algorithms, namely, the Euler and fourth-order Runge-Kutta (RK4) methods in the neutrosophic environment. As an example of such kind of problem, the model y^' (t)=0.5∙y(t) on [0,2] is chosen, but in the case of the additional neutrosophic initial condition y(0)=⟨(0.8,1.0,1.3)⟩. This problem is represented as crisp-endpoint systems by means of ( α,β,γ )-cut approach, and then, it is solved numerically at each cut level while using exact solution as a reference. In accordance with the iteration results, the maximum absolute error of the Euler algorithm at h=0.2 is 1.619×10^(-1) at point t=2, whereas for the RK4 approach, this value is 2.7×10^(-6), meaning that the improvement degree reaches about five orders of magnitude. The analysis of step refinement confirms the convergence orders of the methods that are 1.00 and 4.00 for the Euler and RK4 approaches, respectively.

of 38