On the Coupled of NBEM and CFEM for an Anisotropic Quasilinear Problem in an Unbounded Domain with a Concave Angle

In this paper, based on the Kirchhoff transformation and the natural boundary element method, a coupled natural boundary element and curved edge finite element is applied to solve the anisotropic quasi-linear problem in an unbounded domain with a concave angle. By using the principle of the natural boundary reduction, we obtain the natural integral equation on the artificial boundary of circular arc boundary, and get the coupled variational problem and its numerical method. Then the error and convergence of coupling solution are analyzed. Finally, some numerical examples are verified to show the feasibility of our method.

Second-Order MaxEnt Predictive Modelling Methodology. III: Illustrative Application to a Reactor Physics Benchmark

This work illustrates the innovative results obtained by applying the recently developed the 2nd-order predictive modeling methodology called “2nd- BERRU-PM”, where the acronym BERRU denotes “best-estimate results with reduced uncertainties” and “PM” denotes “predictive modeling.” The physical system selected for this illustrative application is a polyethylene-reflected plutonium (acronym: PERP) OECD/NEA reactor physics benchmark. This benchmark is modeled using the neutron transport Boltzmann equation (involving 21,976 uncertain parameters), the solution of which is representative of “large-scale computations.” The results obtained in this work confirm the fact that the 2nd-BERRU-PM methodology predicts best-estimate results that fall in between the corresponding computed and measured values, while reducing the predicted standard deviations of the predicted results to values smaller than either the experimentally measured or the computed values of the respective standard deviations. The obtained results also indicate that 2nd-order response sensitivities must always be included to quantify the need for including (or not) the 3rd- and/or 4th-order sensitivities. When the parameters are known with high precision, the contributions of the higher-order sensitivities diminish with increasing order, so that the inclusion of the 1st- and 2nd-order sensitivities may suffice for obtaining accurate predicted best- estimate response values and best-estimate standard deviations. On the other hand, when the parameters’ standard deviations are sufficiently large to approach (or be outside of) the radius of convergence of the multivariate Taylor-series which represents the response in the phase-space of model parameters, the contributions stemming from the 3rd- and even 4th-order sensitivities are necessary to ensure consistency between the computed and measured response. In such cases, the use of only the 1st-order sensitivities erroneously indicates that the computed results are inconsistent with the respective measured response. Ongoing research aims at extending the 2nd-BERRU-PM methodology to fourth-order, thus enabling the computation of third-order response correlations (skewness) and fourth-order response correlations (kurtosis).

Adaptive Reduced Basis Methods Applied to Structural Dynamic Analysis

The reduced basis methods (RBM) have been demonstrated as a promising numerical technique for statics problems and are extended to structural dynamic problems in this paper. Direct step-by-step integration and mode superposition are the most widely used methods in the field of the finite element analysis of structural dynamic response and solid mechanics. Herein these two methods are both transformed into reduced forms according to the proposed reduced basis methods. To generate a reduced surrogate model with small size, a greedy algorithm is suggested to construct sample set and reduced basis space adaptively in a prescribed training parameter space. For mode superposition method, the reduced basis space comprises the truncated eigenvectors from generalized eigenvalue problem associated with selected sample parameters. The reduced generalized eigenvalue problem is obtained by the projection of original generalized eigenvalue problem onto the reduced basis space. In the situation of direct integration, the solutions of the original increment formulation corresponding to the sample set are extracted to construct the reduced basis space. The reduced increment formulation is formed by the same method as mode superposition method. Numerical example is given in Section 5 to validate the efficiency of the presented reduced basis methods for structural dynamic problems.

AI-Enhanced Performance Evaluation of Python, MATLAB, and Scilab for Solving Nonlinear Systems of Equations: A Comparative Study Using the Broyden Method

