Matrix Exponential Research Articles

Stability analysis of quasilinear systems on time scale based on a new estimation of the upper bound of the time scale matrix exponential function

In this paper, the stability of quasilinear systems on time scale is analyzed based on a new estimation of the upper bound of the time scale matrix exponential function. First, some new upper bounds for the norm of the matrix exponential function eA(t,t0) are derived, where A is a regressive square matrix, t,t0∈T, T being a time scale. The matrix exponential function generalizes the usual matrix exponential as well as the integer power of a matrix. It is shown that the obtained bounds are more accurate compared to the existing bounds of the norm of the matrix exponential function. One of the upper bounds is then used for stability investigation of quasilinear systems evolving on arbitrary time domains.

Computation of the Golden Matrix Exponential Functions of Special Matrices

Computation of the matrix exponential functions is important in solving various scientific and engineering problems due to their active role in solving differential equations. Accurate and effective computation of these functions determines the success of mathematical analysis and practical applications. Therefore, studying and understanding matrix exponential functions is the key to developing mathematical and engineering sciences. In the present paper, we aim to compute the values of the $1$st and $2$nd type Golden matrix exponential functions for some special matrices. We present the similarities and differences with the value of the well-known matrix exponential function for the same special matrices.

Lamb waves in sandwich structures: Anomalous dispersion and transverse (quasi) resonances

Guided waves propagating in three layered sandwich structures with extremely soft inner layer and thin stiff outer layers reveal peculiar phenomena related to the appearance of dual zero group velocities (ZGV) in the fundamental symmetric branch, transverse (quasi) resonances, and transverse energy fluxes, causing “ringing” of the plates and even material damage. The current research relates to sandwich plates, satisfying the so-called Wiechert condition. The analysis is based on the combined method comprising Cauchy sextic formalism and the exponential fundamental matrix method.

Exponential time propagators for elastodynamics

We propose a computationally efficient and systematically convergent approach for elastodynamics simulations. We recast the second-order dynamical equation of elastodynamics into an equivalent first-order system of coupled equations, so as to express the solution in the form of a Magnus expansion. With any spatial discretization, it entails computing the exponential of a matrix acting upon a vector. We employ an adaptive Krylov subspace approach to inexpensively and accurately evaluate the action of the exponential matrix on a vector. In particular, we use an apriori error estimate to predict the optimal Krylov subspace size required for each time-step size. We show that the Magnus expansion truncated after its first term provides quadratic and superquadratic convergence in the time-step for nonlinear and linear elastodynamics, respectively. We demonstrate the accuracy and efficiency of the proposed method for one linear (linear cantilever beam) and three nonlinear (nonlinear cantilever beam, soft tissue elastomer, and hyperelastic rubber) benchmark systems. For a desired accuracy in energy, displacement, and velocity, our method allows for 10−100× larger time-steps than conventional time-marching schemes such as Newmark-β method. Computationally, it translates to a ∼1000× and ∼10−100× speed-up over conventional time-marching schemes for linear and nonlinear elastodynamics, respectively.

Efficient simulation of complex Ginzburg–Landau equations using high-order exponential-type methods

In this paper, we consider the task of efficiently computing the numerical solution of evolutionary complex Ginzburg–Landau equations on Cartesian product domains with homogeneous Dirichlet/Neumann or periodic boundary conditions. To this aim, we employ for the time integration high-order exponential methods of splitting and Lawson type with constant time step size. These schemes enjoy favorable stability properties and, in particular, do not show restrictions on the time step size due to the underlying stiffness of the models. The needed actions of matrix exponentials are efficiently realized by using a tensor-oriented approach that suitably employs the so-called μ-mode product (when the semidiscretization in space is performed with finite differences) or with pointwise operations in Fourier space (when the model is considered with periodic boundary conditions). The overall effectiveness of the approach is demonstrated by running simulations on a variety of two- and three-dimensional (systems of) complex Ginzburg–Landau equations with cubic or cubic-quintic nonlinearities, which are widely considered in literature to model relevant physical phenomena. In fact, we show that high-order exponential-type schemes may outperform standard techniques to integrate in time the models under consideration, i.e., the well-known second-order split-step method and the explicit fourth-order Runge–Kutta integrator, for stringent accuracies.

3D electro-elastic static analysis of advanced plates and shells

