The aim of this survey is to review some recent developements in devising efficient preconditioners for sequences of linear systems A x = b. Such a problem arise in many scientific applications, such as discretization of transient PDEs, solution of eigenvalue problems, (Inexact) Newton method applied to nonlinear systems, rational Krylov methods for computing a function of a matrix. Full purpose preconditioners such as the Incomplete Cholesky (IC) factorization or approximate inverses are aimed at clustering eigenvalues of the preconditioned matrices around one. In this paper we will analyze a number of techniques of updating a given IC preconditioner (which we denote as P0 in the sequel) by a low-rank matrix with the aim of further improving this clustering. The most popular low-rank strategies are aimed at removing the smallest eigenvalues (deflation) or at shifting them towards the middle of the spectrum. The low-rank correction is based on a (small) number of linearly independent vectors whose choice is crucial for the effectiveness of the approach. In many cases these vectors are approximations of eigenvectors corresponding to the smallest eigenvalues of the preconditioned matrix P0 A. We will also review some techniques to efficiently approximate these vectors when incorporated within a sequence of linear systems all possibly having constant (or slightly changing) coefficient matrices. Numerical results concerning sequences arising from discretization of linear/nonlinear PDEs and iterative solution of eigenvalue problems show that the performance of a given iterative solver can be very much enhanced by the use of low-rank updates.

In this paper, we derive the distribution of eigenvalues for a 2×2 random confusion matrix stemming from a machine learning (ML) evaluation problem. Additionally, we present the distributions of both the matrix’s trace and the difference between the two traces of random confusion matrices. We also illustrate the application of these derived distributions in calculating the superiority probability of four baseline ML models.

This paper proposed a damping method for enhancing oscillatory stability performance of power systems with high penetration of renewable energy by a resilient wide-area multi-mode controller. The resilient wide-area multi-mode controller is used as an additional controller in a renewable energy system with a battery energy storage to enhance the damping of the critically weak modes. The weak modes are likely to be triggered in the event of line outages or any other disturbances, and the system may become unstable in the absence of proper corrective and preventive control. A firefly algorithm has been employed to design such a controller. Eigenvalue analysis and time-domain simulation are used to analyze the performance of the proposed controller in a realistic representative power system. From the simulation results, it is evident that the oscillatory stability performance of the renewable rich power system can be enhanced with the proposed control to keep the damping on critical modes to the industrial standards. Furthermore, renewable energy penetration can be increased significantly in the realistic representative system by introducing the proposed controller without disturbing the oscillatory stability margin.

We focus on macromolecules which are modelled as sequentially growing dual scale-free networks. The dual networks are built by replacing star-like units of the primal treelike scale-free networks through rings, which are then transformed in a small-world manner up to the complete graphs. In this respect, the parameter γ describing the degree distribution in the primal treelike scale-free networks regulates the size of the dual units. The transition towards the networks of complete graphs is controlled by the probability p of adding link between non-neighbouring nodes of the same initial ring. The relaxation dynamics of the polymer networks is studied in the framework of generalized Gaussian structures by using the full eigenvalue spectrum of the Laplacian matrix. The dynamical quantities on which we focus here are the averaged monomer displacement and the mechanical relaxation moduli. For several intermediate values of the parameter’s set (γ, p) we encounter for these dynamical properties regions of constant in-between slope.

Let G be a graph with n vertices and let 1; 2; : : : ; n be the eigenvalues of Randic matrix. The Randic Estrada index of G is REE(G) = Ón i=1 ei . In this paper, we establish lower and upper bounds for Randic index in terms of graph invariants such as the number of vertices and eigenvalues of graphs and improve some previously published lower bounds.