This research extensively evaluates three leading mathematical software packages: Python, MATLAB, and Scilab, in the context of solving nonlinear systems of equations with five unknown variables. The study’s core objectives include comparing software performance using standardized benchmarks, employing key performance metrics for quantitative assessment, and examining the influence of varying hardware specifications on software efficiency across HP ProBook, HP EliteBook, Dell Inspiron, and Dell Latitude laptops. Results from this investigation reveal insights into the capabilities of these software tools in diverse computing environments. On the HP ProBook, Python consistently outperforms MATLAB in terms of computational time. Python also exhibits a lower robustness index for problems 3 and 5 but matches or surpasses MATLAB for problem 1, for some initial guess values. In contrast, on the HP EliteBook, MATLAB consistently exhibits shorter computational times than Python across all benchmark problems. However, Python maintains a lower robustness index for most problems, except for problem 3, where MATLAB performs better. A notable challenge is Python’s failure to converge for problem 4 with certain initial guess values, while MATLAB succeeds in producing results. Analysis on the Dell Inspiron reveals a split in strengths. Python demonstrates superior computational efficiency for some problems, while MATLAB excels in handling others. This pattern extends to the robustness index, with Python showing lower values for some problems, and MATLAB achieving the lowest indices for other problems. In conclusion, this research offers valuable insights into the comparative performance of Python, MATLAB, and Scilab in solving nonlinear systems of equations. It underscores the importance of considering both software and hardware specifications in real-world applications. The choice between Python and MATLAB can yield distinct advantages depending on the specific problem and computational environment, providing guidance for researchers and practitioners in selecting tools for their unique challenges.

Hopf Bifurcation Analysis of the Repressilator Model

The repressilator is a genetic network that exhibits oscillations. The net-work is formed of three genes, each of which represses each other cyclically, creating a negative feedback loop with nonlinear interactions. In this work we present a computational bifurcation analysis of the mathematical model of the repressilator. We show that the steady state undergoes a transition from stable to unstable giving rise to a stable limit-cycle in a Hopf bifurcation. The nonlinear analysis involves a center manifold reduction on the six-dimensional system, which yields closed form expressions for the frequency and amplitude of the oscillation born at the Hopf. A parameter study then shows how the dynamics of the system are influenced for different parameter values and their associated biological significance.

Computing the Moore-Penrose Inverse of a Matrix Through Symmetric Rank-One Updates

This paper presents a recursive procedure to compute the Moore-Penrose inverse of a matrix A. The method is based on the expression for the Moore-Penrose inverse of rank-one modified matrix. The computational complexity of the method is analyzed and a numerical example is included. A variant of the algorithm with lower computational complexity is also proposed. Both algorithms are tested on randomly generated matrices. Numerical performance confirms our theoretic results.

Operator Splitting Method for Coupled Problems:Transport and Maxwell Equations

In this article a new approach is considered for implementing operator splitting methods for transport problems, influenced by electric fields. Our motivation came to model PE-CVD (plasma-enhanced chemical vapor deposition) processes, means the flow of species to a gas-phase, which are influenced by an electric field. Such a field we can model by wave equations. The main contributions are to improve the standard discretization schemes of each part of the coupling equation. So we discuss an improvement with implicit Runge- Kutta methods instead of the Yee’s algorithm. Further we balance the solver method between the Maxwell and Transport equation.

Characteristics of an Accelerated Transverse Mechanical Pulse and Its Implications

In this report, two nontraditional mechanical wave-related issues are addressed. 1) Customary, for practical reasons the characteristics of the sinusoidal pulses progressing at a constant speed only is considered. And 2) the literature search shows that there has been no interest in exploring the characteristics of the pulses in a curvilinear two-dimensional space. By relaxing the first restriction we consider a scenario that which a mechanical pulse progresses with variable speed, specifically at a constant acceleration. We develop its equation of motion conducive to a homogenous linear partial differential equation with variable coefficients then we apply it to a practical problem. To address the 2nd point we depict a circular orbital embodying two Gaussian pulses circulating in opposite directions. Utilizing a Computer Algebra System (CAS), Mathematica, we develop animations visually easing the comprehension of the issues on hand.