The proposed three-dimensional (3D) coupled electro-elastic shell model allows the static analysis of smart structures embedding classical piezoelectric and functionally graded piezoelectric layers. Plates, cylindrical and spherical panels are investigated in both sensor and actuator configurations. The primary variables of the coupled model are displacement components and the electric potential. Therefore, displacements, stresses, strains, electric potential and electric displacements are calculated for smart structures used as sensors (applied mechanical load) and smart structures used as actuators (applied electric potential). In the case of spherical shells, 3D equilibrium equations are coupled with the 3D divergence electric displacement equation. The obtained coupled system is also valid for cylindrical shells and plates thanks to the use of a mixed curvilinear orthogonal reference system. The partial differential governing equations are solved using the Navier harmonic form and the exponential matrix method for simply supported structures. Preliminary assessments are proposed to validate the model and further benchmarks are analyzed to discuss the effects connected with the thickness ratio, the lamination scheme, the load conditions, the geometry of the structures and the employed materials. The main innovation point of the proposed model is the possibility to analyze several geometries including different materials and applied loads by means of a unique and general formulation where partial differential equations are solved in closed form. The use of functionally graded piezoelectric materials allows to eliminate all stress component discontinuities at each layer interface.

Cloud‐mediated self‐triggered synchronisation of a general linear multi‐agent system over a directed graph

AbstractThe authors propose a self‐triggered synchronisation control method of a general high‐order linear time‐invariant multi‐agent system through a cloud repository. In the cloud‐mediated self‐triggered control, each agent asynchronously accesses the cloud repository to obtain past information about its neighbouring agents. Then, the agent predicts future behaviours of its neighbours as well as of its own and locally determines its next access time to the cloud repository. In the case of a general high‐order linear agent dynamics, each agent has to estimate exponential evolution of its trajectory characterised by eigenvalues of a system matrix, which is different from single/double integrator or first‐order linear agents. The authors’ proposed method deals with exponential behaviours of the agents by tightly evaluating the bounds on matrix exponentials. Based on these bounds, the authors design the self‐triggered controller through a cloud that achieves the bounded state synchronization of the closed‐loop system without exhibiting any Zeno behaviours. The effectiveness of the proposed method is demonstrated through the numerical simulation.

Three-dimensional vibration analysis of multilayered composite and functionally graded piezoelectric plates and shells

In the present paper, a coupled 3D exact electro-elastic shell model for Functionally Graded (FG) and composite piezoelectric structures is proposed. Primary variables of the electro-elastic model are the electric potential and the three displacement components. The model allows to evaluate the piezoelectric effect in terms of frequencies and vibration modes. Both closed and open circuit configurations are analyzed and compared. The 3D equilibrium equations and the 3D divergence electric displacement equation for spherical shells give the set of partial differential equations for the electro-elastic problem. The proposed model for spherical shells automatically degenerates into simpler models for plates and cylindrical shells via properly considerations on radii of curvature along in-plane directions. The orthogonal mixed curvilinear coordinates α, β and z are employed. The partial differential governing equations have constant coefficients considering fictitious layers and they are solved using the Navier harmonic form and the exponential matrix method. These features lead to an exact solution for simply-supported boundary conditions. Free vibration analyses are conducted and circular frequencies for the first three thickness vibration modes are computed. After a global assessment phase to verify the correctness of the developed model, new benchmarks are proposed: different thickness ratios and material configurations are investigated. The present work can be intended as a reference general solution for those scientists interested in the study of piezoelectric structures via 2D analytical and numerical formulations.

3D modelling of ground magnetic-source airborne TEM data for anisotropic media based on the rational Krylov method

With the rapid development of the transient electromagnetic method (TEM), the numerical simulations of three-dimensional anisotropic media have garnered attention. This study used the rational Krylov method to realise the three-dimensional modelling of the ground magnetic-source airborne transient electromagnetic data for arbitrary anisotropic media. First, based on Maxwell's equations, a time-domain electromagnetic equation was derived for anisotropic media. The finite difference method was employed to discretise the equation, and the electromagnetic field was then expressed as the product of an exponential matrix and a vector related to the source. Subsequently, the rational Arnoldi algorithm was adopted to construct the rational Krylov subspace orthogonal basis vectors, and the electromagnetic fields at different times were obtained based on a model reduction strategy. The accuracy of the proposed algorithm was verified through the comparisons of its results with those of other software packages. We calculated the response for different anisotropic parameters of the typical three-dimensional anisotropic models, and analysed the influence of the anisotropic media on the ground magnetic-source airborne transient electromagnetic data. The proposed three-dimensional forward TEM algorithm provides important technical support for identifying the anisotropic geological bodies and lays the foundation for further inversion research.

An Efficient Algorithm for Basic Elementary Matrix Functions with Specified Accuracy and Application

