Related papers: An iterative method to solve Lyapunov equations
Linear matrix equations, such as the Sylvester and Lyapunov equations, play an important role in various applications, including the stability analysis and dimensionality reduction of linear dynamical control systems and the solution of…
The asymptotic iteration method (AIM) is an iterative technique used to find exact and approximate solutions to second-order linear differential equations. In this work, we employed AIM to solve systems of two first-order linear…
We present a new algorithm for computing the Lyapunov exponents spectrum based on a matrix differential equation. The approach belongs to the so called continuous type, where the rate of expansion of perturbations is obtained for all times,…
This report discusses two new ideas for using perturbation methods to solve the time-independent Schr\"odinger equation. The first concept begins with rewriting the perturbation equations in a form that is closely related to matrix…
Based on the Scale-Splitting (SCSP) iteration method presented by Hezari et al. in (A new iterative method for solving a class of complex symmetric system linear of equations, Numerical Algorithms 73 (2016) 927-955), we present a new…
Using $\mathcal{P}$-canonical forms of matrices, we derive the minimal polynomial of the Kronecker product of a given family of matrices in terms of the minimal polynomials of these matrices. This, allows us to prove that the product…
In this work, we obtain a Lyapunov-type and a Hartman-Wintner-type inequalities for a linear and a nonlinear fractional differential equation with generalized Hilfer operator subject to Dirichlet-type boundary conditions. We prove existence…
This paper presents a new and straightforward procedure for solving bilinear quadratic optimal control problem. In this method, first the original optimal control problem is transformed into a nonlinear twopoint boundary value problem…
In this paper we present splitting methods which are based on iterative schemes and applied to stochastic nonlinear Schroedinger equation. We will design stochastic integrators which almost conserve the symplectic structure. The idea is…
This article presents a class of modified new modulus-based iterative methods to process the large and sparse implicit complementarity problem (ICP). By using two positive diagonal matrices, we formulate a fixed-point equation which is…
A recently developed method for the calculation of Lyapunov exponents of dynamical systems is described. The method is applicable whenever the linearized dynamics is Hamiltonian. By utilizing the exponential representation of symplectic…
The paper gives a parametrization of the solution set of a matricial Stieltjes-type truncated power moment problem in the non-degenerate and degenerate cases. The key role plays the solution of the corresponding system of Potapov's…
Polynomial multiplication is a fundamental problem in symbolic computation. There are efficient methods for the multiplication of two univariate polynomials. However, there is rarely efficiently nontrivial method for the multiplication of…
We present an efficient preconditioner for linear problems $A x=y$. It guarantees monotonic convergence of the memory-efficient fixed-point iteration for all accretive systems of the form $A = L + V$, where $L$ is an approximation of $A$,…
The Asymptotic Iteration Method (AIM) is a technique for solving analytically and approximately the linear second-order differential equation, especially the eigenvalue problems that frequently appear in theoretical and mathematical…
A proposal is made for reducing the solution of the N-particle Lippmann-Schwinger equation to that of smaller sets of particles. This consists of first writing the N-particle equation in terms of all possible $N/2$-particle…
An iterative method is presented for solving the problem of a uniformly rotating, self-gravitating ring without a central body in Newtonian gravity by expanding about the thin ring limit. Using this method, a simple formula relating mass to…
We discuss several numerical methods for calculating Lyapunov exponents (a quantitative measure of chaos) in systems of ordinary differential equations. We pay particular attention to constrained systems, and we introduce a variety of…
A new spectral type method for solving the one dimensional quantum-mechanical Lippmann-Schwinger integral equation in configuration space is described. The radial interval is divided into partitions, not necessarily of equal length. Two…
We construct fast, structure-preserving iterations for computing the sign decomposition of a unitary matrix $A$ with no eigenvalues equal to $\pm i$. This decomposition factorizes $A$ as the product of an involutory matrix $S =…