This article describes the Analytic Hierarchy Process (AHP) method which can be calculated by several methods. The AHP method is essential for the managerial decision-making to recognize which method is efficient for the calculation and to determine the proper order of criteria. In the article there are included methods that can be used in order to calculate the matrix in the AHP process for setting criteria such as Geometric mean, Arithmetic mean, Row sum of the adjusted the Saaty matrix, Reverse sums of the Saaty matrix columns and Row sums of the Saaty matrix. The paper is focused on the accuracy of the methods used. The results show that the most accurate method is the Saaty method, and the second most accurate method is the geometric mean in order to determine the ranking. This method is easier to use when the same order is achieved as in the Saaty method, followed by Geometric mean, which is favourable for fast and easy determination of alternatives using in the AHP process. The survey carried out among managers graduated from Universities and Colleges in Slovakia showed that the respondents considered the Saaty method as the most complex and also the most difficult method and the geometric mean average method the simplest method. 44% of respondents stated that they are capable to use a program to calculate the AHP. 46% of respondents said they had experience with some method related to the managerial decision-making process. 72% of managers regarded as important to manage some method for decision-making in their managerial position.

In this paper we provide a highly selected review and synthesis on some of the recent and notable contribution to research in portfolio analysis. A unique perspective on this development in the literature is offered in this paper by judiciously identifying a few sample eigenvalues adjustment patterns in a portfolio that leads to an improvement in the out-of-sample portfolio Sharpe ratio when the population covariance matrix admits a high-dimensional factor model. These patterns unveil a key insight into a portfolio performance improvement and shed an important light on the effectiveness of a few recently introduced ”robust to estimation errors” covariance matrix estimation approaches, which were not originally designed with the goal to improve the out-of-sample portfolio performance.

In this article, we establish the existence of and then compare smallest eigenvalues for nabla fractional boundary value problems involving a fractional difference boundary condition, using the theory of u0-positive operators with respect to a cone in a Banach space.

An empirical investigation was carried out to study the relationship between the soil characteristics, including the Nitrogen (N), Phosphorus (P), Potassium (K), potential of Hydrogen (pH), Electrical conductivity (EC), Sulfur (S,), Zinc (Zn), Iron (Fe), Copper (Cu), Manganese (Mn) and Boron (B) using principal component analysis (PCA), Factor Analysis (FA), and Canonical Correlation analysis (CCA) for data reduction multivariate techniques. The first five main components accounted for 24.22%, 18.52%, 16.1%, 9.97%, and 9.27% of sample variances, respectively. All five principal components (PCs) accounted for 78.07% of the sample variance. The soil characteristics viz., P and K have highly dominated the first PC; the soil characteristics N and pH have dominated the second PC; K, EC, and Cu have dominated the third PC; Fe, Mn, and pH have dominated in the fourth PC; whereas the parameter Cu dominated the fifth PC. The first factor showed a strong negative loading on S and a strong favorable loading on Cu; P, K, and EC have substantial positive loadings in the second factor. Significant positive loadings on Mn, Fe, Cu, pH, N, and K are present in the third component. The fourth factor had a significantly positive pH, Fe, N, P, K, and B loadings. Fe, P, and B have much weight in the fifth factor. The soil characteristics viz., N, Zn, pH, K, Fe, and Mn have dominated the first PC; the soil characteristics B, P, S, Zn, and Fe have dominated the second PC; B and P have dominated the third PC whereas the only character Cu dominated the fourth PC. Cu and OC have much weight in the fourth factor. The canonical redundancies for dependent and independent sets are 12% and 17%, respectively. The Stewart-Love canonical redundancy index is 70.58%, which means that the first linear combination of the X-set explains 70.58% of the total variance in the Y-set.

In the research we consider a structure-fluid interaction of oscillating piezodevice and acoustic liquid. Such problem requires finding resonance or anti-resonance frequencies of the solid structure to use them in the latter frequency-response analyses step. After finite element discretization of the issue, we need to solve a generalized eigenvalue problem (GEP). The most efficient numerical method for solving the partial GEP is the shift-and-invert Lanczos method. Each step of this algorithm requires solving a large scale system of linear algebraic equations (SLAEs) with special properties. Various ways of ordering grid nodes lead to coefficient matrices with different structure. Several methods are compared in terms of efficiency. The results of the numerical experiments are presented.

The field dynamics of neutral and charged matter (treated as gauge fields) beyond the event horizon of black holes are investigated. As an extension of the work done in Ganesan (2023) [1], the analysis was done using the combined dynamics of the two-dimensional Yang-Mills and Liouville gravity fields beyond the event horizon. The quantum interactions and symmetry breaking mechanisms of the combined two-dimensional fields are discussed. The second part of this paper explores the quantum dynamics occurring at the event horizon. By considering the structure of the event horizon as a Möbius strip (embedded in three-dimensional space), a formulation for the lower bound of the first energy eigenvalue of a quantum particle (electron) at the event horizon is obtained.