Demystification of Vedic Multiplication Algorithm

The Vedic multiplication algorithm is a very fast way of oral calculation. However, the basis of the algorithm is not available so far. The present paper demystifies the general Vedic algorithm for multiplication by establishment of foundation of the Vedic algorithm of product finding through end results of conventional multiplication. This novel approach, i.e., finding algorithm from the end results of conventional calculations may be useful in devising algorithms similar to Vedic in cases of other calculations. Though the availability of cheap calculators made the Vedic Method obsolete, the present trend resurrected Vedic algorithms by their use in the design of computer processors for enhancing speed and performance.

Comparison of Numerical Approximations of One-Dimensional Space Fractional Diffusion Equation Using Different Types of Collocation Points in Spectral Method Based on Lagrange’s Basis Polynomials

Recently many research works have been conducted and published regarding fractional order differential equations. There are several approaches available for numerical approximations of the solution of fractional order diffusion equations. Spectral collocation method based on Lagrange’s basis polynomials to approximate numerical solutions of one-dimensional (1D) space fractional diffusion equations are introduced in this research paper. The proposed form of approximate solution satisfies non-zero Dirichlet’s boundary conditions on both boundaries. Collocation scheme produce a system of first order Ordinary Differential Equations (ODE) from the fractional diffusion equation. We applied this method with four different sets of collocation points to compare their performance.

An Efficient Direct Method to Solve the Three Dimensional Poisson’s Equation

In this work, the three dimensional Poisson’s equation in Cartesian coordinates with the Dirichlet’s boundary conditions in a cube is solved directly, by extending the method of Hockney. The Poisson equation is approximated by 19-points and 27-points fourth order finite difference approximation schemes and the resulting large algebraic system of linear equations is treated systematically in order to get a block tri-diagonal system. The efficiency of this method is tested for some Poisson’s equations with known analytical solutions and the numerical results obtained show that the method produces accurate results. It is shown that 19-point formula produces comparable results with 27-point formula, though computational efforts are more in 27-point formula.

Fourth-Order Adjoint Sensitivity Analysis of an OECD/NEA Reactor Physics Benchmark: II. Mathematical Expressions and CPU-Time Comparisons for Computing 4^th-Order Sensitivities

This work extends to fourth-order previously published work on developing the adjoint sensitivity and uncertainty analysis of the numerical model of a polyethylene-reflected plutonium (acronym: PERP) OECD/NEA reactor physics benchmark. Previous works showed that the third-order sensitivities of the PERP leakage response with respect to these total microscopic cross sections are far larger than the corresponding 1st-order and 2nd-order ones, thereby having the largest impact on the uncertainties induced in the PERP benchmark’s response. This finding has motivated the development of the original 4th-order formulas presented in this work, which are valid not only for the PERP benchmark but can also be used for computing the 4th-order sensitivities of response of any nuclear system involving fissionable material and internal or external neutron sources. Subsequent works will use the adjoint-based mathematical expressions obtained in this work to compute exactly and efficiently the numerical values of the largest fourth-order sensitivities of the PERP benchmark’s response to the total microscopic cross sections, and use them for a pioneering fourth-order uncertainty analysis of the PERP benchmark’s response.

Wavelets and Entropy for Power Quality Assessment

In this paper, wavelet transform and entropy are evaluated using the mathematical analysis concepts of reflexibility, regularity and series obtention, these concepts remark the reason to make a selective reference framework for power quality applications. With this idea the paper used the same treatment for the two algorithms (Multiresolution and Multiscale Entropy). The wavelet is denoted to have the most power full consistence to the light off the reflexibility, regularity and series obtention. The paper proposes a power quality technique namely MpqAT.

