A numerical algorithm for solving a class of matrix equations
Authors
Abstract:
In this paper, we present a numerical algorithm for solving matrix equations $(A otimes B)X = F$ by extending the well-known Gaussian elimination for $Ax = b$. The proposed algorithm has a high computational efficiency. Two numerical examples are provided to show the effectiveness of the proposed algorithm.
similar resources
a numerical algorithm for solving a class of matrix equations
in this paper, we present a numerical algorithm for solving matrix equations $(a otimes b)x = f$ by extending the well-known gaussian elimination for $ax = b$. the proposed algorithm has a high computational efficiency. two numerical examples are provided to show the effectiveness of the proposed algorithm.
full textA matrix LSQR algorithm for solving constrained linear operator equations
In this work, an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation $mathcal{A}(X)=B$ and the minimum Frobenius norm residual problem $||mathcal{A}(X)-B||_F$ where $Xin mathcal{S}:={Xin textsf{R}^{ntimes n}~|~X=mathcal{G}(X)}$, $mathcal{F}$ is the linear operator from $textsf{R}^{ntimes n}$ onto $textsf{R}^{rtimes s}$, $ma...
full textthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولa matrix lsqr algorithm for solving constrained linear operator equations
in this work, an iterative method based on a matrix form of lsqr algorithm is constructed for solving the linear operator equation $mathcal{a}(x)=b$ and the minimum frobenius norm residual problem $||mathcal{a}(x)-b||_f$ where $xin mathcal{s}:={xin textsf{r}^{ntimes n}~|~x=mathcal{g}(x)}$, $mathcal{f}$ is the linear operator from $textsf{r}^{ntimes n}$ onto $textsf{r}^{rtimes s}$, $ma...
full textA Numerical Method For Solving Ricatti Differential Equations
By adding a suitable real function on both sides of the quadratic Riccati differential equation, we propose a weighted type of Adams-Bashforth rules for solving it, in which moments are used instead of the constant coefficients of Adams-Bashforth rules. Numerical results reveal that the proposed method is efficient and can be applied for other nonlinear problems.
full textA Trust Region Algorithm for Solving Nonlinear Equations (RESEARCH NOTE)
This paper presents a practical and efficient method to solve large-scale nonlinear equations. The global convergence of this new trust region algorithm is verified. The algorithm is then used to solve the nonlinear equations arising in an Expanded Lagrangian Function (ELF). Numerical results for the implementation of some large-scale problems indicate that the algorithm is efficient for these ...
full textMy Resources
Journal title
volume 2 issue 1
pages 41- 54
publication date 2014-05-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023