New or in-service truss bridges, with or without upper bracing systems, may display instability phenomena such as general lateral torsional buckling of the upper chord. The buckling of structural elements, particularly in the case of steel bridges, can be associated with the risk of collapse or temporary/permanent withdrawal from service. Buckling poses a significant danger as it often occurs at lower load values compared to those considered during the design phase. Additionally, this phenomenon can manifest suddenly, without prior warning, rendering intervention for its prevention impossible or futile. In contemporary times, most research and design calculation software offer the capability to establish preliminary values for buckling loads, even for highly intricate structures. This is typically achieved through linear eigenvalue buckling analyses, often followed by significantly more complex large displacement nonlinear analyses. However, interpreting the results for complex bridge structures can be challenging, and their accuracy is difficult to ascertain. Consequently, the objective of this paper is to introduce an original method for a more straightforward estimation of the buckling load of the upper chord in steel truss bridges. The method utilizes the theory of beams on an elastic foundation. The buckling load of the upper chord was determined using both the finite element method and the proposed methodology, yielding highly consistent results.

This work has its origin in intuitive physical and statistical considerations. The problem of optimizing an artificial neural network is treated as a physical system, composed of a conservative vector force field. The derived scalar potential is a measure of the potential energy of the network, a function of the distance between predictions and targets. Starting from some analogies with wave mechanics, the description of the sys-tem is justified with an eigenvalue equation that is a variant of the Schr˜odinger equation, in which the potential is defined by the mutual information between inputs and targets. The weights and parameters of the network, as well as those of the state function, are varied so as to minimize energy, using an equivalent of the variational theorem of wave mechanics. The minimum energy thus obtained implies the principle of minimum mutual information (MinMI). We also propose a definition of the potential work produced by the force field to bring a network from an arbitrary probability distribution to the potential-constrained system, which allows to establish a measure of the complexity of the system. At the end of the discussion we expose a recursive procedure that allows to refine the state function and bypass some initial assumptions, as well as a discussion of some topics in quantum mechanics applied to the formalism, such as the uncertainty principle and the temporal evolution of the system. Results demonstrate how the minimization of energy effectively leads to a decrease in the average error between network predictions and targets.

In this paper, some mixed type bounds on the spectral radius $\rho(A\circ B)$ for the Hadamard product of two nonnegative matrices ($A$ and $B$) and the minimum eigenvalue $\tau(C\star D)$ of the Fan product of two $M$-matrices ($C$ and $D$) are researched. These bounds complement some corresponding results on the simple type bounds. In addition, a new lower bound on the minimum eigenvalue of the Fan product of several $M$-matrices is also presented: $$ \tau(A_{1}\star A_{2}\cdots\star A_{m})\geq \min_{1\leq i\leq n}\{\prod^{m}_{k=1}A_{k}(i,i)-\prod^{m}_{k=1}[A_{k}(i,i)^{P_{k}}-\tau(A_{k}^{(P_{k})})]^\frac{1}{P_{k}}\}, $$ where $A_{1},\ldots, A_{k}$ are $n\times n$ $M$-matrices and $P_{1},\ldots, P_{k}>0$ satisfy $\sum^{m}_{k=1}\frac{1}{P_{k}}\geq 1$. Some special cases of the above result and numerical examples show that this new bound improves some existing results.

Abstract Big datasets are becoming increasingly common and can be challenging to understand and apply in public health. One method for lowering the dimensionality of these datasets and improving interpretability while minimizing information loss is data reduction using principal component analysis (PCA). It achieves this by successively maximizing variance through the creation of new, uncorrelated variables. PCA is an adaptive data analysis technique because it simplifies the process of finding new variables, or principal components, by solving an eigenvalue or eigenvector problem. These new variables are determined by the dataset being used, rather than by the analyst starting from scratch. It is also adaptable in another way because varieties of the method have been designed to adjust to various data structures and types. However, there are serious problems in the theoretical understanding and practical application of PCA in public health researchers, whereas its application is becoming popular in developing countries. Therefore, this article, which concentrated on using PCA to reduce data, began by outlining the fundamental concepts of PCA and going over what it can and cannot do, as well as when and how to use it. We also discussed the fundamental assumptions, benefits, and drawbacks of PCA. Furthermore, this article demonstrated and resolved PCA practical application problems in public health that most scholars are unaware of, such as variable preparation, variable inclusion and exclusion criteria for PCA, iteration steps, wealth index analysis, interpretation, and ranking.