If the matrix function f(At) posses the properties of f(At)=gf(tkA, then the recurrence formula fi−1=gfi,i=N,N−1,⋯,1,f(tA)=f0, can be established. Here, fN=f(AN)=∑j=0majANj,AN=tkNA. This provides an algorithm for computing the matrix function f(At). By specifying the calculation accuracy p, a method is presented to determine m and N in a way that minimizes the time of the above algorithm, thus providing a fast algorithm for f(At). It is important to note that m only depends on the calculation accuracy p and is independent of the matrix A and t. Therefore, f(AN) has a fixed calculation format that is easily computed. On the other hand, N depends not only on A, but also on t. This provides a means to select t such that N is equal to 0, a property of significance. In summary, the algorithm proposed in this article enables users to establish a desired level of accuracy and then utilize it to select the appropriate values for m and N to minimize computation time. This approach ensures that both accuracy and efficiency are addressed concurrently. We develop a general algorithm, then apply it to the exponential, trigonometric, and logarithmic matrix functions, and compare the performance with that of the internal system functions of Mathematica and Pade approximation. In the last section, an example is provided to illustrate the rapid computation of numerical solutions for linear differential equations.

A robust numerical scheme for solving Riesz-tempered fractional reaction–diffusion equations

The Fractional Diffusion Equation (FDE) is a mathematical model that describes anomalous transport phenomena characterized by non-local and long-range dependencies which deviate from the traditional behavior of diffusion. Solving this equation numerically is challenging due to the need to discretize complicated integral operators which increase the computational costs. These complexities are exacerbated by nonlinear source terms, nonsmooth data and irregular domains. In this study, we propose a second order Exponential Time Differencing Finite Element Method (ETD-RDP-FEM) to efficiently solve nonlinear FDE, posed in irregular domains. This approach discretizes matrix exponentials using a rational function with real and distinct poles, resulting in an L-stable scheme that damps spurious oscillations caused by non-smooth initial data. The method is shown to outperform existing second-order methods for FDEs with a higher accuracy and faster computational time.

Identities of matrix powers of a matrix and matrix power of matrix on lie groups

This paper introduces fundamental definitions pertaining to Matrix Lie Groups and Lie Algebra. We illustrate the concepts of the exponential of a matrix and the logarithm of a matrix as integral components of our discourse. We introduce novel identities related to the matrix powers of a matrix. To prove these identities, we employ the results of the matrix powers of a matrix. Finally, we derive an expression for the matrix powers of a matrix within the context of a connected matrix lie group.

Model refinements with experimental validation in piezoelectric plate actuators

The axisymmetric vibration analysis of circular plates with piezoelectric layers and step changes in plate thickness is conducted. For the chosen configurations, it is necessary to solve a coupled system of differential equations for extensional and flexural vibration to obtain accurate modal results. The adopted computational approach is based upon the classical transfer matrix method. Instead of employing analytical solutions in the form of e.g. Bessel functions, matrix exponentials of the system matrix are directly computed in the transfer matrices for finding highly accurate solutions. The developed approach has enabled the complete quantitative modal analysis in piezoelectric actuators. The procedure is firstly verified against available analytical results for natural frequencies and modes shapes in circular homogeneous plates, and by using finite element simulations for plates with asymmetric step changes in thickness. Ultimately, the developed approach is validated against experimental results of relevance to applications in piezoelectric synthetic jet actuation. The obtained numerical results for modal parameters and frequency response functions are in excellent agreement with the available analytical results, and with previous and newly presented in the paper experimental data, when considering the inherent uncertainty in parameter values. Based on extensive experimental results, realistic damping is introduced in the model of piezoelectric plate actuators. Importantly, it is shown that solutions of high accuracy can be obtained by a more general coordinate system than that traditionally linked to the plate neutral plane(s).

More Numerically Accurate Algorithm for Stiff Matrix Exponential

In this paper, we propose a novel, highly accurate numerical algorithm for matrix exponentials (MEs). The algorithm is based on approximating Putzer’s algorithm by analytically solving the ordinary differential equation (ODE)-based coefficients and approximating them. We show that the algorithm outperforms other ME algorithms for stiff matrices for several matrix sizes while keeping the computation and memory consumption asymptotically similar to these algorithms. In addition, we propose a numerical-error- and complexity-optimized decision tree model for efficient ME computation based on machine learning and genetic programming methods. We show that, while there is not one ME algorithm that outperforms the others, one can find a good algorithm for any given matrix according to its properties.

The distance decay effect and spatial reach of spillovers

This paper quantifies and graphically illustrates the distance decay effect and spatial reach of spillover effects derived from a spatial Durbin (SD) model with parameterized spatial weight matrices. Building on attributes of the concept of spatial autocorrelation developed by Arthur Getis, we adopt a distance-based negative exponential spatial weight matrix and parameterize it by a decay parameter that is different for each spatial lag in this model, both of the regressand and of all regressors. The quantification and illustration are applied to the spatially augmented neoclassical growth framework, which we estimate using data for 266 NUTS-2 regions in the EU over the period 2000–2018. We find distance decay parameters ranging from 0.233 to 2.224 and spatial reaches ranging from 700 to more than 1500 km for the different growth determinants in this model. These wide ranges highlight the restrictiveness of the conventional SD model based on one common spatial weight matrix for all spatial lags.

Monitoring Dynamically Changing Migratory Flocks Using an Algebraic Graph Theory-Based Clustering Algorithm

Migration flocks have different forms, including single individuals, formations, and irregular clusters. The shape of a flock can change swiftly over time. The real-time clustering of multiple groups with different characteristics is crucial for the monitoring of dynamically changing migratory flocks. Traditional clustering algorithms need to set various prior parameters, including the number of groups, the number of nearest neighbors, or the minimum number of individuals. However, flocks may display complex group behaviors (splitting, combination, etc.), which complicate the choice and adjustment of the parameters. This paper uses a real-time clustering-based method that utilizes concepts from the algebraic graph theory. The connected graph is used to describe the spatial relationship between the targets. The similarity matrix is calculated, and the problem of group clustering is equivalent to the extraction of the partitioned matrices within. This method needs only one prior parameter (the similarity distance) and is adaptive to the group’s splitting and combination. Two modifications are proposed to reduce the computation burden. First, the similarity distance can be broadened to reduce the exponent of the similarity matrix. Second, the omni-directional measurements are divided into multiple sectors to reduce the dimension of the similarity matrix. Finally, the effectiveness of the proposed method is verified using the experimental results using real radar data.

Some results for min matrices associated with Chebyshev polynomials

Abstract In the present study, inspired by the studies in the literature, we consider Min matrix and its Hadamard exponential matrix family whose elements are Chebyshev polynomials of the first kind. Afterwards, we examine their various linear algebraic properties and obtain some inequalities. Furthermore, we shed light on the results we obtained to boost the clarity of our paper with the illustrative examples. In addition to all these, we give two MATLAB-R2023a codes that compute the Min matrix and the Hadamard exponential matrix with Chebyshev polynomials of the first kind entries, as well as calculate some matrix norms.

Avoiding matrix exponentials for large transition rate matrices.

Exact methods for the exponentiation of matrices of dimension N can be computationally expensive in terms of execution time (N3) and memory requirements (N2), not to mention numerical precision issues. A matrix often exponentiated in the natural sciences is the rate matrix. Here, we explore five methods to exponentiate rate matrices, some of which apply more broadly to other matrix types. Three of the methods leverage a mathematical analogy between computing matrix elements of a matrix exponential process and computing transition probabilities of a dynamical process (technically a Markov jump process, MJP, typically simulated using Gillespie). In doing so, we identify a novel MJP-based method relying on restricting the number of "trajectory" jumps that incurs improved computational scaling. We then discuss this method's downstream implications on mixing properties of Monte Carlo posterior samplers. We also benchmark two other methods of matrix exponentiation valid for any matrix (beyond rate matrices and, more generally, positive definite matrices) related to solving differential equations: Runge-Kutta integrators and Krylov subspace methods. Under conditions where both the largest matrix element and the number of non-vanishing elements scale linearly with N-reasonable conditions for rate matrices often exponentiated-computational time scaling with the most competitive methods (Krylov and one of the MJP-based methods) reduces to N2 with total memory requirements of N.

High-order linearly implicit exponential integrators conserving quadratic invariants with application to scalar auxiliary variable approach

This paper proposes a framework for constructing high-order linearly implicit exponential integrators that conserve a quadratic invariant. This is then applied to the scalar auxiliary variable (SAV) approach. Quadratic invariants are significant objects that are present in various physical equations and also in computationally efficient conservative schemes for general invariants. For instance, the SAV approach converts the invariant into a quadratic form by introducing scalar auxiliary variables, which have been intensively studied in recent years. In this vein, Sato et al. (Appl. Numer. Math. 187, 71-88 2023) proposed high-order linearly implicit schemes that conserve a quadratic invariant. In this study, it is shown that their method can be effectively merged with the Lawson transformation, a technique commonly utilized in the construction of exponential integrators. It is also demonstrated that combining the constructed exponential integrators and the SAV approach yields schemes that are computationally less expensive. Specifically, the main part of the computational cost is the product of several matrix exponentials and vectors, which are parallelizable. Moreover, we conduct some mathematical analyses on the proposed schemes.

Accelerating Quantum Algorithms with Precomputation

Real-world applications of computing can be extremely time-sensitive. It would be valuable if we could accelerate such tasks by performing some of the work ahead of time. Motivated by this, we propose a cost model for quantum algorithms that allows quantum precomputation; i.e., for a polynomial amount of ``free'' computation before the input to an algorithm is fully specified, and methods for taking advantage of it. We analyze two families of unitaries that are asymptotically more efficient to implement in this cost model than in the standard one. The first example of quantum precomputation, based on density matrix exponentiation, could offer an exponential advantage under certain conditions. The second example uses a variant of gate teleportation to achieve a quadratic advantage when compared with implementing the unitaries directly. These examples hint that quantum precomputation may offer a new arena in which to seek quantum advantage.