Zobrazeno 1 - 10
of 655
pro vyhledávání: '"Convergent matrix"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Amir Sadeghi
Publikováno v:
Ain Shams Engineering Journal, Vol 9, Iss 4, Pp 993-999 (2018)
It is known that the matrix square root has a significant role in linear algebra computations arisen in engineering and sciences. Any matrix with no eigenvalues in R- has a unique square root for which every eigenvalue lies in the open right half-pla
Autor:
Kensuke Aishima
Publikováno v:
Linear Algebra and its Applications. 542:310-333
We propose a quadratically convergent algorithm for inverse symmetric eigenvalue problems based on matrix equations. The basic idea is seen in a recent study by Ogita and Aishima, while they derive an efficient iterative refinement algorithm for symm
Autor:
Shinya Miyajima
Publikováno v:
Journal of Computational and Applied Mathematics. 330:276-288
A fast iterative algorithm for numerically computing an interval matrix containing the principal p th root of an n × n matrix A is proposed. This algorithm is based on a numerical spectral decomposition of A , and is applicable when a computed eigen
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Tyler Haynes
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 14, Iss 1, Pp 77-81 (1991)
The main result is that a square matrix D is convergent (limn→∞Dn=0) if and only if it is the Cayley transform CA=(I−A)−1(I+A) of a stable matrix A, where a stable matrix is one whose characteristic values all have negative real parts. In pas
Externí odkaz:
https://doaj.org/article/b132f32e68544d2e9fb8b73dd1fb910d
Autor:
Rahim Entezari, Alijabbar Rashidi
Publikováno v:
AEU - International Journal of Electronics and Communications. 82:321-326
This paper considers the problem of measurement matrix optimization for compressed sensing (CS) in which the dictionary is assumed to be given, such that it leads to an effective sensing matrix. Due to important properties of equiangular tight frames
Autor:
Vjeran Hari
Publikováno v:
Numerical Algorithms. 79:221-249
The paper derives and investigates the Jacobi methods for the generalized eigenvalue problem A x = λ B x, where A is a symmetric and B is a symmetric positive definite matrix. The methods first “normalize” B to have the unit diagonal and then ma
Autor:
An-Bao Xu, Dongxiu Xie
Publikováno v:
Mechanical Systems and Signal Processing. 95:77-89
We consider the matrix completion problem that aims to construct a low rank matrix X that approximates a given large matrix Y from partially known sample data in Y . In this paper we introduce an efficient greedy algorithm for such matrix completions