This study demonstrates a global, non-parametric, non-iterative optimization of time-mean value of a kind of index vibrated by time-varying forcing. It is based on the fact that the (steady) forced vibration of non-autonomous ordinary differential equation systems is well approximated by an analytical solution when the amplitude of forcing is sufficiently small and its base state without forcing is linearly stable and steady. It is applied to optimize a time-averaged heat-transfer rate on a two-dimensional thermal convection field in a square cavity with horizontal temperature difference, and the globally optimal way of vibrational forcing, i.e. the globally optimal, spatial distribution of vibrational heat and vorticity sources, is first obtained. The maximized vibrational thermal convection corresponds well to the state of internal gravity wave resonance. In contrast, the minimized thermal convection is weak, keeping the boundary layers on both sidewalls thick.

In this paper, the author utilizes Saddle Theorem and variational methods to deduce existence of at least six stationary solutions for reaction-diffusion Gilpin-Ayala competition model (RDGACM). To obtain the global stabilization of the positive stationary solution of the RDGACM, the author designs a suitable impulsive event triggered mechanism (IETM) to derive the global exponential stability of the the positive stationary solution. It is worth mentioning that the new mechanism can exclude Zeno behavior and effectively reduce the cost of impulse control through event triggering mechanism. Besides, compared with existing literature, the restrictions on the parameters of the RDGACM are relaxed so that the methods used in existing literature can not be applied to the relaxed case of this paper, and so the author makes comprehensive use of Saddle Theorem, orthogonal decomposition of Sobolev space $H_0^1(\Omega)$ and variational methods to overcome the mathematical difficulty. Numerical examples show the effectiveness of the methods proposed in this paper.

Quantum mechanics could be studied through polynomial algebra, as has been demonstrated by a work (“An approach to first-principles electronic structure calculation by symbolic-numeric computation” by A. Kikuchi). We carry forward the algebraic method of quantum mechanics through algebraic number theory; the basic equations are represented by the multivariate polynomial ideals; the symbolic computations process the ideal and disentangle the eigenstates as the algebraic variety; upon which one canbuild the Galois extension of the number field, in analogy with the univariate polynomial case, to investigate the hierarchy of solutions; the Galois extension is accompanied with the group operations, which permute the eigenstates from one to another, and furnish the quantum system with a non-apparent symmetry. Besides, this sort of algebraic quantum mechanics is an embodiment of the class field theory; some of the important consequences of the latter emerge in quantum mechanics. We shall demonstrate these points through simple models; we will see the use of computational algebra facilitates such sort of analysis, which might often be complicated if we try to solve them manually.

A new framework in quantum chemistry has been proposed recently ("An approach to first principles electronic structure calculation by symbolic-numeric computation'' by A. Kikuchi). It is based on the modern technique of computational algebraic geometry, viz. the symbolic computation of polynomial systems. Although this framework belongs to molecular orbital theory, it fully adopts the symbolic method. The analytic integrals in the secular equations are approximated by the polynomials. The indeterminate variables of polynomials represent the wave-functions and other parameters for the optimization, such as atomic positions and contraction coefficients of atomic orbitals. Then the symbolic computation digests and decomposes the polynomials into a tame form of the set of equations, to which numerical computations are easily applied. The key technique is Grröbner basis theory, by which one can investigate the electronic structure by unraveling the entangled relations of the involved variables. In this article, at first, we demonstrate the featured result of this new theory. Next, we expound the mathematical basics concerning computational algebraic geometry, which are necessitated in our study. We will see how highly abstract ideas of polynomial algebra would be applied to the solution of the definite problems in quantum mechanics. We solve simple problems in "quantum chemistry in algebraic variety'' by means of algebraic approach. Finally, we review several topics related to polynomial computation, whereby we shall have an outlook for the future direction of the research.