A Comparative Study on Numerical Solutions of Initial Value Problems (IVP) for Ordinary Differential Equations (ODE) with Euler and Runge Kutta Methods

This paper mainly presents Euler method and fourth-order Runge Kutta Method (RK4) for solving initial value problems (IVP) for ordinary differential equations (ODE). The two proposed methods are quite efficient and practically well suited for solving these problems. In order to verify the ac-curacy, we compare numerical solutions with the exact solutions. The numerical solutions are in good agreement with the exact solutions. Numerical comparisons between Euler method and Runge Kutta method have been presented. Also we compare the performance and the computational effort of such methods. In order to achieve higher accuracy in the solution, the step size needs to be very small. Finally we investigate and compute the errors of the two proposed methods for different step sizes to examine superiority. Several numerical examples are given to demonstrate the reliability and efficiency.

Computational Studies of Bacterial Colony Model

Microbiological experiments show that the colonies of the bacterium bacillus subtilis placed on a dish filled with an agar medium and nutrient form varied spatial patterns while the individual cells grow, reproduce and migrate on the dish in clumps. In this paper, we discuss a system of reaction-diffusion equations that can be used with a view to modelling this phenomenon and we solve it numerically by means of the method of lines. For the spatial discretization, we use the finite difference method and Galerkin finite element method. We present how the spatial patterns obtained depend on the spatial discretization employed and we measure the experimental order of convergence of the numerical schemes used. Further, we present the numerical results obtained by solving the model in a cubic domain.

A Solution to the 3x + 1 Problem

The author makes the claim to have a solution for the famous 3x + 1 problem. The key to its solution is a special proof that the term (3 + ε)r is a non-integer, as well as the use of properties of extremal points of a Collatz sequence.

Approximate Solutions for a Class of Fractional-Order Model of HIV Infection via Linear Programming Problem

In this paper, we provide a new approach to solve approximately a system of fractional differential equations (FDEs). We extend this approach for approximately solving a fractional-order differential equation model of HIV infection of CD4+T cells with therapy effect. The fractional derivative in our approach is in the sense of Riemann-Liouville. To solve the problem, we reduce the system of FDE to a discrete optimization problem. By obtaining the optimal solutions of new problem by minimization the total errors, we obtain the approximate solution of the original problem. The numerical solutions obtained from the proposed approach indicate that our approximation is easy to implement and accurate when it is applied to a systems of FDEs.

Time-Spectral Solution of Initial-Value Problems—Subdomain Approach

Temporal and spatial subdomain techniques are proposed for a time-spectral method for solution of initial-value problems. The spectral method, called the generalised weighted residual method (GWRM), is a generalisation of weighted residual methods to the time and parameter domains [1]. A semi-analytical Chebyshev polynomial ansatz is employed, and the problem reduces to determine the coefficients of the ansatz from linear or nonlinear algebraic systems of equations. In order to avoid large memory storage and computational cost, it is preferable to subdivide the temporal and spatial domains into subdomains. Methods and examples of this article demonstrate how this can be achieved.

An Upwind Finite Volume Element Method for Nonlinear Convection Diffusion Problem

A class of upwind finite volume element method based on tetrahedron partition is put forward for a nonlinear convection diffusion problem. Some techniques, such as calculus of variations, commutating operators and the a priori estimate, are adopted. The a priori error estimate in L2-norm and H1-norm is derived to determine the error between the approximate solution and the true solution.

High-Order Finite Difference Method for Helmholtz Equation in Polar Coordinates

We present a fourth-order finite difference scheme for the Helmholtz equation in polar coordinates. We employ the finite difference format in the interior of the region and derive a nine-point fourth-order scheme. Specially, ghost points outside the region are applied to obtain the approximation for the Neumann boundary condition. We obtain the matrix form of the linear system and the sparsity of the coefficient matrix is favorable for the computation of the Helmholtz equation. The feasibility and accuracy of the method are validated by two test examples which have exact solutions.