Related papers: An iterative method to solve Lyapunov equations
Developing efficient solvers for large-scale multi-term linear matrix equations remains a central challenge in numerical linear algebra and is still largely unresolved. This paper introduces a methodology leveraging CUR decomposition for…
In this paper, we investigate a spectral Petrov-Galerkin method for fractional initial value problems. Singularities of the solution at the origin inherited from the weakly singular kernel of the fractional derivative are considered, and…
We present a novel way of generating Lyapunov functions for proving linear convergence rates of first-order optimization methods. Our approach provably obtains the fastest linear convergence rate that can be verified by a quadratic Lyapunov…
We discuss the existence of solutions with oblique asymptotes to a class of second order nonlinear ordinary differential equations by means of Lyapunov functions. The approach is new in this field and allows for simpler proofs of general…
This paper proposes methods for likelihood-based inference in multivariate linear regressions when the correlation matrix of the responses is separable; that is, it has a Kronecker product structure, but the variances are unrestricted. The…
We propose a sampling-based approach to learn Lyapunov functions for a class of discrete-time autonomous hybrid systems that admit a mixed-integer representation. Such systems include autonomous piecewise affine systems, closed-loop…
For fixed positive integers $n$, we study the solution of the equation $n = k + p_k$, where $p_k$ denotes the $k$th prime number, by means of the iterative method \[ k_{j+1} = \pi(n-k_j), \qquad k_0 = \pi(n), \] which converges to the…
Integral linear systems $Ax=b$ with matrices $A$, $b$ and solutions $x$ are also required to be in integers, can be solved using invariant factors of $A$ (by computing the Smith Canonical Form of $A$). This paper explores a new problem…
A simple iteration methodology for the solution of a set of a linear algebraic equations is presented. The explanation of this method is based on a pure geometrical interpretation and pictorial representation. Convergence using this method…
Sylvester matrix equations are ubiquitous in scientific computing. However, few solution techniques exist for their generalized multiterm version, as they now arise in an increasingly large number of applications. In this work, we consider…
This paper presents an iteration method for solving linear particle transport problems in binary stochastic mixtures. It is based on nonlinear projection approach. The method is defined by a hierarchy of equations consisting of the…
Nonlinear matrix equations arise in many practical contexts related to control theory, dynamical programming and finite element methods for solving some partial differential equations. In most of these applications, it is needed to compute…
We apply the asymptotic iteration method (AIM) [J. Phys. A: Math. Gen. 36, 11807 (2003)] to solve new classes of second-order homogeneous linear differential equation. In particular, solutions are found for a general class of eigenvalue…
The prime objective of this paper is to design a new family of eighth-order iterative methods by accelerating the order of convergence and efficiency index of well existing seventh-order iterative method of \cite{Soleymani1} without using…
The aim of this paper is to introduce a new Newton-type iterative method and then to show that this process converges to the unique solution of the scalar nonlinear equation f(x)=0 under weaker conditions involving only f and f' by fixed…
We propose a new primal-dual splitting method for solving composite inclusions involving Lipschitzian, and parallel-sum-type monotone operators. Our approach extends the framework in \cite{Siopt4} to a more general class of monotone…
A numerical method is developed leading to algebraic systems based on generalized Lyapunov-Sylvester operators to approximate the solution of two-dimensional Boussinesq equation. It consists of an order reduction method and a finite…
We consider solutions of the $2\times 2$ matrix Hamiltonian of physical systems within the context of the asymptotic iteration method. Our technique is based on transformation of the associated Hamiltonian in the form of the first order…
This paper presents a decomposition method for solving elliptic boundary value problems in one-dimension. The method is an improvement to an existing technique for approximating elliptic systems. It is demonstrated to be computationally…
We consider the solution to the biharmonic equation in mixed form discretized by the Hybrid High-Order (HHO) methods. The two resulting second-order elliptic problems can be decoupled via the introduction of a new unknown, corresponding to…